| 2002 | ISAAC | Minimum Edge Ranking Spanning Trees of Threshold Graphs. | Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki |
| 2001 | ISAAC | Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams. | Takashi Horiyama, Toshihide Ibaraki |
| 2001 | ISAAC | An Index for the Data Size to Extract Decomposable Structures in LAD. | Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki |
| 2001 | ISAAC | A Unified Framework for Approximating Multiway Partition Problems. | Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
| 2001 | STACS | A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. | Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
| 2000 | COCOON | Logical Analysis of Data with Decomposable Structures. | Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki |
| 2000 | ESA | Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. | Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti |
| 2000 | ISAAC | Reasoning with Ordered Binary Decision Diagrams. | Takashi Horiyama, Toshihide Ibaraki |
| 2000 | IDEAL | Finding Essential Attributes in Binary Data. | Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura |
| 1999 | COCOON | An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree. | Hiroshi Nagamochi, Toshihide Ibaraki |
| 1999 | COCOON | A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. | Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki |
| 1999 | ESA | Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph. | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
| 1999 | IPCO | A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts. | Hiroshi Nagamochi, Toshihide Ibaraki |
| 1999 | ISAAC | Ordered Binary Decision Diagrams as Knowledge-Bases. | Takashi Horiyama, Toshihide Ibaraki |
| 1999 | ISAAC | Bisecting Two Subsets in 3-Connected Graphs. | Hiroshi Nagamochi, Tibor Jordn, Yoshitaka Nakao, Toshihide Ibaraki |
| 1999 | ISAAC | Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. | Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
| 1999 | MFCS | On Minimum Edge Ranking Spanning Trees. | Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki |
| 1999 | STACS | On the Difference of Horn Theories. | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
| 1998 | AAAI | Computing Intersections of Horn Theories for Reasoning with Models. | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
| 1998 | COCOON | Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT. | Mutsunori Yagiura, Toshihide Ibaraki |
| 1998 | ISAAC | Disjunctions of Horn Theories and Their Cores. | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
| 1998 | ISAAC | K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
| 1998 | ISAAC | Polyhedral Structure of Submodular and Posi-modular Systems. | Hiroshi Nagamochi, Toshihide Ibaraki |
| 1998 | SODA | Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
| 1998 | STACS | On Disguised Double Horn Functions and Extensions. | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
| 1997 | ALT | Monotone Extensions of Boolean Data Sets. | Endre Boros, Toshihide Ibaraki, Kazuhisa Makino |
| 1997 | ICCCN | Multi-frame Isochronous Service for ATM Networks: Stop-and-Go Revisited. | Toshihide Ibaraki, Tiko Kameda |
| 1997 | ISAAC | Two-Face Horn Extensions. | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
| 1997 | ISAAC | Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract). | Toshihide Ibaraki |
| 1997 | ISAAC | Augmenting Edge and Vertex Connectivities Simultaneously. | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
| 1997 | SODA | Combinatorial Optimization Games. | Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi |
| 1997 | SODA | Computing Edge-Connectivity Augmentation Function in (nm) Time. | Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki |
| 1996 | ICEC | Metaheuristics as Robust and Simple Optimization Tools. | Mutsunori Yagiura, Toshihide Ibaraki |
| 1996 | STOC | Deterministic | Hiroshi Nagamochi, Toshihide Ibaraki |
| 1995 | IPCO | A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. | Hiroshi Nagamochi, Toshihide Ibaraki |
| 1995 | ISAAC | Two Arc Disjoint Paths in Eulerian Diagraphs. | Andrs Frank, Toshihide Ibaraki, Hiroshi Nagamochi |
| 1995 | ISAAC | A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. | Kazuhisa Makino, Toshihide Ibaraki |
| 1994 | ISAAC | The Maximum Latency and Identification of Positive Boolean Functions. | Kazuhisa Makino, Toshihide Ibaraki |
| 1994 | ISAAC | Computing All Small Cuts in Undirected Networks. | Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki |
| 1993 | ISAAC | Vehicle Scheduling on a Tree with Release and Handling Times. | Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki |
| 1992 | ICDCS | Optimal Coteries for Rings and Related Networks. | Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda |
| 1991 | DEXA | Using Relaxation Techniques to Evaluate Queries in Deductive Databases. | Susumu Suzuki, Toshihide Ibaraki, Masahichi Kishi |
| 1983 | VLDB | Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract). | Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura |
| 1983 | VLDB | File Redundancy Issues in Distributed Database Systems. | Shojiro Muro, Toshihide Ibaraki, Hidehiro Miyajima, Toshiharu Hasegawa |