Hiroshi Nagamochi

发表

Some Theorems on Detachments Preserving Local-Edge-Connectivity

Takuro Fukunaga, Hiroshi Nagamochi, 2006, Electron. Notes Discret. Math..

Parameterized edge dominating set in graphs with degree bounded by 3

Hiroshi Nagamochi, Mingyu Xiao, 2013, Theor. Comput. Sci..

Multicommodity flows in certain planar directed networks

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1990, Discret. Appl. Math..

Exact algorithms for dominating induced matching based on graph partition pdf

Hiroshi Nagamochi, Mingyu Xiao, H. Nagamochi, 2014, Discret. Appl. Math..

Augmenting a (k - 1)-Vertex-Connected Multigraph ℓ-Edge-Connected and k-Vertex-Connected Multigraph

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 2005, Algorithmica.

Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs

Hiroshi Nagamochi, Bingbing Zhuang, 2011, IEICE Trans. Inf. Syst..

A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming pdf

Hiroshi Nagamochi, Tatsuya Akutsu, Naveed Ahmed Azam, 2020, ArXiv.

Minimum Transversals in Posimodular Systems

Hiroshi Nagamochi, Kazuhisa Makino, Mariko Sakashita, 2009, SIAM J. Discret. Math..

An algorithm for constructing star-shaped drawings of plane graphs

Hiroshi Nagamochi, Seok-Hee Hong, 2010, Comput. Geom..

Packing Soft Rectangles

Hiroshi Nagamochi, 2006, Int. J. Found. Comput. Sci..

Minmax Tree Cover in the Euclidean Space

Hiroshi Nagamochi, Ehab Morsy, Seigo Karakawa, 2009, WALCOM.

5B3 APPROXIMATING CYCLIC ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS(Technical session 5B: Routing problems)

Hiroshi Nagamochi, Yoshiyuki Karuno, Aleksandar Shurbevski, 2011 .

Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs

Hiroshi Nagamochi, Toshimasa Ishii, Yoko Akiyama, 2003, Algorithmica.

Approximating a Generalization of Metric TSP

Takuro Fukunaga, Hiroshi Nagamochi, 2007, IEICE Trans. Inf. Syst..

Upward Star-Shaped Polyhedral Graphs

Hiroshi Nagamochi, Seok-Hee Hong, 2009, ISAAC.

On a Reconfiguration Algorithm for Torus Lightwave Networks

Hiroshi Nagamochi, Yuji Oie, Manabu Kato, 1997 .

Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1999, J. Algorithms.

Accelerating A* algorithms by sweeping out small-degree nodes (アルゴリズム(AL) Vol.2011-AL-134)

Hiroshi Nagamochi, Liang Zhao, Pipaporn Eumthurapojn, 2011 .

On the approximation of the generalized capacitated tree-routing problem

Hiroshi Nagamochi, Ehab Morsy, 2010, J. Discrete Algorithms.

Protein complex prediction via improved verification methods using constrained domain-domain matching

Hiroshi Nagamochi, Tatsuya Akutsu, Yang Zhao, 2012, Int. J. Bioinform. Res. Appl..

Parameterized Edge Dominating Set in Cubic Graphs - (Extended Abstract)

Hiroshi Nagamochi, Mingyu Xiao, 2011, FAW-AAIM.

S1401-1-3 Heuristics for Scheduling Problems on Identical Machines like Storage Allocation

Hiroshi Nagamochi, Yoshiyuki Karuno, Akira Nakashima, 2010, INDIN 2010.

Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks

Toshihide Ibaraki, Hiroshi Nagamochi, Yoshiyuki Karuno, 2002, Networks.

An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem

Hiroshi Nagamochi, Mutsunori Yagiura, Takashi Imamichi, 2009, Discret. Optim..

Minimum cost source location problem with vertex-connectivity requirements in digraphs

Hiroshi Nagamochi, Toshimasa Ishii, Hiro Ito, 2001, Inf. Process. Lett..

Proceedings of the 7th International Symposium on Algorithms and Computation

Hiroshi Nagamochi, Satoru Miyano, Tetsuo Asano, 1996 .

Bisecting a Four-Connected Graph with Three Resource Sets

Hiroshi Nagamochi, Toshimasa Ishii, Kengo Iwata, 2005, ISAAC.

Practical Algorithms for Two-Dimensional Packing

Hiroshi Nagamochi, Mutsunori Yagiura, Shinji Imahori, 2007, Handbook of Approximation Algorithms and Metaheuristics.

Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex

Hiroshi Nagamochi, 2007, IEICE Trans. Inf. Syst..

Independent spanning trees with small depths in iterated line digraphs

Hiroshi Nagamochi, Toru Hasunuma, H. Nagamochi, 2001, Discret. Appl. Math..

BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING( the 50th Anniversary of the Operations Research Society of Japan)

Hiroshi Nagamochi, Xiaoming Wang, Yoshiyuki Karuno, 2007 .

A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming pdf

Hiroshi Nagamochi, Tatsuya Akutsu, Yu Shi, 2020, Algorithms for Molecular Biology.

Bisecting Two Subsets in 3-Connected Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, Tibor Jordán, 1999, ISAAC.

Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs

Hiroshi Nagamochi, Bingbing Zhuang, 2011, IEICE Trans. Inf. Syst..

Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1996, STOC '96.

Extending Steinitz’s Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra

Hiroshi Nagamochi, Seok-Hee Hong, H. Nagamochi, 2011, Algorithmica.

New Approximation to the One-sided Radial Crossing Minimization

Hiroshi Nagamochi, Seok-Hee Hong, 2009, J. Graph Algorithms Appl..

Unranking of small combinations from large sets

Takuro Fukunaga, Hiroshi Nagamochi, Toshihiro Shimizu, 2014, J. Discrete Algorithms.

An Improved Algorithm for Parameterized Edge Dominating Set Problem

Hiroshi Nagamochi, Ken Iwaide, 2016, J. Graph Algorithms Appl..

4C1 SCHEDULING MULTIPROCESSOR TASKS WITH PROMPT SERVICE CONSTRAINTS ON ALIGNED IDENTICAL PROCESSORS

Hiroshi Nagamochi, Yoshiyuki Karuno, Kougaku Yamashita, 2009 .

On the minimum local-vertex-connectivity augmentation in graphs

Hiroshi Nagamochi, Toshimasa Ishii, 2003, Discret. Appl. Math..

A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions

Hiroshi Nagamochi, Kazuya Haraguchi, 2019, ISAAC.

Kansei engineering, humans and computers: efficient dynamic programming algorithms for combinatorial food packing problems

Hiroshi Nagamochi, Xiaoming Wang, Shinji Imahori, 2011, Int. J. Biom..

Generating Internally Triconnected Rooted Plane Graphs

