List of Papers
Journal Publications

  1. M. Oomine, H. Nagamochi : Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees
    IEICE Transactions (to appear)
  2. M. Xiao, H. Nagamochi : An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4
    Theory of Computing Systems (to appear)
  3. M. Xiao, H. Nagamochi : Exact algorithms for dominating induced matching based on graph partition
    Discrete Applied Mathematics 190: 147-162 (2015)
  4. M. Xiao, H. Nagamochi : An improved exact algorithm for undirected feedback vertex set
    J. of Combinatorial Optimization, 30(2): 214-241 (2015).
  5. Masaki Suzuki, Hiroshi Nagamochi, Tatsuya Akutsu : Efficient enumeration of monocyclic chemical graphs with given path frequencies
    Journal of Cheminformatics (2014), 6:31 doi:10.1186/1758-2946-6-31
  6. Toshihiro Shimizu, Takuro Fukunaga, Hiroshi Nagamochi : Unranking of small combinations from large sets
    J. Discrete Algorithms 29: 8-20 (2014)
  7. M. Xiao, H. Nagamochi : A refined exact algorithm for Edge Dominating Set
    Theor. Comput. Sci. 560: 207-216 (2014)
  8. Yang Zhao, Morihiro Hayashida, Jira Jindalertudomdee, Hiroshi Nagamochi, Tatsuya Akutsu : Breadth first search approach to enumeration of tree-like chemical compounds
    Journal of Bioinformatics and Computational Biology (JBCB) No.11, Issue No. 6. (2013)
  9. M. Xiao, H. Nagamochi : Parameterized edge dominating set in graphs with degree bounded by 3,
    Theoretical Computer Science, 508: 2-15 (2013).
  10. M. Xiao, H. Nagamochi : Exact algorithms for annotated edge dominating set in graphs with degree bounded by 3,
    IEICE Transactions, Vol.E96-D No.3 pp.408-418, 2013.
  11. A. Shurbevski, H. Nagamochi, Y. Karuno : Better Approximation Algorithms for Grasp-and- Delivery Robot Routing Problems,
    IEICE Transactions, Vol.E96-D No.3 pp.450-456, 2013.
  12. M. Xiao, T. Fukunaga, H. Nagamochi : FPTASs for trimming weighted trees,
    Theoretical Computer Science 469: 105-118 (2013).
  13. M. Xiao, H. Nagamochi : Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs,
    Theoretical Computer Science 469: 92-104 (2013).
  14. Y. Karuno, H. Nagamochi, A. Shurbevski : Constant factor approximation algorithms for repetitive routing problems of grasp-and-delivery robots in production of printed circuit boards,
    Journal of the Operations Research Society of Japan, 55(3):181-191, 2012.
  15. Yang Zhao, Morihiro Hayashida, Jose C. Nacher, Hiroshi Nagamochi, Tatsuya Akutsu : Protein complex prediction via improved verification methods using constrained domain-domain matching,
    IJBRA 8(3/4): 210-227 (2012)
  16. S.-H. Hong, H. Nagamochi : Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints,
    Theoretical Computer Science 445, 36-51 (2012).
  17. Y. Arahori, T. Imamichi, H. Nagamochi : An exact strip packing algorithm based on canonical forms,
    Computers and Operations Research, Volume 39, Issue 12, December 2012, Pages 2991-3011.
  18. T. Imada, H. Nagamochi : Indexing all rooted subgraphs of a rooted graph,
    IEICE Transactions, 95-D(3): 712-721 (2012).
  19. S.-H. Hong H. Nagamochi : A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners,
    Algorithmica, 62: 1122-1158 (2012).
  20. K. Okumoto, T. Fukunaga, H. Nagamochi : Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems,
    Algorithmica, 62:787-806 (2012).
  21. M. Xiao, H. Nagamochi : An FPT algorithm for edge subset feedback edge set,
    Inf. Process. Lett. vol. 112, no. 1-2, pp. 5-9 (2012).
  22. H. Aota, T. Fukunaga, H. Nagamochi : An approximation algorithm for locating maximal disks within convex polygons,
    International Journal of Computational Geometry and Applications (IJCGA) Volume: 21, Issue: 6 (2011) pp. 661-684.
  23. S. Imahori, Y. Karuno, H. Nagamochi, X. Wang : Kansei engineering, humans and computers: Efficient dynamic programming algorithms for combinatorial food packing problems,
    International Journal of Biometrics, 3/3 (2011) 228-245.
  24. S. Karakawa, E. Morsy, H. Nagamochi : Minmax tree cover in the Euclidean space,
    J. Graph Algorithms Appl. 15(3): 345-371 (2011).
  25. S.-H. Hong, H. Nagamochi : Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra,
    Algorithmica 61(4): 1022-1076 (2011).
  26. T. Imada, S. Ota, H. Nagamochi, T. Akutsu : Efficient enumeration of stereoisomers of outerplanar chemical graphs using dynamic programming,
    Journal of Chemical Information and Modeling, Volume 51, Issue 11, pp 2788-2807. November 28, 2011.
  27. T. Akutsu, H. Nagamochi : Kernel methods for chemical compounds: from classification to design,
    IEICE Transactions, Vol. E94-D,No.10, Oct. 2011, 1846-1853.
  28. Y. Karuno, H. Nagamochi, A. Shurbevski : An approximation algorithm with factor two for a repetitive routing problem of grasp-and-delivery robots,
    Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol.15 No.8, pp. 1103-1108, 2011.
  29. K. Matsumoto, S. Umetani, H. Nagamochi : On the one-dimensional stock cutting problem in the paper tube industry,
    Journal of Scheduling, 14(3): 281-290 (2011).
  30. T. Ibaraki, T. Imamichi, Y. Koga, H. Nagamochi, K. Nonobe, M. Yagiura : Efficient branch-and-bound algorithms for weighted MAX-2-SAT,
    Mathematical Programming A, 127, 2, 297-343 (2011).
  31. E. Morsy, H. Nagamochi : Approximating capacitated tree-routings in networks,
    Journal of Combinatorial Optimization, 21(2) (2011) 254-267.
  32. H. Nagamochi : Cop-robber guarding game with cycle robber region,
    Theoretical Computer Science, 412 (2011) 383-390.
  33. E. Morsy, H. Nagamochi : On the approximation of the generalized capacitated tree-routing problem,
    Journal of Discrete Algorithms, Volume 8, Issue 3, September 2010, Pages 311-320.
  34. S. Ota, E. Morsy, H. Nagamochi : A plane graph representation of a triconnected graph,
    Theoretical Computer Science, 411 (2010) 3979-3993.
  35. T. Imada, S. Ota, H. Nagamochi, T. Akutsu : Enumerating stereoisomers of tree structured molecules using dynamic programming,
    Journal of Mathematical Chemistry, Volume 49, Number 4, 910-970, 2010.
  36. Y. Ishida, Y. Kato, L. Zhao, H. Nagamochi, T. Akutsu : Branch-and-bound algorithms for enumerating treelike chemical graphs with given path frequency using detachment-cut,
    Journal of Chemical Information and Modeling, 50, 934-946, 2010.
  37. Y. Karuno, H. Nagamochi, X. Wang : Optimization problems and algorithms in double-layered food packing systems,
    Journal of Advanced Mechanical Design, Systems, and Manufacturing, Vol. 4, No. 3, 2010, 605-615.
  38. T. Fukunaga, H. Nagamochi : Network design with weighted degree constraints,
    Discrete Optimization, 7 (2010) 246-255.
  39. S.-H. Hong, H. Nagamochi : Convex drawings of hierarchical planar graphs and clustered planar graphs,
    Journal of Discrete Algorithms, 8(3): 282-295 (2010).
  40. S.-H. Hong, H. Nagamochi : An algorithm for constructing star-shaped drawings of plane graphs,
    Computational Geometry Theory and Applications, vol. 43, no. 2, pp. 191-206, February 2010.
  41. S.-H. Hong, H. Nagamochi : A linear-time algorithm for symmetric convex drawings of internally triconnected planar graphs,
    Algorithmica, vol. 58, no. 2, 2010, 433-460.
  42. S.-H. Hong, H. Nagamochi : Approximation algorithms for minimizing edge crossings in radial drawings,
    Algorithmica, vol. 58, no. 2, 2010, 478-497.
  43. H. Nagamochi : Minimum degree orderings,
    Algorithmica, vol. 56, no. 1, 2010, 17-34.
  44. T. Ishii, Y. Akiyama, H. Nagamochi : Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs,
    Algorithmica, vol. 56, no. 4 2010, 413-436.
  45. E. Morsy, H. Nagamochi : Approximation to the minimum cost edge installation problem,
    IEICE Transactions, E93-A, no.4, April 2010, 778-786.
  46. S.-H. Hong, H. Nagamochi : New approximation to the radial crossing minimization,
    Journal of Graph Algorithms and Applications, Vol. 13, no. 2, 179-196, 2009.
  47. M. Kenmochi, T. Imamichi, K. Nonobe, M. Yagiura, H. Nagamochi : Exact algorithms for the 2-dimensional strip packing problem with and without rotations,
    European Journal of Operational Research, 198(1): 73-83 (2009).
  48. T. Fukunaga, H. Nagamochi : Eulerian detachment with local edge-connectivity,
    Discrete Applied Mathematics, 157(4): 691-698 (2009).
  49. Y. Karuno, H. Nagamochi, J. Uchida: Selective vehicle scheduling on paths with a due date involving criterion,
    Transactions of the Japan Society of Mechanical Engineers, Series C, vol. 73, no. 727, pp.911-918 (2007).
  50. T. Imamichi, M. Yagiura, H. Nagamochi : An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem,
    Discrete Optimization, vol. 6, no. 4, pp. 345-361, November 2009.
  51. T. Fukunaga, H. Nagamochi : Network design with edge-connectivity and degree constraints,
    Theory of Computing Systems, vol. 45, no. 3, pp. 512-532 (2009).
  52. M. Sakashita, K. Makino, H. Nagamochi, S. Fujishige : Minimum transversals in posi-modular systems,
    SIAM J. Disc. Math. Volume 23, Issue 2, pp. 858-871 (2009)
  53. A. Kawaguchi, H. Nagamochi : Drawing slicing graphs with face areas,
    Theoretical Computer Science, 410(11): 1061-1072 (2009).
  54. H. Nagamochi : A detachment algorithm for inferring a graph from path frequency,
    Algorithmica, 53(2): 207-224 (2009).
  55. J. Uchida, Y. Karuno, H. Nagamochi : Scheduling capacitated one-way vehicles on paths with deadlines,
    SICE Journal of Control, Measurement, and System Integration Vol. 2, No. 1, January 2009, pp. 20-26.
  56. T. Imamichi, H. Nagamochi : Performance analysis of a collision detection algorithm of spheres based on slab partitioning,
    IEICE Transactions 91-A(9): 2308-2313 (2008).
  57. H. Fujiwara, J. Wang, L. Zhao, H. Nagamochi, T. Akutsu : Enumerating tree-like chemical graphs with given path frequency,
    Journal of Chemical Information and Modeling, 48 1345-1357, 2008.
  58. Y. Nakao, H. Nagamochi : Worst case analysis for pickup and delivery problems with transfer,
    IEICE Transactions 91-A(9): 2328-2334 (2008).
  59. S.-H. Hong, H. Nagamochi : Convex drawings of graphs with non-convex boundary constraints,
    Discrete Applied Mathematics, 156 (2008) 2368-2380.
  60. H. Nagamochi, T. Ohnishi : Approximating a vehicle scheduling problem with time windows and handling times,
    Theoretical Computer Science, 393 (1-3): 133-146 (2008).
  61. M. Hayashida, T. Akutsu, H. Nagamochi : A clustering method for analysis of sequence similarity networks of proteins using maximal components of graphs,
    IPSJ Transactions on Bioinformatics, 49-Sig 5 (TBIO 4), 15-24, 2008.
  62. E. Morsy, H. Nagamochi : An improved approximation algorithm for capacitated multicast routings in networks,
    Theoretical Computer Science, vol. 390(1): 81-91, 2008.
  63. H. Fujita, T. Ishii, H. Nagamochi : The source location problem with local 3-vertex-connectivity requirements,
    Discrete Applied Mathematics, vol. 155, no. 18, pp. 2523-2538, 2007.
  64. Y. Karuno, H. Nagamochi, X. Wang : Bi-criteria food packing by dynamic programming,
    J. Operations Research Society of Japan, vol. 50, no. 4, pp. 376-389, 2007.
  65. T. Fukunaga, H. Nagamochi: Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds,
    J. Operations Research Society of Japan, vol. 50, no. 4, pp. 339-349, 2007.
  66. A. Berger, T. Fukunaga, H. Nagamochi, O. Parekh : Approximability of the capacitated b-edge dominating set problem,
    Theoretical Computer Science A, vol. 385, pp. 202-213, 2007.
  67. K. Hirata, T. Matsuda, H. Nagamochi, T. Takine : Contention-free \lambda-planes in optically burst-switched WDM networks,
    IEICE Transactions on Communications, vol.E90-B, no.9, pp.2524-2531, 2007.
  68. T. Fukunaga, H. Nagamochi: Approximating a generalization of metric TSP,
    Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals, vol.E90-D, no.2, pp.432-439, 2007.
  69. H. Nagamochi: Computing a minimum cut in a graph with dynamic edges incident to a designated vertex,
    Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals vol.E90-D, no.2, pp.428-431, 2007.
  70. H. Nagamochi, K. Okada: Approximating the minmax rooted-tree cover in a tree,
    Information Processing Letters, vol. 104, pp. 173-178, 2007.
  71. T. Ishii, K. Iwata, H. Nagamochi: Bisecting a four-connected graph with three resource sets,
    Discrete Applied Mathematics, vol. 155, pp. 1441-1450, 2007.
  72. Y. Nakao, H. Nagamochi: A DP-based heuristic algorithm for the discrete split delivery vehicle routing problem,
    Journal of Advanced Mechanical Design, Systems, and Manufacturing, vol. 1, no. 2, pp.217-226, 2007.
  73. T. Fukunaga, H. Nagamochi: Generalizing the induced matching by edge capacity constraints,
    Discrete Optimization, vol. 4, no. 2, pp. 198-205, June 2007.
  74. T. Ishii, H. Fujita, H. Nagamochi: Minimum cost source location problem with local 3-vertex-connectivity requirements,
    Theoretical Computer Science, vol. 372(1) pp. 81-93, 2007.
  75. E. Morsy, H. Nagamochi: Approximation algorithms for multicast routings in a network with multi-sources,
    IEICE Transactions vol. E90-A, no. 5, pp. 900-906, 2007.
  76. H. Nagamochi, K. Kuroya : Drawing c-planar biconnected clustered graphs,
    Discrete Applied Mathematics, vol.155, pp. 1155-1174, 2007.
  77. H. Nagamochi, Y. Kamidoi: Minimum cost subpartitions in graphs,
    Information Processing Letters, vol. 102, 2007, pp. 79-84, 2007.
  78. H. Nagamochi, Y. Abe: An approximation algorithm for dissecting a rectangle into rectangles with specified areas,
    Discrete Applied Mathematics, vol. 155, pp. 523-537, 2007.
  79. Y. Kamidoi, N. Yoshida, H. Nagamochi: A deterministic algorithm for finding all minimum k-way cuts,
    SIAM J. Computing, vol. 36, no. 5, 2006, pp. 943-955.
  80. H. Nagamochi: Packing soft rectangles,
    International Journal of Foundations of Computer Science, vol. 17, no. 5, 2006, pp. 1165-1178.
  81. H. Ito, H. Nagamochi : Two equivalent measures on weighted hypergraphs,
    Discrete Applied Mathematics, vol. 154, 2006, pp. 2330-2334.
  82. H. Nagamochi : Sparse connectivity certificates via MA orderings in graphs,
    Discrete Applied Mathematics, vol. 154, 2006, pp. 2411-2417.
  83. T. Ishii, S. Yamamoto, H. Nagamochi: Augmenting forests to meet odd diameter requirements,
    Discrete Optimization, vol. 3, no. 2, 2006, pp. 154-164.
  84. H. Nagamochi: A fast edge-splitting algorithm in edge-weighted graphs,
    Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals, vol. E89-A, no. 5, May 2006, pp. 1263-1268.
  85. Y. Karuno, H. Nagamochi, Y. Ohshima: A dynamic programming approach for a food packing problem (in Japanese),
    Transactions of the Japan Society of Mechanical Engineers, Series C, vol. 72, no. 716, 2006, pp. 1390-1397.
  86. H. Nagamochi, T. Kawada: Minmax subtree cover problem on cacti,
    Discrete Applied Mathematics, vol. 154, no. 8, 2006, pp. 1254-1263.
  87. T. Ishii, H. Nagamochi, T. Ibaraki: Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph,
    Algorithmica, vol. 44, no. 3, 2006, pp. 257-280.
  88. H. Nagamochi : Increasing the edge-connectivity by contracting a vertex subset,
    IEICE Transactions on Information and Systems, vol. E89-D, no. 2, Feb. 2006, pp. 744-750.
  89. P. Eades, Q. Feng, X. Lin, H. Nagamochi: Straight-line drawing algorithms for hierarchical graphs, and clustered graphs,
    Algorithmica, vol. 44, no. 1, 2006, pp. 1-32.
  90. Y. Karuno, H. Nagamochi: Scheduling vehicles on trees,
    Pacific Journal of Optimization, vol. 1, 2005, pp. 527-543.
  91. H. Nagamochi, K. Iwata, T. Ishii : A robust algorithm for bisecting a triconnected graph with two resource sets,
    Theoretical Computer Science A, vol. 341, 2005, pp. 364-378
  92. H. Nagamochi: A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph,
    J. Algorithms, vol. 56, 2005, pp. 77-95.
  93. H. Nagamochi : Packing unit squares in a rectangle,
    The Electronic Journal of Combinatorics, R37, vol.12(1), 2005.
  94. T. Ishii, H. Nagamochi, Y. Nishigaki, K. Takahashi, M. Takeda : A routing algorithm on a storage tank system (in Japanese),
    ISCIE Journal Systems, Control and Information, vol. 18, no. 6, 2005, pp. 213-221.
  95. H. Nagamochi: Approximating the minmax rooted-subtree cover problem,
    Electron. Inform. Comm. Eng. Trans. Fundamentals, vol. E88-A, no. 5, May, 2005, pp. 1335-1338.
  96. H. Nagamochi: An improved bound on the one-sided minimum crossing number in two-layered drawings,
    Discrete and Computational Geometry, vol. 33, 2005, pp. 569-591.
  97. H. Nagamochi: On the one-sided crossing minimization in a bipartite graph with large degrees,
    Theoretical Computer Science A, vol. 332, 2005, pp. 417-446.
  98. H. Nagamochi: On computing minimum (s,t)-cuts in digraphs,
    Information Processing Letters, vol. 93, no 5, 2005, pp. 231-237.
  99. L. Zhao, H. Nagamochi, T. Ibaraki: A greedy splitting algorithm for approximating multiway partition problems,
    Mathematical Programming, vol. 102, no. 1, 2005, pp. 67-183.
  100. H. Nagamochi: On 2-approximation to the vertex-connectivity in graphs,
    Inst. Electron. Inform. Comm. Eng. Trans. Information and Systems, vol. E88-D, no.1, 2005, pp. 12-16.
  101. H. Nagamochi: Graph algorithms for network connectivity problems,
    J. Operations Research Society of Japan, vol.47, no.4, 2004, pp. 199-223.
  102. H. Nagamochi, N. Yamada: Counting edge crossings in a 2-layered drawing,
    Information Processing Letters, vol. 91, 2004, pp. 221-225.
  103. L. Zhao, H. Nagamochi, T. Ibaraki: On generalized greedy splitting algorithms for multiway partition problems,
    Discrete Applied Mathematics, vol. 143, no.1, 2004, pp. 130-143.
  104. H. Nagamochi, K. Okada: A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree,
    Discrete Applied Mathematics, vol.140, no. 1-3, 2004, pp. 103-114.
  105. H. Nagamochi, K. Suzuki, T. Ishii: A simple recognition of maximal planar graphs,
    Information Processing Letters, vol.89, no.5, 2004, pp. 223-226.
  106. Y. Karuno, H. Nagamochi: An approximability result of the multi-vehicle scheduling problem on a path with release and handling times,
    Theoretical Computer Science A, vol.312, issues 2-3, 2004, pp. 267-280.
  107. H. Nagamochi, Y. Nishida, T. Ibaraki: Approximability of the minimum maximal matching problem in planar graphs,
    Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals, vol.E86-A, 2003, pp. 3251-3258.
  108. H. Nagamochi, P. Eades: An edge-splitting algorithm in planar graphs,
    J. Combinatorial Optimization, vol.7, 2003, pp. 137-159.
  109. H. Nagamochi, T. Ishii: On the minimum local-vertex-connectivity augmentation in graphs,
    Discrete Applied Mathematics, vol.129/2, 2003, pp. 475-486.
  110. Y. Karuno, H. Nagamochi: 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times,
    Discrete Applied Mathematics, vol.129/2, 2003, pp. 433-447.
  111. L. Zhao, H. Nagamochi, T. Ibaraki: A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem,
    Information Processing Letters, vol.86/2, 2003, pp. 63-70.
  112. H. Nagamochi, S. Nakamura, T. Ishii: Constructing a cactus for minimum cuts of a graph in O(mn+n^2 log n) time and O(m) space,
    Inst. Electron. Inform. Comm. Eng. Trans. Information and Systems, vol.E86-D, no.2, 2003, pp. 179-185.
  113. H. Nagamochi: Algorithms for the minimum partitioning problems in graphs (in Japanese),
    Inst. Electron. Inform. Comm. Eng. Trans. Information and Systems, vol. J86-D-I, no.2, 2003, pp. 53-68.
  114. H. Nagamochi, T. Jordan, Y. Nakao, T. Ibaraki: Bisecting two subsets in 3-connected graphs,
    Combinatorica, vol.22, no.4, 2002, pp. 537-554.
  115. L. Zhao, H. Nagamochi, T. Ibaraki: A primal-dual approximation algorithm for the survivable network design problem in hypergraphs,
    Discrete Applied Mathematics, vol. 126/2-3, 2002, pp. 275-289.
  116. H. Nagamochi: An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree,
    Discrete Applied Mathematics, vol. 126, no.1, 2002, pp. 83-113.
  117. Y. Karuno, H. Nagamochi, T. Ibaraki: Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks,
    Networks , vol. 39, no. 4, 2002, pp. 203-209.
  118. L. Zhao, H. Nagamochi, T. Ibaraki: A note on approximating the survivable network design problem in hypergraphs,
    Inst. Electron. Inform. Comm. Eng. Trans. Information and Systems, vol.E85-D, no.2, Feb. 2002, pp.322-326.
  119. H. Nagamochi, T. Ibaraki: Graph connectivity and its augmentation: applications of MA orderings,
    Discrete Applied Mathematics, vol.123, no.1, 2002, pp. 447-472.
  120. T. Fujito, H. Nagamochi: A 2-approximation algorithm for the minimum weight edge dominating set problem,
    Discrete Applied Mathematics, vol.118, no.3, 2002, pp.199-208.
  121. H. Nagamochi, T. Shiraki, T. Ibaraki: Augmenting a submodular and posi-modular set function by a multigraph,
    J. Combinatorial Optimization, vol.5, no.2, 2001, pp.175-212.
  122. H. Nagamochi, T. Hasunuma: An efficient NC algorithm for a sparse k-edge-connectivity certificate,
    J. Algorithms, vol.38, no.2, 2001, pp.354-373.
  123. H. Nagamochi, K. Mochizuki, T. Ibaraki: Solving the single-vehicle scheduling problem for all home locations under depth-first routing on a tree,
    Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals, vol.E84-A, no.5, May 2001, pp.1135-1143.
  124. T. Ishii, H. Nagamochi, T. Ibaraki: Multigraph augmentation under biconnectivity and general edge-connectivity requirements,
    Networks, vol.37, no. 3, 2001, pp.144-155.
  125. L. Zhao, H. Nagamochi, T. Ibaraki: Approximating the minimum k-way cut in a graph via minimum 3-way cuts,
    J. Combinatorial Optimization, vol.5, 2001, pp.397-410.
  126. T. Hasunuma, H. Nagamochi: Independent spanning trees with small depths in iterated line digraphs,
    Discrete Applied Mathematics, vol.110, no.2, 2001, pp.189-212.
  127. H. Nagamochi, T. Ishii, H. Ito: Minimum cost source location problem with vertex-connectivity requirements in digraphs,
    Information Processing Letters, vol.80, no.6, 2001, pp. 287-294.
  128. H. Nagamochi, M. Miller, Slamin: Bounds on sum number in graphs,
    Discrete Mathematics, vol.240, no.1-3, 2001, pp.175-185.
  129. H. Nagamochi, S. Nakamura, T. Ibaraki: A simplified O(nm) time edge-splitting algorithm,
    Algorithmica, vol.26, 2000, pp.50-57.
  130. T. Ishii, H. Nagamochi, T. Ibaraki: Optimal augmentation of a 2-vertex-connected multigraph to a k-edge-connected and 3-vertex-connected multigraph,
    J. Combinatorial Optimization, vol.4, 2000, pp.35-78.
  131. H. Nagamochi: Recent development of graph connectivity augmentation algorithms,
    Inst. Electron. Inform. Comm. Eng. Trans. Information and Systems, vol.E83-D, no.3, March 2000, pp.372-383.
  132. H. Nagamochi, K. Seki, T. Ibaraki: A 7/3 approximation for the minimum weight 3-connected spanning subgraph problem,
    Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals, vol.E83-A, no.4, April 2000, pp.687-691.
  133. H. Nagamochi, S. Katayama, T. Ibaraki: Faster algorithm for computing minimum 5-way and 6-way cuts,
    J. Combinatorial Optimization, vol.4, 2000, pp.151-169.
  134. H. Nagamochi, Y. Nakao, T. Ibaraki: A fast algorithm for cactus representations of minimum cuts,
    J. of Japan Society for Industrial and Applied Mathematics vol.17, 2000, pp. 245-264.
  135. X. Deng, T. Ibaraki, H. Nagamochi, W. Zang: Totally balanced combinatorial optimization games,
    Mathematical Programming, vol.87, no.3, 2000, pp.441-452.
  136. H. Nagamochi, T. Ibaraki: A fast algorithm for computing minimum 3-way and 4-way cuts,
    Mathematical Programming, vol.88, no.3, 2000, pp.507-520.
  137. H. Nagamochi, T. Ibaraki: Polyhedral structure of submodular and posi-modular systems,
    Discrete Applied Mathematics, vol.107, 2000, pp.165-189.
  138. H. Nagamochi, T. Ibaraki: Augmenting edge-connectivity over the entire range in O(nm) time,
    Journal of Algorithms, vol.30, 1999, pp.253-301.
  139. H. Nagamochi, T. Ibaraki: An approximation of the minimum vertex cover in a graph,
    J. of Japan Society for Industrial and Applied Mathematics, vol.16, no.3, 1999, pp.369-375.
  140. X. Deng, T. Ibaraki, H. Nagamochi: Algorithmic aspects of the core of combinatorial optimization games,
    Math. of Operations Research, vol.24, no.3, August 1999, pp.751-766.
  141. H. Nagamochi, T. Ishii, T. Ibaraki: A simple proof of a minimum cut algorithm and its applications,
    Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals, vol.E82-A, no.10, Oct. 1999, pp.2231-2236.
  142. P. Eades, Q. Feng, H. Nagamochi: Drawing clustered graphs on an orthogonal grid,
    Journal of Graph Algorithms and Application, vol.3, no.4, 1999, pp.3-29.
  143. H. Nagamochi, K. Makino, D.-Z. Zeng, M. Murata, T. Ibaraki: Convexity of elementary flow game (in Japanese),
    Trans. Inst. Electron. Inform. Comm. Eng. Jap. vol.J81-D-I, no.6, 1998, pp.666-676.
  144. A. Frank, T. Ibaraki, H. Nagamochi: Two arc-disjoint paths in Eulerian digraphs,
    SIAM Disc. Math., vol.11, no.4, 1998, pp.557-589.
  145. T. Ibaraki, A. Karzanov, H. Nagamochi: A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizations,
    Combinatorica, vol.18, no.1, 1998, pp.61-83.
  146. H. Nagamochi, T. Ibaraki: A note on minimizing submodular functions,
    Information Processing Letters, vol.67, 1998, pp.239-244.
  147. M. Kato, R. Kawakita, H. Nagamochi, Y. Oie: On a reconfiguration algorithm for torus lightwave networks (in Japanese),
    Trans. Inst. Electron. Inform. Comm. Eng. Jap., vol.J80-B-I, no.10, Oct. 1997, pp.709-718.
  148. Y. Karuno, H. Nagamochi, T. Ibaraki: Vehicle scheduling on a tree with release and handling times,
    Annals of Operation Research,vol. 69, 1997, pp.193-207.
  149. H. Nagamochi, K. Nishimura, T. Ibaraki: Computing all small cuts in undirected networks,
    SIAM Disc. Math. vol.10, no.3, 1997, pp.469-481.
  150. H. Nagamochi, T. Ibaraki: Deterministic O(nm) time edge-splitting in undirected graphs,
    J. Combinatorial Optimization, vol.1, no.1, 1997, pp.5-46.
  151. H. Nagamochi, K. Mochizuki, T. Ibaraki: Complexity of the single vehicle scheduling problem on graphs,
    Information Systems and Operations Research, vol.35, no.4, 1997, pp.256-276.
  152. Y. Karuno, H. Nagamochi, T. Ibaraki: Computational complexity of the traveling salesman problem on a line with deadlines and general handling times,
    Memories of the Faculty of Engineering and Design, Kyoto Institute of Technology, vol.45, 1997, pp.19-22.
  153. H. Nagamochi, D.-Z. Zeng, N. Kabutoya, T. Ibaraki: Complexity of the minimum base game on matroids,
    Mathematics of Operations Research, vol.22, no.1, 1997, pp.146-164.
  154. H. Nagamochi, T. Kameda: Constructing cactus representation for all minimum cuts in an undirected network,
    Operations Research Society of Japan, vol.39, no.2, 1996, pp.135-158.
  155. Y. Karuno, H. Nagamochi, T. Ibaraki: Vehicle scheduling on a tree to minimize maximum lateness,
    Operations Research Society of Japan, vol.39, no.3, 1996, pp.345-355.
  156. M. Yagiura, H. Nagamochi, T. Ibaraki: Two comments on the subtour exchange crossover operator (in Japanese),
    Journal of Japanese Society for Artificial Intelligence, vol.10, no.3, 1995, pp.464-467.
  157. T. Ibaraki, H. Nagamochi, T. Kameda: Optimal coteries for rings and related networks,
    Distributed Computing, vol.8, no.4, 1995, pp.191-201.
  158. H. Nagamochi, T. Kameda: Canonical cactus representation for minimum cuts,
    J. of Japan Society for Industrial and Applied Mathematics, vol.11, no.3, 1994, pp.343-361.
  159. H. Harada, Z. Sun, H. Nagamochi: An exact lower bound on the number of cut-sets in multigraphs,
    Networks, vol.24, 1994, pp.429-443.
  160. H. Nagamochi, T. Ono, T. Ibaraki: Implementing an efficient minimum capacity cut algorithm,
    Mathematical Programming, vol.67, 1994, pp.325-341.
  161. A. Frank, T. Ibaraki, H. Nagamochi: On sparse subgraph preserving connectivity properties,
    J. Graph Theory, vol.17, no.3, July 1993, pp.275-281.
  162. H. Nagamochi, T. Watanabe: Computing k-edge-connected components in multigraphs,
    Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals, vol.E76-A, no.4, 1993, pp.513-517.
  163. H. Nagamochi, T. Ibaraki: Computing the edge-connectivity of multigraphs and capacitated graphs,
    SIAM J. Discrete Mathematics vol.5, 1992, pp.54-66.
  164. H. Nagamochi, T. Ibaraki: A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph,
    Algorithmica vol.7, 1992, pp.583-596.
  165. H. Nagamochi, T. Ibaraki: On Onaga's upper bound on the mean values of probabilistic maximum flows,
    IEEE Trans. on Reliability, vol.41, 1992, pp.225-229.
  166. H. Nagamochi, T. Ibaraki: A linear time algorithm for computing 3-edge-connected components in multigraphs,
    J. of Japan Society for Industrial and Applied Mathematics, vol.9, no.2, 1992, pp.163-180.
  167. H. Nagamochi, T. Ibaraki: Maximum flows in probabilistic networks,
    Networks, vol.21, no.6, 1991, pp.645-666.
  168. H. Nagamochi, Z. Sun, T. Ibaraki: Counting the number of minimum cuts in undirected multigraphs,
    IEEE Trans. on Reliability, vol.40, 1991, pp.610-614.
  169. H. Nagamochi, T. Ibaraki: Multicommodity flows in certain planar directed networks,
    Discrete Applied Mathematics, vol.27, 1990, pp.125-145.
  170. H. Nagamochi, M. Fukushima, T. Ibaraki: Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities,
    Networks, vol.20, 1990, pp.409-426.
  171. Z. Sun, H. Nagamochi, K. Kusunoki: 2-edge-connected graphs minimizing the number of cut-sets with 3 edges (in Japanese),
    Trans. Inst. Electron. Inform. Comm. Eng. Jap., vol.J73-A, no.7, 1990, pp.1281-1285.
  172. Z. Sun, H. Nagamochi, K. Kusunoki: A multiple graph minimizing the number of minimum cut sets,
    Trans. Inst. Electron. Inform. Comm. Eng. Jap., vol.E73, no.6, 1990, pp.915-921.
  173. Z. Sun, H. Nagamochi, K. Kusunoki: A graph minimizing the number of cut-sets with a specified number of edges (in Japanese),
    Trans. Inst. Electron. Inform. Comm. Eng. Jap., vol.J72-A, no.10, 1989, pp.1601-1611.
  174. H. Nagamochi, K. Chiba, K. Kusunoki: On the expected maximum flows in probabilistic networks (in Japanese),
    Trans. Inst. Electron. Inform. Comm. Eng. Jap., vol.J72-A, no.10, 1989, pp.1611-1620.
  175. H. Nagamochi, T. Ibaraki: On max-flow min-cut and integral flow properties for multicommodity flow in directed networks,
    Information Processing Letters, vol.31, 1989, pp.279-285.
  176. H. Nagamochi, T. Ibaraki: An efficient feasibility testing of the multicommodity flow problem in certain planar directed networks (in Japanese),
    Trans. Inst. Electron. Inform. Comm. Eng. Jap., vol.J71-A, no.3, 1988, pp.804-810.
  177. H. Nagamochi, T. Ibaraki: Max-flow min-cut theorem for the multicommodity flow in certain planar directed networks (in Japanese),
    Trans. Inst. Electron. Inform. Comm. Eng. Jap., vol.J71-A, no.1, 1988, pp 71-82 [Eng. transl. Electronics and Communications in Japan, Scripta Technica, Inc. vol.72, no.3, 1989, pp.58-72].
  178. H. Nagamochi, T. Ibaraki, T. Hasegawa: Multicommodity flow problem for class CU of planar directed networks (in Japanese),
    Trans. Inst. Electron. Inform. Comm. Eng. Jap., vol.J70-A, no.9, 1987, pp.1328-1339.
  179. H. Nagamochi, T. Ibaraki, T. Hasegawa: Multicommodity flow problem in certain planar directed networks (in Japanese),
    Trans. Inst. Electron. Inform. Comm. Eng. Jap., vol.J70-A, no.2, 1987, pp.228-238.
