The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hiroshi Nagamochi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda
    Optimal Coteries for Rings and Related Networks. [Citation Graph (1, 0)][DBLP]
    Distributed Computing, 1995, v:8, n:4, pp:191-201 [Journal]
  2. Morihiro Hayashida, Tatsuya Akutsu, Hiroshi Nagamochi
    A Novel Clustering Method for Analysis of Biological Networks using Maximal Components of Graphs. [Citation Graph (0, 0)][DBLP]
    APBC, 2007, pp:257-266 [Conf]
  3. Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi
    Minimum Cost Source Location Problem with Local 3-Vertex-Connectivity Requirements. [Citation Graph (0, 0)][DBLP]
    CATS, 2005, pp:97-105 [Conf]
  4. Takuro Fukunaga, Hiroshi Nagamochi
    Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:747-756 [Conf]
  5. Hiroshi Nagamochi
    A Detachment Algorithm for Inferring a Graph from Path Frequency. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:274-283 [Conf]
  6. Hiroshi Nagamochi, Toshihide Ibaraki
    An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:31-40 [Conf]
  7. Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki
    A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:164-173 [Conf]
  8. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:414-425 [Conf]
  9. Yoshiyuki Karuno, Hiroshi Nagamochi
    A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:218-229 [Conf]
  10. Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige
    Minimum Transversals in Posi-modular Systems. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:576-587 [Conf]
  11. Hiroshi Nagamochi
    An Improved Approximation to the One-Sided Bilayer Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:406-418 [Conf]
  12. Hiroshi Nagamochi, Katsutoshi Kuroya
    Convex Drawing for c-Planar Biconnected Clustered Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:369-380 [Conf]
  13. Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda
    Optimal Coteries for Rings and Related Networks. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1992, pp:650-656 [Conf]
  14. Hiroshi Nagamochi, Peter Eades
    Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:96-111 [Conf]
  15. Hiroshi Nagamochi, Toshihide Ibaraki
    A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:403-413 [Conf]
  16. Hiroshi Nagamochi, Toshihide Ibaraki
    A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:377-390 [Conf]
  17. András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
    Two Arc Disjoint Paths in Eulerian Diagraphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:92-101 [Conf]
  18. Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
    Bisecting a Four-Connected Graph with Three Resource Sets. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:176-185 [Conf]
  19. Toshimasa Ishii, Hiroshi Nagamochi
    Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:326-337 [Conf]
  20. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    Augmenting Edge and Vertex Connectivities Simultaneously. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:102-111 [Conf]
  21. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:159-168 [Conf]
  22. Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi
    Augmenting Forests to Meet Odd Diameter Requirements. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:434-443 [Conf]
  23. Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita
    File Transfer Tree Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:441-452 [Conf]
  24. Yoshiyuki Karuno, Hiroshi Nagamochi
    A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:36-47 [Conf]
  25. Yoshiyuki Karuno, Hiroshi Nagamochi
    A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:199-210 [Conf]
  26. Yoshiyuki Karuno, Hiroshi Nagamochi
    A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:309-318 [Conf]
  27. Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki
    Vehicle Scheduling on a Tree with Release and Handling Times. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:486-495 [Conf]
  28. Hiroshi Nagamochi, Yuusuke Abe
    An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:280-289 [Conf]
  29. Hiroshi Nagamochi, Toru Hasunuma
    An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:447-456 [Conf]
  30. Hiroshi Nagamochi, Toshimasa Ishii
    On the Minimum Local-Vertex-Connectivity Augmentation in Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:124-135 [Conf]
  31. Hiroshi Nagamochi, Toshihide Ibaraki
    Polyhedral Structure of Submodular and Posi-modular Systems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:169-178 [Conf]
  32. Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki
    Bisecting Two Subsets in 3-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:425-434 [Conf]
  33. Hiroshi Nagamochi, Taizo Kawada
    Approximating the Minmax Subtree Cover Problem in a Cactus. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:705-716 [Conf]
  34. Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki
    Computing All Small Cuts in Undirected Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:190-198 [Conf]
  35. Hiroshi Nagamochi, Kohei Okada
    Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:138-147 [Conf]
  36. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    A Unified Framework for Approximating Multiway Partition Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:682-694 [Conf]
  37. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:373-382 [Conf]
  38. Hiro Ito, Hiroshi Nagamochi
    Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:176-181 [Conf]
  39. Hiroshi Nagamochi, Toshihide Ibaraki
    Computing Edge-Connectivity in Multiple and Capacitated Graphs. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:12-20 [Conf]
  40. Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi
    Combinatorial Optimization Games. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:720-729 [Conf]
  41. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:280-289 [Conf]
  42. Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki
    Computing Edge-Connectivity Augmentation Function in Õ(nm) Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:649-658 [Conf]
  43. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:478-489 [Conf]
  44. Hiroshi Nagamochi, Toshihide Ibaraki
    Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:64-73 [Conf]
  45. Toshimasa Ishii, Hiroshi Nagamochi
    On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:286-299 [Conf]
  46. Takuro Fukunaga, Hiroshi Nagamochi
    Network Design with Edge-Connectivity and Degree Constraints. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:188-201 [Conf]
  47. Seok-Hee Hong, Hiroshi Nagamochi
    Convex Drawings of Graphs with Non-convex Boundary. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:113-124 [Conf]
  48. Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi
    Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:1, pp:1-32 [Journal]
  49. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:3, pp:257-280 [Journal]
  50. Hiroshi Nagamochi, Toshihide Ibaraki
    A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:5&6, pp:583-596 [Journal]
  51. Hiroshi Nagamochi, S. Nakamura, Toshihide Ibaraki
    A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:1, pp:50-67 [Journal]
  52. Toshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi
    A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:1, pp:61-83 [Journal]
  53. Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki
    Convex Embeddings and Bisections of 3-Connected Graphs 1. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:4, pp:537-554 [Journal]
  54. Toshihiro Fujito, Hiroshi Nagamochi
    A 2-approximation algorithm for the minimum weight edge dominating set problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:118, n:3, pp:199-207 [Journal]
  55. Toru Hasunuma, Hiroshi Nagamochi
    Independent spanning trees with small depths in iterated line digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:189-211 [Journal]
  56. Yoshiyuki Karuno, Hiroshi Nagamochi
    2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:433-447 [Journal]
  57. Hiroshi Nagamochi
    An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:1, pp:83-113 [Journal]
  58. Hiroshi Nagamochi, Toshihide Ibaraki
    Polyhedral structure of submodular and posi-modular systems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:165-189 [Journal]
  59. Hiroshi Nagamochi, Toshihide Ibaraki
    Graph connectivity and its augmentation: applications of MA orderings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:447-472 [Journal]
  60. Hiroshi Nagamochi, Toshimasa Ishii
    On the minimum local-vertex-connectivity augmentation in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:475-486 [Journal]
  61. Hiroshi Nagamochi, Taizo Kawada
    Minmax subtree cover problem on cacti. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:8, pp:1254-1263 [Journal]
  62. Hiroshi Nagamochi, Kohei Okada
    A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:140, n:1-3, pp:103-114 [Journal]
  63. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:275-289 [Journal]
  64. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    On generalized greedy splitting algorithms for multiway partition problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:130-143 [Journal]
  65. Hiroshi Nagamochi
    Sparse connectivity certificates via MA orderings in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2411-2417 [Journal]
  66. Hiro Ito, Hiroshi Nagamochi
    Two equivalent measures on weighted hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2330-2334 [Journal]
  67. Hiroshi Nagamochi, Yuusuke Abe
    An approximation algorithm for dissecting a rectangle into rectangles with specified areas. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:4, pp:523-537 [Journal]
  68. Hiroshi Nagamochi, Katsutoshi Kuroya
    Drawing c-planar biconnected clustered graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:9, pp:1155-1174 [Journal]
  69. Hiroshi Nagamochi
    An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:4, pp:569-591 [Journal]
  70. Hiroshi Nagamochi, Mirka Miller, Slamin
    Bounds on the number of isolates in sum graph labeling. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:175-185 [Journal]
  71. Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi
    Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:78, n:, pp:- [Journal]
  72. Hiroshi Nagamochi
    On 2-Approximation to the Vertex-Connectivity in Graphs. [Citation Graph (0, 0)][DBLP]
    IEICE Transactions, 2005, v:88, n:1, pp:12-16 [Journal]
  73. Hiroshi Nagamochi
    Packing Soft Rectangles. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:5, pp:1165-1178 [Journal]
  74. Hiroshi Nagamochi
    On computing minimum (s, t)-cuts in digraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:5, pp:231-237 [Journal]
  75. Hiroshi Nagamochi, Toshihide Ibaraki
    On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:6, pp:279-285 [Journal]
  76. Hiroshi Nagamochi, Toshihide Ibaraki
    A Note on Minimizing Submodular Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:5, pp:239-244 [Journal]
  77. Hiroshi Nagamochi, Takahisa Suzuki, Toshimasa Ishii
    A simple recognition of maximal planar graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:5, pp:223-226 [Journal]
  78. Hiroshi Nagamochi, Nobuyasu Yamada
    Counting edge crossings in a 2-layered drawing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:5, pp:221-225 [Journal]
  79. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:2, pp:63-70 [Journal]
  80. Hiroshi Nagamochi, Yoko Kamidoi
    Minimum cost subpartitions in graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:2-3, pp:79-84 [Journal]
  81. Hiroshi Nagamochi
    A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:56, n:2, pp:77-95 [Journal]
  82. Hiroshi Nagamochi, Toru Hasunuma
    An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:2, pp:354-373 [Journal]
  83. Hiroshi Nagamochi, Toshihide Ibaraki
    Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:30, n:2, pp:253-301 [Journal]
  84. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:1, pp:35-77 [Journal]
  85. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:4, pp:397-410 [Journal]
  86. Hiroshi Nagamochi, Peter Eades
    An Edge-Splitting Algorithm in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2003, v:7, n:2, pp:137-159 [Journal]
  87. Hiroshi Nagamochi, Toshihide Ibaraki
    Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1997, v:1, n:1, pp:5-46 [Journal]
  88. Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki
    A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:2, pp:151-169 [Journal]
  89. Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki
    Augmenting a Submodular and Posi-modular Set Function by a Multigraph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:2, pp:175-212 [Journal]
  90. Peter Eades, Qing-Wen Feng, Hiroshi Nagamochi
    Drawing Clustered Graphs on an Orthogonal Grid. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1999, v:3, n:4, pp:3-29 [Journal]
  91. Hiroshi Nagamochi, Tadashi Ono, Toshihide Ibaraki
    Implementing an efficient minimum capacity cut algorithm. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:67, n:, pp:325-341 [Journal]
  92. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    Greedy splitting algorithms for approximating multiway partition problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:102, n:1, pp:167-183 [Journal]
  93. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    Multigraph augmentation under biconnectivity and general edge-connectivity requirements. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:3, pp:144-155 [Journal]
  94. Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki
    Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:4, pp:203-209 [Journal]
  95. Yoko Kamidoi, Noriyoshi Yoshida, Hiroshi Nagamochi
    A Deterministic Algorithm for Finding All Minimum k-Way Cuts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1329-1341 [Journal]
  96. András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
    Two Arc-Disjoint Paths in Eulerian Digraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:4, pp:557-589 [Journal]
  97. Hiroshi Nagamochi, Toshihide Ibaraki
    Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:1, pp:54-66 [Journal]
  98. Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki
    Computing All Small Cuts in an Undirected Network. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:3, pp:469-481 [Journal]
  99. Yoshiyuki Karuno, Hiroshi Nagamochi
    An approximability result of the multi-vehicle scheduling problem on a path with release and handling times. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:2-3, pp:267-280 [Journal]
  100. Hiroshi Nagamochi
    On the one-sided crossing minimization in a bipartite graph with large degrees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:417-446 [Journal]
  101. Hiroshi Nagamochi, Kengo Iwata, Toshimasa Ishii
    A robust algorithm for bisecting a triconnected graph with two resource sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:364-378 [Journal]
  102. Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi
    Minimum cost source location problem with local 3-vertex-connectivity requirements. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:372, n:1, pp:81-93 [Journal]
  103. Kazuya Haraguchi, Hiroshi Nagamochi
    Extension of ICF Classifiers to Real World Data Sets. [Citation Graph (0, 0)][DBLP]
    IEA/AIE, 2007, pp:776-785 [Conf]
  104. Takuro Fukunaga, Hiroshi Nagamochi
    The Set Connector Problem in Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:484-498 [Conf]
  105. Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
    An Efficient Algorithm for Generating Colored Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:573-583 [Conf]
  106. Ehab Morsy, Hiroshi Nagamochi
    Approximating Capacitated Tree-Routings in Networks. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:342-353 [Conf]
  107. Akifumi Kawaguchi, Hiroshi Nagamochi
    Orthogonal Drawings for Plane Graphs with Specified Face Areas. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:584-594 [Conf]
  108. L. Zhao, A. Shimae, H. Nagamochi
    Linear-tree rule structure for firewall optimization. [Citation Graph (0, 0)][DBLP]
    Communications, Internet, and Information Technology, 2007, pp:67-72 [Conf]
  109. Takashi Imamichi, Hiroshi Nagamochi
    A Multi-sphere Scheme for 2D and 3D Packing Problems. [Citation Graph (0, 0)][DBLP]
    SLS, 2007, pp:207-211 [Conf]
  110. Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred Glover
    A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP]
    SLS, 2007, pp:121-135 [Conf]
  111. Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine
    Contention-Free l-Planes in Optically Burst-Switched WDM Networks. [Citation Graph (0, 0)][DBLP]
    GLOBECOM, 2006, pp:- [Conf]
  112. Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
    Bisecting a 4-connected graph with three resource sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:11, pp:1441-1450 [Journal]
  113. Hiroshi Nagamochi, Kohei Okada
    Approximating the minmax rooted-tree cover in a tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:5, pp:173-178 [Journal]
  114. André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh
    Approximability of the capacitated b-edge dominating set problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:202-213 [Journal]

  115. Independent Spanning Trees with Small Depths in Iterated Line Digraphs. [Citation Graph (, )][DBLP]


  116. Enumerating Rooted Graphs with Reflectional Block Structures. [Citation Graph (, )][DBLP]


  117. Approximating the Generalized Capacitated Tree-Routing Problem. [Citation Graph (, )][DBLP]


  118. Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints. [Citation Graph (, )][DBLP]


  119. "Rent-or-Buy" Scheduling and Cost Coloring Problems. [Citation Graph (, )][DBLP]


  120. Removing Node Overlaps Using Multi-sphere Scheme. [Citation Graph (, )][DBLP]


  121. Minimum Degree Orderings. [Citation Graph (, )][DBLP]


  122. Approximation to the Minimum Cost Edge Installation Problem. [Citation Graph (, )][DBLP]


  123. Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming. [Citation Graph (, )][DBLP]


  124. Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries. [Citation Graph (, )][DBLP]


  125. Upward Star-Shaped Polyhedral Graphs. [Citation Graph (, )][DBLP]


  126. Approximating Crossing Minimization in Radial Layouts. [Citation Graph (, )][DBLP]


  127. Bipartite Graph Representation of Multiple Decision Table Classifiers. [Citation Graph (, )][DBLP]


  128. Robust cost colorings. [Citation Graph (, )][DBLP]


  129. Generating Internally Triconnected Rooted Plane Graphs. [Citation Graph (, )][DBLP]


  130. Network Design with Weighted Degree Constraints. [Citation Graph (, )][DBLP]


  131. Minmax Tree Cover in the Euclidean Space. [Citation Graph (, )][DBLP]


  132. Cop-Robber Guarding Game with Cycle Robber Region. [Citation Graph (, )][DBLP]


  133. FPTAS's for Some Cut Problems in Weighted Trees. [Citation Graph (, )][DBLP]


  134. Constant Time Generation of Biconnected Rooted Plane Graphs. [Citation Graph (, )][DBLP]


  135. Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables. [Citation Graph (, )][DBLP]


  136. A Detachment Algorithm for Inferring a Graph from Path Frequency. [Citation Graph (, )][DBLP]


  137. Minimum Degree Orderings. [Citation Graph (, )][DBLP]


  138. Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs. [Citation Graph (, )][DBLP]


  139. Packing Unit Squares in a Rectangle. [Citation Graph (, )][DBLP]


  140. An algorithm for constructing star-shaped drawings of plane graphs. [Citation Graph (, )][DBLP]


  141. The source location problem with local 3-vertex-connectivity requirements. [Citation Graph (, )][DBLP]


  142. Convex drawings of graphs with non-convex boundary constraints. [Citation Graph (, )][DBLP]


  143. Multicommodity flows in certain planar directed networks. [Citation Graph (, )][DBLP]


  144. Eulerian detachments with local edge-connectivity. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.016secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002