On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks. - Hiroshi Nagamochi; Toshihide Ibaraki (Inf. Process. Lett., 1989)

Computing Edge-Connectivity in Multiple and Capacitated Graphs. - Hiroshi Nagamochi; Toshihide Ibaraki (SIGAL International Symposium on Algorithms, 1990)

Multicommodity flows in certain planar directed networks. - Hiroshi Nagamochi; Toshihide Ibaraki (Discret. Appl. Math., 1990)

Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities. - Hiroshi Nagamochi; Masao Fukushima; Toshihide Ibaraki (Networks, 1990)

Maximum flows in probabilistic networks. - Hiroshi Nagamochi; Toshihide Ibaraki (Networks, 1991)

Optimal Coteries for Rings and Related Networks. - Toshihide Ibaraki; Hiroshi Nagamochi; Tiko Kameda (ICDCS, 1992)

A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph. - Hiroshi Nagamochi; Toshihide Ibaraki (Algorithmica, 1992)

Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. - Hiroshi Nagamochi; Toshihide Ibaraki (SIAM J. Discret. Math., 1992)

On sparse subgraphs preserving connectivity properties. - András Frank; Toshihide Ibaraki; Hiroshi Nagamochi (J. Graph Theory, 1993)

Computing All Small Cuts in Undirected Networks. - Hiroshi Nagamochi; Kazuhiro Nishimura; Toshihide Ibaraki (ISAAC, 1994)

Implementing an efficient minimum capacity cut algorithm. - Hiroshi Nagamochi; Tadashi Ono; Toshihide Ibaraki (Math. Program., 1994)

An exact lower bound on the number of cut-sets in multigraphs. - Hideaki Harada; Zheng Sun; Hiroshi Nagamochi (Networks, 1994)

A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. - Hiroshi Nagamochi; Toshihide Ibaraki (IPCO, 1995)

Two Arc Disjoint Paths in Eulerian Diagraphs. - András Frank; Toshihide Ibaraki; Hiroshi Nagamochi (ISAAC, 1995)

Optimal Coteries for Rings and Related Networks. - Toshihide Ibaraki; Hiroshi Nagamochi; Tsunehiko Kameda (Distributed Comput., 1995)

Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. - Hiroshi Nagamochi; Toshihide Ibaraki (STOC, 1996)

Augmenting Edge and Vertex Connectivities Simultaneously. - Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki (ISAAC, 1997)

Combinatorial Optimization Games. - Xiaotie Deng; Toshihide Ibaraki; Hiroshi Nagamochi (SODA, 1997)

Computing Edge-Connectivity Augmentation Function in Õ(nm) Time. - Hiroshi Nagamochi; Takashi Shiraki; Toshihide Ibaraki (SODA, 1997)

Vehicle scheduling on a tree with release and handling times. - Yoshiyuki Karuno; Hiroshi Nagamochi; Toshihide Ibaraki (Ann. Oper. Res., 1997)

Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. - Hiroshi Nagamochi; Toshihide Ibaraki (J. Comb. Optim., 1997)

Complexity of the Minimum Base Game on Matroids. - Hiroshi Nagamochi; Dao-Zhi Zeng; Naohisa Kabutoya; Toshihide Ibaraki (Math. Oper. Res., 1997)

Computing All Small Cuts in an Undirected Network. - Hiroshi Nagamochi; Kazuhiro Nishimura; Toshihide Ibaraki (SIAM J. Discret. Math., 1997)

Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. - Hiroshi Nagamochi; Peter Eades (IPCO, 1998)

K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. - Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki (ISAAC, 1998)

Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. - Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki (SODA, 1998)

A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations. - Toshihide Ibaraki; Alexander V. Karzanov; Hiroshi Nagamochi (Comb., 1998)

A Note on Minimizing Submodular Functions. - Hiroshi Nagamochi; Toshihide Ibaraki (Inf. Process. Lett., 1998)

Two Arc-Disjoint Paths in Eulerian Digraphs. - András Frank; Toshihide Ibaraki; Hiroshi Nagamochi (SIAM J. Discret. Math., 1998)

An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree. - Hiroshi Nagamochi; Toshihide Ibaraki (COCOON, 1999)

Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph. - Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki (ESA, 1999)

Bisecting Two Subsets in 3-Connected Graphs. - Hiroshi Nagamochi; Tibor Jordán; Yoshitaka Nakao; Toshihide Ibaraki (ISAAC, 1999)

Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time. - Hiroshi Nagamochi; Toshihide Ibaraki (J. Algorithms, 1999)

Drawing Clustered Graphs on an Orthogonal Grid. - Peter Eades; Qing-Wen Feng; Hiroshi Nagamochi (J. Graph Algorithms Appl., 1999)

Algorithmic Aspects of the Core of Combinatorial Optimization Games. - Xiaotie Deng; Toshihide Ibaraki; Hiroshi Nagamochi (Math. Oper. Res., 1999)

Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph. - Toshimasa Ishii; Hiroshi Nagamochi (ISAAC, 2000)

On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph. - Toshimasa Ishii; Hiroshi Nagamochi (SWAT, 2000)

A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs. - Hiroshi Nagamochi; S. Nakamura; Toshihide Ibaraki (Algorithmica, 2000)

