default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroshi Nagamochi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j180]Jianshen Zhu
, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes. IEEE ACM Trans. Comput. Biol. Bioinform. 21(5): 1529-1541 (2024)- [j179]Ryota Ido, Shengjuan Cao, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
A Method for Inferring Polymers Based on Linear Regression and Integer Programming. IEEE ACM Trans. Comput. Biol. Bioinform. 21(6): 1623-1632 (2024) - 2023
- [j178]Kazuya Haraguchi, Hiroshi Nagamochi:
Polynomial-delay enumeration algorithms in set systems. Theor. Comput. Sci. 963: 113963 (2023) - [i19]Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes. CoRR abs/2305.00801 (2023) - 2022
- [j177]Kazuya Haraguchi, Hiroshi Nagamochi:
Enumeration of Support-Closed Subsets in Confluent Systems. Algorithmica 84(5): 1279-1315 (2022) - [j176]Fan Zhang, Jianshen Zhu, Rachaya Chiewvanichakorn, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
A new approach to the design of acyclic chemical compounds using skeleton trees and integer linear programming. Appl. Intell. 52(15): 17058-17072 (2022) - [j175]Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
On the enumeration of minimal non-pairwise compatibility graphs. J. Comb. Optim. 44(4): 2871-2892 (2022) - [j174]Jianshen Zhu, Naveed Ahmed Azam, Fan Zhang, Aleksandar Shurbevski, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming. IEEE ACM Trans. Comput. Biol. Bioinform. 19(6): 3233-3245 (2022) - [c119]Jianshen Zhu, Kazuya Haraguchi, Hiroshi Nagamochi, Tatsuya Akutsu:
Adjustive Linear Regression and Its Application to the Inverse QSAR. BIOINFORMATICS 2022: 144-151 - [c118]Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
A Method for Molecular Design Based on Linear Regression and Integer Programming. ICBBB 2022: 21-28 - [i18]Jianshen Zhu, Naveed Ahmed Azam, Shengjuan Cao, Ryota Ido, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model. CoRR abs/2209.13527 (2022) - 2021
- [j173]Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming. Algorithms Mol. Biol. 16(1): 18 (2021) - [j172]Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
A method for enumerating pairwise compatibility graphs with a given number of vertices. Discret. Appl. Math. 303: 171-185 (2021) - [j171]Seok-Hee Hong, Hiroshi Nagamochi:
Re-embedding a 1-plane graph for a straight-line drawing in linear time. Theor. Comput. Sci. 892: 132-154 (2021) - [c117]Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search. BIBM 2021: 360-363 - [c116]Kouki Tanaka, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
An Inverse QSAR Method Based on Decision Tree and Integer Programming. ICIC (2) 2021: 628-644 - [c115]Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures. IEA/AIE (1) 2021: 197-209 - [i17]Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
An Inverse QSAR Method Based on Linear Regression and Integer Programming. CoRR abs/2107.02381 (2021) - [i16]Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search. CoRR abs/2108.10266 (2021) - [i15]Ryota Ido, Shengjuan Cao, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
A Method for Inferring Polymers Based on Linear Regression and Integer Programming. CoRR abs/2109.02628 (2021) - 2020
- [j170]Mingyu Xiao, Hiroshi Nagamochi:
Characterizing Star-PCGs. Algorithmica 82(10): 3066-3090 (2020) - [j169]Jianshen Zhu, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming. Algorithms 13(5): 124 (2020) - [j168]Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops. Entropy 22(9): 923 (2020) - [j167]Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank. Entropy 22(11): 1295 (2020) - [j166]Mingyu Xiao, Hiroshi Nagamochi:
Some reduction operations to pairwise compatibility graphs. Inf. Process. Lett. 153 (2020) - [j165]Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi:
Group Strategy-proof Mechanisms for Shuttle Facility Games. J. Inf. Process. 28: 976-986 (2020) - [c114]Naveed Ahmed Azam, Rachaya Chiewvanichakorn, Fan Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility. BIOINFORMATICS 2020: 101-108 - [c113]Seok-Hee Hong, Hiroshi Nagamochi:
Path-Monotonic Upward Drawings of Graphs. COCOON 2020: 110-122 - [c112]Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
On the Enumeration of Minimal Non-pairwise Compatibility Graphs. COCOON 2020: 372-383 - [c111]Rachaya Chiewvanichakorn, Chenxi Wang, Zhe Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
A Method for the Inverse QSAR/QSPR Based on Artificial Neural Networks and Mixed Integer Linear Programming. ICBBB 2020: 40-46 - [c110]Fan Zhang, Jianshen Zhu, Rachaya Chiewvanichakorn, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
A New Integer Linear Programming Formulation to the Inverse QSAR/QSPR for Acyclic Chemical Compounds Using Skeleton Trees. IEA/AIE 2020: 433-444 - [i14]Kazuya Haraguchi, Hiroshi Nagamochi:
Design of Polynomial-delay Enumeration Algorithms in Transitive Systems. CoRR abs/2004.01904 (2020) - [i13]Yuui Tamura, Yuhei Nishiyama, Chenxi Wang, Yanming Sun, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies. CoRR abs/2004.06367 (2020) - [i12]Kazuya Haraguchi, Hiroshi Nagamochi:
Polynomial-delay Enumeration Algorithms in Set Systems. CoRR abs/2004.07823 (2020) - [i11]Kyousuke Yamashita, Ryuji Masui, Xiang Zhou, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications. CoRR abs/2004.08381 (2020) - [i10]Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
A Novel Method for Inference of Acyclic Chemical Compounds with Bounded Branch-height Based on Artificial Neural Networks and Integer Programming. CoRR abs/2009.09646 (2020) - [i9]Tatsuya Akutsu, Hiroshi Nagamochi:
A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming. CoRR abs/2010.09203 (2020) - [i8]Mingyu Xiao, Hiroshi Nagamochi:
Bounded-Degree Cut is Fixed-Parameter Tractable. CoRR abs/2012.14174 (2020)
2010 – 2019
- 2019
- [j164]Seok-Hee Hong, Hiroshi Nagamochi:
A linear-time algorithm for testing full outer-2-planarity. Discret. Appl. Math. 255: 234-257 (2019) - [j163]Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades:
Acute Constraints in Straight-Line Drawings of Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 994-1001 (2019) - [j162]Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi:
λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1179-1186 (2019) - [j161]Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi:
COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets. J. Graph Algorithms Appl. 23(2): 434-458 (2019) - [j160]Yuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs. IEEE ACM Trans. Comput. Biol. Bioinform. 16(1): 77-90 (2019) - [c109]Kazuya Haraguchi, Hiroshi Nagamochi:
A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions. ISAAC 2019: 3:1-3:15 - 2018
- [j159]Mohd Shahrizan Othman, Aleksandar Shurbevski, Hiroshi Nagamochi:
Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem. IEICE Trans. Inf. Syst. 101-D(3): 611-612 (2018) - [j158]Hiroaki Suto, Aleksandar Shurbevski, Hiroshi Nagamochi:
The Stable Roommates Problem with Unranked Entries. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1412-1419 (2018) - [j157]Jinghui Li, Hiroshi Nagamochi, Tatsuya Akutsu:
Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs. IEEE ACM Trans. Comput. Biol. Bioinform. 15(2): 633-646 (2018) - [j156]Seok-Hee Hong, Hiroshi Nagamochi:
Simpler algorithms for testing two-page book embedding of partitioned graphs. Theor. Comput. Sci. 725: 79-98 (2018) - [c108]Mingyu Xiao, Hiroshi Nagamochi:
Characterizing Star-PCGs. COCOON 2018: 504-515 - [c107]Mingyu Xiao, Hiroshi Nagamochi:
Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable. ICALP 2018: 112:1-112:6 - [c106]Yuui Tamura, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
Enumerating Chemical Mono-Block 3-Augmented Trees with Two Junctions. ICBBB 2018: 48-55 - [p1]Shinji Imahori, Mutsunori Yagiura, Hiroshi Nagamochi:
Practical Algorithms for Two-Dimensional Packing of Rectangles. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 571-583 - [i7]Mingyu Xiao, Hiroshi Nagamochi:
Some Reduction Operations to Pairwise Compatibility Graphs. CoRR abs/1804.02887 (2018) - [i6]Mingyu Xiao, Hiroshi Nagamochi:
Characterizing Star-PCGs. CoRR abs/1804.02895 (2018) - 2017
- [j155]Mingyu Xiao, Hiroshi Nagamochi:
Exact algorithms for maximum independent set. Inf. Comput. 255: 126-146 (2017) - [j154]Ken Iwaide, Hiroshi Nagamochi:
An Exact Algorithm for Lowest Edge Dominating Set. IEICE Trans. Inf. Syst. 100-D(3): 414-421 (2017) - [j153]Mingyu Xiao, Hiroshi Nagamochi:
A refined algorithm for maximum independent set in degree-4 graphs. J. Comb. Optim. 34(3): 830-873 (2017) - [j152]Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi:
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game. J. Graph Algorithms Appl. 21(3): 247-263 (2017) - [j151]Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi:
An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs. J. Inf. Process. 25: 639-654 (2017) - [j150]Mohd Shahrizan Othman, Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi:
Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route. J. Inf. Process. 25: 655-666 (2017) - [j149]Mingyu Xiao, Hiroshi Nagamochi:
Complexity and kernels for bipartition into degree-bounded induced graphs. Theor. Comput. Sci. 659: 72-82 (2017) - 2016
- [j148]Mingyu Xiao, Hiroshi Nagamochi:
An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure. Algorithmica 74(2): 713-741 (2016) - [j147]Mingyu Xiao, Hiroshi Nagamochi:
An exact algorithm for maximum independent set in degree-5 graphs. Discret. Appl. Math. 199: 137-155 (2016) - [j146]Morito Oomine, Hiroshi Nagamochi:
Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees. IEICE Trans. Inf. Syst. 99-D(3): 615-623 (2016) - [j145]Ken Iwaide, Hiroshi Nagamochi:
An Improved Algorithm for Parameterized Edge Dominating Set Problem. J. Graph Algorithms Appl. 20(1): 23-58 (2016) - [j144]Mingyu Xiao, Hiroshi Nagamochi:
An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4. Theory Comput. Syst. 58(2): 241-272 (2016) - [c105]Fei He, Akiyoshi Hanai, Hiroshi Nagamochi, Tatsuya Akutsu:
Enumerating Naphthalene Isomers of Tree-like Chemical Graphs. BIOINFORMATICS 2016: 258-265 - [c104]Seok-Hee Hong, Hiroshi Nagamochi:
Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time. GD 2016: 321-334 - [c103]Mingyu Xiao, Hiroshi Nagamochi:
A Linear-Time Algorithm for Integral Multiterminal Flows in Trees. ISAAC 2016: 62:1-62:12 - [c102]Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi:
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game. WALCOM 2016: 286-297 - [i5]Seok-Hee Hong, Hiroshi Nagamochi:
Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time. CoRR abs/1608.07662 (2016) - [i4]Mingyu Xiao, Hiroshi Nagamochi:
A Linear-time Algorithm for Integral Multiterminal Flows in Trees. CoRR abs/1611.08803 (2016) - 2015
- [j143]Mingyu Xiao, Hiroshi Nagamochi:
Exact algorithms for dominating induced matching based on graph partition. Discret. Appl. Math. 190-191: 147-162 (2015) - [j142]Masataka Ikeda, Hiroshi Nagamochi:
Some Reduction Procedure for Computing Pathwidth of Undirected Graphs. IEICE Trans. Inf. Syst. 98-D(3): 503-511 (2015) - [j141]Mingyu Xiao, Hiroshi Nagamochi:
An improved exact algorithm for undirected feedback vertex set. J. Comb. Optim. 30(2): 214-241 (2015) - [c101]Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi:
A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs. JCDCGG 2015: 228-240 - [c100]Ken Iwaide, Hiroshi Nagamochi:
An Improved Algorithm for Parameterized Edge Dominating Set Problem. WALCOM 2015: 234-245 - [c99]Seok-Hee Hong, Hiroshi Nagamochi:
Testing Full Outer-2-planarity in Linear Time. WG 2015: 406-421 - 2014
- [j140]Masaki Suzuki, Hiroshi Nagamochi, Tatsuya Akutsu:
Efficient enumeration of monocyclic chemical graphs with given path frequencies. J. Cheminformatics 6(1): 31 (2014) - [j139]Toshihiro Shimizu, Takuro Fukunaga, Hiroshi Nagamochi:
Unranking of small combinations from large sets. J. Discrete Algorithms 29: 8-20 (2014) - [j138]Mingyu Xiao, Hiroshi Nagamochi:
A refined exact algorithm for Edge Dominating Set. Theor. Comput. Sci. 560: 207-216 (2014) - [c98]Seok-Hee Hong, Hiroshi Nagamochi:
Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs. COCOON 2014: 477-488 - [c97]Mingyu Xiao, Hiroshi Nagamochi:
Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs. ISAAC 2014: 429-440 - [c96]Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno:
Approximating the Bipartite TSP and Its Biased Generalization. WALCOM 2014: 56-67 - [i3]Mingyu Xiao, Hiroshi Nagamochi:
Exact Algorithms for Dominating Induced Matching Based on Graph Partition. CoRR abs/1408.6196 (2014) - 2013
- [j137]Mingyu Xiao, Hiroshi Nagamochi:
Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3. IEICE Trans. Inf. Syst. 96-D(3): 408-418 (2013) - [j136]Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno:
Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems. IEICE Trans. Inf. Syst. 96-D(3): 450-456 (2013) - [j135]Yang Zhao, Morihiro Hayashida, Jira Jindalertudomdee, Hiroshi Nagamochi, Tatsuya Akutsu:
Breadth-First Search Approach to Enumeration of Tree-like Chemical Compounds. J. Bioinform. Comput. Biol. 11(6) (2013) - [j134]Mingyu Xiao, Hiroshi Nagamochi:
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs. Theor. Comput. Sci. 469: 92-104 (2013) - [j133]Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi:
FPTASs for trimming weighted trees. Theor. Comput. Sci. 469: 105-118 (2013) - [j132]Mingyu Xiao, Hiroshi Nagamochi:
Parameterized edge dominating set in graphs with degree bounded by 3. Theor. Comput. Sci. 508: 2-15 (2013) - [c95]Mingyu Xiao, Hiroshi Nagamochi:
An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs. FAW-AAIM 2013: 72-83 - [c94]Mingyu Xiao, Hiroshi Nagamochi:
An Improved Exact Algorithm for Undirected Feedback Vertex Set. COCOA 2013: 153-164 - [c93]Aleksandar Shurbevski, Noriaki Hirosue, Hiroshi Nagamochi:
Optimization Techniques for Robot Path Planning. ICT Innovations 2013: 111-120 - [c92]Mingyu Xiao, Hiroshi Nagamochi:
Exact Algorithms for Maximum Independent Set. ISAAC 2013: 328-338 - [c91]Mingyu Xiao, Hiroshi Nagamochi:
An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure. TAMC 2013: 96-107 - [i2]Mingyu Xiao, Hiroshi Nagamochi:
Exact Algorithms for Maximum Independent Set. CoRR abs/1312.6260 (2013) - 2012
- [j131]Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi:
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. Algorithmica 62(3-4): 787-806 (2012) - [j130]Seok-Hee Hong, Hiroshi Nagamochi:
A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners. Algorithmica 62(3-4): 1122-1158 (2012) - [j129]Yohei Arahori, Takashi Imamichi, Hiroshi Nagamochi:
An exact strip packing algorithm based on canonical forms. Comput. Oper. Res. 39(12): 2991-3011 (2012) - [j128]Tomoki Imada, Hiroshi Nagamochi:
Indexing All Rooted Subgraphs of a Rooted Graph. IEICE Trans. Inf. Syst. 95-D(3): 712-721 (2012) - [j127]Yang Zhao, Morihiro Hayashida, Jose C. Nacher, Hiroshi Nagamochi, Tatsuya Akutsu:
Protein complex prediction via improved verification methods using constrained domain-domain matching. Int. J. Bioinform. Res. Appl. 8(3/4): 210-227 (2012) - [j126]Mingyu Xiao, Hiroshi Nagamochi:
An FPT algorithm for edge subset feedback edge set. Inf. Process. Lett. 112(1-2): 5-9 (2012) - [j125]Seok-Hee Hong, Hiroshi Nagamochi:
Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints. Theor. Comput. Sci. 445: 36-51 (2012) - [c90]Cong Zhang, Hiroshi Nagamochi:
The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights. CATS 2012: 13-20 - [c89]Ken Ibara, Hiroshi Nagamochi:
Characterizing Mechanisms in Obnoxious Facility Game. COCOA 2012: 301-311 - [c88]Mingyu Xiao, Hiroshi Nagamochi:
An Improved Exact Algorithm for TSP in Degree-4 Graphs. COCOON 2012: 74-85 - [c87]Hiroshi Nagamochi:
Linear Layouts in Submodular Systems. ISAAC 2012: 475-484 - [c86]Mingyu Xiao, Hiroshi Nagamochi:
A Refined Exact Algorithm for Edge Dominating Set. TAMC 2012: 360-372 - [c85]Hiroshi Nagamochi:
Submodular Minimization via Pathwidth. TAMC 2012: 584-593 - [i1]Mingyu Xiao, Hiroshi Nagamochi:
An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure. CoRR abs/1212.6831 (2012) - 2011
- [j124]Seok-Hee Hong, Hiroshi Nagamochi:
Editorial: ISAAC 2008 Special Issue. Algorithmica 61(4): 777-778 (2011) - [j123]Seok-Hee Hong, Hiroshi Nagamochi:
Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra. Algorithmica 61(4): 1022-1076 (2011) - [j122]Masaaki Shimizu, Hiroshi Nagamochi, Tatsuya Akutsu:
Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies. BMC Bioinform. 12(S-14): S3 (2011) - [j121]Bingbing Zhuang, Hiroshi Nagamochi:
Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs. IEICE Trans. Inf. Syst. 94-D(2): 200-210 (2011) - [j120]Bingbing Zhuang, Hiroshi Nagamochi:
Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs. IEICE Trans. Inf. Syst. 94-D(2): 211-219 (2011) - [j119]Tatsuya Akutsu, Hiroshi Nagamochi:
Kernel Methods for Chemical Compounds: From Classification to Design. IEICE Trans. Inf. Syst. 94-D(10): 1846-1853 (2011) - [j118]Shinji Imahori, Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang:
Kansei engineering, humans and computers: efficient dynamic programming algorithms for combinatorial food packing problems. Int. J. Biom. 3(3): 228-245 (2011) - [j117]Seok-Hee Hong, Hiroshi Nagamochi:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 21(3): 251-252 (2011) - [j116]Hirofumi Aota, Takuro Fukunaga, Hiroshi Nagamochi:
An Approximation Algorithm for Locating Maximal Disks within Convex Polygons. Int. J. Comput. Geom. Appl. 21(6): 661-684 (2011) - [j115]Yoshiyuki Karuno, Hiroshi Nagamochi, Aleksandar Shurbevski:
An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots. J. Adv. Comput. Intell. Intell. Informatics 15(8): 1103-1108 (2011) - [j114]Tomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, Tatsuya Akutsu:
Efficient Enumeration of Stereoisomers of Outerplanar Chemical Graphs Using Dynamic Programming. J. Chem. Inf. Model. 51(11): 2788-2807 (2011) - [j113]Ehab Morsy, Hiroshi Nagamochi:
Approximating capacitated tree-routings in networks. J. Comb. Optim. 21(2): 254-267 (2011) - [j112]Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi:
Minmax Tree Cover in the Euclidean Space. J. Graph Algorithms Appl. 15(3): 345-371 (2011) - [j111]Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura:
Efficient branch-and-bound algorithms for weighted MAX-2-SAT. Math. Program. 127(2): 297-343 (2011) - [j110]Kazuki Matsumoto, Shunji Umetani, Hiroshi Nagamochi:
On the one-dimensional stock cutting problem in the paper tube industry. J. Sched. 14(3): 281-290 (2011) - [j109]Hiroshi Nagamochi:
Cop-robber guarding game with cycle robber-region. Theor. Comput. Sci. 412(4-5): 383-390 (2011) - [c84]Mingyu Xiao, Hiroshi Nagamochi:
Parameterized Edge Dominating Set in Cubic Graphs - (Extended Abstract). FAW-AAIM 2011: 100-112 - [c83]Mingyu Xiao, Hiroshi Nagamochi:
Further Improvement on Maximum Independent Set in Degree-4 Graphs. COCOA 2011: 163-178 - [c82]Toru Hasunuma, Hiroshi Nagamochi:
Improved Bounds for Minimum Fault-Tolerant Gossip Graphs. WG 2011: 203-214 - 2010
- [j108]Hiroshi Nagamochi:
Minimum Degree Orderings. Algorithmica 56(1): 17-34 (2010) - [j107]Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi:
Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs. Algorithmica 56(4): 413-436 (2010) - [j106]Seok-Hee Hong, Hiroshi Nagamochi:
A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs. Algorithmica 58(2): 433-460 (2010) - [j105]Seok-Hee Hong, Hiroshi Nagamochi:
Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings. Algorithmica 58(2): 478-497 (2010) - [j104]Seok-Hee Hong, Hiroshi Nagamochi:
An algorithm for constructing star-shaped drawings of plane graphs. Comput. Geom. 43(2): 191-206 (2010) - [j103]Takuro Fukunaga, Hiroshi Nagamochi:
Network design with weighted degree constraints. Discret. Optim. 7(4): 246-255 (2010) - [j102]Ehab Morsy, Hiroshi Nagamochi:
Approximation to the Minimum Cost Edge Installation Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(4): 778-786 (2010) - [j101]Yusuke Ishida, Yuki Kato, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut. J. Chem. Inf. Model. 50(5): 934-946 (2010) - [j100]Seok-Hee Hong, Hiroshi Nagamochi:
Convex drawings of hierarchical planar graphs and clustered planar graphs. J. Discrete Algorithms 8(3): 282-295 (2010) - [j99]Ehab Morsy, Hiroshi Nagamochi:
On the approximation of the generalized capacitated tree-routing problem. J. Discrete Algorithms 8(3): 311-320 (2010) - [j98]Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi:
A plane graph representation of triconnected graphs. Theor. Comput. Sci. 411(44-46): 3979-3993 (2010) - [c81]Tatsuya Ohshima, Pipaporn Eumthurapojn, Liang Zhao, Hiroshi Nagamochi:
An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem. CGGA 2010: 154-163 - [c80]Bingbing Zhuang, Hiroshi Nagamochi:
Enumerating Rooted Graphs with Reflectional Block Structures. CIAC 2010: 49-60 - [c79]Bingbing Zhuang, Hiroshi Nagamochi:
Listing Triconnected Rooted Plane Graphs. COCOA (2) 2010: 347-361 - [c78]Bingbing Zhuang, Hiroshi Nagamochi:
Constant Time Generation of Biconnected Rooted Plane Graphs. FAW 2010: 113-123 - [c77]Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi:
FPTAS's for Some Cut Problems in Weighted Trees. FAW 2010: 210-221 - [c76]Bingbing Zhuang, Hiroshi Nagamochi:
Generating Trees on Multisets. ISAAC (1) 2010: 182-193 - [c75]Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi:
Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables. LION 2010: 169-183 - [c74]Bingbing Zhuang, Hiroshi Nagamochi:
Generating Internally Triconnected Rooted Plane Graphs. TAMC 2010: 467-478
2000 – 2009
- 2009
- [j97]Hiroshi Nagamochi:
A Detachment Algorithm for Inferring a Graph from Path Frequency. Algorithmica 53(2): 207-224 (2009) - [j96]Takuro Fukunaga, Hiroshi Nagamochi:
Eulerian detachments with local edge-connectivity. Discret. Appl. Math. 157(4): 691-698 (2009) - [j95]Takashi Imamichi, Mutsunori Yagiura, Hiroshi Nagamochi:
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Discret. Optim. 6(4): 345-361 (2009) - [j94]Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi:
Exact algorithms for the two-dimensional strip packing problem with and without rotations. Eur. J. Oper. Res. 198(1): 73-83 (2009) - [j93]Seok-Hee Hong, Hiroshi Nagamochi:
New Approximation to the One-sided Radial Crossing Minimization. J. Graph Algorithms Appl. 13(2): 179-196 (2009) - [j92]Takuro Fukunaga, Hiroshi Nagamochi:
Network Design with Edge-Connectivity and Degree Constraints. Theory Comput. Syst. 45(3): 512-532 (2009) - [j91]Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige:
Minimum Transversals in Posimodular Systems. SIAM J. Discret. Math. 23(2): 858-871 (2009) - [j90]Akifumi Kawaguchi, Hiroshi Nagamochi:
Drawing slicing graphs with face areas. Theor. Comput. Sci. 410(11): 1061-1072 (2009) - [c73]Hiroshi Nagamochi:
Cop-Robber Guarding Game with Cycle Robber Region. FAW 2009: 74-84 - [c72]Tomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, Tatsuya Akutsu:
Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming. ISAAC 2009: 14-23 - [c71]Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi:
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. ISAAC 2009: 55-64 - [c70]Yoshitaka Nakao, Hiroshi Nagamochi:
Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries. ISAAC 2009: 554-563 - [c69]Seok-Hee Hong, Hiroshi Nagamochi:
Upward Star-Shaped Polyhedral Graphs. ISAAC 2009: 913-922 - [c68]Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi:
Bipartite Graph Representation of Multiple Decision Table Classifiers. SAGA 2009: 46-60 - [c67]Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi:
Minmax Tree Cover in the Euclidean Space. WALCOM 2009: 202-213 - [c66]Takuro Fukunaga, Hiroshi Nagamochi:
Network Design with Weighted Degree Constraints. WALCOM 2009: 214-225 - 2008
- [b1]Hiroshi Nagamochi, Toshihide Ibaraki:
Algorithmic Aspects of Graph Connectivity. Encyclopedia of Mathematics and its Applications 123, Cambridge University Press 2008, ISBN 9780511721649 - [j89]Seok-Hee Hong, Hiroshi Nagamochi:
Convex drawings of graphs with non-convex boundary constraints. Discret. Appl. Math. 156(12): 2368-2380 (2008) - [j88]Takashi Imamichi, Hiroshi Nagamochi:
Performance Analysis of a Collision Detection Algorithm of Spheres Based on Slab Partitioning. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2308-2313 (2008) - [j87]Yoshitaka Nakao, Hiroshi Nagamochi:
Worst Case Analysis for Pickup and Delivery Problems with Transfer. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2328-2334 (2008) - [j86]Morihiro Hayashida, Tatsuya Akutsu, Hiroshi Nagamochi:
A Clustering Method for Analysis of Sequence Similarity Networks of Proteins Using Maximal Components of Graphs. Inf. Media Technol. 3(2): 341-350 (2008) - [j85]Hiroki Fujiwara, Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Enumerating Treelike Chemical Graphs with Given Path Frequency. J. Chem. Inf. Model. 48(7): 1345-1357 (2008) - [j84]Ehab Morsy, Hiroshi Nagamochi:
An improved approximation algorithm for capacitated multicast routings in networks. Theor. Comput. Sci. 390(1): 81-91 (2008) - [j83]Hiroshi Nagamochi, Takaharu Ohnishi:
Approximating a vehicle scheduling problem with time windows and handling times. Theor. Comput. Sci. 393(1-3): 133-146 (2008) - [c65]Seok-Hee Hong, Hiroshi Nagamochi:
Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints. COCOON 2008: 405-414 - [c64]Ehab Morsy, Hiroshi Nagamochi:
Approximating the Generalized Capacitated Tree-Routing Problem. COCOON 2008: 621-630 - [c63]Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi:
Removing Node Overlaps Using Multi-sphere Scheme. GD 2008: 296-301 - [c62]Seok-Hee Hong, Hiroshi Nagamochi:
Approximating Crossing Minimization in Radial Layouts. LATIN 2008: 461-472 - [c61]Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi:
Robust cost colorings. SODA 2008: 1204-1212 - [e2]Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga:
Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings. Lecture Notes in Computer Science 5369, Springer 2008, ISBN 978-3-540-92181-3 [contents] - 2007
- [j82]Hiroshi Nagamochi, Yuusuke Abe:
An approximation algorithm for dissecting a rectangle into rectangles with specified areas. Discret. Appl. Math. 155(4): 523-537 (2007) - [j81]Hiroshi Nagamochi, Katsutoshi Kuroya:
Drawing c-planar biconnected clustered graphs. Discret. Appl. Math. 155(9): 1155-1174 (2007) - [j80]Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi:
Bisecting a 4-connected graph with three resource sets. Discret. Appl. Math. 155(11): 1441-1450 (2007) - [j79]Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi:
The source location problem with local 3-vertex-connectivity requirements. Discret. Appl. Math. 155(18): 2523-2538 (2007) - [j78]Takuro Fukunaga, Hiroshi Nagamochi:
Generalizing the induced matching by edge capacity constraints. Discret. Optim. 4(2): 198-205 (2007) - [j77]Hiroshi Nagamochi:
Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex. IEICE Trans. Inf. Syst. 90-D(2): 428-431 (2007) - [j76]Takuro Fukunaga, Hiroshi Nagamochi:
Approximating a Generalization of Metric TSP. IEICE Trans. Inf. Syst. 90-D(2): 432-439 (2007) - [j75]Ehab Morsy, Hiroshi Nagamochi:
Approximation Algorithms for Multicast Routings in a Network with Multi-Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(5): 900-906 (2007) - [j74]Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine:
Contention-Free lambda-Planes in Optically Burst-Switched WDM Networks. IEICE Trans. Commun. 90-B(9): 2524-2531 (2007) - [j73]Hiroshi Nagamochi, Yoko Kamidoi:
Minimum cost subpartitions in graphs. Inf. Process. Lett. 102(2-3): 79-84 (2007) - [j72]Hiroshi Nagamochi, Kohei Okada:
Approximating the minmax rooted-tree cover in a tree. Inf. Process. Lett. 104(5): 173-178 (2007) - [j71]Yoko Kamidoi, Noriyoshi Yoshida, Hiroshi Nagamochi:
A Deterministic Algorithm for Finding All Minimum k-Way Cuts. SIAM J. Comput. 36(5): 1329-1341 (2007) - [j70]Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi:
Minimum cost source location problem with local 3-vertex-connectivity requirements. Theor. Comput. Sci. 372(1): 81-93 (2007) - [j69]André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh:
Approximability of the capacitated b-edge dominating set problem. Theor. Comput. Sci. 385(1-3): 202-213 (2007) - [c60]Morihiro Hayashida, Tatsuya Akutsu, Hiroshi Nagamochi:
A Novel Clustering Method for Analysis of Biological Networks using Maximal Components of Graphs. APBC 2007: 257-266 - [c59]Liang Zhao, A. Shimae, Hiroshi Nagamochi:
Linear-tree rule structure for firewall optimization. Communications, Internet, and Information Technology 2007: 67-72 - [c58]Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi:
"Rent-or-Buy" Scheduling and Cost Coloring Problems. FSTTCS 2007: 84-95 - [c57]Kazuya Haraguchi, Hiroshi Nagamochi:
Extension of ICF Classifiers to Real World Data Sets. IEA/AIE 2007: 776-785 - [c56]Takuro Fukunaga, Hiroshi Nagamochi:
The Set Connector Problem in Graphs. IPCO 2007: 484-498 - [c55]Hiroshi Nagamochi:
Minimum Degree Orderings. ISAAC 2007: 17-28 - [c54]Ehab Morsy, Hiroshi Nagamochi:
Approximation to the Minimum Cost Edge Installation Problem. ISAAC 2007: 292-303 - [c53]Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred W. Glover:
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem. SLS 2007: 121-135 - [c52]Takashi Imamichi, Hiroshi Nagamochi:
A Multi-sphere Scheme for 2D and 3D Packing Problems. SLS 2007: 207-211 - [c51]Ehab Morsy, Hiroshi Nagamochi:
Approximating Capacitated Tree-Routings in Networks. TAMC 2007: 342-353 - [c50]Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
An Efficient Algorithm for Generating Colored Outerplanar Graphs. TAMC 2007: 573-583 - [c49]Akifumi Kawaguchi, Hiroshi Nagamochi:
Orthogonal Drawings for Plane Graphs with Specified Face Areas. TAMC 2007: 584-594 - [r2]Yoshiyuki Karuno, Hiroshi Nagamochi:
Vehicle Scheduling Problems in Graphs. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r1]Mutsunori Yagiura, Hiroshi Nagamochi, Shinji Imahori:
Practical Algorithms for Two-Dimensional Packing. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j68]Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi:
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Algorithmica 44(1): 1-32 (2006) - [j67]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. Algorithmica 44(3): 257-280 (2006) - [j66]Hiroshi Nagamochi, Taizo Kawada:
Minmax subtree cover problem on cacti. Discret. Appl. Math. 154(8): 1254-1263 (2006) - [j65]Hiro Ito, Hiroshi Nagamochi:
Two equivalent measures on weighted hypergraphs. Discret. Appl. Math. 154(16): 2330-2334 (2006) - [j64]Hiroshi Nagamochi:
Sparse connectivity certificates via MA orderings in graphs. Discret. Appl. Math. 154(16): 2411-2417 (2006) - [j63]Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi:
Augmenting forests to meet odd diameter requirements. Discret. Optim. 3(2): 154-164 (2006) - [j62]Takuro Fukunaga, Hiroshi Nagamochi:
Some Theorems on Detachments Preserving Local-Edge-Connectivity. Electron. Notes Discret. Math. 24: 173-180 (2006) - [j61]Hiroshi Nagamochi:
Increasing the Edge-Connectivity by Contracting a Vertex Subset in Graphs. IEICE Trans. Inf. Syst. 89-D(2): 744-750 (2006) - [j60]Hiroshi Nagamochi:
A Fast Edge-Splitting Algorithm in Edge-Weighted Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1263-1268 (2006) - [j59]Hiroshi Nagamochi:
Packing Soft Rectangles. Int. J. Found. Comput. Sci. 17(5): 1165-1178 (2006) - [c48]Hiroshi Nagamochi:
A Detachment Algorithm for Inferring a Graph from Path Frequency. COCOON 2006: 274-283 - [c47]Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige:
Minimum Transversals in Posi-modular Systems. ESA 2006: 576-587 - [c46]Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine:
Contention-Free l-Planes in Optically Burst-Switched WDM Networks. GLOBECOM 2006 - [c45]Takuro Fukunaga, Hiroshi Nagamochi:
Network Design with Edge-Connectivity and Degree Constraints. WAOA 2006: 188-201 - [c44]Seok-Hee Hong, Hiroshi Nagamochi:
Convex Drawings of Graphs with Non-convex Boundary. WG 2006: 113-124 - 2005
- [j58]Hiroshi Nagamochi:
Packing Unit Squares in a Rectangle. Electron. J. Comb. 12 (2005) - [j57]Hiroshi Nagamochi:
An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings. Discret. Comput. Geom. 33(4): 569-591 (2005) - [j56]Hiroshi Nagamochi:
On 2-Approximation to the Vertex-Connectivity in Graphs. IEICE Trans. Inf. Syst. 88-D(1): 12-16 (2005) - [j55]Hiroshi Nagamochi:
Approximating the Minmax Rooted-Subtree Cover Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1335-1338 (2005) - [j54]Hiroshi Nagamochi:
On computing minimum (s, t)-cuts in digraphs. Inf. Process. Lett. 93(5): 231-237 (2005) - [j53]Hiroshi Nagamochi:
A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph. J. Algorithms 56(2): 77-95 (2005) - [j52]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
Greedy splitting algorithms for approximating multiway partition problems. Math. Program. 102(1): 167-183 (2005) - [j51]Hiroshi Nagamochi:
On the one-sided crossing minimization in a bipartite graph with large degrees. Theor. Comput. Sci. 332(1-3): 417-446 (2005) - [j50]Hiroshi Nagamochi, Kengo Iwata, Toshimasa Ishii:
A robust algorithm for bisecting a triconnected graph with two resource sets. Theor. Comput. Sci. 341(1-3): 364-378 (2005) - [c43]Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi:
Minimum Cost Source Location Problem with Local 3-Vertex-Connectivity Requirements. CATS 2005: 97-105 - [c42]Takuro Fukunaga, Hiroshi Nagamochi:
Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems. COCOON 2005: 747-756 - [c41]Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi:
Bisecting a Four-Connected Graph with Three Resource Sets. ISAAC 2005: 176-185 - 2004
- [j49]Hiroshi Nagamochi, Kohei Okada:
A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree. Discret. Appl. Math. 140(1-3): 103-114 (2004) - [j48]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
On generalized greedy splitting algorithms for multiway partition problems. Discret. Appl. Math. 143(1-3): 130-143 (2004) - [j47]Hiroshi Nagamochi, Takahisa Suzuki, Toshimasa Ishii:
A simple recognition of maximal planar graphs. Inf. Process. Lett. 89(5): 223-226 (2004) - [j46]Hiroshi Nagamochi, Nobuyasu Yamada:
Counting edge crossings in a 2-layered drawing. Inf. Process. Lett. 91(5): 221-225 (2004) - [j45]Yoshiyuki Karuno, Hiroshi Nagamochi:
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times. Theor. Comput. Sci. 312(2-3): 267-280 (2004) - [c40]Hiroshi Nagamochi, Taizo Kawada:
Approximating the Minmax Subtree Cover Problem in a Cactus. ISAAC 2004: 705-716 - 2003
- [j44]Hiroshi Nagamochi:
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree. Discret. Appl. Math. 126(1): 83-113 (2003) - [j43]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. Discret. Appl. Math. 126(2-3): 275-289 (2003) - [j42]Yoshiyuki Karuno, Hiroshi Nagamochi:
2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. Discret. Appl. Math. 129(2-3): 433-447 (2003) - [j41]Hiroshi Nagamochi, Toshimasa Ishii:
On the minimum local-vertex-connectivity augmentation in graphs. Discret. Appl. Math. 129(2-3): 475-486 (2003) - [j40]Hiroshi Nagamochi, Yukihiro Nishida, Toshihide Ibaraki:
Approximability of the Minimum Maximal Matching Problem in Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(12): 3251-3258 (2003) - [j39]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem. Inf. Process. Lett. 86(2): 63-70 (2003) - [j38]Hiroshi Nagamochi, Peter Eades:
An Edge-Splitting Algorithm in Planar Graphs. J. Comb. Optim. 7(2): 137-159 (2003) - [c39]Hiroshi Nagamochi, Katsutoshi Kuroya:
Convex Drawing for c-Planar Biconnected Clustered Graphs. GD 2003: 369-380 - [c38]Hiroshi Nagamochi:
An Improved Approximation to the One-Sided Bilayer Drawing. GD 2003: 406-418 - [c37]Hiroshi Nagamochi, Kohei Okada:
Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem. ISAAC 2003: 138-147 - [c36]Hiroshi Nagamochi, Yuusuke Abe:
An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas. ISAAC 2003: 280-289 - [c35]Yoshiyuki Karuno, Hiroshi Nagamochi:
A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags. ISAAC 2003: 309-318 - [c34]Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi:
Augmenting Forests to Meet Odd Diameter Requirements. ISAAC 2003: 434-443 - [c33]Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi:
Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs. CATS 2003: 236-259 - 2002
- [j37]Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki:
Convex Embeddings and Bisections of 3-Connected Graphs 1. Comb. 22(4): 537-554 (2002) - [j36]Toshihiro Fujito, Hiroshi Nagamochi:
A 2-approximation algorithm for the minimum weight edge dominating set problem. Discret. Appl. Math. 118(3): 199-207 (2002) - [j35]Hiroshi Nagamochi, Toshihide Ibaraki:
Graph connectivity and its augmentation: applications of MA orderings. Discret. Appl. Math. 123(1-3): 447-472 (2002) - [j34]Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki:
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. Networks 39(4): 203-209 (2002) - [c32]Yoshiyuki Karuno, Hiroshi Nagamochi:
A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage. ISAAC 2002: 199-210 - [c31]Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita:
File Transfer Tree Problems. ISAAC 2002: 441-452 - [c30]Hiro Ito, Hiroshi Nagamochi:
Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. JCDCG 2002: 176-181 - 2001
- [j33]Toru Hasunuma, Hiroshi Nagamochi:
Independent spanning trees with small depths in iterated line digraphs. Discret. Appl. Math. 110(2-3): 189-211 (2001) - [j32]Hiroshi Nagamochi, Mirka Miller, Slamin:
Bounds on the number of isolates in sum graph labeling. Discret. Math. 240(1-3): 175-185 (2001) - [j31]Hiroshi Nagamochi, Toshimasa Ishii, Hiro Ito:
Minimum cost source location problem with vertex-connectivity requirements in digraphs. Inf. Process. Lett. 80(6): 287-293 (2001) - [j30]Hiroshi Nagamochi, Toru Hasunuma:
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. J. Algorithms 38(2): 354-373 (2001) - [j29]Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki:
Augmenting a Submodular and Posi-modular Set Function by a Multigraph. J. Comb. Optim. 5(2): 175-212 (2001) - [j28]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. J. Comb. Optim. 5(4): 397-410 (2001) - [j27]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Multigraph augmentation under biconnectivity and general edge-connectivity requirements. Networks 37(3): 144-155 (2001) - [c29]Yoshiyuki Karuno, Hiroshi Nagamochi:
A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. ESA 2001: 218-229 - [c28]Yoshiyuki Karuno, Hiroshi Nagamochi:
A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. ISAAC 2001: 36-47 - [c27]Hiroshi Nagamochi, Toshimasa Ishii:
On the Minimum Local-Vertex-Connectivity Augmentation in Graphs. ISAAC 2001: 124-135 - [c26]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
A Unified Framework for Approximating Multiway Partition Problems. ISAAC 2001: 682-694 - [c25]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. STACS 2001: 478-489 - 2000
- [j26]Hiroshi Nagamochi, S. Nakamura, Toshihide Ibaraki:
A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs. Algorithmica 26(1): 50-67 (2000) - [j25]Hiroshi Nagamochi, Toshihide Ibaraki:
Polyhedral structure of submodular and posi-modular systems. Discret. Appl. Math. 107(1-3): 165-189 (2000) - [j24]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph. J. Comb. Optim. 4(1): 35-77 (2000) - [j23]Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki:
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. J. Comb. Optim. 4(2): 151-169 (2000) - [j22]Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi, Wenan Zang:
Totally balanced combinatorial optimization games. Math. Program. 87(3): 441-452 (2000) - [j21]Hiroshi Nagamochi, Toshihide Ibaraki:
A fast algorithm for computing minimum 3-way and 4-way cuts. Math. Program. 88(3): 507-520 (2000) - [c24]Toshimasa Ishii, Hiroshi Nagamochi:
Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph. ISAAC 2000: 326-337 - [c23]Toshimasa Ishii, Hiroshi Nagamochi:
On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph. SWAT 2000: 286-299
1990 – 1999
- 1999
- [j20]Hiroshi Nagamochi, Toshihide Ibaraki:
Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time. J. Algorithms 30(2): 253-301 (1999) - [j19]Peter Eades, Qing-Wen Feng, Hiroshi Nagamochi:
Drawing Clustered Graphs on an Orthogonal Grid. J. Graph Algorithms Appl. 3(4): 3-29 (1999) - [j18]Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi:
Algorithmic Aspects of the Core of Combinatorial Optimization Games. Math. Oper. Res. 24(3): 751-766 (1999) - [c22]Hiroshi Nagamochi, Toshihide Ibaraki:
An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree. COCOON 1999: 31-40 - [c21]Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki:
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. COCOON 1999: 164-173 - [c20]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph. ESA 1999: 414-425 - [c19]Hiroshi Nagamochi, Toshihide Ibaraki:
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts. IPCO 1999: 377-390 - [c18]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. ISAAC 1999: 373-382 - [c17]Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki:
Bisecting Two Subsets in 3-Connected Graphs. ISAAC 1999: 425-434 - 1998
- [j17]Toshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi:
A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations. Comb. 18(1): 61-83 (1998) - [j16]Hiroshi Nagamochi, Toshihide Ibaraki:
A Note on Minimizing Submodular Functions. Inf. Process. Lett. 67(5): 239-244 (1998) - [j15]András Frank, Toshihide Ibaraki, Hiroshi Nagamochi:
Two Arc-Disjoint Paths in Eulerian Digraphs. SIAM J. Discret. Math. 11(4): 557-589 (1998) - [c16]Toru Hasunuma, Hiroshi Nagamochi:
Independent Spanning Trees with Small Depths in Iterated Line Digraphs. CATS 1998: 21-36 - [c15]Hiroshi Nagamochi, Peter Eades:
Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. IPCO 1998: 96-111 - [c14]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. ISAAC 1998: 159-168 - [c13]Hiroshi Nagamochi, Toshihide Ibaraki:
Polyhedral Structure of Submodular and Posi-modular Systems. ISAAC 1998: 169-178 - [c12]Hiroshi Nagamochi, Toru Hasunuma:
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. ISAAC 1998: 447-456 - [c11]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. SODA 1998: 280-289 - 1997
- [j14]Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki:
Vehicle scheduling on a tree with release and handling times. Ann. Oper. Res. 69: 193-207 (1997) - [j13]Hiroshi Nagamochi, Toshihide Ibaraki:
Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. J. Comb. Optim. 1(1): 5-46 (1997) - [j12]Hiroshi Nagamochi, Dao-Zhi Zeng, Naohisa Kabutoya, Toshihide Ibaraki:
Complexity of the Minimum Base Game on Matroids. Math. Oper. Res. 22(1): 146-164 (1997) - [j11]Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki:
Computing All Small Cuts in an Undirected Network. SIAM J. Discret. Math. 10(3): 469-481 (1997) - [c10]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Augmenting Edge and Vertex Connectivities Simultaneously. ISAAC 1997: 102-111 - [c9]Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki:
Computing Edge-Connectivity Augmentation Function in Õ(nm) Time. SODA 1997: 649-658 - [c8]Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi:
Combinatorial Optimization Games. SODA 1997: 720-729 - 1996
- [c7]Hiroshi Nagamochi, Toshihide Ibaraki:
Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. STOC 1996: 64-73 - [e1]Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri:
Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings. Lecture Notes in Computer Science 1178, Springer 1996, ISBN 3-540-62048-6 [contents] - 1995
- [j10]Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda:
Optimal Coteries for Rings and Related Networks. Distributed Comput. 8(4): 191-201 (1995) - [c6]Hiroshi Nagamochi, Toshihide Ibaraki:
A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. IPCO 1995: 403-413 - [c5]András Frank, Toshihide Ibaraki, Hiroshi Nagamochi:
Two Arc Disjoint Paths in Eulerian Diagraphs. ISAAC 1995: 92-101 - 1994
- [j9]Hiroshi Nagamochi, Tadashi Ono, Toshihide Ibaraki:
Implementing an efficient minimum capacity cut algorithm. Math. Program. 67: 325-341 (1994) - [j8]Hideaki Harada, Zheng Sun, Hiroshi Nagamochi:
An exact lower bound on the number of cut-sets in multigraphs. Networks 24(8): 429-443 (1994) - [c4]Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki:
Computing All Small Cuts in Undirected Networks. ISAAC 1994: 190-198 - 1993
- [j7]András Frank, Toshihide Ibaraki, Hiroshi Nagamochi:
On sparse subgraphs preserving connectivity properties. J. Graph Theory 17(3): 275-281 (1993) - [c3]Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki:
Vehicle Scheduling on a Tree with Release and Handling Times. ISAAC 1993: 486-495 - 1992
- [j6]Hiroshi Nagamochi, Toshihide Ibaraki:
A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph. Algorithmica 7(5&6): 583-596 (1992) - [j5]Hiroshi Nagamochi, Toshihide Ibaraki:
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. SIAM J. Discret. Math. 5(1): 54-66 (1992) - [c2]Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda:
Optimal Coteries for Rings and Related Networks. ICDCS 1992: 650-656 - 1991
- [j4]Hiroshi Nagamochi, Toshihide Ibaraki:
Maximum flows in probabilistic networks. Networks 21(6): 645-666 (1991) - 1990
- [j3]Hiroshi Nagamochi, Toshihide Ibaraki:
Multicommodity flows in certain planar directed networks. Discret. Appl. Math. 27(1-2): 125-145 (1990) - [j2]Hiroshi Nagamochi, Masao Fukushima, Toshihide Ibaraki:
Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities. Networks 20(4): 409-426 (1990) - [c1]Hiroshi Nagamochi, Toshihide Ibaraki:
Computing Edge-Connectivity in Multiple and Capacitated Graphs. SIGAL International Symposium on Algorithms 1990: 12-20
1980 – 1989
- 1989
- [j1]Hiroshi Nagamochi, Toshihide Ibaraki:
On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks. Inf. Process. Lett. 31(6): 279-285 (1989)
Coauthor Index
[j111] [b1] [c53] [j67] [j52] [j48] [j43] [j40] [j39] [j37] [j35] [j34] [j29] [j28] [j27] [c26] [c25] [j26] [j25] [j24] [j23] [j22] [j21] [j20] [j18] [c22] [c21] [c20] [c19] [c18] [c17] [j17] [j16] [j15] [c14] [c13] [c11] [j14] [j13] [j12] [j11] [c10] [c9] [c8] [c7] [j10] [c6] [c5] [j9] [c4] [j7] [c3] [j6] [j5] [c2] [j4] [j3] [j2] [c1] [j1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