International Conference Papers

  1. Fei He H. Nagamochi : A Method for Generating Colorings over Graph Automorphism
    The 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management (ISORA 2015), Luoyang, China, August 21-24, 2015, pp. 70-81.
  2. N. Md Yunos, A. Shurbevski, H. Nagamochi : A Polynomial-Space Exact Algorithm for TSP in Degree-5 Graphs
    The 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management (ISORA 2015), Luoyang, China, August 21-24, 2015, pp. 45-58.
  3. N. Md Yunos, A. Shurbevski, H. Nagamochi : A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs
    The 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015), Kyoto University, Kyoto, Japan, September 14-16, 2015, pp. 102-103.
  4. A. Shurbevski, H. Nagamochi, Y. Karuno : Approximation Algorithms for a Sequencing Problem with Biased Bipartite Structure,
    Proceedings of International Symposium on Scheduling 2015 (ISS2015), pp. 214-219. July 4-6, 2015, Kobe, Japan (2015).
  5. Ken Iwaide, Hiroshi Nagamochi : An Improved Algorithm for Parameterized Edge Dominating Set Problem
    WALCOM 2015: 234-245, Lecture Notes in Computer Science 8973, Springer 2015, ISBN 978-3-319-15611-8
  6. Seok-Hee Hong, Hiroshi Nagamochi : Simpler algorithms for testing two-page book embedding of partitioned graphs
    The 20th International Computing and Combinatorics Conference (COCOON'14), Atlanta, Georgia, USA, during August 4-6, 2014, COCOON 2014: 477-488, Lecture Notes in Computer Science 8591, Springer 2014, ISBN 978-3-319-08782-5
  7. Mingyu Xiao, Hiroshi Nagamochi : Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs
    ISAAC 2014: 429-440, Lecture Notes in Computer Science 8889, Springer 2014, ISBN 978-3-319-13074-3
  8. Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno : Approximating the bipartite TSP and its biased generalization
    WALCOM 2014 LNCS 8344, 56-67, 2014.
  9. Yang Zhao, Morihiro Hayashida, Jira Jindalertudomdee, Hiroshi Nagamochi, Tatsuya Akutsu : Breadth first search approach to enumeration of tree-like chemical compounds
    GIW2013.
  10. Aleksandar Shurbevski and Hiroshi Nagamochi : Packing for robot motion planning
    In 11th ESICUP Meeting, March, p.22, 2014.
  11. M. Xiao, H. Nagamochi : An exact algorithm for maximum independent set,
    The 24thInternational Symposium on Algorithms and Computation, Hong Kong, December 16-18, 2013, Springer 2013, LNCS 8283, 328-338 (2013).
  12. M. Xiao, H. Nagamochi : An improved exact algorithm for undirected feedback vertex set,
    The 7th Annual International Conference on Combinatorial Optimization and Applications (COCOA'13), December 12-14, 2013, in Chengdu, China, LNCS 8287, 153-164 (2013)
  13. A. Shurbevski, N. Hirosue, H. Nagamochi : Optimization techniques for robot path planning
    The 5th ICT Innovations Conference, 2013, Ohrid, Macedonia, August 12-15, Advances in Intelligent Systems and Computing Volume 231, 2014, pp 111-120
  14. A. Shurbevski, H. Nagamochi, Y. Karuno : The repetitive routing problem revisited: a new constant factor approximation algorithm for an asymmetric cost function case
    the 11th International Conference on Electronics, Telecommunications, Automation, and Informatics - ETAI 2013, Metropol Hotel, Ohrid, Macedonia September 26-28, 2013, CD-ROM Proceedings, paper A1-2
  15. M. Xiao, H. Nagamochi : An exact algorithm for maximum independent set in degree-5 graphs,
    The Seventh International Frontiers of Algorithmics Workshop Dalian, China, June 26-28, 2013, Springer 2013 LNCS 7924, 72-83.
  16. M. Xiao, H. Nagamochi : An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure,
    The 10th annual conference on Theory and Applications of Models of Computation Hong Kong, China, 20-22 May 2013, Springer 2013 LNCS 7876, 96-107.
  17. H. Nagamochi : Linear layouts in submodular systems,
    the 23rd International Symposium on Algorithms and Computation (ISAAC 2012), LNCS 7676, 475-484.
  18. M. Xiao, H. Nagamochi : An improved exact algorithm for TSP in degree-4 graphs,
    The 18th International Computing and Combinatorics Conference (COCOON'2012) Sydney, Australia, in August 20--22, 2012, LNCS vol. 7434, 74-85.
  19. K. Ibara, H. Nagamochi : Characterizing mechanisms in obnoxious facility game,
    The 6th Annual International Conference on Combinatorial Optimization and Applications (COCOA'12), August 5-9, 2012, Banff, Canada, LNCS 7402, 301-311.
  20. M. Ikeda, H. Nagamochi : A method for computing the pathwidth of chemical graphs,
    The 15th Japan-Korea Joint Workshop on Algorithms and Computation, July 10 - 11, 2012, National Institute of Informatics, Tokyo, Japan, 140-145.
  21. A. Shurbevski, H. Nagamochi, Y. Karuno : Improved approximation ratio algorithms for grasp-and-delivery robot routing problems,
    The 15th Japan-Korea Joint Workshop on Algorithms and Computation, July 10 - 11, 2012, National Institute of Informatics, Tokyo, Japan, 9-16.
  22. M. Xiao, H. Nagamochi : A refined exact algorithm for edge dominating set,
    9th annual conference on Theory and Applications of Models of Computation (TAMC2012) Beijing, China, Manindra Agrawal, S. Barry Cooper, and Angsheng Li (eds.), LNCS vol. 7287, 360-372.
  23. Y. Zhao, M. Hayashida, J. C. Nacher, H. Nagamochi, T. Akutsu : Protein complex prediction via improved verification methods using constrained domain-domain matching,
    The Tenth Asia Pacific Bioinformatics Conference, Melbourne, Australia, 17-19 January 2012.
  24. C. Zhang, H. Nagamochi : The next-to-shortest path in undirected graphs with nonnegative weights.
    CATS 2012: 13-20
  25. M. Shimizu, H. Nagamochi, T. Akutsu : Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies,
    The 22nd International Conference on Genome Informatics (GIW2011), Haeundae Grand Hotel, Busan, Korea, December 5-7, 2011, BMC Bioinformatics 2011, 12 (Suppl 14): S3.
  26. A. Shurbevski, H. Nagamochi, Y. Karuno : Heuristics for a repetitive routing problem of a single grasp-and-delivery robot with an asymmetric edge cost function,
    The 10th International Conference on Electronics, Telecommunications, Automation, and Informatics - ETAI 2011, Metropol Hotel, Ohrid, Macedonia September 16-20, 2011.
  27. M. Xiao, H. Nagamochi : Further improvement on maximum independent set in degree-4 graphs,
    The 5th Annual International Conference on Combinatorial Optimization and Applications (COCOA'11), Augest 4-6, 2011, Zhangjiajie, China, Weifan Wang, Xuding Zhu and Ding-Zhu Du (Eds.) Proceedings. Lecture Notes in Computer Science 6831 Springer 2011, 163-178.
  28. T. Hasunuma, H. Nagamochi : Improved bounds for minimum fault-tolerant gossip graphs,
    37th International Workshop on Graph-Theoretic Concepts in Computer Science, Tepla in West Bohemia, Czech Republic, June 21-24. 2011, LNCS 6986, pp. 203-214.
  29. Y. Karuno, H. Nagamochi : Network transformation heuristics for multi-story storage rack problems,
    Proceedings of International Symposium on Scheduling 2011 (ISS2011), JSME No. 11-205, pp. 161-164.
  30. A. Shurbevski, Y. Karuno, H. Nagamochi : Improved implementation of an approximation algorithm with factor two for a cyclic routing problem of grasp-and-delivery robots,
    Proceedings of International Symposium on Scheduling 2011 (ISS2011), JSME No. 11-205, pp. 235-240.
  31. Y. Karuno, H. Nagamochi, A. Shurbevski : Approximating cyclic routing problems of grasp-and-delivery robots in production of printed circuit boards,
    Proceedings of International Symposium on Scheduling 2011 (ISS2011), JSME No. 11-205, pp. 247-252.
  32. M. Xiao, H. Nagamochi : Parameterized edge dominating set in cubic graphs,
    the Fifth International Frontiers of Algorithmics Workshop (FAW 2011) and The Seventh International Conference on Algorithmic Aspects of Information and Management (AAIM 2011), Lecture Notes in Computer Science 6681 Springer 2011, 100-112.
  33. L. Zhao, P. Eumthurapojn, H. Nagamochi : A practical speed-up technique for A* algorithms,
    the 4th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC 2011), Hsinchu, Taiwan, April 16-17, 2011.
  34. Y. Karuno, H. Nagamochi, A. Shurbevski : Approximation algorithms for a cyclic routing problem of grasp-and-delivery robots,
    SCIS and ISIS 2010, Joint 5th International Conference on Soft Computing and Intelligent Systems and 11th International Symposium on Advanced Intelligent Systems, Okayama, Dec. 8-12, 2010, pp. 94-99.
  35. T. Ohshima, P. Eumthurapojn, L. Zhao, H. Nagamochi : A* algorithm framework for the time-dependent point-to-point shortest path problem,
    The China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010, Dalian) November 3-6 in Dalian, China 2010, Lecture Notes in Computer Science 7033, 154-163.
  36. M. Xiao, T. Fukunaga, H. Nagamochi : FPTAS's for some cut problems in weighted trees,
    The 4th International Frontiers of Algorithmics Workshop (FAW 2010), August 11-13, 2010, at Wuhan University, Wuhan, China, (eds.) D.T. Lee, Danny Z. Chen, and Shi Ying, Lecture Notes in Computer Science, vol. 6213, Springer-Verlag, 2010, 210-221.
  37. Y. Karuno, H. Nagamochi, A. Nakashima, K. Yamashita : Heuristics for scheduling problems on identical machines like storage allocation,
    IEEE INDIN 2010, 13-16 July 2010, Osaka, Japan, 863 - 868.
  38. K. Haraguchi, S.-H. Hong, H. Nagamochi : Multiclass visual classifier based on bipartite graph representation of decision tables,
    Learning and Intelligent OptimizatioN Conference (LION 4), January 18-22, 2010. Venice, Italy, LNCS 6073, pp. 169-183 (2010)
  39. T. Imada, S. Ota, H. Nagamochi, T. Akutsu : Enumerating stereoisomers of tree structured molecules using dynamic programming,
    The 20th International Symposium on Algorithms and Computation (ISAAC 2009), December 16-18, 2009, in Hawaii, USA, LNCS 5878, 14-23.
  40. K. Okumoto, T. Fukunaga, H. Nagamochi : Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems,
    The 20th International Symposium on Algorithms and Computation (ISAAC 2009), December 16-18, 2009, in Hawaii, USA, LNCS 5878, 55-64.
  41. Y. Nakao, H. Nagamochi : Worst case analysis for pickup and delivery problems with consecutive pickups and deliveries,
    The 20th International Symposium on Algorithms and Computation (ISAAC 2009), December 16-18, 2009, in Hawaii, USA, LNCS 5878, 554-563.
  42. S.-H. Hong, H. Nagamochi : Upward star-shaped polyhedral graphs,
    The 20th International Symposium on Algorithms and Computation (ISAAC 2009), December 16-18, 2009, in Hawaii, USA, LNCS 5878, 913-922.
  43. K. Haraguchi, S.-H. Hong, H. Nagamochi : Visualization can improve multiple decision table classifiers,
    The 6th International Conference on Modeling Decisions for Artificial Intelligence (MDAI 2009), Awaji Island, Japan, November 30 - December 2, 2009, 41-52.
  44. K. Haraguchi, S.-H. Hong, H. Nagamochi : Bipartite graph representation of multiple decision table classifiers,
    Fifth Symposium on Stochastic Algorithms, Foundations and Applications (SAGA 2009), Sapporo, Japan October 26-28, 2009, Lecture Notes in Computer Science Volume 5792/2009, 46-60.
  45. K. Haraguchi, S.-H. Hong, H. Nagamochi : Visualized multiple decision table classifiers without discretization,
    4th Korea-Japan Workshop on Operations Research in Service Science, October 14-16, 2009, Sendai, Japan, 19-28.
  46. Y. Karuno, K. Yamashita, E. Chiba, H. Nagamochi : Scheduling multiprocessor tasks with prompt service constraints on aligned identical processors,
    Proc. International Symposium on Scheduling 2009, JSME No. 09-206, 4C1, pp. 203-208 July 4-6, 2009, Nagoya Institute of Technology (2009).
  47. Y. Karuno, H. Nagamochi, X. Wang : Combinatorial optimization problems and algorithms in double-layered food packing equipments,
    Proc. International Symposium on Scheduling 2009, JSME No. 09-206, 1A1, pp. 12-17 July 4-6, 2009, Nagoya Institute of Technology (2009).
  48. J. Wang, J. Gim, M. Sasaki, L. Zhao, H. Nagamochi : Efficient approximate algorithms for the beacon placement and its dual problem,
    Korea-Japan Joint Workshop on Algorithms and Computation, Kookmin University in Seoul, Korea, July 4-5, 2009, pp. 101-108.
  49. H. Nagamochi : Cop-robber guarding game with cycle robber region,
    The Third International Frontiers of Algorithmics Workshop (FAW 2009), June 20-23,2009, Hefei University of Technology, Hefei, Anhui, China, LNCS 5598, 74-84.
  50. S.-H. Hong, H. Nagamochi : Toward characterization of vertex-edge graphs of three-dimensional nonconvex polyhedra,
    6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications May 16-19, 2009 in Budapest, Hungary (invited talk).
  51. T. Imamichi, Y. Arahori, H. Nagamochi : Efficient branch-and-bound algorithms for one-dimensional contiguous bin packing problem and two-dimensional strip packing problem,
    The 6th ESICUP Meeting, March 26-27, 2009, the Fundacion Universidad Empresa-ADEIT, Valencia, Spain.
  52. S. Umetani, K. Matsumoto, H. Nagamochi : One-dimensional cutting stock problem for a paper tube industry,
    The 6th ESICUP Meeting, March 26-27, 2009, the Fundacion Universidad Empresa-ADEIT, Valencia, Spain.
  53. S. Karakawa, E. Morsy, H. Nagamochi : Minmax tree cover in the Euclidean space,
    Third Annual Workshop on Algorithms and Computation (WALCOM 2009), February 18-20, Indian Statistical Institute, Kolkata, India, LNCS 5431, 202-213 (2009).
  54. T. Fukunaga, H. Nagamochi : Network design with weighted degree constraints,
    Third Annual Workshop on Algorithms and Computation (WALCOM 2009), February 18-20, Indian Statistical Institute, Kolkata, India, LNCS 5431, 202-213 (2009).
  55. S. Imahori, Y. Karuno, H. Nagamochi, X. Wang : Efficient algorithms for combinatorial food packing problems,
    Proc. of the 11th International Conference on Humans and Computers (HC'2008), November 20th-23rd, 2008, Nagaoka and Tokyo in Japan and Dusseldorf in Germany, pp. 317-322.
  56. Y. Ishida, L. Zhao, H. Nagamochi, T. Akutsu : Improved algorithm for enumerating tree-likee chemical graphs,
    The 19th International Conference on Genome Informatics (GIW2008), Gold Coast, Australia, 1- 3 December 2008 Genome Informatics 21: 53-64 (2008).
  57. M. Sasaki, L. Zhao, H. Nagamochi : Security-aware beacon based network monitoring,
    the 11th IEEE International Conference on Communication Systems 2008 pp. 527-531.
  58. T. Imamichi, Y. Arahori, J. Gim, S.-H. Hong, H. Nagamochi : Removing node overlaps using multi-sphere scheme,
    The 16th International Symposium on Graph Drawing (GD 2008) Hersonissos, Heraklion Crete from 21-24 September 2008.
  59. L. Zhao, T. Ohshima, H. Nagamochi : A* algorithm for the time-dependent shortest path problem,
    The 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08) July 19-20, 2008, Fukuoka, Japan, pp. 36-43.
  60. T. Imamichi and H. Nagamochi : A fast collision detection algorithm for a multi-sphere scheme,
    The 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08) July 19-20, 2008, Fukuoka, Japan, pp. 173-180.
  61. S.-H. Hong, H. Nagamochi : Star-shaped drawings of graphs with fixed embedding and concave corner constraints,
    The 14th Annual International Computing and Combinatorics Conference (COCOON 2008) June 27 -29, 2008, Dalian, China, Xiaodong Hu and Jie Wang (Eds.), LNCS 5092, pp. 405-414.
  62. E. Morsy, H. Nagamochi : Approximating the generalized capacitated tree-routing,
    The 14th Annual International Computing and Combinatorics Conference (COCOON 2008) June 27 -29, 2008, Dalian, China, Xiaodong Hu and Jie Wang (Eds.), LNCS 5092, pp. 621-630.
  63. S.-H. Hong, H. Nagamochi : Approximating crossing minimization in radial layouts,
    The 8th Latin American Theoretical Informatics Symposium (LATIN08) April 7-11, 2008, Rio de Janeiro, Brazil, E. S. Laber et al. (Eds.), LNCS 4957, pp. 461--472, 2008.
  64. K. Haraguchi, S.-H. Hong, H. Nagamochi : Visual analysis of hierarchical data using 2.5D drawing with minimum occlusion,
    in the poster session of 2008 IEEE Pacific Visualization Symposium (PacificVis 2008), March 5-7 Kyoto, Japan, 2008 (best poster award).
  65. J. Gim, Y. Arahori, T. Imamichi, S.-H. Hong, H. Nagamochi : Overlap removal in label layouts by a multi-sphere scheme,
    in the poster session of 2008 IEEE Pacific Visualization Symposium (PacificVis 2008), March 5-7 Kyoto, Japan, 2008.
  66. T. Fukunaga, M. Halldorsson, H. Nagamochi : Robust cost colorings,
    ACM-SIAM Symposium on Discrete Algorithms, January 20-22, 2008 Holiday Inn Golden Gateway San Francisco, California, pp. 1204-1212.
  67. H. Nagamochi : Minimum degree orderings,
    The 18th International Symposium on Algorithms and Computation (ISAAC 2007) December 17-19, 2007 Sendai, Japan, Lecture Notes in Computer Science 4835, 17-28.
  68. E. Morsy and H. Nagamochi : Approximation to the minimum cost edge installation problem,
    The 18th International Symposium on Algorithms and Computation (ISAAC 2007) December 17-19, 2007 Sendai, Japan, Lecture Notes in Computer Science 4835, 292-303.
  69. T. Fukunaga, M. Halldorsson, H. Nagamochi : Rent-or-buy scheduling and cost coloring problems,
    Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2007, New Delhi during 12-14 December 2007, Lecture Notes in Computer Science 4855, 84-95.
  70. S.-H. Hong, H. Nagamochi : Star-shaped drawings of planar graphs,
    18th International Workshop on Combinatorial Algorithms, Lake Macquarie, Newcastle, NSW, Australia, 5-9 November 2007.
  71. J. Uchida, Y. Karuno, H. Nagamochi : Heuristics for a scheduling problem of minimizing the number of one-way vehicles on path with deadlines,
    Proc. SICE Annual Conference 2007, Sep. 17-20, Kagawa Univ., Japan, pp. 2633-2638.
  72. T. Imamichi, H. Nagamochi : A multi-sphere scheme for 2D and 3D packing problems,
    Stochastic local search (SLS) algorithms, Universite Libre de Bruxelles, Brussels, Belgium, 6-8 September 2007, Lecture Notes in Computer Science, vol. 4638, 2007, pp. 207-211.
  73. M. Yagiura, A. Komiya, K. Kojima, K. Nonobe, H. Nagamochi, T. Ibaraki, F. Glover : A path relinking approach for the multi-resource generalized assignment problem,
    Stochastic local search (SLS) algorithms, Universite Libre de Bruxelles, Brussels, Belgium, 6-8 September 2007, Lecture Notes in Computer Science, vol. 4638, 2007, pp. 121-135.
  74. S.-H. Hong, H. Nagamochi : Fully convex drawings of clustered planar graphs,
    2007 Korea-Japan Joint Workshop on Algorithms and Computation, August 9-10, 2007, Chonnam National University, Gwangju, Korea, pp. 32-39.
  75. T. Imamichi, H. Nagamochi : An iterated local search algorithm in a multi-sphere scheme for 2D and 3D packing problems,
    2007 Korea-Japan Joint Workshop on Algorithms and Computation, August 9-10, 2007, Chonnam National University, Gwangju, Korea, pp. 72-79.
  76. H. Fujiwara, L. Zhao, H. Nagamochi, T. Akutsu, W. Jiexun : Enumerating tree-like chemical structures from feature vector,
    2007 Korea-Japan Joint Workshop on Algorithms and Computation, August 9-10, 2007, Chonnam National University, Gwangju, Korea, pp. 48-55.
  77. T. Imamichi, H. Nagamochi : Packing sets of circles with shape-memory,
    INFORMS International, Puerto Rico 2007, July 8-11, 2007.
  78. L. Zhao, A. Shimae, H. Nagamochi : Linear-tree rule structure for firewall optimization,
    6th IASTED Intl. Conf. on Communications, Internet, and Information Technology, July 2-4, 2007, pp. 67-72.
  79. K. Haraguchi, H. Nagamochi : Extension of ICF classifiers to real world data sets,
    IEA/AIE 2007: The 20th International Conference on Industrial, Engineering & Other Applications of Applied Intelligent Systems, June 26-29, 2007 Kyoto (Japan) Kyoto University Clock Tower Hall Proc. 20th IEA/AIE (LNAI4570), 2007, 776-785.
  80. T. Fukunaga, H. Nagamochi : The set connector problems in graphs,
    The Twelfth Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, Cornell University, Ithaca, New York, June 25-27, Lecture Notes in Computer Science, 4513, 2007, 484-498.
  81. S.-H. Hong, H. Nagamochi : A linear time algorithm for symmetric convex drawings of triconnected planar graphs,
    The Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007), Kyoto, Japan, June 11-15, 2007.
  82. S. Ota, H. Nagamochi : A plane graph representation for tripartitions of a triconnected graph,
    The Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007), Kyoto, Japan, June 11-15, 2007.
  83. A. Kawaguchi, H. Nagamochi : Orthogonal drawings for plane graphs with specified face areas,
    The 4th Annual Conference on Theory and Applications of Models of Computation (TAMC07) Shanghai, China, May 22 to 25, 2007, Lecture Notes in Computer Science, volume 4484, 2007, 584-594.
  84. E. Morsy, H. Nagamochi : Approximating capacitated tree-routings in networks,
    The 4th Annual Conference on Theory and Applications of Models of Computation (TAMC07) Shanghai, China, May 22 to 25, 2007, Lecture Notes in Computer Science, volume 4484, 2007, 342-353.
  85. J. Wang, L. Zhao, H. Nagamochi, T. Akutsu : An efficient enumeration of colored outerplanar graphs,
    The 4th Annual Conference on Theory and Applications of Models of Computation (TAMC07) Shanghai, China, May 22 to 25, 2007, Lecture Notes in Computer Science, volume 4484, 2007, 573-583.
  86. M. Hayashida, T. Akutsu, H. Nagamochi : A novel clustering method for analysis of biological networks using maximal components of graphs,
    The Fifth Asia-Pacific Bioinformatics Conference, APBC2007, Hong Kong. 15-17, January, 2007, 257-266.
  87. K. Hirata, T. Matsuda, H. Nagamochi, T. Takine : Contention-free lambda-planes in optically burst-switched WDM,
    IEEE GLOBECOM 2006 Advanced Technologies and Protocols for Optical Networks, 27 November - 1 December 2006, San Francisco, California, USA.
  88. T. Fukunaga, H. Nagamochi : Network design with edge-connectivity and degree constraints,
    Fourth Workshop on Approximation and Online Algorithms (WAOA06) 14-15 September 2006, ETH Zurich, Zurich, Switzerland, Lecture Notes in Computer Science, volume 4368, 2007, 188-201.
  89. T. Fukunaga, H. Nagamochi : Some theorems on detachments preserving local-edge-connectivity,
    Fifth CRACOW Conference on Graph Theory (USTRON '06), Ustron, Poland, September 11-15, 2006 CCGT. http://home.agh.edu.pl/~graphs/proceedings.php
  90. M. Sakashita, K. Makino, H. Nagamochi, S. Fujishige : Minimum transversals in posi-modular systems,
    Lecture Notes in Computer Science, volume 4168, 2006, 576-587, 14th Annual European Symposium on Algorithms (ESA2006) 11-13 September 2006, ETH Zurich, Zurich, Switzerland.
  91. H. Nagamochi: A detachment algorithm for inferring a graph from path frequency,
    The Twelfth Annual International Computing and Combinatorics Conference (COCOON'06) Taipei, Taiwan, August 15-18, 2006, Lecture Notes in Computer Science, volume 4112 pp. 274-283, 2006.
  92. S.-H. Hong, H. Nagamochi : Convex drawings of hierarchical plane graphs,
    17th Australasian Workshop on Combinatorial Algorithms (AWOCA 2006) Uluru, NT, Australia, July 13-16, 2006.
  93. E. Morsy, H. Nagamochi: An improved approximation algorithm for capacitated multicast routings in networks,
    Proc. of International Symposium on Scheduling 2006 (ISS2006) July 18-20, 2006 in Arcadia Ichigaya, Tokyo, Japan, pp. 12-17.
  94. Y. Nakao, H. Nagamochi: A DP-based heuristic algorithm for the discrete split delivery vehicle routing problem,
    Proc. of International Symposium on Scheduling 2006 (ISS2006) July 18-20, 2006 in Arcadia Ichigaya, Tokyo, Japan, pp. 42-47.
  95. T. Imamichi, H. Nagamochi, M. Yagiura: An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem,
    Proc. of International Symposium on Scheduling 2006 (ISS2006) July 18-20, 2006 in Arcadia Ichigaya, Tokyo, Japan, pp. 132-137.
  96. T. Ibaraki, A. Ishikawa, H. Nagamochi, K. Nonobe, M. Yagiura: An iterated local search algorithm for the multi-resource generalized assignment problem with flexible assignment cost,
    Proc. of International Symposium on Scheduling 2006 (ISS2006) July 18-20, 2006 in Arcadia Ichigaya, Tokyo, Japan, pp. 160-165.
  97. T. Fukunaga, H. Nagamochi : Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds,
    Proceedings of the 9th Japan-Korea Joint Workshop on Algorithm and Computation (WAAC06), July 4-5, 2006, Hokkaido University, Sapporo, Japan, pp. 25-32.
  98. S.-H. Hong, H. Nagamochi: Convex drawings with non-convex boundary,
    The 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006) Bergen, Norway June 22-24, 2006, Lecture Notes in Computer Science, vol. 4271, Springer-Verlag, pp. 113--124, 2006.
  99. T. Imamichi, M. Yagiura, H. Nagamochi: An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem,
    The 19th conference of the European Chapter on Combinatorial Optimization (ECCO XIX) and the International Symposium on Combinatorial Optimisation 2006 (CO 2006) Porto, Portugal, May 11-13, 2006.
  100. Y. Karuno, H. Nagamochi: Minimizing capacitated tree covers of graphs,
    Third International Conference on Innovative Applications of Information Technology for the Developing World (Asian Applied Computing Conference (AACC 2005)) 10-12 December 2005, Nepal.
  101. K. Haraguchi, H. Nagamochi, T. Ibaraki: Experimental studies on representation complexity and error rates of iteratively composed features,
    Third International Conference on Innovative Applications of Information Technology for the Developing World (Asian Applied Computing Conference (AACC 2005)) 10-12 December 2005, Nepal.
  102. Y. Koga, M. Yagiura, K. Nonobe, T. Imamichi, H. Nagamochi, T. Ibaraki : Efficient branch-and-bound algorithms for weighted MAX-2-SAT,
    Third International Conference on Innovative Applications of Information Technology for the Developing World (Asian Applied Computing Conference (AACC 2005)) 10-12 December 2005, Nepal.
  103. T. Ishii, K. Iwata, H. Nagamochi: Bisecting a four-connected graph with three resource sets,
    The 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), December 19 - 21, 2005, Sanya, Hainan, China, Lecture Notes in Computer Science, vol. 3827 pp. 176-185, 2005.
  104. T. Fukunaga, H. Nagamochi: Approximation algorithms for the b-edge dominating set problem and its related problems,
    Lecture Notes in Computer Science, vol. 3595, Springer-Verlag, L. Wang (Ed.), The Eleventh International Computing and Combinatorics Conference (COCOON 2005) August 16-19, 2005, Kunming, Yunnan, pp. 747-756 (2005).
  105. M. Kenmochi, T. Imamichi, K. Nonobe, M. Yagiura, H. Nagamochi : Exact algorithms for the 2-dimensional strip packing problem with rotations,
    The Seventeenth Triennial Conference of the International Federation of Operational Research Societies (IFORS2005), Honolulu, Hawaii, July 11-15, 2005.
  106. M. Nishihara, M. Yagiura, T. Ibaraki, H. Nagamochi : The relation between option pricing and optimization problems,
    The Seventeenth Triennial Conference of the International Federation of Operational Research Societies (IFORS2005), Honolulu, Hawaii, July 11-15, 2005.
  107. H. Nagamochi: Heuristics for the minmax subtree cover in graphs,
    The Seventeenth Triennial Conference of the International Federation of Operational Research Societies (IFORS2005), Honolulu, Hawaii, July 11-15, 2005.
  108. Y. Kamidoi, N. Yoshida, H. Nagamochi : A deterministic algorithm for finding all minimum k-way cuts,
    4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, June 3-6, 2005 in Budapest, Hungary pp. 224-223.
  109. K. Haraguchi, H. Nagamochi, T. Ibaraki : Compactness of classifiers by iterative compositions of features,
    4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, June 3-6, 2005 in Budapest, Hungary pp. 92-98.
  110. T. Fukunaga, H. Nagamochi: Edge packing problem with edge capacity constraints,
    4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, June 3-6, 2005 in Budapest, Hungary pp. 69-75.
  111. T. Ishii, K. Iwata, H. Nagamochi: Bisecting a four-connected graph with three resource sets,
    4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, June 3-6, 2005 in Budapest, Hungary pp. 107-113.
  112. T. Imamichi, M. Kenmochi, K. Nonobe, M. Yagiura, H. Nagamochi : Branch-and-bound algorithms for rectangular strip packing and perfect packing problems,
    ESICUP (EURO Special Interest Group on Cutting and Packing) 2nd Meeting, Southampton, UK, April 14-16, 2005. http://www.apdio.pt/esicup-2ndMeeting
  113. T. Ishii, H. Fujita, H. Nagamochi: Minimum cost source location problem with local 3-vertex-connectivity requirements,
    Computing: The Australasian Theory Symposium (CATS) Australasian Computer Science Week, 2005 30 January - 3 February Newcastle, Australia pp.97-105. http://www.cs.newcastle.edu.au/~acsw05/index.html
  114. H. Nagamochi, T. Kawada: Approximating the minmax subtree cover problem in a cactus,
    Lecture Notes in Computer Science, vol. 3341 The 15th Annual International Symposium on Algorithms and Computation (ISAAC2004) December 20 - 22, 2004, HKUST, Hong Kong, pp.705-716.
  115. H. Nagamochi, K. Okada: Polynomial time 2-approximation algorithms for the minmax subtree cover problem,
    Lecture Notes in Computer Science, vol. 2906, Springer-Verlag, The 14th Annual International Symposium on Algorithms and Computation (ISAAC2003) Kyoto, December 15-17, 2003, pp.138-147.
  116. H. Nagamochi, Y. Abe: An approximation algorithm for dissecting a rectangle into rectangles with specified areas,
    Lecture Notes in Computer Science, vol. 2906, Springer-Verlag, The 14th Annual International Symposium on Algorithms and Computation (ISAAC2003) Kyoto, December 15-17, 2003, pp.280-289.
  117. Y. Karuno, H. Nagamochi: A better approximation for the two-machine flowshop scheduling problem with time lags,
    Lecture Notes in Computer Science, vol. 2906, Springer-Verlag, The 14th Annual International Symposium on Algorithms and Computation (ISAAC2003) Kyoto, December 15-17, 2003, pp.309-318.
  118. T. Ishii, S. Yamamoto, H. Nagamochi: Augmenting forests to meet odd diameter requirements,
    Lecture Notes in Computer Science, vol. 2906, Springer-Verlag, The 14th Annual International Symposium on Algorithms and Computation (ISAAC2003) Kyoto, December 15-17, 2003, pp.434-443.
  119. H. Nagamochi: An improved approximation to the one-sided bilayer drawing,
    The 11th International Symposium on Graph Drawing (GD2003) September 21-24, 2003, Perugia, Italy, Lecture Notes in Computer Science, vol. 2912, Springer-Verlag, 2004, pp. 406-418.
  120. H. Nagamochi, K. Kuroya: Convex drawing for c-planar biconnected clustered graphs,
    The 11th International Symposium on Graph Drawing (GD2003) September 21-24, 2003, Perugia, Italy, Lecture Notes in Computer Science, vol. 2912, Springer-Verlag, 2004, pp. 369-380.
  121. H. Nagamochi, K. Suzuki, T. Ishii: A simple recognition of maximal planar graphs,
    Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation, July 3-4, Sendai Japan 2003, pp.182-188.
  122. H. Nagamochi, N. Yamada: Fast algorithms for counting bilayer crossings,
    Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation, July 3-4, Sendai Japan 2003, pp.203-209.
  123. H. Nagamochi, K. Iwata, T. Ishii: A simple robust algorithm for bisecting a triconnected graph with two resource sets,
    Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation, July 3-4, Sendai Japan 2003, pp. 210-222.
  124. T. Ishii, Y. Akiyama, H. Nagamochi: Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs,
    ENTCS (Elsevier Science in the series Electronic Notes in Theoretical Computer Science http://www.elsevier.nl/gej-ng/31/29/23/134/23/show/Products/notes/index.htt#016 ) Computing: The Australasian Theory Symposium, CATS 2003, Adelaide, South Australia, Feb. 4-7, 2003.
  125. H. Ito, H. Nagamochi: Can a hypergraph cover every convex polygon?,
    the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, January 21-24, 2003, Tokyo, Japan, pp.293-302.
  126. T. Ishii, H. Fujita, H. Nagamochi: Source location problem with local 3-vertex-connectivity requirements,
    the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, January 21-24, 2003, Tokyo, Japan, pp.368-377.
  127. H. Nagamochi: Computing extreme sets in graphs and its applications,
    the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, January 21-24, 2003, Tokyo, Japan, pp.349-357.
  128. H. Ito, H. Nagamochi: Comparing hypergraphs by areas of hyperedges drawn on a convex polygon,
    Discrete and Computational Geometry, JCDCG'02, Dec. 6-9, 2002, Tokai University, Tokyo, Japan, Lecture Notes in Computer Science, vol. 2866, 2003, pp.176-181
  129. H. Ito, H. Nagamochi, Y. Sugiyama, M. Fujita: File transfer tree problems,
    The 13th Annual International Symposium on Algorithms and Computation (ISAAC2002) Vancouver, Canada, November 20-23, Lecture Notes in Computer Science, vol. 2518, Springer-Verlag, 2002, pp.441-452.
  130. Y. Karuno, H. Nagamochi: A better approximation for the two-stage assembly scheduling problem with 2 machines at the first stage,
    The 13th Annual International Symposium on Algorithms and Computation (ISAAC2002) Vancouver, Canada, November 20-23, Lecture Notes in Computer Science, vol. 2518, Springer-Verlag, 2002, pp.199-210.
  131. L. Zhao, H. Nagamochi, T. Ibaraki: A primal-dual approximation algorithm for the survivable network design problem in hypergraphs,
    Lecture Notes in Computer Science, vol.2010, STACS 2001, February, 15-17, 2001, pp.478-489.
  132. Y. Karuno, H. Nagamochi: A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times,
    Lecture Notes in Computer Science, Springer-Verlag, vol.2161 9th Annual European Symposium on Algorithms, BRICS, University of Aarhus, Denmark, August 28-31, 2001 pp.218-229.
  133. H. Nagamochi, T. Ishii: On the minimum local-vertex-connectivity augmentation in graphs,
    Lecture Notes in Computer Science 2223, Springer-Verlag, Twelfth Annual International Symposium on Algorithms and Computation (ISAAC 01) December 19-21, 2001 Christchurch, New Zealand, pp.124-135.
  134. L. Zhao, H. Nagamochi, T. Ishii: A unified framework for approximating some partition problems via greedy splitting,
    Lecture Notes in Computer Science 2223, Springer-Verlag, Twelfth Annual International Symposium on Algorithms and Computation (ISAAC 01) December 19-21, 2001 Christchurch, New Zealand, pp.682-694.
  135. Y. Karuno, H. Nagamochi: A polynomial time approximation scheme for the multi-vehicle scheduling on a path with release and handling times,
    Lecture Notes in Computer Science 2223, Springer-Verlag, Twelfth Annual International Symposium on Algorithms and Computation (ISAAC 01) December 19-21, 2001 Christchurch, New Zealand, pp.36-47.
  136. T. Ishii, H. Nagamochi: On the minimum augmentation of an l-connected graph to a k-connected graph,
    Lecture Notes in Computer Science, vol.1851, Springer-Verlag, 7th Biennial Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, pp.286-299.
  137. T. Ishii, H. Nagamochi: Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph,
    Lecture Notes in Computer Science, vol.1969, Springer-Verlag, 11th Annual International Symposium on Algorithms and Computation, ISAAC'00, Dec., 18-20, Taipei, Taiwan, 2000, pp.326-337.
  138. H. Nagamochi, T. Shiraki, T. Ibaraki: Augmenting a submodular and posi-modular set function by a multigraph,
    Proceedings of the 1st Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Kyoto, March, 1999, pp.273-279.
  139. H. Nagamochi, T. Ibaraki: A fast algorithm for computing minimum 3-way and 4-way cuts,
    Lecture Notes in Computer Science, Springer-Verlag, vol. 1610, 7th Conference on Integer Programming and Combinatorial Optimization, June 9-11, Graz, Austria, 1999, pp.377-390.
  140. T. Ishii, H. Nagamochi, T. Ibaraki: Augmenting an (l-1)-vertex-connected multigraph to a k-edge-connected and l-vertex-connected multigraph,
    Lecture Notes in Computer Science, Springer-Verlag, vol.1643, 7th Annual European Symposium on Algorithms, July 16-18, Prague, Czech Republic, 1999, pp.414-425.
  141. H. Nagamochi, S. Katayama, T. Ibaraki: Faster algorithm for computing minimum 5-way and 6-way cuts,
    Lecture Notes in Computer Science, Springer-Verlag, vol.1627, 5th Annual International Computing and Combinatorics Conference, July 26-28, Tokyo, Japan, 1999, pp.164-173.
  142. H. Nagamochi, T. Jordan, Y. Nakao, T. Ibaraki: Bisecting two subsets in 3-connected graphs,
    Lecture Notes in Computer Science, Springer-Verlag, vol.1741, 10th Annual International Symposium on Algorithms and Computation, ISAAC'99, Dec., 16-18, Chennai, India 1999, pp.425-434.
  143. L. Zhao, H. Nagamochi, T. Ibaraki: Approximating the minimum k-way cut in a graph via minimum 3-way cuts,
    Lecture Notes in Computer Science, Springer-Verlag, vol.1741, 10th Annual International Symposium on Algorithms and Computation, ISAAC'99, Dec., 16-18, Chennai, India 1999, pp.373-382.
  144. T. Ishii, H. Nagamochi, T. Ibaraki: Optimal augmentation of a biconnected graph to a k-edge-connected and triconnected graph,
    Proceedings 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California January 1998 pp.280-289.
  145. T. Hasunuma, H. Nagamochi: Independent spanning trees with small depths in iterated line digraphs,
    Australian Computer Science Communications, vol.20, no.3, Springer-Verlag, Computing Theory: The Australian Theory Symposium (CATS'98) Perth, Feb. 2-3, 1998, pp.21-35.
  146. H. Nagamochi, P. Eades: Edge-splitting and edge-connectivity augmentation in planar graphs,
    Lecture Notes in Computer Science 1412, Springer-Verlag, 6th Conference on Integer Programming and Combinatorial Optimization, Houston, June 22-24, 1998, pp.96-111.
  147. Y. Karuno, H. Nagamochi, T. Ibaraki: A 1.5-Approximation for single-vehicle scheduling problem on a line with release and handling times,
    Japan-U.S.A. Symposium on Flexible Automation, Ohtsu, Japan, July 13-15, 1998, pp.1363-1366.
  148. T. Ishii, H. Nagamochi, T. Ibaraki: k-edge and 3-vertex connectivity augmentation in an arbitrary multigraph,
    Lecture Notes in Computer Science 1533, Springer-Verlag, Kyung-Yong Chwa and Oscar H.Ibara (Eds.), Algorithms and Computation, 9th International Symposium, ISAAC'98, Taejon, Korea, Dec., 1998, pp.159-168.
  149. H. Nagamochi, T. Ibaraki: Polyhedral structure of submodular and posi-modular systems,
    Lecture Notes in Computer Science 1533, Springer-Verlag, Kyung-Yong Chwa and Oscar H.Ibara (Eds.), Algorithms and Computation, 9th International Symposium, ISAAC'98, Taejon, Korea, Dec., 1998, pp.169-178.
  150. H. Nagamochi, T. Hasunuma: An efficient NC algorithm for a sparse k-edge-connectivity certificate,
    Lecture Notes in Computer Science 1533, Springer-Verlag, Kyung-Yong Chwa and Oscar H.Ibara (Eds.), Algorithms and Computation, 9th International Symposium, ISAAC'98, Taejon, Korea, Dec., 1998, pp.447-456.
  151. H. Nagamochi, T. Shiraki, T. Ibaraki: Computing edge-connectivity augmentation function in O(nm) time,
    in the Proceedings 8th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, January 1997, pp.649-658.
  152. X. Deng, T. Ibaraki, H. Nagamochi: Combinatorial optimization games,
    in the Proceedings 8th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, January 1997, pp.720-729.
  153. T. Ishii, H. Nagamochi, T. Ibaraki: Augmenting edge and vertex connectivities simultaneously,
    Lecture Notes in Computer Science, 1350, Algorithms and Computation, 8th International Symposium, ISAAC'97 Singapore, December 17-19, 1997 pp.102-111.
  154. H. Nagamochi, T. Ibaraki: Deterministic O(nm) time edge-splitting in undirected graphs,
    Proceedings 28th ACM Symposium on Theory of Computing, 1996, pp.64-73.
  155. H. Nagamochi, T. Ibaraki: A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem,
    Lecture Notes in Computer Science 920, Springer-Verlag, Egon Balas and Jens Clausen (Eds.), 4th Conference on Integer Programming and Combinatorial Optimization, Copenhagen, May 1995, pp.401-413.
  156. A. Frank, T. Ibaraki, H. Nagamochi: Two arc-disjoint paths in Eulerian digraphs,
    Lecture Notes in Computer Science 1004, Springer-Verlag, John Staples, Peter Eades, Naoki Katoh and Alistair Moffat (Eds.), Algorithms and Computation, 6th International Symposium, ISAAC'95 Cairns, Dec. 1995, pp. 92-101.
  157. H. Nagamochi, K. Nishimura, T. Ibaraki: Computing all small cuts in undirected networks,
    Lecture Notes in Computer Science 834, Springer-Verlag, Ding-Zhu Du and Xiang-Sun Zhang (Eds.), Algorithms and Computation, 5th International Symposium, ISAAC'94 Beijing, Aug. 1994, pp.190-198.
  158. Y. Karuno, H. Nagamochi, T. Ibaraki: Vehicle scheduling on a tree with release and handling times,
    Lecture Notes in Computer Science, vol 762, 4th International Symposium, ISAAC'93 Hong Kong, (ed. K.W.Ng, P.Raghavan, N.V.Balasubramanian, and F.Y.L.Chin) Springer-Verlag, 1993, pp.486-495.
  159. T. Ibaraki, H. Nagamochi, T. Kameda: Optimal coteries for rings and related networks,
    Proceedings of the 12th International Conference on Distributed Computing Systems, Yokohama, Japan, 1992, pp.650-656
  160. H. Nagamochi, T. Ibaraki: Computing the edge-connectivity of multigraphs and capacitated graphs,
    Lecture Notes in Computer Science, vol.450, SIGAL'90 Algorithms, Springer-Verlag, 1990, pp.12-20.

Books

    Hiroshi Nagamochi, Toshihide Ibaraki : Algorithmic Aspects of Graph Connectivities (Encyclopedia of Mathematics and Its Applications)
    Cambridge University Press, 2008.

Dissertation

    H. Nagamochi: Studies on Multicommodity Flows in Directed Networks,
    Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, 1988.
    [Download(PDF)]


HOME(Japanese) HOME(English)
TECHNICAL REPORTS (Department of Applied Mathematics and Physics) -->