Hiroshi Nagamochi, Bingbing Zhuang, 2010, TAMC.

An exact lower bound on the number of cut-sets in multigraphs

Hiroshi Nagamochi, Zheng Sun, Hideaki Harada, 1994, Networks.

Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints

Hiroshi Nagamochi, Seok-Hee Hong, 2008, COCOON.

A Note on Minimizing Submodular Functions

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1998, Inf. Process. Lett..

Constant Time Generation of Biconnected Rooted Plane Graphs

Hiroshi Nagamochi, Bingbing Zhuang, 2010, FAW.

An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate

Hiroshi Nagamochi, Toru Hasunuma, 2001, J. Algorithms.

A fast algorithm for computing minimum 3-way and 4-way cuts

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1999, Math. Program..

Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies pdf

Hiroshi Nagamochi, Tatsuya Akutsu, Aleksandar Shurbevski, 2020, ArXiv.

5B1 IMPROVED IMPLEMENTATION OF AN APPROXIMATION ALGORITHM WITH FACTOR TWO FOR A CYCLIC ROUTING PROBLEM OF GRASP-AND-DELIVERY ROBOTS(Technical session 5B: Routing problems)

Hiroshi Nagamochi, Yoshiyuki Karuno, Aleksandar Shurbevski, 2011 .

Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts

Toshihide Ibaraki, Hiroshi Nagamochi, Liang Zhao, 1999, J. Comb. Optim..

Kernel Methods for Chemical Compounds: From Classification to Design

Hiroshi Nagamochi, Tatsuya Akutsu, 2011, IEICE Trans. Inf. Syst..

An Algorithm for Node Replacement in Lightwave Networks

Hiroshi Nagamochi, Yuji Oie, Manabu Kato, 1995 .

Approximation Algorithms for Multicast Routings in a Network with Multi-Sources

Hiroshi Nagamochi, Ehab Morsy, 2007, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs

Hiroshi Nagamochi, Seok-Hee Hong, 2008, Algorithmica.

Path-Monotonic Upward Drawings of Graphs

Hiroshi Nagamochi, Seok-Hee Hong, 2020, COCOON.

Acute Constraints in Straight-Line Drawings of Planar Graphs

Hiroshi Nagamochi, Peter Eades, Aleksandar Shurbevski, 2019, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1992, Algorithmica.

An improved approximation algorithm for capacitated multicast routings in networks

Hiroshi Nagamochi, Ehab Morsy, H. Nagamochi, 2008, Theor. Comput. Sci..

Design of Polynomial-delay Enumeration Algorithms in Transitive Systems pdf

Hiroshi Nagamochi, Kazuya Haraguchi, H. Nagamochi, 2020, ArXiv.

Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings

Hiroshi Nagamochi, Seok-Hee Hong, 2009, Algorithmica.

Extension of ICF Classifiers to Real World Data Sets

Hiroshi Nagamochi, Kazuya Haraguchi, H. Nagamochi, 2007, IEA/AIE.

Two equivalent measures on weighted hypergraphs

Hiroshi Nagamochi, Hiro Ito, 2006, Discret. Appl. Math..

Approximating the minmax rooted-tree cover in a tree

Hiroshi Nagamochi, Kohei Okada, 2007, Inf. Process. Lett..

The Set Connector Problem in Graphs

Takuro Fukunaga, Hiroshi Nagamochi, H. Nagamochi, 2007, IPCO.

Convex drawings of graphs with non-convex boundary constraints

Hiroshi Nagamochi, Seok-Hee Hong, H. Nagamochi, 2006, Discret. Appl. Math..

Algorithmic Aspects of Graph Connectivity

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 2008, Encyclopedia of Mathematics and its Applications.

Approximating Capacitated Tree-Routings in Networks

Hiroshi Nagamochi, Ehab Morsy, 2007, TAMC.

Polyhedral structure of submodular and posi-modular systems

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1998, Discret. Appl. Math..

Further Improvement on Maximum Independent Set in Degree-4 Graphs

Hiroshi Nagamochi, Mingyu Xiao, 2011, COCOA.

Performance Analysis of a Collision Detection Algorithm of Spheres Based on Slab Partitioning

Hiroshi Nagamochi, Takashi Imamichi, T. Imamichi, 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Approximating the Minmax Subtree Cover Problem in a Cactus

Hiroshi Nagamochi, Taizo Kawada, 2004, ISAAC.

A New Integer Linear Programming Formulation to the Inverse QSAR/QSPR for Acyclic Chemical Compounds Using Skeleton Trees

Hiroshi Nagamochi, Tatsuya Akutsu, Fan Zhang, 2020, IEA/AIE.

Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables

Hiroshi Nagamochi, Kazuya Haraguchi, Seok-Hee Hong, 2010, LION.

Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities

Masao Fukushima, Toshihide Ibaraki, Hiroshi Nagamochi, 1990, Networks.

Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game

Hiroshi Nagamochi, Aleksandar Shurbevski, Morito Oomine, 2017, J. Graph Algorithms Appl..

A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem

Toshihide Ibaraki, Hiroshi Nagamochi, Liang Zhao, 2003, Inf. Process. Lett..

Computing edge-connectivity augmentation function in Õ(nm) time

Toshihide Ibaraki, Hiroshi Nagamochi, Takashi Shiraki, 1997, SODA '97.

for Two-dimensional Packing

Hiroshi Nagamochi, Mutsunori Yagiura, Shinji Imahori, 2006 .

A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem

Fred W. Glover, Toshihide Ibaraki, Hiroshi Nagamochi, 2007, SLS.

Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs

Hiroshi Nagamochi, Toshimasa Ishii, Yoko Akiyama, 2003, Electron. Notes Theor. Comput. Sci..

Improved algorithms for enumerating tree-like chemical graphs with given path frequency.

Hiroshi Nagamochi, Tatsuya Akutsu, Liang Zhao, 2008, Genome informatics. International Conference on Genome Informatics.

Augmenting Edge and Vertex Connectivities Simultaneously

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 1997, ISAAC.

Some Reduction Operations to Pairwise Compatibility Graphs

Hiroshi Nagamochi, Mingyu Xiao, H. Nagamochi, 2018, Inf. Process. Lett..

Indexing All Rooted Subgraphs of a Rooted Graph

Hiroshi Nagamochi, Tomoki Imada, H. Nagamochi, 2012, IEICE Trans. Inf. Syst..

Approximating the Generalized Capacitated Tree-Routing Problem

Hiroshi Nagamochi, Ehab Morsy, 2008, COCOON.

Augmenting a Submodular and Posi-modular Set Function by a Multigraph

Toshihide Ibaraki, Hiroshi Nagamochi, Takashi Shiraki, 2001, J. Comb. Optim..