Polyhedral structure of submodular and posi-modular systems. - Hiroshi Nagamochi; Toshihide Ibaraki (Discret. Appl. Math., 2000)

Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph. - Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki (J. Comb. Optim., 2000)

A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. - Hiroshi Nagamochi; Shigeki Katayama; Toshihide Ibaraki (J. Comb. Optim., 2000)

Totally balanced combinatorial optimization games. - Xiaotie Deng; Toshihide Ibaraki; Hiroshi Nagamochi; Wenan Zang (Math. Program., 2000)

A fast algorithm for computing minimum 3-way and 4-way cuts. - Hiroshi Nagamochi; Toshihide Ibaraki (Math. Program., 2000)

A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. - Yoshiyuki Karuno; Hiroshi Nagamochi (ESA, 2001)

A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. - Yoshiyuki Karuno; Hiroshi Nagamochi (ISAAC, 2001)

A Unified Framework for Approximating Multiway Partition Problems. - Liang Zhao 013; Hiroshi Nagamochi; Toshihide Ibaraki (ISAAC, 2001)

A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. - Liang Zhao 013; Hiroshi Nagamochi; Toshihide Ibaraki (STACS, 2001)

Independent spanning trees with small depths in iterated line digraphs. - Toru Hasunuma; Hiroshi Nagamochi (Discret. Appl. Math., 2001)

Bounds on the number of isolates in sum graph labeling. - Hiroshi Nagamochi; Mirka Miller; Slamin (Discret. Math., 2001)

Minimum cost source location problem with vertex-connectivity requirements in digraphs. - Hiroshi Nagamochi; Toshimasa Ishii; Hiro Ito (Inf. Process. Lett., 2001)

An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. - Hiroshi Nagamochi; Toru Hasunuma (J. Algorithms, 2001)

Augmenting a Submodular and Posi-modular Set Function by a Multigraph. - Hiroshi Nagamochi; Takashi Shiraki; Toshihide Ibaraki (J. Comb. Optim., 2001)

Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. - Liang Zhao 013; Hiroshi Nagamochi; Toshihide Ibaraki (J. Comb. Optim., 2001)

Multigraph augmentation under biconnectivity and general edge-connectivity requirements. - Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki (Networks, 2001)

File Transfer Tree Problems. - Hiro Ito; Hiroshi Nagamochi; Yosuke Sugiyama; Masato Fujita (ISAAC, 2002)

A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage. - Yoshiyuki Karuno; Hiroshi Nagamochi (ISAAC, 2002)

Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. - Hiro Ito; Hiroshi Nagamochi (JCDCG, 2002)

Convex Embeddings and Bisections of 3-Connected Graphs 1. - Hiroshi Nagamochi; Tibor Jordán; Yoshitaka Nakao; Toshihide Ibaraki (Comb., 2002)

A 2-approximation algorithm for the minimum weight edge dominating set problem. - Toshihiro Fujito; Hiroshi Nagamochi (Discret. Appl. Math., 2002)

Graph connectivity and its augmentation: applications of MA orderings. - Hiroshi Nagamochi; Toshihide Ibaraki (Discret. Appl. Math., 2002)

Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. - Yoshiyuki Karuno; Hiroshi Nagamochi; Toshihide Ibaraki (Networks, 2002)

An Improved Approximation to the One-Sided Bilayer Drawing. - Hiroshi Nagamochi (GD, 2003)

Convex Drawing for c-Planar Biconnected Clustered Graphs. - Hiroshi Nagamochi; Katsutoshi Kuroya (GD, 2003)

A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags. - Yoshiyuki Karuno; Hiroshi Nagamochi (ISAAC, 2003)

Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem. - Hiroshi Nagamochi; Kohei Okada (ISAAC, 2003)

2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. - Yoshiyuki Karuno; Hiroshi Nagamochi (Discret. Appl. Math., 2003)

An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree. - Hiroshi Nagamochi (Discret. Appl. Math., 2003)

On the minimum local-vertex-connectivity augmentation in graphs. - Hiroshi Nagamochi; Toshimasa Ishii (Discret. Appl. Math., 2003)

A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. - Liang Zhao 013; Hiroshi Nagamochi; Toshihide Ibaraki (Discret. Appl. Math., 2003)

