Toshihide Ibaraki
-
- Optimization and Packing Problems 42
- Vehicle Routing Optimization Methods 28
- Scheduling and Optimization Algorithms 24
- Advanced Manufacturing and Logistics Optimization 24
- Computational Theory and Mathematics top 0.1%
- Advanced Graph Theory Research 50
- Complexity and Algorithms in Graphs 48
- Computer Networks and Communications top 0.5%
- Optimization and Search Problems 50
- Numerical Analysis top 2%
-
- Machine Learning and Algorithms 27
- Co-authors
- Hiroshi NagamochiMutsunori YagiuraHisashi MineNaoki KatohKoji NonobeEndre BorosPeter L. HammerMasao Fukushima
- Cited by
- Industrial and Manufacturing EngineeringComputational Theory and MathematicsComputer Graphics and Computer-Aided Design
- Partner nations
- JapanUnited StatesCanada
In The Last Decade
Toshihide Ibaraki
252 papers receiving 5.3k citations
Peers
Comparison fields: 5 of 127
- Industrial and Manufacturing Engineering 1.9k
- Computational Theory and Mathematics 2.1k
- Computer Graphics and Computer-Aided Design 317
- Computer Networks and Communications 1.7k
- Numerical Analysis 406
Countries citing papers authored by Toshihide Ibaraki
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
The 25 scholars most cited alongside Toshihide Ibaraki, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 5B1 A GUIDED LOCAL SEARCH ALGORITHM BASED ON A FAST NEIGHBORHOOD SEARCH FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem) | 2006 | 2 |
| 2 | Algorithms and Computation: 14th International Symposium, Isaac 2003, Kyoto, Japan, December 15-17, 2003 Proceedings (Lecture Notes in Computer Science, 2906) | 2004 | 2 |
| 3 | K1 BUILDING GENERAL SOLVERS FOR SCHEDULING PROBLEMS(Keynote speech) | 2004 | 1 |
| 4 | An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns | 2003 | 7 |
| 5 | Approximability of the Minimum Maximal Matching Problem in Planar Graphs | 2003 | 5 |
| 6 | 2003 | 1 | |
| 7 | A Note on Approximating the Survivable Network Design Problem in Hypergraphs | 2002 | 2 |
| 8 | 3-B-2 A PATH RELINKING APPROACH FOR THE GENERALIZED ASSIGNMENT PROBLEM | 2002 | 15 |
| 9 | A polynomial time approximation scheme for the minimum maximal matching problem in planar graphs (New Developments of Theory of Computation and Algorithms) | 2001 | 1 |
| 10 | Solving the Single-Vehicle Scheduling Problems for All Home Locations under Depth-First Routing on a Tree | 2001 | 2 |
| 11 | A Simple Proof of a Minimum Cut Algorithm and Its Applications | 1999 | 4 |
| 12 | 1999 | 1 | |
| 13 | 1998 | 5 | |
| 14 | Augmenting Edge-Connectivity and Vertex-Connectivity Simultaneously | 1997 | 2 |
| 15 | 1997 | 3 | |
| 16 | Multiversion Cautious Schedulers with Dynamic Serialization Constraints | 1989 | 0 |
| 17 | Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract) | 1983 | 6 |
| 18 | File Redundancy Issues in Distributed Database Systems | 1983 | 2 |
| 19 | The Computational Complexity of the m -Center Problems on the Plane | 1981 | 63 |
| 20 | Parallel-Machine Scheduling Problem with Unit Processing Time When Jobs Have Ready and Due Times | 1976 | 2 |
About Toshihide Ibaraki
Toshihide Ibaraki is a scholar working on Industrial and Manufacturing Engineering, Computational Theory and Mathematics and Computer Networks and Communications, having authored 266 papers that have together received 5.9k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (50 papers), Optimization and Search Problems (50 papers), Complexity and Algorithms in Graphs (48 papers), Optimization and Packing Problems (42 papers), Vehicle Routing Optimization Methods (28 papers), Machine Learning and Algorithms (27 papers), Scheduling and Optimization Algorithms (24 papers) and Advanced Manufacturing and Logistics Optimization (24 papers). The work is most often cited by research in Industrial and Manufacturing Engineering (1.9k citations), Computational Theory and Mathematics (2.1k citations) and Computer Graphics and Computer-Aided Design (317 citations). Toshihide Ibaraki has collaborated with scholars based in Japan, United States and Canada. Frequent co-authors include Hiroshi Nagamochi, Mutsunori Yagiura, Hisashi Mine, Naoki Katoh, Koji Nonobe, Endre Boros, Peter L. Hammer, Masao Fukushima, Alexander Kogan and Tiko Kameda.
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.