On computing minimum (s, t)-cuts in digraphs

Hiroshi Nagamochi, 2005, Inf. Process. Lett..

On the Negation-Limited Circuit Complexity of Merging

Hiroshi Nagamochi, Toshihide Ibaraki, Yoshitaka Nakano, 1999 .

Computing All Small Cuts in Undirected Networks

Toshihide Ibaraki, Hiroshi Nagamochi, Kazuhiro Nishimura, 1994, ISAAC.

Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, 1997, J. Comb. Optim..

A Multi-sphere Scheme for 2D and 3D Packing Problems

Hiroshi Nagamochi, Takashi Imamichi, T. Imamichi, 2007, SLS.

A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph

Hiroshi Nagamochi, 2005, J. Algorithms.

Generating Trees on Multisets

Hiroshi Nagamochi, Bingbing Zhuang, H. Nagamochi, 2010, ISAAC.

Orthogonal Drawings for Plane Graphs with Specified Face Areas

Hiroshi Nagamochi, Akifumi Kawaguchi, 2007, TAMC.

A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times

Hiroshi Nagamochi, Yoshiyuki Karuno, 2001, ISAAC.

Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming

Hiroshi Nagamochi, Tatsuya Akutsu, Shunsuke Ota, 2009, ISAAC.

Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications pdf

Hiroshi Nagamochi, Tatsuya Akutsu, Xiang Zhou, 2020, ArXiv.

Efficient Enumeration of Stereoisomers of Outerplanar Chemical Graphs Using Dynamic Programming

Hiroshi Nagamochi, Tatsuya Akutsu, Shunsuke Ota, 2011, J. Chem. Inf. Model..

COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets

Hiroshi Nagamochi, Kazuya Haraguchi, Aleksandar Shurbevski, 2019, J. Graph Algorithms Appl..

OPNp1-3: Contention-Free l-Planes in Optically Burst-Switched WDM Networks

Hiroshi Nagamochi, Tetsuya Takine, Takahiro Matsuda, 2006, IEEE Globecom 2006.

Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems

Hiroshi Nagamochi, Yoshiyuki Karuno, Aleksandar Shurbevski, 2013, IEICE Trans. Inf. Syst..

4A2 NETWORK TRANSFORMATION HEURISTICS FOR MULTI-STORY STORAGE RACK PROBLEMS(Technical session 4A: Material handling system)

Hiroshi Nagamochi, Yoshiyuki Karuno, H. Nagamochi, 2011 .

Vehicle Scheduling on a Tree with Release and Handling Times

Toshihide Ibaraki, Hiroshi Nagamochi, Yoshiyuki Karuno, 1993, ISAAC.

A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts

Toshihide Ibaraki, Hiroshi Nagamochi, 1999, IPCO.

An Efficient Algorithm for Generating Colored Outerplanar Graphs

Hiroshi Nagamochi, Tatsuya Akutsu, Liang Zhao, 2007, TAMC.

2B1 A DP-BASED HEURISTIC ALGORITHM FOR THE DISCRETE SPLIT DELIVERY VEHICLE ROUTING PROBLEM(Technical session 2B: Vehicle scheduling and communication)

Hiroshi Nagamochi, Yoshitaka Nakao, H. Nagamochi, 2006 .

Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems

Takuro Fukunaga, Hiroshi Nagamochi, 2005, COCOON.

Complexity and kernels for bipartition into degree-bounded induced graphs

Hiroshi Nagamochi, Mingyu Xiao, H. Nagamochi, 2014, Theor. Comput. Sci..

Digital Halftoning : Formulation as a Combinatorial Optimization Problem and Approximation Algorithms Based on Network Flow (Algorithm Engineering as a New Paradigm)

Hiroshi Nagamochi, Tomomi Matsui, Tetsuo Asano, 2001 .

An exact algorithm for maximum independent set in degree-5 graphs

Hiroshi Nagamochi, Mingyu Xiao, H. Nagamochi, 2016, Discret. Appl. Math..

Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs

Hiroshi Nagamochi, Seok-Hee Hong, H. Nagamochi, 2014, COCOON.

Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts

Toshihide Ibaraki, Hiroshi Nagamochi, Liang Zhao, 2001, J. Comb. Optim..

Bounds on the number of isolates in sum graph labeling

Hiroshi Nagamochi, Mirka Miller, Slamin, 2001, Discret. Math..

Drawing Clustered Graphs on an Orthogonal Grid

Hiroshi Nagamochi, Peter Eades, Qing-Wen Feng, 1999, J. Graph Algorithms Appl..

Enumerating Rooted Graphs with Reflectional Block Structures

Hiroshi Nagamochi, Bingbing Zhuang, H. Nagamochi, 2010, CIAC.

EFFICIENT BRANCH-AND-BOUND ALGORITHMS FOR WEIGHTED MAX-2-SAT

Hiroshi Nagamochi, Mutsunori Yagiura, Koji Nonobe, 2007 .

Approximating the Bipartite TSP and Its Biased Generalization

Hiroshi Nagamochi, Yoshiyuki Karuno, Aleksandar Shurbevski, 2014, WALCOM.

Enumerating Treelike Chemical Graphs with Given Path Frequency

Hiroshi Nagamochi, Tatsuya Akutsu, Liang Zhao, 2008, J. Chem. Inf. Model..

Network Design with Weighted Degree

Takuro Fukunaga, Hiroshi Nagamochi, 2008 .

An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree

Toshihide Ibaraki, Hiroshi Nagamochi, 1999, COCOON.

On generalized greedy splitting algorithms for multiway partition problems

Toshihide Ibaraki, Hiroshi Nagamochi, Liang Zhao, 2004, Discret. Appl. Math..

Vehicle Scheduling Problems in Graphs

Hiroshi Nagamochi, Yoshiyuki Karuno, 2007, Handbook of Approximation Algorithms and Metaheuristics.

An exact algorithm for maximum independent set in degree-5 graphs

Hiroshi Nagamochi, Mingyu Xiao, 2016, Discret. Appl. Math..

1A2 AN IMPROVED APPROXIMATION ALGORITHM FOR CAPACITATED MULTICAST ROUTINGS IN NETWORKS(Technical session 1A: Combinatorial optimization)

Hiroshi Nagamochi, Ehab Morsy, 2006 .

Efficient enumeration of monocyclic chemical graphs with given path frequencies

Hiroshi Nagamochi, Tatsuya Akutsu, Masaki Suzuki, 2014, Journal of Cheminformatics.

Sparse connectivity certificates via MA orderings in graphs

Hiroshi Nagamochi, 2006, Discret. Appl. Math..

A simple recognition of maximal planar graphs

Hiroshi Nagamochi, Toshimasa Ishii, Takahisa Suzuki, 2004, Inf. Process. Lett..

Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank

Hiroshi Nagamochi, Aleksandar Shurbevski, Naveed Ahmed Azam, 2020, Entropy.

On 2-Approximation to the Vertex-Connectivity in Graphs

Hiroshi Nagamochi, 2005, IEICE Trans. Inf. Syst..

Characterizing Star-PCGs

Hiroshi Nagamochi, Mingyu Xiao, 2020, Algorithmica.

Efficient branch-and-bound algorithms for weighted MAX-2-SAT

Toshihide Ibaraki, Hiroshi Nagamochi, Mutsunori Yagiura, 2011, Math. Program..

Totally balanced combinatorial optimization games

Toshihide Ibaraki, Hiroshi Nagamochi, Xiaotie Deng, 2000, Math. Program..

Enumerating Naphthalene Isomers of Tree-like Chemical Graphs

Hiroshi Nagamochi, Tatsuya Akutsu, Fei He, 2016, BIOINFORMATICS.

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

Takuro Fukunaga, Hiroshi Nagamochi, Kazumasa Okumoto, 2009, Algorithmica.

Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 1999, ESA.

FPTAS's for Some Cut Problems in Weighted Trees

Takuro Fukunaga, Hiroshi Nagamochi, Mingyu Xiao, 2010, FAW.

A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage

Hiroshi Nagamochi, Yoshiyuki Karuno, 2002, ISAAC.

An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree

Hiroshi Nagamochi, H. Nagamochi, 1999, Discret. Appl. Math..

Bounded-Degree Cut is Fixed-Parameter Tractable pdf

Hiroshi Nagamochi, Mingyu Xiao, 2020, ArXiv.

On the enumeration of minimal non-pairwise compatibility graphs

Hiroshi Nagamochi, Aleksandar Shurbevski, Naveed Ahmed Azam, 2020, Journal of Combinatorial Optimization.

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

Takuro Fukunaga, Hiroshi Nagamochi, Kazumasa Okumoto, 2009, ISAAC.

Implementing an efficient minimum capacity cut algorithm

Toshihide Ibaraki, Hiroshi Nagamochi, Tadashi Ono, 1994, Math. Program..

Network Design with Weighted Degree Constraints

Takuro Fukunaga, Hiroshi Nagamochi, 2009, WALCOM.

Two Arc-Disjoint Paths in Eulerian Digraphs

Toshihide Ibaraki, Hiroshi Nagamochi, András Frank, 1998, SIAM J. Discret. Math..

Eulerian detachments with local edge-connectivity

Takuro Fukunaga, Hiroshi Nagamochi, 2009, Discret. Appl. Math..

5B2 AN ITERATED LOCAL SEARCH ALGORITHM BASED ON NONLINEAR PROGRAMMING FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem)

Hiroshi Nagamochi, Mutsunori Yagiura, Takashi Imamichi, 2006 .

A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, Shigeki Katayama, 2000, J. Comb. Optim..

Increasing the Edge-Connectivity by Contracting a Vertex Subset in Graphs

Hiroshi Nagamochi, 2006, IEICE Trans. Inf. Syst..

Packing Unit Squares in a Rectangle

Hiroshi Nagamochi, 2005, Electron. J. Comb..

Group Strategy-proof Mechanisms for Shuttle Facility Games

Hiroshi Nagamochi, Aleksandar Shurbevski, Yuhei Fukui, 2020, J. Inf. Process..

Optical Path Assignment Problem for Torus Lightwave Networks

Hiroshi Nagamochi, Yuji Oie, Hideki Sunahara, 1997 .

A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1995, IPCO.

A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph

Toshihide Ibaraki, Hiroshi Nagamochi, Liang Zhao, 2001, STACS.

GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS( Network Design, Control and Optimization)

Hiroshi Nagamochi, H. Nagamochi, 2004 .

An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure

Hiroshi Nagamochi, Mingyu Xiao, 2013, TAMC.

Minimum cost subpartitions in graphs

Hiroshi Nagamochi, Yoko Kamidoi, H. Nagamochi, 2007, Inf. Process. Lett..

Augmenting Forests to Meet Odd Diameter Requirements

Hiroshi Nagamochi, Toshimasa Ishii, Shigeyuki Yamamoto, 2003, ISAAC.

Network Design with Edge-Connectivity and Degree Constraints

Takuro Fukunaga, Hiroshi Nagamochi, H. Nagamochi, 2006, Theory of Computing Systems.

Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 2000, J. Comb. Optim..

The Stable Roommates Problem with Unranked Entries

Hiroshi Nagamochi, Aleksandar Shurbevski, Hiroaki Suto, 2018, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Algorithmic Aspects of Graph Connectivity: Bibliography

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 2008 .

Algorithms and Computation : 7th International Symposium, ISAAC '96 Osaka, Japan, December 16-18, 1996 Proceedings

Hiroshi Nagamochi, Satoru Miyano, Subhash Suri, 1996 .

Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs

Hiroshi Nagamochi, Tatsuya Akutsu, Aleksandar Shurbevski, 2019, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs

Hiroshi Nagamochi, Aleksandar Shurbevski, Norhazwani Md Yunos, 2015, JCDCGG.

On the one-sided crossing minimization in a bipartite graph with large degrees

Hiroshi Nagamochi, H. Nagamochi, 2005, Theor. Comput. Sci..

Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route

Hiroshi Nagamochi, Yoshiyuki Karuno, Aleksandar Shurbevski, 2017, J. Inf. Process..

Generalizing the induced matching by edge capacity constraints

Takuro Fukunaga, Hiroshi Nagamochi, 2007, Discret. Optim..

Improved Bounds for Minimum Fault-Tolerant Gossip Graphs

Hiroshi Nagamochi, Toru Hasunuma, 2011, WG.

On sparse subgraphs preserving connectivity properties

Toshihide Ibaraki, Hiroshi Nagamochi, András Frank, 1993, J. Graph Theory.

Exact Algorithms for Maximum Independent Set

Hiroshi Nagamochi, Mingyu Xiao, 2013, ISAAC.

Convex Embeddings and Bisections of 3-Connected Graphs1

Toshihide Ibaraki, Hiroshi Nagamochi, Tibor Jordán, 2002, Comb..

Minimum Degree Orderings

Hiroshi Nagamochi, H. Nagamochi, 2007, Algorithmica.

An FPT algorithm for edge subset feedback edge set

Hiroshi Nagamochi, Mingyu Xiao, H. Nagamochi, 2012, Inf. Process. Lett..

Graph connectivity and its augmentation: applications of MA orderings

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 2002, Discret. Appl. Math..

Optimal coteries for rings and related networks

Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda, 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

Augmenting Edge-Connectivity and Vertex-Connectivity Simultaneously

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 1997 .

Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable

Hiroshi Nagamochi, Mingyu Xiao, H. Nagamochi, 2018, ICALP.

A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times

Hiroshi Nagamochi, Yoshiyuki Karuno, 2001, ESA.

Cop-Robber Guarding Game with Cycle Robber Region

Hiroshi Nagamochi, 2009, FAW.

A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming

Hiroshi Nagamochi, Tatsuya Akutsu, Aleksandar Shurbevski, 2020, Algorithms.

Comparison and Enumeration of Chemical Graphs

Hiroshi Nagamochi, Tatsuya Akutsu, 2013, Computational and structural biotechnology journal.

Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints

Hiroshi Nagamochi, Seok-Hee Hong, 2012, Theor. Comput. Sci..

A linear-time algorithm for testing full outer-2-planarity

Hiroshi Nagamochi, Seok-Hee Hong, H. Nagamochi, 2019, Discret. Appl. Math..

An improved exact algorithm for undirected feedback vertex set

Hiroshi Nagamochi, Mingyu Xiao, H. Nagamochi, 2013, J. Comb. Optim..

On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1989, Inf. Process. Lett..

Bipartite Graph Representation of Multiple Decision Table Classifiers

Hiroshi Nagamochi, Kazuya Haraguchi, Seok-Hee Hong, 2009, SAGA.

λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks

Hiroshi Nagamochi, Aleksandar Shurbevski, Yuhei Fukui, 2019, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate

Hiroshi Nagamochi, Toru Hasunuma, H. Nagamochi, 1998, J. Algorithms.

"Rent-or-Buy" Scheduling and Cost Coloring Problems

Takuro Fukunaga, Hiroshi Nagamochi, Magnús M. Halldórsson, 2007, FSTTCS.

The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights

Hiroshi Nagamochi, Cong Zhang, H. Nagamochi, 2012, CATS.

Algorithmic Aspects of Graph Connectivity: Preface

Toshihide Ibaraki, Hiroshi Nagamochi, 2008 .

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

Hiroshi Nagamochi, Xuemin Lin, Peter Eades, 1996, Algorithmica.

An Improved Exact Algorithm for Undirected Feedback Vertex Set

Hiroshi Nagamochi, Mingyu Xiao, 2013, COCOA.

A Clustering Method for Analysis of Sequence Similarity Networks of Proteins Using Maximal Components of Graphs

Hiroshi Nagamochi, Tatsuya Akutsu, Morihiro Hayashida, 2008 .

Linear Layouts in Submodular Systems

Hiroshi Nagamochi, H. Nagamochi, 2012, ISAAC.

Approximating the Minmax Rooted-Subtree Cover Problem

Hiroshi Nagamochi, 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

IMPROVED ALGORITHMS FOR ENUMERATING TREE-LIKE CHEMICAL GRAPHS WITH GIVEN PATH FREQUENCY

Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu, 2008 .

BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING( the 50th Anniversary of the Operations Research Society of Japan)

Hiroshi Nagamochi, Xiaoming Wang, Yoshiyuki Karuno, 2007 .

Worst Case Analysis for Pickup and Delivery Problems with Transfer

Hiroshi Nagamochi, Yoshitaka Nakao, 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game

Hiroshi Nagamochi, Aleksandar Shurbevski, Morito Oomine, 2016, WALCOM.

Listing Triconnected Rooted Plane Graphs

Hiroshi Nagamochi, Bingbing Zhuang, H. Nagamochi, 2010, COCOA.

A Detachment Algorithm for Inferring a Graph from Path Frequency

Hiroshi Nagamochi, H. Nagamochi, 2009, Algorithmica.

Polyhedral Structure of Submodular and Posi-modular Systems

Toshihide Ibaraki, Hiroshi Nagamochi, 1998, ISAAC.

A Linear-Time Algorithm for Integral Multiterminal Flows in Trees

Hiroshi Nagamochi, Mingyu Xiao, 2016, ISAAC.

Computing Edge-Connectivity in Multiple and Capacitated Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, 1990, SIGAL International Symposium on Algorithms.

File Transfer Tree Problems

Hiroshi Nagamochi, Hiro Ito, Masato Fujita, 2002, ISAAC.

An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4

Hiroshi Nagamochi, Mingyu Xiao, H. Nagamochi, 2015, Theory of Computing Systems.

Computing Edge-Connectivity in Multigraphs and Capacitated Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1992, SIAM J. Discret. Math..

A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility

Hiroshi Nagamochi, Tatsuya Akutsu, Fan Zhang, 2020, BIOINFORMATICS.

Submodular Minimization via Pathwidth

Hiroshi Nagamochi, H. Nagamochi, 2012, TAMC.

On the one-dimensional stock cutting problem in the paper tube industry

Hiroshi Nagamochi, Shunji Umetani, Kazuki Matsumoto, 2011, J. Sched..

Approximating capacitated tree-routings in networks

Hiroshi Nagamochi, Ehab Morsy, 2011, J. Comb. Optim..

Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3

Hiroshi Nagamochi, Mingyu Xiao, 2013, IEICE Trans. Inf. Syst..

Approximating a vehicle scheduling problem with time windows and handling times

Hiroshi Nagamochi, Takaharu Ohnishi, H. Nagamochi, 2008, Theor. Comput. Sci..

A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, Shigeki Katayama, 1999, J. Comb. Optim..

Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut

Hiroshi Nagamochi, Tatsuya Akutsu, Liang Zhao, 2010, J. Chem. Inf. Model..

A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners

Hiroshi Nagamochi, Seok-Hee Hong, 2011, Algorithmica.

A Refined Exact Algorithm for Edge Dominating Set

Hiroshi Nagamochi, Mingyu Xiao, 2012, TAMC.

Polynomial-delay Enumeration Algorithms in Set Systems pdf

Hiroshi Nagamochi, Kazuya Haraguchi, 2020, ArXiv.

Multigraph augmentation under biconnectivity and general edge-connectivity requirements

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 2001, Networks.

Convex Drawings of Graphs with Non-convex Boundary

Hiroshi Nagamochi, Seok-Hee Hong, 2006, WG.

Vehicle scheduling on a tree with release and handling times

Toshihide Ibaraki, Hiroshi Nagamochi, Yoshiyuki Karuno, 1997, Ann. Oper. Res..

On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph

Hiroshi Nagamochi, Toshimasa Ishii, H. Nagamochi, 2000, SWAT.

Removing Node Overlaps Using Multi-sphere Scheme

Hiroshi Nagamochi, Seok-Hee Hong, Takashi Imamichi, 2008, Graph Drawing.

Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem

Hiroshi Nagamochi, Kohei Okada, 2003, ISAAC.

Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees

Hiroshi Nagamochi, Morito Oomine, 2016, IEICE Trans. Inf. Syst..

Linear-tree rule structure for firewall optimization

Hiroshi Nagamochi, Liang Zhao, A. Shimae, 2007, Communications, Internet, and Information Technology.

A 1.5-Approximation for Single-Vehicle Scheduling Problem on a Line with Release and Handling Times

Toshihide Ibaraki, Hiroshi Nagamochi, Yoshiyuki Karuno, 1998 .

Optimal augmentation to make a graph k-edge-connected and triconnected

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 1998, SODA '98.

Augmenting forests to meet odd diameter requirements

Hiroshi Nagamochi, Toshimasa Ishii, Shigeyuki Yamamoto, 2006, Discret. Optim..

Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon

Hiroshi Nagamochi, Hiro Ito, 2002, JCDCG.

A plane graph representation of triconnected graphs

Hiroshi Nagamochi, Ehab Morsy, Shunsuke Ota, 2010, Theor. Comput. Sci..

Complexity and kernels for bipartition into degree-bounded induced graphs

Hiroshi Nagamochi, Mingyu Xiao, 2017, Theor. Comput. Sci..

Convex Drawing for c-Planar Biconnected Clustered Graphs

Hiroshi Nagamochi, Katsutoshi Kuroya, 2003, Graph Drawing.

Selective Vehicle Scheduling on Paths with a Due Date Involving Criterion

Hiroshi Nagamochi, Yoshiyuki Karuno, Jun Uchida, 2007 .

Efficient Approximate Algorithms for the Beacon Placement and its Dual Problem (Abstract)

Hiroshi Nagamochi, Liang Zhao, Masahiro Sasaki, 2009, 2009 International Conference on Computational Intelligence and Software Engineering.

A Routing Algorithm on a Storage Tank System

Hiroshi Nagamochi, Toshimasa Ishii, Makoto Takeda, 2005 .

An Improved Algorithm for Parameterized Edge Dominating Set Problem

Hiroshi Nagamochi, Ken Iwaide, 2015, WALCOM.

A Novel Clustering Method for Analysis of Biological Networks using Maximal Components of Graphs

Hiroshi Nagamochi, Tatsuya Akutsu, Morihiro Hayashida, 2007, APBC.

Scheduling Capacitated One-Way Vehicles on Paths with Deadlines

Hiroshi Nagamochi, Yoshiyuki Karuno, Jun Uchida, 2009 .

A robust algorithm for bisecting a triconnected graph with two resource sets

Hiroshi Nagamochi, Toshimasa Ishii, Kengo Iwata, 2005, Theor. Comput. Sci..

An Improved Approximation to the One-Sided Bilayer Drawing

Hiroshi Nagamochi, H. Nagamochi, 2003, GD.

Cop-robber guarding game with cycle robber-region

Hiroshi Nagamochi, 2011, Theor. Comput. Sci..

An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs

Hiroshi Nagamochi, Aleksandar Shurbevski, Norhazwani Md Yunos, 2017, Journal of Information Processing.

An Approximation Algorithm for Locating Maximal Disks within Convex Polygons

Takuro Fukunaga, Hiroshi Nagamochi, Hirofumi Aota, 2011, Int. J. Comput. Geom. Appl..

Recent development of graph connectivity augmentation algorithms

Hiroshi Nagamochi, 2000 .

A Dynamic Programming Based Improvement Heuristic for a Repetitive Routing Problem of Grasp-and-Delivery Robots

Hiroshi Nagamochi, Yoshiyuki Karuno, Aleksandar Shurbevski, 2012 .

2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times

Hiroshi Nagamochi, Yoshiyuki Karuno, 2003, Discret. Appl. Math..

Network design with weighted degree constraints

Takuro Fukunaga, Hiroshi Nagamochi, 2010, Discret. Optim..

Drawing slicing graphs with face areas

Hiroshi Nagamochi, Akifumi Kawaguchi, H. Nagamochi, 2009, Theor. Comput. Sci..

Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs

Hiroshi Nagamochi, Seok-Hee Hong, 2014, COCOON.

Minimum Degree Orderings

Hiroshi Nagamochi, 2007, ISAAC.

Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies

Hiroshi Nagamochi, Tatsuya Akutsu, Masaaki Shimizu, 2011, BMC Bioinformatics.

On the Minimum Local-Vertex-Connectivity Augmentation in Graphs

Hiroshi Nagamochi, Toshimasa Ishii, 2001, ISAAC.

Robust cost colorings

Takuro Fukunaga, Hiroshi Nagamochi, Magnús M. Halldórsson, 2008, SODA '08.

Maximum flows in probabilistic networks

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1991, Networks.

Editorial: ISAAC 2008 Special Issue

Hiroshi Nagamochi, Seok-Hee Hong, 2011, Algorithmica.

An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops

Hiroshi Nagamochi, Aleksandar Shurbevski, Naveed Ahmed Azam, 2020, Entropy.

A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree

Hiroshi Nagamochi, Kohei Okada, H. Nagamochi, 2004, Discret. Appl. Math..

A 2-approximation algorithm for the minimum weight edge dominating set problem

Hiroshi Nagamochi, Toshihiro Fujito, H. Nagamochi, 2002, Discret. Appl. Math..

Approximating Crossing Minimization in Radial Layouts

Hiroshi Nagamochi, Seok-Hee Hong, 2008, LATIN.

Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time

Hiroshi Nagamochi, Seok-Hee Hong, H. Nagamochi, 2016, GD.

An approximation algorithm for dissecting a rectangle into rectangles with specified areas

Hiroshi Nagamochi, Yuusuke Abe, H. Nagamochi, 2003, Discret. Appl. Math..

An exact strip packing algorithm based on canonical forms

Hiroshi Nagamochi, Takashi Imamichi, Yohei Arahori, 2012, Comput. Oper. Res..

Approximability of the capacitated b-edge dominating set problem

Ojas Parekh, Takuro Fukunaga, Hiroshi Nagamochi, 2007, Theor. Comput. Sci..

Minmax subtree cover problem on cacti

Hiroshi Nagamochi, Taizo Kawada, 2006, Discret. Appl. Math..

Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries

Hiroshi Nagamochi, Yoshitaka Nakao, 2009, ISAAC.

An approximation algorithm for dissecting a rectangle into rectangles with specified areas

Hiroshi Nagamochi, Yuusuke Abe, H. Nagamochi, 2003, Discret. Appl. Math..

Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs

Hiroshi Nagamochi, Mingyu Xiao, H. Nagamochi, 2013, Theor. Comput. Sci..

A Unified Framework for Approximating Multiway Partition Problems

Toshihide Ibaraki, Hiroshi Nagamochi, Liang Zhao, 2009, ISAAC.

