H. Nagamochi

发表

A Note on Minimizing Submodular Functions

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

A Simple Proof of a Minimum Cut Algorithm and Its Applications

T. Ibaraki, H. Nagamochi, Toshimasa Ishii, 1999 .

Designing Algorithms with Multi-sphere Scheme

T. Imamichi, H. Nagamochi, 2008, International Conference on Informatics Education and Research for Knowledge-Circulating Society (icks 2008).

Worst Case Analysis for a Pickup and Delivery Problem with Single Transfer

H. Nagamochi, Yoshitaka Nakao, 2010 .

A reconfigurative algorithm for Torus lightwave networks

Y. Oie, H. Nagamochi, Manabu Kato, 1999 .

The Steiner Minimal Tree problem in the λ-geometry plane

S. Suri, T. Asano, S. Miyano, 1996 .

A Method for the Inverse QSAR/QSPR Based on Artificial Neural Networks and Mixed Integer Linear Programming

T. Akutsu, H. Nagamochi, Rachaya Chiewvanichakorn, 2020, ICBBB.

A Mixed Integer Linear Programming Formulation to Artificial Neural Networks

T. Akutsu, H. Nagamochi, 2019, Proceedings of the 2019 2nd International Conference on Information Science and Systems.

Further Improvement on Maximum Independent Set in Graphs with Maximum Degree 4

H. Nagamochi, Mingyu Xiao, 2012 .

Enumerating Chemical Mono-Block 3-Augmented Trees with Two Junctions

T. Akutsu, H. Nagamochi, Aleksandar Shurbevski, 2018, ICBBB 2018.

Constant Time Generation of Trees with Degree Bounds (アルゴリズム(AL))

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

Title Efficient enumeration of monocyclic chemical graphs withgiven path frequencies

T. Akutsu, H. Nagamochi, Masaki Suzuki, 2019 .

Title Enumerating tree-like chemical graphs with given upper andlower bounds on path frequencies

T. Akutsu, H. Nagamochi, Masaaki Shimizu, 2018 .

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

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

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

H. Nagamochi, 2004 .

On Onaga's upper bound on the mean values of probabilistic maximum flows

T. Ibaraki, H. Nagamochi, 1992 .

A linear time algorithm for computing 3-edge-connected components in a multigraph

T. Ibaraki, H. Nagamochi, 1992 .

Computing k-Edge-Connected Components of a Multigraph (Special Section on Discrete Mathematics and Its Applications)

H. Nagamochi, Toshimasa Watanabe, 1993 .

VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS

T. Ibaraki, H. Nagamochi, Y. Karuno, 1996 .

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

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

A Simple Extreme Subsets Algorithm for Submodular and Posi-modular Set Functions

H. Nagamochi, 2007 .

Approximating Minimum k-partitions in Submodular Systems

