| 2020 | COCOON | On the Enumeration of Minimal Non-pairwise Compatibility Graphs. | Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi |
| 2020 | COCOON | Path-Monotonic Upward Drawings of Graphs. | Seok-Hee Hong, Hiroshi Nagamochi |
| 2019 | ISAAC | A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions. | Kazuya Haraguchi, Hiroshi Nagamochi |
| 2018 | COCOON | Characterizing Star-PCGs. | Mingyu Xiao, Hiroshi Nagamochi |
| 2018 | ICALP | Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable. | Mingyu Xiao, Hiroshi Nagamochi |
| 2016 | GD | Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time. | Seok-Hee Hong, Hiroshi Nagamochi |
| 2016 | ISAAC | A Linear-Time Algorithm for Integral Multiterminal Flows in Trees. | Mingyu Xiao, Hiroshi Nagamochi |
| 2016 | WALCOM | Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game. | Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi |
| 2015 | WALCOM | An Improved Algorithm for Parameterized Edge Dominating Set Problem. | Ken Iwaide, Hiroshi Nagamochi |
| 2015 | WG | Testing Full Outer-2-planarity in Linear Time. | Seok-Hee Hong, Hiroshi Nagamochi |
| 2014 | COCOON | Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs. | Seok-Hee Hong, Hiroshi Nagamochi |
| 2014 | ISAAC | Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs. | Mingyu Xiao, Hiroshi Nagamochi |
| 2014 | WALCOM | Approximating the Bipartite TSP and Its Biased Generalization. | Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno |
| 2013 | AAIM | An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs. | Mingyu Xiao, Hiroshi Nagamochi |
| 2013 | COCOA | An Improved Exact Algorithm for Undirected Feedback Vertex Set. | Mingyu Xiao, Hiroshi Nagamochi |
| 2013 | ISAAC | Exact Algorithms for Maximum Independent Set. | Mingyu Xiao, Hiroshi Nagamochi |
| 2013 | TAMC | An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure. | Mingyu Xiao, Hiroshi Nagamochi |
| 2012 | COCOA | Characterizing Mechanisms in Obnoxious Facility Game. | Ken Ibara, Hiroshi Nagamochi |
| 2012 | COCOON | An Improved Exact Algorithm for TSP in Degree-4 Graphs. | Mingyu Xiao, Hiroshi Nagamochi |
| 2012 | ISAAC | Linear Layouts in Submodular Systems. | Hiroshi Nagamochi |
| 2012 | TAMC | Submodular Minimization via Pathwidth. | Hiroshi Nagamochi |
| 2012 | TAMC | A Refined Exact Algorithm for Edge Dominating Set. | Mingyu Xiao, Hiroshi Nagamochi |
| 2011 | AAIM | Parameterized Edge Dominating Set in Cubic Graphs - (Extended Abstract). | Mingyu Xiao, Hiroshi Nagamochi |
| 2011 | COCOA | Further Improvement on Maximum Independent Set in Degree-4 Graphs. | Mingyu Xiao, Hiroshi Nagamochi |
| 2011 | WG | Improved Bounds for Minimum Fault-Tolerant Gossip Graphs. | Toru Hasunuma, Hiroshi Nagamochi |
| 2010 | CIAC | Enumerating Rooted Graphs with Reflectional Block Structures. | Bingbing Zhuang, Hiroshi Nagamochi |
| 2010 | COCOA | Listing Triconnected Rooted Plane Graphs. | Bingbing Zhuang, Hiroshi Nagamochi |
| 2010 | FAW | FPTAS's for Some Cut Problems in Weighted Trees. | Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi |
| 2010 | FAW | Constant Time Generation of Biconnected Rooted Plane Graphs. | Bingbing Zhuang, Hiroshi Nagamochi |
| 2010 | ISAAC | Generating Trees on Multisets. | Bingbing Zhuang, Hiroshi Nagamochi |
| 2010 | TAMC | Generating Internally Triconnected Rooted Plane Graphs. | Bingbing Zhuang, Hiroshi Nagamochi |
| 2009 | FAW | Cop-Robber Guarding Game with Cycle Robber Region. | Hiroshi Nagamochi |
| 2009 | ISAAC | Upward Star-Shaped Polyhedral Graphs. | Seok-Hee Hong, Hiroshi Nagamochi |
| 2009 | ISAAC | Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming. | Tomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, Tatsuya Akutsu |
| 2009 | ISAAC | Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries. | Yoshitaka Nakao, Hiroshi Nagamochi |
| 2009 | ISAAC | Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. | Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi |
| 2009 | WALCOM | Network Design with Weighted Degree Constraints. | Takuro Fukunaga, Hiroshi Nagamochi |
| 2009 | WALCOM | Minmax Tree Cover in the Euclidean Space. | Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi |
| 2008 | COCOON | Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints. | Seok-Hee Hong, Hiroshi Nagamochi |
| 2008 | COCOON | Approximating the Generalized Capacitated Tree-Routing Problem. | Ehab Morsy, Hiroshi Nagamochi |
| 2008 | GD | Removing Node Overlaps Using Multi-sphere Scheme. | Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi |
| 2008 | LATIN | Approximating Crossing Minimization in Radial Layouts. | Seok-Hee Hong, Hiroshi Nagamochi |
| 2008 | SODA | Robust cost colorings. | Takuro Fukunaga, Magns M. Halldrsson, Hiroshi Nagamochi |
| 2007 | APBC | A Novel Clustering Method for Analysis of Biological Networks using Maximal Components of Graphs. | Morihiro Hayashida, Tatsuya Akutsu, Hiroshi Nagamochi |
| 2007 | IPCO | The Set Connector Problem in Graphs. | Takuro Fukunaga, Hiroshi Nagamochi |
| 2007 | ISAAC | Approximation to the Minimum Cost Edge Installation Problem. | Ehab Morsy, Hiroshi Nagamochi |
| 2007 | ISAAC | Minimum Degree Orderings. | Hiroshi Nagamochi |
| 2007 | TAMC | Orthogonal Drawings for Plane Graphs with Specified Face Areas. | Akifumi Kawaguchi, Hiroshi Nagamochi |
| 2007 | TAMC | Approximating Capacitated Tree-Routings in Networks. | Ehab Morsy, Hiroshi Nagamochi |
| 2007 | TAMC | An Efficient Algorithm for Generating Colored Outerplanar Graphs. | Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu |
| 2006 | COCOON | A Detachment Algorithm for Inferring a Graph from Path Frequency. | Hiroshi Nagamochi |
| 2006 | ESA | Minimum Transversals in Posi-modular Systems. | Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige |
| 2006 | GLOBECOM | Contention-Free l-Planes in Optically Burst-Switched WDM Networks. | Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine |
| 2006 | WAOA | Network Design with Edge-Connectivity and Degree Constraints. | Takuro Fukunaga, Hiroshi Nagamochi |
| 2006 | WG | Convex Drawings of Graphs with Non-convex Boundary. | Seok-Hee Hong, Hiroshi Nagamochi |
| 2005 | COCOON | Approximation Algorithms for the | Takuro Fukunaga, Hiroshi Nagamochi |
| 2005 | ISAAC | Bisecting a Four-Connected Graph with Three Resource Sets. | Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi |
| 2004 | ISAAC | Approximating the Minmax Subtree Cover Problem in a Cactus. | Hiroshi Nagamochi, Taizo Kawada |
| 2003 | GD | An Improved Approximation to the One-Sided Bilayer Drawing. | Hiroshi Nagamochi |
| 2003 | GD | Convex Drawing for c-Planar Biconnected Clustered Graphs. | Hiroshi Nagamochi, Katsutoshi Kuroya |
| 2003 | ISAAC | Augmenting Forests to Meet Odd Diameter Requirements. | Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi |
| 2003 | ISAAC | A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags. | Yoshiyuki Karuno, Hiroshi Nagamochi |
| 2003 | ISAAC | An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas. | Hiroshi Nagamochi, Yuusuke Abe |
| 2003 | ISAAC | Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem. | Hiroshi Nagamochi, Kohei Okada |
| 2002 | ISAAC | File Transfer Tree Problems. | Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita |
| 2002 | ISAAC | A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage. | Yoshiyuki Karuno, Hiroshi Nagamochi |
| 2001 | ESA | A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. | Yoshiyuki Karuno, Hiroshi Nagamochi |
| 2001 | ISAAC | A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. | Yoshiyuki Karuno, Hiroshi Nagamochi |
| 2001 | ISAAC | On the Minimum Local-Vertex-Connectivity Augmentation in Graphs. | Hiroshi Nagamochi, Toshimasa Ishii |
| 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 | ISAAC | Simultaneous Augmentation of Two Graphs to an | Toshimasa Ishii, Hiroshi Nagamochi |
| 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 | 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 |
| 1998 | IPCO | Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. | Hiroshi Nagamochi, Peter Eades |
| 1998 | ISAAC | K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
| 1998 | ISAAC | An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. | Hiroshi Nagamochi, Toru Hasunuma |
| 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 |
| 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 | 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 |
| 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 |