Studies on Multicommodity Flows in Directed Networks

Hiroshi Nagamochi, H. Nagamochi, 1988 .

Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs

Hiroshi Nagamochi, Tatsuya Akutsu, Jinghui Li, 2018, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

Some Reduction Procedure for Computing Pathwidth of Undirected Graphs

Hiroshi Nagamochi, Masataka Ikeda, 2015, IEICE Trans. Inf. Syst..

Complexity of the Minimum Base Game on Matroids

Toshihide Ibaraki, Hiroshi Nagamochi, Dao-Zhi Zeng, 1997, Math. Oper. Res..

Worst Case Analysis for a Pickup and Delivery Problem with Single Transfer (Numerical Optimization methods, theory and applications)

Hiroshi Nagamochi, Yoshitaka Nakao, 2008 .

Single Vehicle Scheduling Problem for Processing a Maximum Benefit Subset of Jobs on a Line(New Trends in Theory of Computation and Algorithm)

Hiroshi Nagamochi, Takaharu Ohnishi, H. Nagamochi, 2006 .

An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure

Hiroshi Nagamochi, Mingyu Xiao, H. Nagamochi, 2012, Algorithmica.

An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings

Hiroshi Nagamochi, H. Nagamochi, 2005, Discret. Comput. Geom..

Two Arc Disjoint Paths in Eulerian Diagraphs

Toshihide Ibaraki, Hiroshi Nagamochi, András Frank, 1995, ISAAC.

Minimum Transversals in Posi-modular Systems

Hiroshi Nagamochi, Kazuhisa Makino, Mariko Sakashita, 2006, ESA.

A DP-based Heuristic Algorithm for the Discrete Split Delivery Vehicle Routing Problem

Hiroshi Nagamochi, Yoshitaka Nakao, 2007 .

Exact Algorithms for Maximum Independent Set pdf

Hiroshi Nagamochi, Mingyu Xiao, H. Nagamochi, 2013, ISAAC.

K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 1998, ISAAC.

An Edge-Splitting Algorithm in Planar Graphs

Hiroshi Nagamochi, Peter Eades, 2003, J. Comb. Optim..

An approximability result of the multi-vehicle scheduling problem on a path with release and handling times

Hiroshi Nagamochi, Yoshiyuki Karuno, 2004, Theor. Comput. Sci..

The source location problem with local 3-vertex-connectivity requirements

Hiroshi Nagamochi, Toshimasa Ishii, Hitoshi Fujita, 2007, Discret. Appl. Math..

An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem

Hiroshi Nagamochi, Liang Zhao, Pipaporn Eumthurapojn, 2010, CGGA.

Minimum cost source location problem with local 3-vertex-connectivity requirements

Hiroshi Nagamochi, Toshimasa Ishii, Hitoshi Fujita, 2007, Theor. Comput. Sci..

Algorithmic Aspects of the Core of Combinatorial Optimization Games

Toshihide Ibaraki, Hiroshi Nagamochi, Xiaotie Deng, 1999, Math. Oper. Res..

Optimal coteries for rings and related networks

Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda, 2005, Distributed Computing.

Drawing c-planar biconnected clustered graphs

Hiroshi Nagamochi, Katsutoshi Kuroya, H. Nagamochi, 2007, Discret. Appl. Math..

A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations

Toshihide Ibaraki, Hiroshi Nagamochi, Alexander V. Karzanov, 1998, Comb..

Bisecting a 4-connected graph with three resource sets

Hiroshi Nagamochi, Toshimasa Ishii, Kengo Iwata, 2007, Discret. Appl. Math..

An Exact Algorithm for Lowest Edge Dominating Set

Hiroshi Nagamochi, Ken Iwaide, 2017, IEICE Trans. Inf. Syst..

MINIMIZING CAPACITATED TREE COVERS OF GRAPHS

Hiroshi Nagamochi, Yoshiyuki Karuno, 2007 .

An Improved Exact Algorithm for TSP in Degree-4 Graphs

Hiroshi Nagamochi, Mingyu Xiao, 2012, COCOON.

Network Design with Edge-Connectivity and Degree Constraints

Takuro Fukunaga, Hiroshi Nagamochi, 2008, Theory of Computing Systems.

A Fast Edge-Splitting Algorithm in Edge-Weighted Graphs

Hiroshi Nagamochi, H. Nagamochi, 2006, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Practical Algorithms for Two-Dimensional Packing of Rectangles

Hiroshi Nagamochi, Mutsunori Yagiura, Shinji Imahori, 2018, Handbook of Approximation Algorithms and Metaheuristics.

Greedy splitting algorithms for approximating multiway partition problems

Toshihide Ibaraki, Hiroshi Nagamochi, Liang Zhao, 2005, Math. Program..

Contention-Free lambda-Planes in Optically Burst-Switched WDM Networks

Hiroshi Nagamochi, Tetsuya Takine, Takahiro Matsuda, 2007, IEICE Trans. Commun..

Counting edge crossings in a 2-layered drawing

Hiroshi Nagamochi, Nobuyasu Yamada, 2004, Inf. Process. Lett..

Breadth-First Search Approach to Enumeration of Tree-like Chemical Compounds

Hiroshi Nagamochi, Tatsuya Akutsu, Yang Zhao, 2013, J. Bioinform. Comput. Biol..

Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem

Hiroshi Nagamochi, Aleksandar Shurbevski, Mohd Shahrizan Othman, 2018, IEICE Trans. Inf. Syst..

Exact algorithms for the two-dimensional strip packing problem with and without rotations

Hiroshi Nagamochi, Mutsunori Yagiura, Koji Nonobe, 2009, Eur. J. Oper. Res..

Characterizing Star-PCGs

Hiroshi Nagamochi, Mingyu Xiao, H. Nagamochi, 2018, Algorithmica.

Optimization Techniques for Robot Path Planning

Hiroshi Nagamochi, Aleksandar Shurbevski, Noriaki Hirosue, 2013, ICT Innovations.

Computing All Small Cuts in an Undirected Network

Toshihide Ibaraki, Hiroshi Nagamochi, Kazuhiro Nishimura, 1997, SIAM J. Discret. Math..

Convex drawings of hierarchical planar graphs and clustered planar graphs

Hiroshi Nagamochi, Seok-Hee Hong, H. Nagamochi, 2010, J. Discrete Algorithms.

A refined exact algorithm for Edge Dominating Set

Hiroshi Nagamochi, Mingyu Xiao, 2014, Theor. Comput. Sci..

Heuristics for scheduling problems on identical machines like storage allocation

Hiroshi Nagamochi, Yoshiyuki Karuno, Akira Nakashima, 2010, 2010 8th IEEE International Conference on Industrial Informatics.

FPTASs for trimming weighted trees