H. Nagamochi, 2007, Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (ICKS'07).

Dynamic Programming Based Approximation Scheme for Locating Disks within Convex Polygons ∗

H. Nagamochi, Hirofumi Aota, Takuro Fukunaga, 2010 .

Optimization Techniques for Robot Path Planning Preprint ?

H. Nagamochi, Aleksandar Shurbevski, Noriaki Hirosue, 2014 .

A Landmark Algorithm for the Time-Dependent Shortest Path Problem Guidance Professor

H. Nagamochi, Liang Zhao, 2008 .

Algorithmic Aspects of Graph Connectivity: Connectivity Augmentation

T. Ibaraki, H. Nagamochi, 2008 .

TR-2006-009 Capacitated b-Edge Dominating Set and Related Problems

Ojas D. Parekh, Ojas Parekh, H. Nagamochi, 2007 .

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

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

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

Hiroshi Nagamochi, Xiaoming Wang, Yoshiyuki Karuno, 2007 .

Optimization Problems and Algorithms in Double-layered Food Packing Systems

H. Nagamochi, Xiaoming Wang, Y. Karuno, 2010 .

Implementing an efficient minimum capacity cut algorithm

T. Ibaraki, H. Nagamochi, Tadashi Ono, 1994, Mathematical programming.

Optimization Games on Graphs(Continuous and Discrete Mathematical Optimization)

Xiaotie Deng, T. Ibaraki, H. Nagamochi, 1997 .

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

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

Approximability of the Minimum Maximal Matching Problem in Planar Graphs

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

Enumeration of Unlabeled Tree by Dynamic Programming

H. Nagamochi, Aleksandar Shurbevski, Ryuji Masui, 2019 .

Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming

T. Akutsu, H. Nagamochi, S. Ota, 2011 .

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

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

A method for generating colorings over graph automorphism

H. Nagamochi, Fei He, 2015 .

Generating Internally Triconnected Rooted Graphs

H. Nagamochi, Bingbing Zhuang, 2010 .

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

Hiroshi Nagamochi, Satoru Miyano, Subhash Suri, 1996 .

Proceedings of the 7th International Symposium on Algorithms and Computation

Hiroshi Nagamochi, Satoru Miyano, Tetsuo Asano, 1996 .

Characterizing Star-PCGs

H. Nagamochi, Mingyu Xiao, 2018, Algorithmica.

Algorithmic Aspects of Graph Connectivity: Bibliography

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

A Branch-and-bound Algorithm Based on Canonical Forms for the Strip Packing Problem ✩

T. Imamichi, H. Nagamochi, Yohei Arahori, 2010 .

Characterizing GSP Mechanisms to Obnoxious Facility Game in Trees via Output Locations Morito

H. Nagamochi, Oomine, 2015 .

Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model

Naveed Ahmed Azam, T. Akutsu, H. Nagamochi, 2022, ArXiv.

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 .

CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS

H. Nagamochi, Aleksandar Shurbevski, Y. Karuno, 2012 .

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 a sequencing problem with a biased bipartite structure

H. Nagamochi, Aleksandar Shurbevski, Y. Karuno, 2016 .

Design Problems with Weighted Degree

H. Nagamochi, Takuro Fukunaga, 2021 .

Characterizing Star-PCGs

H. Nagamochi, Mingyu Xiao, 2018, Algorithmica.

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..

Bounds on Sum Number in GraphsHiroshi NagamochiDept

H. Nagamochi, Mirka Miller, 2007 .

Bl 235 IMPROVED IMPLEMENTATION OF AN APPROXIMATION ALGORITHM VVITH FACTOR TWO FOR A CYCLIC ROUTING PROBLEM OF GRASP-AND-DELIVERY ROBOTS

H. Nagamochi, 2014 .

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 exact algorithm for maximum independent set in degree-5 graphs

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

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

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

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

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

Exact algorithms for dominating induced matching based on graph partition pdf

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

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.

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

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

Exact Algorithms for Maximum Independent Set pdf

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

Algorithmic Aspects of Graph Connectivity

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

Max‐flow min‐cut theorem for the multicommodity flows in certain planar directed networks

T. Ibaraki, H. Nagamochi, 1989 .

Studies on Multicommodity Flows in Directed Networks

Hiroshi Nagamochi, H. Nagamochi, 1988 .

Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables

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

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

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

Multicommodity flows in certain planar directed networks

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

Robust cost colorings

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

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.

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

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

Two-page Book Embedding and Clustered Graph Planarity

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

Complexity Of The Single Vehicle Scheduling Problem On Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, Koji Mochizuki, 1997 .

Independent spanning trees with small depths in iterated line digraphs

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

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

Hiroshi Nagamochi, Tatsuya Akutsu, Morihiro Hayashida, 2008 .

Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes

Naveed Ahmed Azam, T. Akutsu, H. Nagamochi, 2023, IEEE/ACM transactions on computational biology and bioinformatics.

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

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

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.

Efficient enumeration of monocyclic chemical graphs with given path frequencies

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

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

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

Enumerating Treelike Chemical Graphs with Given Path Frequency

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

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.

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

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

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

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

Computing Edge-Connectivity in Multigraphs and Capacitated Graphs

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

Characterizing Mechanisms in Obnoxious Facility Game

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

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

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

Algorithms for the minimum partitioning problems in graphs

Hiroshi Nagamochi, H. Nagamochi, 2007 .

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

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

An exact strip packing algorithm based on canonical forms

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

Drawing c-planar biconnected clustered graphs

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

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

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

Drawing Clustered Graphs on an Orthogonal Grid

Peter Eades, Qing-Wen Feng, P. Eades, 1997, J. Graph Algorithms Appl..

Greedy splitting algorithms for approximating multiway partition problems

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

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

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

Network Design with Edge-Connectivity and Degree Constraints

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

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

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

Bounds on the number of isolates in sum graph labeling

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

Bisecting a 4-connected graph with three resource sets

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

Bisecting a Four-Connected Graph with Three Resource Sets

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

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

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

Title Approximating a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree (Algorithm Engineering as a New Paradigm)

H. Nagamochi, 2018 .

An approximation of the minimum vertex cover in a graph

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

Polyhedral structure of submodular and posi-modular systems

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

Approximating a vehicle scheduling problem with time windows and handling times

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

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 .

Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game

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

Group Strategy-proof Mechanisms for Shuttle Facility Games

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

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..

Combinatorial Optimization

Alberto Caprara, T. Ibaraki, H. Nagamochi, 2012, Lecture Notes in Computer Science.

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

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

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

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

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

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

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

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

Convex drawings of hierarchical planar graphs and clustered planar graphs

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

Convex drawings of graphs with non-convex boundary constraints

Hiroshi Nagamochi, Seok-Hee Hong, H. Nagamochi, 2006, 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 .

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

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

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.

Extension of ICF Classifiers to Real World Data Sets

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

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

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

On sparse subgraphs preserving connectivity properties

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

Implementing an efficient minimum capacity cut algorithm

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

Totally balanced combinatorial optimization games

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

Algorithmic Aspects of the Core of Combinatorial Optimization Games

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

Complexity of the Minimum Base Game on Matroids

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

A fast algorithm for cactus representations of minimum cuts

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

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..

CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK

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

Maximum flows in probabilistic networks

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

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

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

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..

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

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

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.

Linear-tree rule structure for firewall optimization

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

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

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

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

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

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.

A Detachment Algorithm for Inferring a Graph from Path Frequency

Hiroshi Nagamochi, H. Nagamochi, 2009, Algorithmica.

An Improved Approximation to the One-Sided Bilayer Drawing

Hiroshi Nagamochi, H. Nagamochi, 2003, GD.

A Unified Framework for Approximating Multiway Partition Problems

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

Drawing slicing graphs with face areas

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

A Deterministic Algorithm for Finding All Minimum k-Way Cuts

YOKO KAMIDOI, NORIYOSHI YOSHIDA, HIROSHI NAGAMOCHI, 2006, SIAM J. Comput..

On generalized greedy splitting algorithms for multiway partition problems

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

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

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

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

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

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

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

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

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

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..

An improved approximation algorithm for capacitated multicast routings in networks

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

Submodular Minimization via Pathwidth

Hiroshi Nagamochi, H. Nagamochi, 2012, TAMC.

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

Hiroshi Nagamochi, H. Nagamochi, 2004 .

Graph connectivity and its augmentation: applications of MA orderings

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

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

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

Computing All Small Cuts in Undirected Networks

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

Some Reduction Operations to Pairwise Compatibility Graphs

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

Characterizing Star-PCGs

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

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, 2020, Journal of Combinatorial Optimization.

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..

Approximability of the capacitated b-edge dominating set problem

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

Capacitated b-Edge Dominating Set and Related Problems

Ojas D. Parekh, H. Nagamochi, A. Berger, 2007 .

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

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

Complexity and kernels for bipartition into degree-bounded induced graphs

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

A plane graph representation of triconnected graphs

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

Bisecting Two Subsets in 3-Connected Graphs

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

Linear Layouts in Submodular Systems

Hiroshi Nagamochi, H. Nagamochi, 2012, ISAAC.

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

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

A Method for Molecular Design Based on Linear Regression and Integer Programming

Naveed Ahmed Azam, T. Akutsu, H. Nagamochi, 2022, ICBBB.

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).

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

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

