| 2022 | COCOON | Reallocation Problems with Minimum Completion Time. | Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono |
| 2017 | ISAAC | Settlement Fund Circulation Problem. | Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
| 2017 | WADS | Posimodular Function Optimization. | Magns M. Halldrsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa |
| 2014 | LATIN | (Total) Vector Domination for Graphs with Bounded Branchwidth. | Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
| 2010 | ISAAC | The ( | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
| 2010 | IWOCA | The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
| 2009 | ESA | A Linear Time Algorithm for | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
| 2009 | ISAAC | Posi-modular Systems with Modulotone Requirements under Permutation Constraints. | Toshimasa Ishii, Kazuhisa Makino |
| 2007 | ISAAC | Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs. | Toshimasa Ishii |
| 2005 | ISAAC | Bisecting a Four-Connected Graph with Three Resource Sets. | Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi |
| 2003 | ISAAC | Augmenting Forests to Meet Odd Diameter Requirements. | Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi |
| 2003 | MFCS | Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs. | Toshimasa Ishii, Masayuki Hagiwara |
| 2001 | ISAAC | On the Minimum Local-Vertex-Connectivity Augmentation in Graphs. | Hiroshi Nagamochi, Toshimasa Ishii |
| 2000 | ISAAC | Simultaneous Augmentation of Two Graphs to an | Toshimasa Ishii, Hiroshi Nagamochi |
| 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 |
| 1998 | ISAAC | K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
| 1998 | SODA | Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
| 1997 | ISAAC | Augmenting Edge and Vertex Connectivities Simultaneously. | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |