Hiroshi Nagamochi

324 papers A* 6A 9B 50C 13Misc 14Journal 199Unranked 29
YearRankTypeTitle / Venue / Authors
2024 J jnl
A Method for Inferring Polymers Based on Linear Regression and Integer Programming.
IEEE ACM Trans. Comput. Biol. Bioinform.
Ryota Ido, Shengjuan Cao, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2024 J jnl
Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes.
IEEE ACM Trans. Comput. Biol. Bioinform.
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2023 J jnl
Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes.
CoRR
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2023 J jnl
Polynomial-delay enumeration algorithms in set systems.
Theor. Comput. Sci.
Kazuya Haraguchi, Hiroshi Nagamochi
2022 — conf
A Method for Molecular Design Based on Linear Regression and Integer Programming.
ICBBB
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2022 J jnl
A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming.
IEEE ACM Trans. Comput. Biol. Bioinform.
Jianshen Zhu, Naveed Ahmed Azam, Fan Zhang, Aleksandar Shurbevski, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2022 J jnl
A new approach to the design of acyclic chemical compounds using skeleton trees and integer linear programming.
Appl. Intell.
Fan Zhang, Jianshen Zhu, Rachaya Chiewvanichakorn, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2022 — conf
Adjustive Linear Regression and Its Application to the Inverse QSAR.
BIOINFORMATICS
Jianshen Zhu, Kazuya Haraguchi, Hiroshi Nagamochi, Tatsuya Akutsu
2022 J jnl
Enumeration of Support-Closed Subsets in Confluent Systems.
Algorithmica
Kazuya Haraguchi, Hiroshi Nagamochi
2022 J jnl
Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model.
CoRR
Jianshen Zhu, Naveed Ahmed Azam, Shengjuan Cao, Ryota Ido, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2022 J jnl
On the enumeration of minimal non-pairwise compatibility graphs.
J. Comb. Optim.
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
2021 J jnl
A Method for Inferring Polymers Based on Linear Regression and Integer Programming.
CoRR
Ryota Ido, Shengjuan Cao, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 J jnl
A method for enumerating pairwise compatibility graphs with a given number of vertices.
Discret. Appl. Math.
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
2021 J jnl
A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming.
Algorithms Mol. Biol.
Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 — conf
An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures.
IEA/AIE (1)
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 — conf
An Inverse QSAR Method Based on Decision Tree and Integer Programming.
ICIC (2)
Kouki Tanaka, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 J jnl
An Inverse QSAR Method Based on Linear Regression and Integer Programming.
CoRR
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 — conf
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search.
BIBM
Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 J jnl
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search.
CoRR
Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 J jnl
Re-embedding a 1-plane graph for a straight-line drawing in linear time.
Theor. Comput. Sci.
Seok-Hee Hong, Hiroshi Nagamochi
2020 — conf
A Method for the Inverse QSAR/QSPR Based on Artificial Neural Networks and Mixed Integer Linear Programming.
ICBBB
Rachaya Chiewvanichakorn, Chenxi Wang, Zhe Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2020 C conf
A New Integer Linear Programming Formulation to the Inverse QSAR/QSPR for Acyclic Chemical Compounds Using Skeleton Trees.
IEA/AIE
Fan Zhang, Jianshen Zhu, Rachaya Chiewvanichakorn, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2020 J jnl
A Novel Method for Inference of Acyclic Chemical Compounds with Bounded Branch-height Based on Artificial Neural Networks and Integer Programming.
CoRR
Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2020 J jnl
A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming.
Algorithms
Jianshen Zhu, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2020 — conf
A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility.
BIOINFORMATICS
Naveed Ahmed Azam, Rachaya Chiewvanichakorn, Fan Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2020 J jnl
A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming.
CoRR
Tatsuya Akutsu, Hiroshi Nagamochi
2020 J jnl
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops.
Entropy
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
2020 J jnl
Bounded-Degree Cut is Fixed-Parameter Tractable.
CoRR
Mingyu Xiao, Hiroshi Nagamochi
2020 J jnl
Characterizing Star-PCGs.
Algorithmica
Mingyu Xiao, Hiroshi Nagamochi
2020 J jnl
Design of Polynomial-delay Enumeration Algorithms in Transitive Systems.
CoRR
Kazuya Haraguchi, Hiroshi Nagamochi
2020 J jnl
Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies.
CoRR
Yuui Tamura, Yuhei Nishiyama, Chenxi Wang, Yanming Sun, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2020 J jnl
Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications.
CoRR
Kyousuke Yamashita, Ryuji Masui, Xiang Zhou, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2020 J jnl
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank.
Entropy
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
2020 J jnl
Group Strategy-proof Mechanisms for Shuttle Facility Games.
J. Inf. Process.
Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi
2020 Misc conf
On the Enumeration of Minimal Non-pairwise Compatibility Graphs.
COCOON
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
2020 Misc conf
Path-Monotonic Upward Drawings of Graphs.
COCOON
Seok-Hee Hong, Hiroshi Nagamochi
2020 J jnl
Polynomial-delay Enumeration Algorithms in Set Systems.
CoRR
Kazuya Haraguchi, Hiroshi Nagamochi
2020 J jnl
Some reduction operations to pairwise compatibility graphs.
Inf. Process. Lett.
Mingyu Xiao, Hiroshi Nagamochi
2019 B conf
A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions.
ISAAC
Kazuya Haraguchi, Hiroshi Nagamochi
2019 J jnl
A linear-time algorithm for testing full outer-2-planarity.
Discret. Appl. Math.
Seok-Hee Hong, Hiroshi Nagamochi
2019 J jnl
Acute Constraints in Straight-Line Drawings of Planar Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades
2019 J jnl
COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets.
J. Graph Algorithms Appl.
Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi
2019 J jnl
Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.
IEEE ACM Trans. Comput. Biol. Bioinform.
Yuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2019 J jnl
λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi
2018 A* conf
Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable.
ICALP
Mingyu Xiao, Hiroshi Nagamochi
2018 Misc conf
Characterizing Star-PCGs.
COCOON
Mingyu Xiao, Hiroshi Nagamochi
2018 J jnl
Characterizing Star-PCGs.
CoRR
Mingyu Xiao, Hiroshi Nagamochi
2018 — conf
Enumerating Chemical Mono-Block 3-Augmented Trees with Two Junctions.
ICBBB
Yuui Tamura, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2018 J jnl
Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs.
IEEE ACM Trans. Comput. Biol. Bioinform.
Jinghui Li, Hiroshi Nagamochi, Tatsuya Akutsu
2018 J jnl
Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem.
IEICE Trans. Inf. Syst.
Mohd Shahrizan Othman, Aleksandar Shurbevski, Hiroshi Nagamochi
2018 — ch.
Practical Algorithms for Two-Dimensional Packing of Rectangles.
Handbook of Approximation Algorithms and Metaheuristics (1)
Shinji Imahori, Mutsunori Yagiura, Hiroshi Nagamochi
2018 J jnl
Simpler algorithms for testing two-page book embedding of partitioned graphs.
Theor. Comput. Sci.
Seok-Hee Hong, Hiroshi Nagamochi
2018 J jnl
Some Reduction Operations to Pairwise Compatibility Graphs.
CoRR
Mingyu Xiao, Hiroshi Nagamochi
2018 J jnl
The Stable Roommates Problem with Unranked Entries.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hiroaki Suto, Aleksandar Shurbevski, Hiroshi Nagamochi
2017 J jnl
A refined algorithm for maximum independent set in degree-4 graphs.
J. Comb. Optim.
Mingyu Xiao, Hiroshi Nagamochi
2017 J jnl
An Exact Algorithm for Lowest Edge Dominating Set.
IEICE Trans. Inf. Syst.
Ken Iwaide, Hiroshi Nagamochi
2017 J jnl
An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs.
J. Inf. Process.
Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi
2017 J jnl
Complexity and kernels for bipartition into degree-bounded induced graphs.
Theor. Comput. Sci.
Mingyu Xiao, Hiroshi Nagamochi
2017 J jnl
Exact algorithms for maximum independent set.
Inf. Comput.
Mingyu Xiao, Hiroshi Nagamochi
2017 J jnl
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game.
J. Graph Algorithms Appl.
Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi
2017 J jnl
Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route.
J. Inf. Process.
Mohd Shahrizan Othman, Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi
2016 B conf
A Linear-Time Algorithm for Integral Multiterminal Flows in Trees.
ISAAC
Mingyu Xiao, Hiroshi Nagamochi
2016 J jnl
A Linear-time Algorithm for Integral Multiterminal Flows in Trees.
CoRR
Mingyu Xiao, Hiroshi Nagamochi
2016 J jnl
An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure.
Algorithmica
Mingyu Xiao, Hiroshi Nagamochi
2016 J jnl
An Improved Algorithm for Parameterized Edge Dominating Set Problem.
J. Graph Algorithms Appl.
Ken Iwaide, Hiroshi Nagamochi
2016 J jnl
An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4.
Theory Comput. Syst.
Mingyu Xiao, Hiroshi Nagamochi
2016 J jnl
An exact algorithm for maximum independent set in degree-5 graphs.
Discret. Appl. Math.
Mingyu Xiao, Hiroshi Nagamochi
2016 J jnl
Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees.
IEICE Trans. Inf. Syst.
Morito Oomine, Hiroshi Nagamochi
2016 — conf
Enumerating Naphthalene Isomers of Tree-like Chemical Graphs.
BIOINFORMATICS
Fei He, Akiyoshi Hanai, Hiroshi Nagamochi, Tatsuya Akutsu
2016 B conf
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game.
WALCOM
Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi
2016 A conf
Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time.
GD
Seok-Hee Hong, Hiroshi Nagamochi
2016 J jnl
Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time.
CoRR
Seok-Hee Hong, Hiroshi Nagamochi
2015 — conf
A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs.
JCDCGG
Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi
2015 B conf
An Improved Algorithm for Parameterized Edge Dominating Set Problem.
WALCOM
Ken Iwaide, Hiroshi Nagamochi
2015 J jnl
An improved exact algorithm for undirected feedback vertex set.
J. Comb. Optim.
Mingyu Xiao, Hiroshi Nagamochi
2015 J jnl
Exact algorithms for dominating induced matching based on graph partition.
Discret. Appl. Math.
Mingyu Xiao, Hiroshi Nagamochi
2015 J jnl
Some Reduction Procedure for Computing Pathwidth of Undirected Graphs.
IEICE Trans. Inf. Syst.
Masataka Ikeda, Hiroshi Nagamochi
2015 B conf
Testing Full Outer-2-planarity in Linear Time.
WG
Seok-Hee Hong, Hiroshi Nagamochi
2014 J jnl
A refined exact algorithm for Edge Dominating Set.
Theor. Comput. Sci.
Mingyu Xiao, Hiroshi Nagamochi
2014 B conf
Approximating the Bipartite TSP and Its Biased Generalization.
WALCOM
Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno
2014 B conf
Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs.
ISAAC
Mingyu Xiao, Hiroshi Nagamochi
2014 J jnl
Efficient enumeration of monocyclic chemical graphs with given path frequencies.
J. Cheminformatics
Masaki Suzuki, Hiroshi Nagamochi, Tatsuya Akutsu
2014 J jnl
Exact Algorithms for Dominating Induced Matching Based on Graph Partition.
CoRR
Mingyu Xiao, Hiroshi Nagamochi
2014 Misc conf
Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs.
COCOON
Seok-Hee Hong, Hiroshi Nagamochi
2014 J jnl
Unranking of small combinations from large sets.
J. Discrete Algorithms
Toshihiro Shimizu, Takuro Fukunaga, Hiroshi Nagamochi
2013 — conf
An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs.
FAW-AAIM
Mingyu Xiao, Hiroshi Nagamochi
2013 C conf
An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure.
TAMC
Mingyu Xiao, Hiroshi Nagamochi
2013 C conf
An Improved Exact Algorithm for Undirected Feedback Vertex Set.
COCOA
Mingyu Xiao, Hiroshi Nagamochi
2013 J jnl
Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems.
IEICE Trans. Inf. Syst.
Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno
2013 J jnl
Breadth-First Search Approach to Enumeration of Tree-like Chemical Compounds.
J. Bioinform. Comput. Biol.
Yang Zhao, Morihiro Hayashida, Jira Jindalertudomdee, Hiroshi Nagamochi, Tatsuya Akutsu
2013 J jnl
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs.
Theor. Comput. Sci.
Mingyu Xiao, Hiroshi Nagamochi
2013 J jnl
Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3.
IEICE Trans. Inf. Syst.
Mingyu Xiao, Hiroshi Nagamochi
2013 B conf
Exact Algorithms for Maximum Independent Set.
ISAAC
Mingyu Xiao, Hiroshi Nagamochi
2013 J jnl
Exact Algorithms for Maximum Independent Set.
CoRR
Mingyu Xiao, Hiroshi Nagamochi
2013 J jnl
FPTASs for trimming weighted trees.
Theor. Comput. Sci.
Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi
2013 — conf
Optimization Techniques for Robot Path Planning.
ICT Innovations
Aleksandar Shurbevski, Noriaki Hirosue, Hiroshi Nagamochi
2013 J jnl
Parameterized edge dominating set in graphs with degree bounded by 3.
Theor. Comput. Sci.
Mingyu Xiao, Hiroshi Nagamochi
2012 J jnl
A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners.
Algorithmica
Seok-Hee Hong, Hiroshi Nagamochi
2012 C conf
A Refined Exact Algorithm for Edge Dominating Set.
TAMC
Mingyu Xiao, Hiroshi Nagamochi
2012 J jnl
An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure
CoRR
Mingyu Xiao, Hiroshi Nagamochi
2012 J jnl
An FPT algorithm for edge subset feedback edge set.
Inf. Process. Lett.
Mingyu Xiao, Hiroshi Nagamochi
2012 Misc conf
An Improved Exact Algorithm for TSP in Degree-4 Graphs.
COCOON
Mingyu Xiao, Hiroshi Nagamochi
2012 J jnl
An exact strip packing algorithm based on canonical forms.
Comput. Oper. Res.
Yohei Arahori, Takashi Imamichi, Hiroshi Nagamochi
2012 C conf
Characterizing Mechanisms in Obnoxious Facility Game.
COCOA
Ken Ibara, Hiroshi Nagamochi
2012 J jnl
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems.
Algorithmica
Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi
2012 J jnl
Indexing All Rooted Subgraphs of a Rooted Graph.
IEICE Trans. Inf. Syst.
Tomoki Imada, Hiroshi Nagamochi
2012 B conf
Linear Layouts in Submodular Systems.
ISAAC
Hiroshi Nagamochi
2012 J jnl
Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints.
Theor. Comput. Sci.
Seok-Hee Hong, Hiroshi Nagamochi
2012 J jnl
Protein complex prediction via improved verification methods using constrained domain-domain matching.
Int. J. Bioinform. Res. Appl.
Yang Zhao, Morihiro Hayashida, Jose C. Nacher, Hiroshi Nagamochi, Tatsuya Akutsu
2012 C conf
Submodular Minimization via Pathwidth.
TAMC
Hiroshi Nagamochi
2012 — conf
The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights.
CATS
Cong Zhang, Hiroshi Nagamochi
2011 J jnl
An Approximation Algorithm for Locating Maximal Disks within Convex Polygons.
Int. J. Comput. Geom. Appl.
Hirofumi Aota, Takuro Fukunaga, Hiroshi Nagamochi
2011 J jnl
An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots.
J. Adv. Comput. Intell. Intell. Informatics
Yoshiyuki Karuno, Hiroshi Nagamochi, Aleksandar Shurbevski
2011 J jnl
Approximating capacitated tree-routings in networks.
J. Comb. Optim.
Ehab Morsy, Hiroshi Nagamochi
2011 J jnl
Cop-robber guarding game with cycle robber-region.
Theor. Comput. Sci.
Hiroshi Nagamochi
2011 J jnl
Editorial: ISAAC 2008 Special Issue.
Algorithmica
Seok-Hee Hong, Hiroshi Nagamochi
2011 J jnl
Efficient Enumeration of Stereoisomers of Outerplanar Chemical Graphs Using Dynamic Programming.
J. Chem. Inf. Model.
Tomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, Tatsuya Akutsu
2011 J jnl
Efficient branch-and-bound algorithms for weighted MAX-2-SAT.
Math. Program.
Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura
2011 J jnl
Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies.
BMC Bioinform.
Masaaki Shimizu, Hiroshi Nagamochi, Tatsuya Akutsu
2011 J jnl
Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra.
Algorithmica
Seok-Hee Hong, Hiroshi Nagamochi
2011 C conf
Further Improvement on Maximum Independent Set in Degree-4 Graphs.
COCOA
Mingyu Xiao, Hiroshi Nagamochi
2011 J jnl
Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs.
IEICE Trans. Inf. Syst.
Bingbing Zhuang, Hiroshi Nagamochi
2011 J jnl
Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs.
IEICE Trans. Inf. Syst.
Bingbing Zhuang, Hiroshi Nagamochi
2011 J jnl
Guest Editors' Foreword.
Int. J. Comput. Geom. Appl.
Seok-Hee Hong, Hiroshi Nagamochi
2011 B conf
Improved Bounds for Minimum Fault-Tolerant Gossip Graphs.
WG
Toru Hasunuma, Hiroshi Nagamochi
2011 J jnl
Kansei engineering, humans and computers: efficient dynamic programming algorithms for combinatorial food packing problems.
Int. J. Biom.
Shinji Imahori, Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang
2011 J jnl
Kernel Methods for Chemical Compounds: From Classification to Design.
IEICE Trans. Inf. Syst.
Tatsuya Akutsu, Hiroshi Nagamochi
2011 J jnl
Minmax Tree Cover in the Euclidean Space.
J. Graph Algorithms Appl.
Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi
2011 J jnl
On the one-dimensional stock cutting problem in the paper tube industry.
J. Sched.
Kazuki Matsumoto, Shunji Umetani, Hiroshi Nagamochi
2011 — conf
Parameterized Edge Dominating Set in Cubic Graphs - (Extended Abstract).
FAW-AAIM
Mingyu Xiao, Hiroshi Nagamochi
2010 J jnl
A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs.
Algorithmica
Seok-Hee Hong, Hiroshi Nagamochi
2010 J jnl
A plane graph representation of triconnected graphs.
Theor. Comput. Sci.
Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi
2010 — conf
An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem.
CGGA
Tatsuya Ohshima, Pipaporn Eumthurapojn, Liang Zhao, Hiroshi Nagamochi
2010 J jnl
An algorithm for constructing star-shaped drawings of plane graphs.
Comput. Geom.
Seok-Hee Hong, Hiroshi Nagamochi
2010 J jnl
Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings.
Algorithmica
Seok-Hee Hong, Hiroshi Nagamochi
2010 J jnl
Approximation to the Minimum Cost Edge Installation Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Ehab Morsy, Hiroshi Nagamochi
2010 J jnl
Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut.
J. Chem. Inf. Model.
Yusuke Ishida, Yuki Kato, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2010 Misc conf
Constant Time Generation of Biconnected Rooted Plane Graphs.
FAW
Bingbing Zhuang, Hiroshi Nagamochi
2010 J jnl
Convex drawings of hierarchical planar graphs and clustered planar graphs.
J. Discrete Algorithms
Seok-Hee Hong, Hiroshi Nagamochi
2010 C conf
Enumerating Rooted Graphs with Reflectional Block Structures.
CIAC
Bingbing Zhuang, Hiroshi Nagamochi
2010 Misc conf
FPTAS's for Some Cut Problems in Weighted Trees.
FAW
Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi
2010 C conf
Generating Internally Triconnected Rooted Plane Graphs.
TAMC
Bingbing Zhuang, Hiroshi Nagamochi
2010 — conf
Generating Trees on Multisets.
ISAAC (1)
Bingbing Zhuang, Hiroshi Nagamochi
2010 — conf
Listing Triconnected Rooted Plane Graphs.
COCOA (2)
Bingbing Zhuang, Hiroshi Nagamochi
2010 J jnl
Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs.
Algorithmica
Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi
2010 J jnl
Minimum Degree Orderings.
Algorithmica
Hiroshi Nagamochi
2010 — conf
Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables.
LION
Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
2010 J jnl
Network design with weighted degree constraints.
Discret. Optim.
Takuro Fukunaga, Hiroshi Nagamochi
2010 J jnl
On the approximation of the generalized capacitated tree-routing problem.
J. Discrete Algorithms
Ehab Morsy, Hiroshi Nagamochi
2009 J jnl
A Detachment Algorithm for Inferring a Graph from Path Frequency.
Algorithmica
Hiroshi Nagamochi
2009 J jnl
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem.
Discret. Optim.
Takashi Imamichi, Mutsunori Yagiura, Hiroshi Nagamochi
2009 — conf
Bipartite Graph Representation of Multiple Decision Table Classifiers.
SAGA
Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
2009 Misc conf
Cop-Robber Guarding Game with Cycle Robber Region.
FAW
Hiroshi Nagamochi
2009 B conf
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems.
ISAAC
Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi
2009 J jnl
Drawing slicing graphs with face areas.
Theor. Comput. Sci.
Akifumi Kawaguchi, Hiroshi Nagamochi
2009 B conf
Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming.
ISAAC
Tomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, Tatsuya Akutsu
2009 J jnl
Eulerian detachments with local edge-connectivity.
Discret. Appl. Math.
Takuro Fukunaga, Hiroshi Nagamochi
2009 J jnl
Exact algorithms for the two-dimensional strip packing problem with and without rotations.
Eur. J. Oper. Res.
Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi
2009 J jnl
Minimum Transversals in Posimodular Systems.
SIAM J. Discret. Math.
Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige
2009 B conf
Minmax Tree Cover in the Euclidean Space.
WALCOM
Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi
2009 J jnl
Network Design with Edge-Connectivity and Degree Constraints.
Theory Comput. Syst.
Takuro Fukunaga, Hiroshi Nagamochi
2009 B conf
Network Design with Weighted Degree Constraints.
WALCOM
Takuro Fukunaga, Hiroshi Nagamochi
2009 J jnl
New Approximation to the One-sided Radial Crossing Minimization.
J. Graph Algorithms Appl.
Seok-Hee Hong, Hiroshi Nagamochi
2009 B conf
Upward Star-Shaped Polyhedral Graphs.
ISAAC
Seok-Hee Hong, Hiroshi Nagamochi
2009 B conf
Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries.
ISAAC
Yoshitaka Nakao, Hiroshi Nagamochi
2008 J jnl
A Clustering Method for Analysis of Sequence Similarity Networks of Proteins Using Maximal Components of Graphs.
Inf. Media Technol.
Morihiro Hayashida, Tatsuya Akutsu, Hiroshi Nagamochi
2008 — book
Algorithmic Aspects of Graph Connectivity
Hiroshi Nagamochi, Toshihide Ibaraki
2008 B ed.
Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings
ISAAC
Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga
2008 J jnl
An improved approximation algorithm for capacitated multicast routings in networks.
Theor. Comput. Sci.
Ehab Morsy, Hiroshi Nagamochi
2008 B conf
Approximating Crossing Minimization in Radial Layouts.
LATIN
Seok-Hee Hong, Hiroshi Nagamochi
2008 J jnl
Approximating a vehicle scheduling problem with time windows and handling times.
Theor. Comput. Sci.
Hiroshi Nagamochi, Takaharu Ohnishi
2008 Misc conf
Approximating the Generalized Capacitated Tree-Routing Problem.
COCOON
Ehab Morsy, Hiroshi Nagamochi
2008 J jnl
Convex drawings of graphs with non-convex boundary constraints.
Discret. Appl. Math.
Seok-Hee Hong, Hiroshi Nagamochi
2008 J jnl
Enumerating Treelike Chemical Graphs with Given Path Frequency.
J. Chem. Inf. Model.
Hiroki Fujiwara, Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2008 J jnl
Performance Analysis of a Collision Detection Algorithm of Spheres Based on Slab Partitioning.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Takashi Imamichi, Hiroshi Nagamochi
2008 A conf
Removing Node Overlaps Using Multi-sphere Scheme.
GD
Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi
2008 A* conf
Robust cost colorings.
SODA
Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi
2008 Misc conf
Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints.
COCOON
Seok-Hee Hong, Hiroshi Nagamochi
2008 J jnl
Worst Case Analysis for Pickup and Delivery Problems with Transfer.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Yoshitaka Nakao, Hiroshi Nagamochi
2007 — conf
"Rent-or-Buy" Scheduling and Cost Coloring Problems.
FSTTCS
Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi
2007 J jnl
A Deterministic Algorithm for Finding All Minimum k-Way Cuts.
SIAM J. Comput.
Yoko Kamidoi, Noriyoshi Yoshida, Hiroshi Nagamochi
2007 — conf
A Multi-sphere Scheme for 2D and 3D Packing Problems.
SLS
Takashi Imamichi, Hiroshi Nagamochi
2007 B conf
A Novel Clustering Method for Analysis of Biological Networks using Maximal Components of Graphs.
APBC
Morihiro Hayashida, Tatsuya Akutsu, Hiroshi Nagamochi
2007 — conf
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem.
SLS
Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred W. Glover
2007 C conf
An Efficient Algorithm for Generating Colored Outerplanar Graphs.
TAMC
Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2007 J jnl
An approximation algorithm for dissecting a rectangle into rectangles with specified areas.
Discret. Appl. Math.
Hiroshi Nagamochi, Yuusuke Abe
2007 J jnl
Approximability of the capacitated b-edge dominating set problem.
Theor. Comput. Sci.
André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh
2007 C conf
Approximating Capacitated Tree-Routings in Networks.
TAMC
Ehab Morsy, Hiroshi Nagamochi
2007 J jnl
Approximating a Generalization of Metric TSP.
IEICE Trans. Inf. Syst.
Takuro Fukunaga, Hiroshi Nagamochi
2007 J jnl
Approximating the minmax rooted-tree cover in a tree.
Inf. Process. Lett.
Hiroshi Nagamochi, Kohei Okada
2007 J jnl
Approximation Algorithms for Multicast Routings in a Network with Multi-Sources.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Ehab Morsy, Hiroshi Nagamochi
2007 B conf
Approximation to the Minimum Cost Edge Installation Problem.
ISAAC
Ehab Morsy, Hiroshi Nagamochi
2007 J jnl
Bisecting a 4-connected graph with three resource sets.
Discret. Appl. Math.
Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
2007 J jnl
Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex.
IEICE Trans. Inf. Syst.
Hiroshi Nagamochi
2007 J jnl
Contention-Free lambda-Planes in Optically Burst-Switched WDM Networks.
IEICE Trans. Commun.
Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine
2007 J jnl
Drawing c-planar biconnected clustered graphs.
Discret. Appl. Math.
Hiroshi Nagamochi, Katsutoshi Kuroya
2007 C conf
Extension of ICF Classifiers to Real World Data Sets.
IEA/AIE
Kazuya Haraguchi, Hiroshi Nagamochi
2007 J jnl
Generalizing the induced matching by edge capacity constraints.
Discret. Optim.
Takuro Fukunaga, Hiroshi Nagamochi
2007 — conf
Linear-tree rule structure for firewall optimization.
Communications, Internet, and Information Technology
Liang Zhao, A. Shimae, Hiroshi Nagamochi
2007 B conf
Minimum Degree Orderings.
ISAAC
Hiroshi Nagamochi
2007 J jnl
Minimum cost source location problem with local 3-vertex-connectivity requirements.
Theor. Comput. Sci.
Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi
2007 J jnl
Minimum cost subpartitions in graphs.
Inf. Process. Lett.
Hiroshi Nagamochi, Yoko Kamidoi
2007 C conf
Orthogonal Drawings for Plane Graphs with Specified Face Areas.
TAMC
Akifumi Kawaguchi, Hiroshi Nagamochi
2007 — ch.
Practical Algorithms for Two-Dimensional Packing.
Handbook of Approximation Algorithms and Metaheuristics
Mutsunori Yagiura, Hiroshi Nagamochi, Shinji Imahori
2007 B conf
The Set Connector Problem in Graphs.
IPCO
Takuro Fukunaga, Hiroshi Nagamochi
2007 J jnl
The source location problem with local 3-vertex-connectivity requirements.
Discret. Appl. Math.
Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi
2007 — ch.
Vehicle Scheduling Problems in Graphs.
Handbook of Approximation Algorithms and Metaheuristics
Yoshiyuki Karuno, Hiroshi Nagamochi
2006 Misc conf
A Detachment Algorithm for Inferring a Graph from Path Frequency.
COCOON
Hiroshi Nagamochi
2006 J jnl
A Fast Edge-Splitting Algorithm in Edge-Weighted Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hiroshi Nagamochi
2006 J jnl
Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph.
Algorithmica
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
2006 J jnl
Augmenting forests to meet odd diameter requirements.
Discret. Optim.
Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi
2006 B conf
Contention-Free l-Planes in Optically Burst-Switched WDM Networks.
GLOBECOM
Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine
2006 B conf
Convex Drawings of Graphs with Non-convex Boundary.
WG
Seok-Hee Hong, Hiroshi Nagamochi
2006 J jnl
Increasing the Edge-Connectivity by Contracting a Vertex Subset in Graphs.
IEICE Trans. Inf. Syst.
Hiroshi Nagamochi
2006 A conf
Minimum Transversals in Posi-modular Systems.
ESA
Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige
2006 J jnl
Minmax subtree cover problem on cacti.
Discret. Appl. Math.
Hiroshi Nagamochi, Taizo Kawada
2006 B conf
Network Design with Edge-Connectivity and Degree Constraints.
WAOA
Takuro Fukunaga, Hiroshi Nagamochi
2006 J jnl
Packing Soft Rectangles.
Int. J. Found. Comput. Sci.
Hiroshi Nagamochi
2006 J jnl
Some Theorems on Detachments Preserving Local-Edge-Connectivity.
Electron. Notes Discret. Math.
Takuro Fukunaga, Hiroshi Nagamochi
2006 J jnl
Sparse connectivity certificates via MA orderings in graphs.
Discret. Appl. Math.
Hiroshi Nagamochi
2006 J jnl
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs.
Algorithmica
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi
2006 J jnl
Two equivalent measures on weighted hypergraphs.
Discret. Appl. Math.
Hiro Ito, Hiroshi Nagamochi
2005 J jnl
A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph.
J. Algorithms
Hiroshi Nagamochi
2005 J jnl
A robust algorithm for bisecting a triconnected graph with two resource sets.
Theor. Comput. Sci.
Hiroshi Nagamochi, Kengo Iwata, Toshimasa Ishii
2005 J jnl
An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings.
Discret. Comput. Geom.
Hiroshi Nagamochi
2005 J jnl
Approximating the Minmax Rooted-Subtree Cover Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hiroshi Nagamochi
2005 Misc conf
Approximation Algorithms for the
COCOON
Takuro Fukunaga, Hiroshi Nagamochi
2005 B conf
Bisecting a Four-Connected Graph with Three Resource Sets.
ISAAC
Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
2005 J jnl
Greedy splitting algorithms for approximating multiway partition problems.
Math. Program.
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2005 — conf
Minimum Cost Source Location Problem with Local 3-Vertex-Connectivity Requirements.
CATS
Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi
2005 J jnl
On 2-Approximation to the Vertex-Connectivity in Graphs.
IEICE Trans. Inf. Syst.
Hiroshi Nagamochi
2005 J jnl
On computing minimum (
Inf. Process. Lett.
Hiroshi Nagamochi
2005 J jnl
On the one-sided crossing minimization in a bipartite graph with large degrees.
Theor. Comput. Sci.
Hiroshi Nagamochi
2005 J jnl
Packing Unit Squares in a Rectangle.
Electron. J. Comb.
Hiroshi Nagamochi
2004 J jnl
A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree.
Discret. Appl. Math.
Hiroshi Nagamochi, Kohei Okada
2004 J jnl
A simple recognition of maximal planar graphs.
Inf. Process. Lett.
Hiroshi Nagamochi, Takahisa Suzuki, Toshimasa Ishii
2004 J jnl
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times.
Theor. Comput. Sci.
Yoshiyuki Karuno, Hiroshi Nagamochi
2004 B conf
Approximating the Minmax Subtree Cover Problem in a Cactus.
ISAAC
Hiroshi Nagamochi, Taizo Kawada
2004 J jnl
Counting edge crossings in a 2-layered drawing.
Inf. Process. Lett.
Hiroshi Nagamochi, Nobuyasu Yamada
2004 J jnl
On generalized greedy splitting algorithms for multiway partition problems.
Discret. Appl. Math.
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2003 J jnl
2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
Discret. Appl. Math.
Yoshiyuki Karuno, Hiroshi Nagamochi
2003 B conf
A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags.
ISAAC
Yoshiyuki Karuno, Hiroshi Nagamochi
2003 J jnl
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem.
Inf. Process. Lett.
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2003 J jnl
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs.
Discret. Appl. Math.
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2003 B conf
An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas.
ISAAC
Hiroshi Nagamochi, Yuusuke Abe
2003 J jnl
An Edge-Splitting Algorithm in Planar Graphs.
J. Comb. Optim.
Hiroshi Nagamochi, Peter Eades
2003 A conf
An Improved Approximation to the One-Sided Bilayer Drawing.
GD
Hiroshi Nagamochi
2003 J jnl
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree.
Discret. Appl. Math.
Hiroshi Nagamochi
2003 J jnl
Approximability of the Minimum Maximal Matching Problem in Planar Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hiroshi Nagamochi, Yukihiro Nishida, Toshihide Ibaraki
2003 B conf
Augmenting Forests to Meet Odd Diameter Requirements.
ISAAC
Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi
2003 A conf
Convex Drawing for c-Planar Biconnected Clustered Graphs.
GD
Hiroshi Nagamochi, Katsutoshi Kuroya
2003 — conf
Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs.
CATS
Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi
2003 J jnl
On the minimum local-vertex-connectivity augmentation in graphs.
Discret. Appl. Math.
Hiroshi Nagamochi, Toshimasa Ishii
2003 B conf
Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem.
ISAAC
Hiroshi Nagamochi, Kohei Okada
2002 J jnl
A 2-approximation algorithm for the minimum weight edge dominating set problem.
Discret. Appl. Math.
Toshihiro Fujito, Hiroshi Nagamochi
2002 B conf
A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage.
ISAAC
Yoshiyuki Karuno, Hiroshi Nagamochi
2002 J jnl
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks.
Networks
Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki
2002 — conf
Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon.
JCDCG
Hiro Ito, Hiroshi Nagamochi
2002 J jnl
Convex Embeddings and Bisections of 3-Connected Graphs 1.
Comb.
Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki
2002 B conf
File Transfer Tree Problems.
ISAAC
Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita
2002 J jnl
Graph connectivity and its augmentation: applications of MA orderings.
Discret. Appl. Math.
Hiroshi Nagamochi, Toshihide Ibaraki
2001 A conf
A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times.
ESA
Yoshiyuki Karuno, Hiroshi Nagamochi
2001 B conf
A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times.
ISAAC
Yoshiyuki Karuno, Hiroshi Nagamochi
2001 A conf
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.
STACS
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2001 B conf
A Unified Framework for Approximating Multiway Partition Problems.
ISAAC
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2001 J jnl
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate.
J. Algorithms
Hiroshi Nagamochi, Toru Hasunuma
2001 J jnl
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.
J. Comb. Optim.
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2001 J jnl
Augmenting a Submodular and Posi-modular Set Function by a Multigraph.
J. Comb. Optim.
Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki
2001 J jnl
Bounds on the number of isolates in sum graph labeling.
Discret. Math.
Hiroshi Nagamochi, Mirka Miller, Slamin
2001 J jnl
Independent spanning trees with small depths in iterated line digraphs.
Discret. Appl. Math.
Toru Hasunuma, Hiroshi Nagamochi
2001 J jnl
Minimum cost source location problem with vertex-connectivity requirements in digraphs.
Inf. Process. Lett.
Hiroshi Nagamochi, Toshimasa Ishii, Hiro Ito
2001 J jnl
Multigraph augmentation under biconnectivity and general edge-connectivity requirements.
Networks
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
2001 B conf
On the Minimum Local-Vertex-Connectivity Augmentation in Graphs.
ISAAC
Hiroshi Nagamochi, Toshimasa Ishii
2000 J jnl
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs.
J. Comb. Optim.
Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki
2000 J jnl
A Simplified
Algorithmica
Hiroshi Nagamochi, S. Nakamura, Toshihide Ibaraki
2000 J jnl
A fast algorithm for computing minimum 3-way and 4-way cuts.
Math. Program.
Hiroshi Nagamochi, Toshihide Ibaraki
2000 — conf
On the Minimum Augmentation of an
SWAT
Toshimasa Ishii, Hiroshi Nagamochi
2000 J jnl
Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph.
J. Comb. Optim.
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
2000 J jnl
Polyhedral structure of submodular and posi-modular systems.
Discret. Appl. Math.
Hiroshi Nagamochi, Toshihide Ibaraki
2000 B conf
Simultaneous Augmentation of Two Graphs to an
ISAAC
Toshimasa Ishii, Hiroshi Nagamochi
2000 J jnl
Totally balanced combinatorial optimization games.
Math. Program.
Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi, Wenan Zang
1999 B conf
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts.
IPCO
Hiroshi Nagamochi, Toshihide Ibaraki
1999 Misc conf
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs.
COCOON
Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki
1999 J jnl
Algorithmic Aspects of the Core of Combinatorial Optimization Games.
Math. Oper. Res.
Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi
1999 Misc conf
An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree.
COCOON
Hiroshi Nagamochi, Toshihide Ibaraki
1999 B conf
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.
ISAAC
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
1999 J jnl
Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time.
J. Algorithms
Hiroshi Nagamochi, Toshihide Ibaraki
1999 A conf
Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph.
ESA
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
1999 B conf
Bisecting Two Subsets in 3-Connected Graphs.
ISAAC
Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki
1999 J jnl
Drawing Clustered Graphs on an Orthogonal Grid.
J. Graph Algorithms Appl.
Peter Eades, Qing-Wen Feng, Hiroshi Nagamochi
1998 J jnl
A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations.
Comb.
Toshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi
1998 J jnl
A Note on Minimizing Submodular Functions.
Inf. Process. Lett.
Hiroshi Nagamochi, Toshihide Ibaraki
1998 B conf
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate.
ISAAC
Hiroshi Nagamochi, Toru Hasunuma
1998 B conf
Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs.
IPCO
Hiroshi Nagamochi, Peter Eades
1998 — conf
Independent Spanning Trees with Small Depths in Iterated Line Digraphs.
CATS
Toru Hasunuma, Hiroshi Nagamochi
1998 B conf
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph.
ISAAC
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
1998 A* conf
Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected.
SODA
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
1998 B conf
Polyhedral Structure of Submodular and Posi-modular Systems.
ISAAC
Hiroshi Nagamochi, Toshihide Ibaraki
1998 J jnl
Two Arc-Disjoint Paths in Eulerian Digraphs.
SIAM J. Discret. Math.
András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
1997 B conf
Augmenting Edge and Vertex Connectivities Simultaneously.
ISAAC
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
1997 A* conf
Combinatorial Optimization Games.
SODA
Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi
1997 J jnl
Complexity of the Minimum Base Game on Matroids.
Math. Oper. Res.
Hiroshi Nagamochi, Dao-Zhi Zeng, Naohisa Kabutoya, Toshihide Ibaraki
1997 J jnl
Computing All Small Cuts in an Undirected Network.
SIAM J. Discret. Math.
Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki
1997 A* conf
Computing Edge-Connectivity Augmentation Function in Õ(nm) Time.
SODA
Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki
1997 J jnl
Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs.
J. Comb. Optim.
Hiroshi Nagamochi, Toshihide Ibaraki
1997 J jnl
Vehicle scheduling on a tree with release and handling times.
Ann. Oper. Res.
Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki
1996 B ed.
Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings
ISAAC
Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri
1996 A* conf
Deterministic
STOC
Hiroshi Nagamochi, Toshihide Ibaraki
1995 B conf
A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem.
IPCO
Hiroshi Nagamochi, Toshihide Ibaraki
1995 J jnl
Optimal Coteries for Rings and Related Networks.
Distributed Comput.
Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda
1995 B conf
Two Arc Disjoint Paths in Eulerian Diagraphs.
ISAAC
András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
1994 J jnl
An exact lower bound on the number of cut-sets in multigraphs.
Networks
Hideaki Harada, Zheng Sun, Hiroshi Nagamochi
1994 B conf
Computing All Small Cuts in Undirected Networks.
ISAAC
Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki
1994 J jnl
Implementing an efficient minimum capacity cut algorithm.
Math. Program.
Hiroshi Nagamochi, Tadashi Ono, Toshihide Ibaraki
1993 J jnl
On sparse subgraphs preserving connectivity properties.
J. Graph Theory
András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
1993 B conf
Vehicle Scheduling on a Tree with Release and Handling Times.
ISAAC
Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki
1992 J jnl
A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph.
Algorithmica
Hiroshi Nagamochi, Toshihide Ibaraki
1992 J jnl
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs.
SIAM J. Discret. Math.
Hiroshi Nagamochi, Toshihide Ibaraki
1992 A conf
Optimal Coteries for Rings and Related Networks.
ICDCS
Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda
1991 J jnl
Maximum flows in probabilistic networks.
Networks
Hiroshi Nagamochi, Toshihide Ibaraki
1990 — conf
Computing Edge-Connectivity in Multiple and Capacitated Graphs.
SIGAL International Symposium on Algorithms
Hiroshi Nagamochi, Toshihide Ibaraki
1990 J jnl
Multicommodity flows in certain planar directed networks.
Discret. Appl. Math.
Hiroshi Nagamochi, Toshihide Ibaraki
1990 J jnl
Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities.
Networks
Hiroshi Nagamochi, Masao Fukushima, Toshihide Ibaraki
1989 J jnl
On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks.
Inf. Process. Lett.
Hiroshi Nagamochi, Toshihide Ibaraki