Countries citing papers authored by Toshihide Ibaraki
Since
Specialization
Citations
This map shows the geographic impact of Toshihide Ibaraki's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Toshihide Ibaraki with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Toshihide Ibaraki more than expected).
Fields of papers citing papers by Toshihide Ibaraki
This network shows the impact of papers produced by Toshihide Ibaraki. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Toshihide Ibaraki. The network helps show where Toshihide Ibaraki may publish in the future.
Co-authorship network of co-authors of Toshihide Ibaraki
This figure shows the co-authorship network connecting the top 25 collaborators of Toshihide Ibaraki.
A scholar is included among the top collaborators of Toshihide Ibaraki based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Toshihide Ibaraki. Toshihide Ibaraki is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Umetani, Shunji, Mutsunori Yagiura, Takashi Imamichi, et al.. (2006). 5B1 A GUIDED LOCAL SEARCH ALGORITHM BASED ON A FAST NEIGHBORHOOD SEARCH FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem). 2006. 126–131.2 indexed citations
2.
Ibaraki, Toshihide, et al.. (2004). An average running time analysis of a backtracking algorithm to calculate the measure of the union of hyperrectangles in $d$ dimensions.. Canadian Conference on Computational Geometry. 196–199.3 indexed citations
3.
Ibaraki, Toshihide. (2004). K1 BUILDING GENERAL SOLVERS FOR SCHEDULING PROBLEMS(Keynote speech). 2004. 1–6.1 indexed citations
4.
Ibaraki, Toshihide, Prosenjit Bose, Naoki Katoh, & Hirotaka Ono. (2004). Algorithms and Computation: 14th International Symposium, Isaac 2003, Kyoto, Japan, December 15-17, 2003 Proceedings (Lecture Notes in Computer Science, 2906).2 indexed citations
5.
Ibaraki, Toshihide, Toshio Inui, & Katsumi Tanaka. (2004). Proceedings : International Conference on Informatics Research for Development of Knowledge Society Infrastructure : ICKS 2004 : 1-2 March 2004, Kyoto, Japan.1 indexed citations
6.
Nagamochi, Hiroshi, et al.. (2003). Approximability of the Minimum Maximal Matching Problem in Planar Graphs. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 86(12). 3251–3258.5 indexed citations
Yagiura, Mutsunori, Toshihide Ibaraki, & Fred Glover. (2002). 3-B-2 A PATH RELINKING APPROACH FOR THE GENERALIZED ASSIGNMENT PROBLEM. 2002. 105–108.15 indexed citations
9.
Zhao, Liang, Hiroshi Nagamochi, & Toshihide Ibaraki. (2002). A Note on Approximating the Survivable Network Design Problem in Hypergraphs. IEICE Transactions on Information and Systems. 85(2). 322–326.2 indexed citations
10.
Nagamochi, Hiroshi, et al.. (2001). A polynomial time approximation scheme for the minimum maximal matching problem in planar graphs (New Developments of Theory of Computation and Algorithms). Kyoto University Research Information Repository (Kyoto University). 1205. 89–94.1 indexed citations
11.
Ibaraki, Toshihide & Masafumi Yamashita. (2000). Special Issue on Algorithm Engineering : Surveys. IEICE Transactions on Information and Systems. 83(3). 319–321.
12.
Nagamochi, Hiroshi, et al.. (1999). A Simple Proof of a Minimum Cut Algorithm and Its Applications. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 82(10). 2231–2236.4 indexed citations
13.
Uno, Yushi & Toshihide Ibaraki. (1998). Reachability Problems of Random Digraphs. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 81(12). 2694–2702.1 indexed citations
14.
Nagamochi, Hiroshi, et al.. (1997). Augmenting Edge-Connectivity and Vertex-Connectivity Simultaneously. Kyoto University Research Information Repository (Kyoto University). 992(992). 90–97.2 indexed citations
Makino, Kazuhisa, et al.. (1996). Data Analysis by Positive Decision Trees. 82(1). 257–264.4 indexed citations
17.
Ibaraki, Toshihide, et al.. (1983). Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract). Very Large Data Bases. 89–91.6 indexed citations
18.
Ibaraki, Toshihide, et al.. (1981). The Computational Complexity of the m -Center Problems on the Plane. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 57–64.63 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.