Adjustive Linear Regression and Its Application to the Inverse QSAR

T. Akutsu, H. Nagamochi, Kazuya Haraguchi, 2022, BIOINFORMATICS.

An Inverse QSAR Method Based on Decision Tree and Integer Programming

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

Enumerating Naphthalene Isomers of Tree-like Chemical Graphs

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

Two Arc-Disjoint Paths in Eulerian Digraphs

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

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

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

An improved exact algorithm for undirected feedback vertex set

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

An FPT algorithm for edge subset feedback edge set

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

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

Hiroshi Nagamochi, Xiaoming Wang, Yoshiyuki Karuno, 2007 .

The Set Connector Problem in Graphs

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

Minimum cost subpartitions in graphs

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

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 .

Enumeration of Support-Closed Subsets in Confluent Systems

H. Nagamochi, Kazuya Haraguchi, 2022, Algorithmica.

Design of Polynomial-delay Enumeration Algorithms in Transitive Systems pdf

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

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

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

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

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

Approximating the Bipartite TSP and Its Biased Generalization

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

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.

Network design with weighted degree constraints

H. Nagamochi, Takuro Fukunaga, 2009, Discret. Optim..

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

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

Testing Full Outer-2-planarity in Linear Time

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

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..

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

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

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

Hiroshi Nagamochi, Yoshiyuki Karuno, Aleksandar Shurbevski, 2012 .