Approximability of the Minimum Maximal Matching Problem in Planar Graphs. - Hiroshi Nagamochi; Yukihiro Nishida; Toshihide Ibaraki (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem. - Liang Zhao 013; Hiroshi Nagamochi; Toshihide Ibaraki (Inf. Process. Lett., 2003)

An Edge-Splitting Algorithm in Planar Graphs. - Hiroshi Nagamochi; Peter Eades (J. Comb. Optim., 2003)

Approximating the Minmax Subtree Cover Problem in a Cactus. - Hiroshi Nagamochi; Taizo Kawada (ISAAC, 2004)

A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree. - Hiroshi Nagamochi; Kohei Okada (Discret. Appl. Math., 2004)

On generalized greedy splitting algorithms for multiway partition problems. - Liang Zhao 013; Hiroshi Nagamochi; Toshihide Ibaraki (Discret. Appl. Math., 2004)

A simple recognition of maximal planar graphs. - Hiroshi Nagamochi; Takahisa Suzuki; Toshimasa Ishii (Inf. Process. Lett., 2004)

Counting edge crossings in a 2-layered drawing. - Hiroshi Nagamochi; Nobuyasu Yamada (Inf. Process. Lett., 2004)

An approximability result of the multi-vehicle scheduling problem on a path with release and handling times. - Yoshiyuki Karuno; Hiroshi Nagamochi (Theor. Comput. Sci., 2004)

Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems. - Takuro Fukunaga; Hiroshi Nagamochi (COCOON, 2005)

Bisecting a Four-Connected Graph with Three Resource Sets. - Toshimasa Ishii; Kengo Iwata; Hiroshi Nagamochi (ISAAC, 2005)

Packing Unit Squares in a Rectangle. - Hiroshi Nagamochi (Electron. J. Comb., 2005)

An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings. - Hiroshi Nagamochi (Discret. Comput. Geom., 2005)

On 2-Approximation to the Vertex-Connectivity in Graphs. - Hiroshi Nagamochi (IEICE Trans. Inf. Syst., 2005)

Approximating the Minmax Rooted-Subtree Cover Problem. - Hiroshi Nagamochi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

On computing minimum (s, t)-cuts in digraphs. - Hiroshi Nagamochi (Inf. Process. Lett., 2005)

A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph. - Hiroshi Nagamochi (J. Algorithms, 2005)

Greedy splitting algorithms for approximating multiway partition problems. - Liang Zhao 013; Hiroshi Nagamochi; Toshihide Ibaraki (Math. Program., 2005)

On the one-sided crossing minimization in a bipartite graph with large degrees. - Hiroshi Nagamochi (Theor. Comput. Sci., 2005)

A robust algorithm for bisecting a triconnected graph with two resource sets. - Hiroshi Nagamochi; Kengo Iwata; Toshimasa Ishii (Theor. Comput. Sci., 2005)

Minimum Transversals in Posi-modular Systems. - Mariko Sakashita; Kazuhisa Makino; Hiroshi Nagamochi; Satoru Fujishige (ESA, 2006)

Contention-Free l-Planes in Optically Burst-Switched WDM Networks. - Kouji Hirata; Takahiro Matsuda 001; Hiroshi Nagamochi; Tetsuya Takine (GLOBECOM, 2006)

Convex Drawings of Graphs with Non-convex Boundary. - Seok-Hee Hong 001; Hiroshi Nagamochi (WG, 2006)

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. - Peter Eades; Qing-Wen Feng; Xuemin Lin 001; Hiroshi Nagamochi (Algorithmica, 2006)

Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. - Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki (Algorithmica, 2006)

Two equivalent measures on weighted hypergraphs. - Hiro Ito; Hiroshi Nagamochi (Discret. Appl. Math., 2006)

Sparse connectivity certificates via MA orderings in graphs. - Hiroshi Nagamochi (Discret. Appl. Math., 2006)

Minmax subtree cover problem on cacti. - Hiroshi Nagamochi; Taizo Kawada (Discret. Appl. Math., 2006)

Augmenting forests to meet odd diameter requirements. - Toshimasa Ishii; Shigeyuki Yamamoto; Hiroshi Nagamochi (Discret. Optim., 2006)

Some Theorems on Detachments Preserving Local-Edge-Connectivity. - Takuro Fukunaga; Hiroshi Nagamochi (Electron. Notes Discret. Math., 2006)

A Fast Edge-Splitting Algorithm in Edge-Weighted Graphs. - Hiroshi Nagamochi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Increasing the Edge-Connectivity by Contracting a Vertex Subset in Graphs. - Hiroshi Nagamochi (IEICE Trans. Inf. Syst., 2006)

Packing Soft Rectangles. - Hiroshi Nagamochi (Int. J. Found. Comput. Sci., 2006)

A Novel Clustering Method for Analysis of Biological Networks using Maximal Components of Graphs. - Morihiro Hayashida; Tatsuya Akutsu; Hiroshi Nagamochi (APBC, 2007)

Linear-tree rule structure for firewall optimization. - Liang Zhao 013; A. Shimae; Hiroshi Nagamochi (Communications, Internet, and Information Technology, 2007)

"Rent-or-Buy" Scheduling and Cost Coloring Problems. - Takuro Fukunaga; Magnús M. Halldórsson; Hiroshi Nagamochi (FSTTCS, 2007)

Extension of ICF Classifiers to Real World Data Sets. - Kazuya Haraguchi; Hiroshi Nagamochi (IEA/AIE, 2007)

The Set Connector Problem in Graphs. - Takuro Fukunaga; Hiroshi Nagamochi (IPCO, 2007)

A Multi-sphere Scheme for 2D and 3D Packing Problems. - Takashi Imamichi; Hiroshi Nagamochi (SLS, 2007)

A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem. - Mutsunori Yagiura; Akira Komiya; Kenya Kojima; Koji Nonobe; Hiroshi Nagamochi; Toshihide Ibaraki; Fred W. Glover (SLS, 2007)

Orthogonal Drawings for Plane Graphs with Specified Face Areas. - Akifumi Kawaguchi; Hiroshi Nagamochi (TAMC, 2007)

An Efficient Algorithm for Generating Colored Outerplanar Graphs. - Jiexun Wang; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (TAMC, 2007)

The source location problem with local 3-vertex-connectivity requirements. - Toshimasa Ishii; Hitoshi Fujita; Hiroshi Nagamochi (Discret. Appl. Math., 2007)

Bisecting a 4-connected graph with three resource sets. - Toshimasa Ishii; Kengo Iwata; Hiroshi Nagamochi (Discret. Appl. Math., 2007)

An approximation algorithm for dissecting a rectangle into rectangles with specified areas. - Hiroshi Nagamochi; Yuusuke Abe (Discret. Appl. Math., 2007)

Drawing c-planar biconnected clustered graphs. - Hiroshi Nagamochi; Katsutoshi Kuroya (Discret. Appl. Math., 2007)

Generalizing the induced matching by edge capacity constraints. - Takuro Fukunaga; Hiroshi Nagamochi (Discret. Optim., 2007)

Approximating a Generalization of Metric TSP. - Takuro Fukunaga; Hiroshi Nagamochi (IEICE Trans. Inf. Syst., 2007)

Contention-Free lambda-Planes in Optically Burst-Switched WDM Networks. - Kouji Hirata; Takahiro Matsuda 001; Hiroshi Nagamochi; Tetsuya Takine (IEICE Trans. Commun., 2007)

Approximation Algorithms for Multicast Routings in a Network with Multi-Sources. - Ehab Morsy; Hiroshi Nagamochi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007)

Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex. - Hiroshi Nagamochi (IEICE Trans. Inf. Syst., 2007)