Takuro Fukunaga, Hiroshi Nagamochi, Mingyu Xiao, 2013, Theor. Comput. Sci..

A Detachment Algorithm for Inferring a Graph from Path Frequency

Hiroshi Nagamochi, 2006, COCOON.

A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, S. Nakamura, 2000, Algorithmica.

Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph

Hiroshi Nagamochi, Toshimasa Ishii, 2000, ISAAC.

Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs

Hiroshi Nagamochi, Peter Eades, 1998, IPCO.

An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots

Hiroshi Nagamochi, Yoshiyuki Karuno, Aleksandar Shurbevski, 2011, J. Adv. Comput. Intell. Intell. Informatics.

Approximation to the Minimum Cost Edge Installation Problem

Hiroshi Nagamochi, Ehab Morsy, 2007, ISAAC.

Characterizing Mechanisms in Obnoxious Facility Game

Hiroshi Nagamochi, Ken Ibara, H. Nagamochi, 2012, COCOA.

Guest Editors' Foreword

Hiroshi Nagamochi, Seok-Hee Hong, 2011, Int. J. Comput. Geom. Appl..

Testing Full Outer-2-planarity in Linear Time

Hiroshi Nagamochi, Seok-Hee Hong, H. Nagamochi, 2015, WG.

An Inverse QSAR Method Based on Decision Tree and Integer Programming

Hiroshi Nagamochi, Tatsuya Akutsu, Kazuya Haraguchi, 2021, ICIC.

Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search

Hiroshi Nagamochi, Tatsuya Akutsu, Kazuya Haraguchi, 2021, 2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM).

A Novel Method for the Inverse QSAR/QSPR to Monocyclic Chemical Compounds Based on Artificial Neural Networks and Integer Programming

Hiroshi Nagamochi, Tatsuya Akutsu, Aleksandar Shurbevski, 2021, Advances in Computer Vision and Computational Biology.

An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures

Hiroshi Nagamochi, Tatsuya Akutsu, Kazuya Haraguchi, 2021, IEA/AIE.

An Inverse QSAR Method Based on Linear Regression and Integer Programming pdf

Hiroshi Nagamochi, Tatsuya Akutsu, Kazuya Haraguchi, 2021, Frontiers in bioscience.

Re-embedding a 1-plane graph for a straight-line drawing in linear time

Hiroshi Nagamochi, Seok-Hee Hong, 2021, Theor. Comput. Sci..

A method for enumerating pairwise compatibility graphs with a given number of vertices

Hiroshi Nagamochi, Aleksandar Shurbevski, Naveed Ahmed Azam, 2020, Discret. Appl. Math..

On the enumeration of minimal non-pairwise compatibility graphs

Hiroshi Nagamochi, Aleksandar Shurbevski, Naveed Ahmed Azam, 2021, Journal of Combinatorial Optimization.

A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming

Hiroshi Nagamochi, Tatsuya Akutsu, 2021, IEEE/ACM transactions on computational biology and bioinformatics.

A Method for Inferring Polymers Based on Linear Regression and Integer Programming pdf

Hiroshi Nagamochi, Tatsuya Akutsu, Kazuya Haraguchi, 2021, ArXiv.

Convex Drawings of Hierarchical Plane Graphs

Hiroshi Nagamochi, Seok-Hee Hong, 2002 .

Enumerating Biconnected Rooted Plane Graphs

Hiroshi Nagamochi, Bingbing Zhuang, H. Nagamochi, 2010 .

Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming

Hiroshi Nagamochi, Tatsuya Akutsu, Tomoki Imada, 2011 .

A POLYNOMIAL-SPACE EXACT ALGORITHM FOR TSP IN DEGREE-5 GRAPHS

Hiroshi Nagamochi, Aleksandar Shurbevski, Norhazwani Md Yunos, 2015 .

APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS( the 50th Anniversary of the Operations Research Society of Japan)

Takuro Fukunaga, Hiroshi Nagamochi, H. Nagamochi, 2007 .

Some Duality Properties of Combinatorial Optimization Games(Optimization Theory in Descrete and Continuous Mathematical Sciences)

Toshihide Ibaraki, Hiroshi Nagamochi, Xiaotie Deng, 1997 .

A Dynamic Programming Approach for a Food Packing Problem

Hiroshi Nagamochi, Yoshiyuki Karuno, H. Nagamochi, 2006 .

Constructing a cactus for minimum cust og a graph in O(mn+n2log n) time and O(m) space

Hiroshi Nagamochi, H. Nagamochi, 2003 .

Counting the number of minimum cuts in undirected multigraphs

Toshihide Ibaraki, Hiroshi Nagamochi, Z. Sun, 1991 .

Optimal Augmentation of a Submodular and Posi-modular Set Function by A

Hiroshi Nagamochi, Takashi Shiraki, H. Nagamochi, 1999 .

Parameterized Edge Dominating Set in Cubic Graphs

Hiroshi Nagamochi, Mingyu Xiao, 2011 .

Algorithms for the minimum partitioning problems in graphs

Hiroshi Nagamochi, H. Nagamochi, 2007 .

Complexity Of The Single Vehicle Scheduling Problem On Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, Koji Mochizuki, 1997 .

Simpler Testing for Two-page Book Embedding of Partitioned Graphs

Hiroshi Nagamochi, Seok-Hee Hong, 2013 .

APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS( the 50th Anniversary of the Operations Research Society of Japan)

Takuro Fukunaga, Hiroshi Nagamochi, H. Nagamochi, 2007 .

Canonical cactus representation for minimum cuts

Hiroshi Nagamochi, Tiko Kameda, 1994 .

A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags

Hiroshi Nagamochi, Yoshiyuki Karuno, H. Nagamochi, 2003, ISAAC.

Enumerating Rooted Biconnected Planar Graphs with Internally Triangulated Faces

Hiroshi Nagamochi, Bingbing Zhuang, H. Nagamochi, 2010 .

An approximation of the minimum vertex cover in a graph

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1999 .

Approximability of the Minimum Maximal Matching Problem in Planar Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 2003, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK

Hiroshi Nagamochi, Tiko Kameda, T. Kameda, 1996 .

Removing Overlaps in Label Layouts Using Multi-sphere Scheme ?

Hiroshi Nagamochi, Seok-Hee Hong, Yohei Arahori, 2008 .

Two-page Book Embedding and Clustered Graph Planarity

Hiroshi Nagamochi, Seok-Hee Hong, H. Nagamochi, 2009 .

A fast algorithm for cactus representations of minimum cuts

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 2000 .

Solving the Single-Vehicle Scheduling Problems for All Home Locations under Depth-First Routing on a Tree

Toshihide Ibaraki, Hiroshi Nagamochi, Koji Mochizuki, 2001 .