A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming

Naveed Ahmed Azam, H. Nagamochi, Aleksandar Shurbevski, 2021, IEEE/ACM Transactions on Computational Biology & Bioinformatics.

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

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

An Inverse QSAR Method Based on a Two-Layered Model and Integer Programming

Naveed Ahmed Azam, T. Akutsu, H. Nagamochi, 2021, International Journal of Molecular Sciences.

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.

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.

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.

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.

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.

Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs

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

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.

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

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

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

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

Practical Algorithms for Two-Dimensional Packing

M. Yagiura, H. Nagamochi, S. Imahori, 2007, Handbook of Approximation Algorithms and Metaheuristics.

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

D. R. Fulkerson, L. R. Ford, H. Nagamochi, 2004 .

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

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

Computing All Small Cuts in an Undirected Network

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

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

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

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

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

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

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

for Two-dimensional Packing

Hiroshi Nagamochi, Mutsunori Yagiura, Shinji Imahori, 2006 .

Minimum Transversals in Posimodular Systems

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

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

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

Minimum Transversals in Posi-modular Systems

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

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

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

Title A Ranged Laminar Family in Graphs and Its Application (Mathematical Optimization Theory and its Algorithm)

H. Nagamochi, Toshimasa Ishii, Yuusuke Abe, 2018 .

Approximation Algorithms for a Cyclic Routing Problem of Grasp-and-Delivery Robots

H. Nagamochi, Aleksandar Shurbevski, Y. Karuno, 2010 .

Unranking of small combinations from large sets

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

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..

Generating Trees on Multisets

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

Enumerating Rooted Graphs with Reflectional Block Structures

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

Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming

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

A Dynamic Programming Approach for a Food Packing Problem

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

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 .

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

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

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

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

Minimum Degree Orderings

Hiroshi Nagamochi, H. Nagamochi, 2007, Algorithmica.

Sparse connectivity certificates via MA orderings in graphs

H. Nagamochi, 2006, Discret. Appl. Math..

A Fast Edge-Splitting Algorithm in Edge-Weighted Graphs

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

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

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

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

Hiroshi Nagamochi, H. Nagamochi, 2003 .

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

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

Polynomial-delay Enumeration Algorithms in Set Systems

H. Nagamochi, Kazuya Haraguchi, 2020, Theor. Comput. Sci..

Listing Triconnected Rooted Plane Graphs

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

Enumerating Biconnected Rooted Plane Graphs

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

Enumerating Rooted Biconnected Planar Graphs with Internally Triangulated Faces

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

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

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

Indexing All Rooted Subgraphs of a Rooted Graph

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