Minimum cost subpartitions in graphs. - Hiroshi Nagamochi; Yoko Kamidoi (Inf. Process. Lett., 2007)

Approximating the minmax rooted-tree cover in a tree. - Hiroshi Nagamochi; Kohei Okada (Inf. Process. Lett., 2007)

A Deterministic Algorithm for Finding All Minimum k-Way Cuts. - Yoko Kamidoi; Noriyoshi Yoshida; Hiroshi Nagamochi (SIAM J. Comput., 2007)

Approximability of the capacitated b-edge dominating set problem. - André Berger; Takuro Fukunaga; Hiroshi Nagamochi; Ojas Parekh (Theor. Comput. Sci., 2007)

Minimum cost source location problem with local 3-vertex-connectivity requirements. - Toshimasa Ishii; Hitoshi Fujita; Hiroshi Nagamochi (Theor. Comput. Sci., 2007)

Vehicle Scheduling Problems in Graphs. - Yoshiyuki Karuno; Hiroshi Nagamochi (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Practical Algorithms for Two-Dimensional Packing. - Mutsunori Yagiura; Hiroshi Nagamochi; Shinji Imahori (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Algorithmic Aspects of Graph Connectivity - Hiroshi Nagamochi; Toshihide Ibaraki (Cambridge University Press, 2008)

Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints. - Seok-Hee Hong 001; Hiroshi Nagamochi (COCOON, 2008)

Approximating the Generalized Capacitated Tree-Routing Problem. - Ehab Morsy; Hiroshi Nagamochi (COCOON, 2008)

Removing Node Overlaps Using Multi-sphere Scheme. - Takashi Imamichi; Yohei Arahori; Jaeseong Gim; Seok-Hee Hong 001; Hiroshi Nagamochi (GD, 2008)

Approximating Crossing Minimization in Radial Layouts. - Seok-Hee Hong 001; Hiroshi Nagamochi (LATIN, 2008)

Robust cost colorings. - Takuro Fukunaga; Magnús M. Halldórsson; Hiroshi Nagamochi (SODA, 2008)

Convex drawings of graphs with non-convex boundary constraints. - Seok-Hee Hong 001; Hiroshi Nagamochi (Discret. Appl. Math., 2008)

Performance Analysis of a Collision Detection Algorithm of Spheres Based on Slab Partitioning. - Takashi Imamichi; Hiroshi Nagamochi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

Worst Case Analysis for Pickup and Delivery Problems with Transfer. - Yoshitaka Nakao; Hiroshi Nagamochi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

A Clustering Method for Analysis of Sequence Similarity Networks of Proteins Using Maximal Components of Graphs. - Morihiro Hayashida; Tatsuya Akutsu; Hiroshi Nagamochi (Inf. Media Technol., 2008)

Enumerating Treelike Chemical Graphs with Given Path Frequency. - Hiroki Fujiwara; Jiexun Wang; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (J. Chem. Inf. Model., 2008)

An improved approximation algorithm for capacitated multicast routings in networks. - Ehab Morsy; Hiroshi Nagamochi (Theor. Comput. Sci., 2008)

Approximating a vehicle scheduling problem with time windows and handling times. - Hiroshi Nagamochi; Takaharu Ohnishi (Theor. Comput. Sci., 2008)

Upward Star-Shaped Polyhedral Graphs. - Seok-Hee Hong 001; Hiroshi Nagamochi (ISAAC, 2009)

Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming. - Tomoki Imada; Shunsuke Ota; Hiroshi Nagamochi; Tatsuya Akutsu (ISAAC, 2009)

Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries. - Yoshitaka Nakao; Hiroshi Nagamochi (ISAAC, 2009)

Bipartite Graph Representation of Multiple Decision Table Classifiers. - Kazuya Haraguchi; Seok-Hee Hong 001; Hiroshi Nagamochi (SAGA, 2009)

A Detachment Algorithm for Inferring a Graph from Path Frequency. - Hiroshi Nagamochi (Algorithmica, 2009)

Eulerian detachments with local edge-connectivity. - Takuro Fukunaga; Hiroshi Nagamochi (Discret. Appl. Math., 2009)

An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. - Takashi Imamichi; Mutsunori Yagiura; Hiroshi Nagamochi (Discret. Optim., 2009)

Exact algorithms for the two-dimensional strip packing problem with and without rotations. - Mitsutoshi Kenmochi; Takashi Imamichi; Koji Nonobe; Mutsunori Yagiura; Hiroshi Nagamochi (Eur. J. Oper. Res., 2009)

New Approximation to the One-sided Radial Crossing Minimization. - Seok-Hee Hong 001; Hiroshi Nagamochi (J. Graph Algorithms Appl., 2009)

Network Design with Edge-Connectivity and Degree Constraints. - Takuro Fukunaga; Hiroshi Nagamochi (Theory Comput. Syst., 2009)

Minimum Transversals in Posimodular Systems. - Mariko Sakashita; Kazuhisa Makino; Hiroshi Nagamochi; Satoru Fujishige (SIAM J. Discret. Math., 2009)

Drawing slicing graphs with face areas. - Akifumi Kawaguchi; Hiroshi Nagamochi (Theor. Comput. Sci., 2009)

An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem. - Tatsuya Ohshima; Pipaporn Eumthurapojn; Liang Zhao 013; Hiroshi Nagamochi (CGGA, 2010)

Enumerating Rooted Graphs with Reflectional Block Structures. - Bingbing Zhuang; Hiroshi Nagamochi (CIAC, 2010)

Listing Triconnected Rooted Plane Graphs. - Bingbing Zhuang; Hiroshi Nagamochi (COCOA (2), 2010)

FPTAS's for Some Cut Problems in Weighted Trees. - Mingyu Xiao 001; Takuro Fukunaga; Hiroshi Nagamochi (FAW, 2010)

Constant Time Generation of Biconnected Rooted Plane Graphs. - Bingbing Zhuang; Hiroshi Nagamochi (FAW, 2010)

Generating Trees on Multisets. - Bingbing Zhuang; Hiroshi Nagamochi (ISAAC (1), 2010)

Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables. - Kazuya Haraguchi; Seok-Hee Hong 001; Hiroshi Nagamochi (LION, 2010)

Generating Internally Triconnected Rooted Plane Graphs. - Bingbing Zhuang; Hiroshi Nagamochi (TAMC, 2010)

A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs. - Seok-Hee Hong 001; Hiroshi Nagamochi (Algorithmica, 2010)

Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings. - Seok-Hee Hong 001; Hiroshi Nagamochi (Algorithmica, 2010)

Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs. - Toshimasa Ishii; Yoko Akiyama; Hiroshi Nagamochi (Algorithmica, 2010)

Minimum Degree Orderings. - Hiroshi Nagamochi (Algorithmica, 2010)

An algorithm for constructing star-shaped drawings of plane graphs. - Seok-Hee Hong 001; Hiroshi Nagamochi (Comput. Geom., 2010)

Network design with weighted degree constraints. - Takuro Fukunaga; Hiroshi Nagamochi (Discret. Optim., 2010)

Approximation to the Minimum Cost Edge Installation Problem. - Ehab Morsy; Hiroshi Nagamochi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010)

Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut. - Yusuke Ishida; Yuki Kato; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (J. Chem. Inf. Model., 2010)

Convex drawings of hierarchical planar graphs and clustered planar graphs. - Seok-Hee Hong 001; Hiroshi Nagamochi (J. Discrete Algorithms, 2010)

On the approximation of the generalized capacitated tree-routing problem. - Ehab Morsy; Hiroshi Nagamochi (J. Discrete Algorithms, 2010)

A plane graph representation of triconnected graphs. - Shunsuke Ota; Ehab Morsy; Hiroshi Nagamochi (Theor. Comput. Sci., 2010)

Parameterized Edge Dominating Set in Cubic Graphs - (Extended Abstract). - Mingyu Xiao 001; Hiroshi Nagamochi (FAW-AAIM, 2011)

Further Improvement on Maximum Independent Set in Degree-4 Graphs. - Mingyu Xiao 001; Hiroshi Nagamochi (COCOA, 2011)

Improved Bounds for Minimum Fault-Tolerant Gossip Graphs. - Toru Hasunuma; Hiroshi Nagamochi (WG, 2011)

Editorial: ISAAC 2008 Special Issue. - Seok-Hee Hong 001; Hiroshi Nagamochi (Algorithmica, 2011)

Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra. - Seok-Hee Hong 001; Hiroshi Nagamochi (Algorithmica, 2011)

Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies. - Masaaki Shimizu; Hiroshi Nagamochi; Tatsuya Akutsu (BMC Bioinform., 2011)

Kernel Methods for Chemical Compounds: From Classification to Design. - Tatsuya Akutsu; Hiroshi Nagamochi (IEICE Trans. Inf. Syst., 2011)

Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs. - Bingbing Zhuang; Hiroshi Nagamochi (IEICE Trans. Inf. Syst., 2011)

Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs. - Bingbing Zhuang; Hiroshi Nagamochi (IEICE Trans. Inf. Syst., 2011)

Kansei engineering, humans and computers: efficient dynamic programming algorithms for combinatorial food packing problems. - Shinji Imahori; Yoshiyuki Karuno; Hiroshi Nagamochi; Xiaoming Wang (Int. J. Biom., 2011)

An Approximation Algorithm for Locating Maximal Disks within Convex Polygons. - Hirofumi Aota; Takuro Fukunaga; Hiroshi Nagamochi (Int. J. Comput. Geom. Appl., 2011)

Guest Editors' Foreword. - Seok-Hee Hong 001; Hiroshi Nagamochi (Int. J. Comput. Geom. Appl., 2011)

An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots. - Yoshiyuki Karuno; Hiroshi Nagamochi; Aleksandar Shurbevski (J. Adv. Comput. Intell. Intell. Informatics, 2011)

Efficient Enumeration of Stereoisomers of Outerplanar Chemical Graphs Using Dynamic Programming. - Tomoki Imada; Shunsuke Ota; Hiroshi Nagamochi; Tatsuya Akutsu (J. Chem. Inf. Model., 2011)

Approximating capacitated tree-routings in networks. - Ehab Morsy; Hiroshi Nagamochi (J. Comb. Optim., 2011)

Minmax Tree Cover in the Euclidean Space. - Seigo Karakawa; Ehab Morsy; Hiroshi Nagamochi (J. Graph Algorithms Appl., 2011)

Efficient branch-and-bound algorithms for weighted MAX-2-SAT. - Toshihide Ibaraki; Takashi Imamichi; Yuichi Koga; Hiroshi Nagamochi; Koji Nonobe; Mutsunori Yagiura (Math. Program., 2011)

On the one-dimensional stock cutting problem in the paper tube industry. - Kazuki Matsumoto; Shunji Umetani; Hiroshi Nagamochi (J. Sched., 2011)

Cop-robber guarding game with cycle robber-region. - Hiroshi Nagamochi (Theor. Comput. Sci., 2011)

The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights. - Cong Zhang; Hiroshi Nagamochi (CATS, 2012)

Characterizing Mechanisms in Obnoxious Facility Game. - Ken Ibara; Hiroshi Nagamochi (COCOA, 2012)

An Improved Exact Algorithm for TSP in Degree-4 Graphs. - Mingyu Xiao 001; Hiroshi Nagamochi (COCOON, 2012)

Linear Layouts in Submodular Systems. - Hiroshi Nagamochi (ISAAC, 2012)

Submodular Minimization via Pathwidth. - Hiroshi Nagamochi (TAMC, 2012)

A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners. - Seok-Hee Hong 001; Hiroshi Nagamochi (Algorithmica, 2012)

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. - Kazumasa Okumoto; Takuro Fukunaga; Hiroshi Nagamochi (Algorithmica, 2012)

An exact strip packing algorithm based on canonical forms. - Yohei Arahori; Takashi Imamichi; Hiroshi Nagamochi (Comput. Oper. Res., 2012)

Indexing All Rooted Subgraphs of a Rooted Graph. - Tomoki Imada; Hiroshi Nagamochi (IEICE Trans. Inf. Syst., 2012)

Protein complex prediction via improved verification methods using constrained domain-domain matching. - Yang Zhao 018; Morihiro Hayashida; Jose C. Nacher; Hiroshi Nagamochi; Tatsuya Akutsu (Int. J. Bioinform. Res. Appl., 2012)

An FPT algorithm for edge subset feedback edge set. - Mingyu Xiao 001; Hiroshi Nagamochi (Inf. Process. Lett., 2012)

Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints. - Seok-Hee Hong 001; Hiroshi Nagamochi (Theor. Comput. Sci., 2012)

Optimization Techniques for Robot Path Planning. - Aleksandar Shurbevski; Noriaki Hirosue; Hiroshi Nagamochi (ICT Innovations, 2013)

Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems. - Aleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki Karuno (IEICE Trans. Inf. Syst., 2013)

Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3. - Mingyu Xiao 001; Hiroshi Nagamochi (IEICE Trans. Inf. Syst., 2013)

Breadth-First Search Approach to Enumeration of Tree-like Chemical Compounds. - Yang Zhao 018; Morihiro Hayashida; Jira Jindalertudomdee; Hiroshi Nagamochi; Tatsuya Akutsu (J. Bioinform. Comput. Biol., 2013)

FPTASs for trimming weighted trees. - Mingyu Xiao 001; Takuro Fukunaga; Hiroshi Nagamochi (Theor. Comput. Sci., 2013)

Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs. - Mingyu Xiao 001; Hiroshi Nagamochi (Theor. Comput. Sci., 2013)

Parameterized edge dominating set in graphs with degree bounded by 3. - Mingyu Xiao 001; Hiroshi Nagamochi (Theor. Comput. Sci., 2013)

Approximating the Bipartite TSP and Its Biased Generalization. - Aleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki Karuno (WALCOM, 2014)

Efficient enumeration of monocyclic chemical graphs with given path frequencies. - Masaki Suzuki; Hiroshi Nagamochi; Tatsuya Akutsu (J. Cheminformatics, 2014)

Unranking of small combinations from large sets. - Toshihiro Shimizu; Takuro Fukunaga; Hiroshi Nagamochi (J. Discrete Algorithms, 2014)

A refined exact algorithm for Edge Dominating Set. - Mingyu Xiao 001; Hiroshi Nagamochi (Theor. Comput. Sci., 2014)

A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs. - Norhazwani Md Yunos; Aleksandar Shurbevski; Hiroshi Nagamochi (JCDCGG, 2015)

Testing Full Outer-2-planarity in Linear Time. - Seok-Hee Hong 001; Hiroshi Nagamochi (WG, 2015)

Exact algorithms for dominating induced matching based on graph partition. - Mingyu Xiao 001; Hiroshi Nagamochi (Discret. Appl. Math., 2015)

Some Reduction Procedure for Computing Pathwidth of Undirected Graphs. - Masataka Ikeda; Hiroshi Nagamochi (IEICE Trans. Inf. Syst., 2015)

An improved exact algorithm for undirected feedback vertex set. - Mingyu Xiao 001; Hiroshi Nagamochi (J. Comb. Optim., 2015)

Enumerating Naphthalene Isomers of Tree-like Chemical Graphs. - Fei He; Akiyoshi Hanai; Hiroshi Nagamochi; Tatsuya Akutsu (BIOINFORMATICS, 2016)

Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time. - Seok-Hee Hong 001; Hiroshi Nagamochi (GD, 2016)

A Linear-Time Algorithm for Integral Multiterminal Flows in Trees. - Mingyu Xiao 001; Hiroshi Nagamochi (ISAAC, 2016)

An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure. - Mingyu Xiao 001; Hiroshi Nagamochi (Algorithmica, 2016)

An exact algorithm for maximum independent set in degree-5 graphs. - Mingyu Xiao 001; Hiroshi Nagamochi (Discret. Appl. Math., 2016)

Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees. - Morito Oomine; Hiroshi Nagamochi (IEICE Trans. Inf. Syst., 2016)

An Improved Algorithm for Parameterized Edge Dominating Set Problem. - Ken Iwaide; Hiroshi Nagamochi (J. Graph Algorithms Appl., 2016)

An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4. - Mingyu Xiao 001; Hiroshi Nagamochi (Theory Comput. Syst., 2016)

Exact algorithms for maximum independent set. - Mingyu Xiao 001; Hiroshi Nagamochi (Inf. Comput., 2017)

An Exact Algorithm for Lowest Edge Dominating Set. - Ken Iwaide; Hiroshi Nagamochi (IEICE Trans. Inf. Syst., 2017)

A refined algorithm for maximum independent set in degree-4 graphs. - Mingyu Xiao 001; Hiroshi Nagamochi (J. Comb. Optim., 2017)

Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game. - Morito Oomine; Aleksandar Shurbevski; Hiroshi Nagamochi (J. Graph Algorithms Appl., 2017)

Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route. - Mohd Shahrizan Othman; Aleksandar Shurbevski; Yoshiyuki Karuno; Hiroshi Nagamochi (J. Inf. Process., 2017)

An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs. - Norhazwani Md Yunos; Aleksandar Shurbevski; Hiroshi Nagamochi (J. Inf. Process., 2017)

Complexity and kernels for bipartition into degree-bounded induced graphs. - Mingyu Xiao 001; Hiroshi Nagamochi (Theor. Comput. Sci., 2017)

Practical Algorithms for Two-Dimensional Packing of Rectangles. - Shinji Imahori; Mutsunori Yagiura; Hiroshi Nagamochi (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable. - Mingyu Xiao 001; Hiroshi Nagamochi (ICALP, 2018)

Enumerating Chemical Mono-Block 3-Augmented Trees with Two Junctions. - Yuui Tamura; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu (ICBBB, 2018)

Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem. - Mohd Shahrizan Othman; Aleksandar Shurbevski; Hiroshi Nagamochi (IEICE Trans. Inf. Syst., 2018)

The Stable Roommates Problem with Unranked Entries. - Hiroaki Suto; Aleksandar Shurbevski; Hiroshi Nagamochi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs. - Jinghui Li; Hiroshi Nagamochi; Tatsuya Akutsu (IEEE ACM Trans. Comput. Biol. Bioinform., 2018)

Simpler algorithms for testing two-page book embedding of partitioned graphs. - Seok-Hee Hong 001; Hiroshi Nagamochi (Theor. Comput. Sci., 2018)

A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions. - Kazuya Haraguchi; Hiroshi Nagamochi (ISAAC, 2019)

A linear-time algorithm for testing full outer-2-planarity. - Seok-Hee Hong 001; Hiroshi Nagamochi (Discret. Appl. Math., 2019)

λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks. - Yuhei Fukui; Aleksandar Shurbevski; Hiroshi Nagamochi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Acute Constraints in Straight-Line Drawings of Planar Graphs. - Akane Seto; Aleksandar Shurbevski; Hiroshi Nagamochi; Peter Eades (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets. - Kazuya Haraguchi; Yusuke Momoi; Aleksandar Shurbevski; Hiroshi Nagamochi (J. Graph Algorithms Appl., 2019)

Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs. - Yuhei Nishiyama; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu (IEEE ACM Trans. Comput. Biol. Bioinform., 2019)

A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility. - Naveed Ahmed Azam; Rachaya Chiewvanichakorn; Fan Zhang; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu (BIOINFORMATICS, 2020)

Path-Monotonic Upward Drawings of Graphs. - Seok-Hee Hong 001; Hiroshi Nagamochi (COCOON, 2020)

A Method for the Inverse QSAR/QSPR Based on Artificial Neural Networks and Mixed Integer Linear Programming. - Rachaya Chiewvanichakorn; Chenxi Wang; Zhe Zhang; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu (ICBBB, 2020)

A New Integer Linear Programming Formulation to the Inverse QSAR/QSPR for Acyclic Chemical Compounds Using Skeleton Trees. - Fan Zhang; Jianshen Zhu; Rachaya Chiewvanichakorn; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu (IEA/AIE, 2020)

Characterizing Star-PCGs. - Mingyu Xiao 001; Hiroshi Nagamochi (Algorithmica, 2020)

A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming. - Jianshen Zhu; Chenxi Wang; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu (Algorithms, 2020)

Design of Polynomial-delay Enumeration Algorithms in Transitive Systems. - Kazuya Haraguchi; Hiroshi Nagamochi (CoRR, 2020)

Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies. - Yuui Tamura; Yuhei Nishiyama; Chenxi Wang; Yanming Sun; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu (CoRR, 2020)

Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications. - Kyousuke Yamashita; Ryuji Masui; Xiang Zhou; Chenxi Wang; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu (CoRR, 2020)

A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming. - Tatsuya Akutsu; Hiroshi Nagamochi (CoRR, 2020)

Bounded-Degree Cut is Fixed-Parameter Tractable. - Mingyu Xiao 001; Hiroshi Nagamochi (CoRR, 2020)

An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops. - Naveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi (Entropy, 2020)

Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank. - Naveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi (Entropy, 2020)

Some reduction operations to pairwise compatibility graphs. - Mingyu Xiao 001; Hiroshi Nagamochi (Inf. Process. Lett., 2020)

Group Strategy-proof Mechanisms for Shuttle Facility Games. - Yuhei Fukui; Aleksandar Shurbevski; Hiroshi Nagamochi (J. Inf. Process., 2020)

Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search. - Naveed Ahmed Azam; Jianshen Zhu; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (BIBM, 2021)

An Inverse QSAR Method Based on Decision Tree and Integer Programming. - Kouki Tanaka; Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (ICIC (2), 2021)

An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures. - Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (IEA/AIE (1), 2021)

A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming. - Naveed Ahmed Azam; Jianshen Zhu; Yanming Sun; Yu Shi; Aleksandar Shurbevski; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (Algorithms Mol. Biol., 2021)

An Inverse QSAR Method Based on Linear Regression and Integer Programming. - Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (CoRR, 2021)

A method for enumerating pairwise compatibility graphs with a given number of vertices. - Naveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi (Discret. Appl. Math., 2021)

Re-embedding a 1-plane graph for a straight-line drawing in linear time. - Seok-Hee Hong 001; Hiroshi Nagamochi (Theor. Comput. Sci., 2021)

Adjustive Linear Regression and Its Application to the Inverse QSAR. - Jianshen Zhu; Kazuya Haraguchi; Hiroshi Nagamochi; Tatsuya Akutsu (BIOINFORMATICS, 2022)

A Method for Molecular Design Based on Linear Regression and Integer Programming. - Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (ICBBB, 2022)

Enumeration of Support-Closed Subsets in Confluent Systems. - Kazuya Haraguchi; Hiroshi Nagamochi (Algorithmica, 2022)

A new approach to the design of acyclic chemical compounds using skeleton trees and integer linear programming. - Fan Zhang; Jianshen Zhu; Rachaya Chiewvanichakorn; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu (Appl. Intell., 2022)

Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model. - Jianshen Zhu; Naveed Ahmed Azam; Shengjuan Cao; Ryota Ido; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (CoRR, 2022)

On the enumeration of minimal non-pairwise compatibility graphs. - Naveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi (J. Comb. Optim., 2022)

A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming. - Jianshen Zhu; Naveed Ahmed Azam; Fan Zhang; Aleksandar Shurbevski; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (IEEE ACM Trans. Comput. Biol. Bioinform., 2022)

Polynomial-delay enumeration algorithms in set systems. - Kazuya Haraguchi; Hiroshi Nagamochi (Theor. Comput. Sci., 2023)

A Method for Inferring Polymers Based on Linear Regression and Integer Programming. - Ryota Ido; Shengjuan Cao; Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (IEEE ACM Trans. Comput. Biol. Bioinform., 2024)

Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes. - Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (IEEE ACM Trans. Comput. Biol. Bioinform., 2024)