Hiroshi Nagamochi

According to our database1, Hiroshi Nagamochi authored at least 255 papers between 1989 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Some reduction operations to pairwise compatibility graphs.
Inf. Process. Lett., 2020

A Novel Method for Inference of Acyclic Chemical Compounds with Bounded Branch-height Based on Artificial Neural Networks and Integer Programming.
CoRR, 2020

Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications.
CoRR, 2020

Polynomial-delay Enumeration Algorithms in Set Systems.
CoRR, 2020

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

Design of Polynomial-delay Enumeration Algorithms in Transitive Systems.
CoRR, 2020

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

A New Integer Linear Programming Formulation to the Inverse QSAR/QSPR for Acyclic Chemical Compounds Using Skeleton Trees.
Proceedings of the Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices, 2020

Path-Monotonic Upward Drawings of Graphs.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

On the Enumeration of Minimal Non-pairwise Compatibility Graphs.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility.
Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2020), 2020

2019
Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019

COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets.
J. Graph Algorithms Appl., 2019

Acute Constraints in Straight-Line Drawings of Planar Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

A linear-time algorithm for testing full outer-2-planarity.
Discret. Appl. Math., 2019

A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018
Simpler algorithms for testing two-page book embedding of partitioned graphs.
Theor. Comput. Sci., 2018

Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs.
IEEE ACM Trans. Comput. Biol. Bioinform., 2018

The Stable Roommates Problem with Unranked Entries.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem.
IEICE Trans. Inf. Syst., 2018

Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Characterizing Star-PCGs.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Practical Algorithms for Two-Dimensional Packing of Rectangles.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Complexity and kernels for bipartition into degree-bounded induced graphs.
Theor. Comput. Sci., 2017

An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs.
J. Inf. Process., 2017

Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route.
J. Inf. Process., 2017

Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game.
J. Graph Algorithms Appl., 2017

A refined algorithm for maximum independent set in degree-4 graphs.
J. Comb. Optim., 2017

An Exact Algorithm for Lowest Edge Dominating Set.
IEICE Trans. Inf. Syst., 2017

Exact algorithms for maximum independent set.
Inf. Comput., 2017

2016
An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4.
Theory Comput. Syst., 2016

An Improved Algorithm for Parameterized Edge Dominating Set Problem.
J. Graph Algorithms Appl., 2016

Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees.
IEICE Trans. Inf. Syst., 2016

An exact algorithm for maximum independent set in degree-5 graphs.
Discret. Appl. Math., 2016

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

A Linear-Time Algorithm for Integral Multiterminal Flows in Trees.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time.
Proceedings of the Graph Drawing and Network Visualization, 2016

Enumerating Naphthalene Isomers of Tree-like Chemical Graphs.
Proceedings of the 9th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2016), 2016

2015
An improved exact algorithm for undirected feedback vertex set.
J. Comb. Optim., 2015

Some Reduction Procedure for Computing Pathwidth of Undirected Graphs.
IEICE Trans. Inf. Syst., 2015

Exact algorithms for dominating induced matching based on graph partition.
Discret. Appl. Math., 2015

Testing Full Outer-2-planarity in Linear Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014
A refined exact algorithm for Edge Dominating Set.
Theor. Comput. Sci., 2014

Unranking of small combinations from large sets.
J. Discrete Algorithms, 2014

Efficient enumeration of monocyclic chemical graphs with given path frequencies.
J. Cheminformatics, 2014

Approximating the Bipartite TSP and Its Biased Generalization.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

2013
Parameterized edge dominating set in graphs with degree bounded by 3.
Theor. Comput. Sci., 2013

Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs.
Theor. Comput. Sci., 2013

FPTASs for trimming weighted trees.
Theor. Comput. Sci., 2013

Breadth-First Search Approach to Enumeration of Tree-like Chemical Compounds.
J. Bioinform. Comput. Biol., 2013

Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3.
IEICE Trans. Inf. Syst., 2013

Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems.
IEICE Trans. Inf. Syst., 2013

Optimization Techniques for Robot Path Planning.
Proceedings of the ICT Innovations 2013, 2013

2012
Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints.
Theor. Comput. Sci., 2012

An FPT algorithm for edge subset feedback edge set.
Inf. Process. Lett., 2012

Protein complex prediction via improved verification methods using constrained domain-domain matching.
Int. J. Bioinform. Res. Appl., 2012

Indexing All Rooted Subgraphs of a Rooted Graph.
IEICE Trans. Inf. Syst., 2012

An exact strip packing algorithm based on canonical forms.
Comput. Oper. Res., 2012

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems.
Algorithmica, 2012

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

Submodular Minimization via Pathwidth.
Proceedings of the Theory and Applications of Models of Computation, 2012

Linear Layouts in Submodular Systems.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

An Improved Exact Algorithm for TSP in Degree-4 Graphs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Characterizing Mechanisms in Obnoxious Facility Game.
Proceedings of the Combinatorial Optimization and Applications, 2012

The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011
Cop-robber guarding game with cycle robber-region.
Theor. Comput. Sci., 2011

On the one-dimensional stock cutting problem in the paper tube industry.
J. Sched., 2011

Efficient branch-and-bound algorithms for weighted MAX-2-SAT.
Math. Program., 2011

Minmax Tree Cover in the Euclidean Space.
J. Graph Algorithms Appl., 2011

Approximating capacitated tree-routings in networks.
J. Comb. Optim., 2011

Efficient Enumeration of Stereoisomers of Outerplanar Chemical Graphs Using Dynamic Programming.
J. Chem. Inf. Model., 2011

An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots.
J. Adv. Comput. Intell. Intell. Informatics, 2011

Guest Editors' Foreword.
Int. J. Comput. Geom. Appl., 2011

An Approximation Algorithm for Locating Maximal Disks within Convex Polygons.
Int. J. Comput. Geom. Appl., 2011

Kansei engineering, humans and computers: efficient dynamic programming algorithms for combinatorial food packing problems.
Int. J. Biom., 2011

Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs.
IEICE Trans. Inf. Syst., 2011

Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs.
IEICE Trans. Inf. Syst., 2011

Kernel Methods for Chemical Compounds: From Classification to Design.
IEICE Trans. Inf. Syst., 2011

Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies.
BMC Bioinform., 2011

Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra.
Algorithmica, 2011

Editorial: ISAAC 2008 Special Issue.
Algorithmica, 2011

Improved Bounds for Minimum Fault-Tolerant Gossip Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Further Improvement on Maximum Independent Set in Degree-4 Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2011

Parameterized Edge Dominating Set in Cubic Graphs - (Extended Abstract).
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
A plane graph representation of triconnected graphs.
Theor. Comput. Sci., 2010

On the approximation of the generalized capacitated tree-routing problem.
J. Discrete Algorithms, 2010

Convex drawings of hierarchical planar graphs and clustered planar graphs.
J. Discrete Algorithms, 2010

Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut.
J. Chem. Inf. Model., 2010

Approximation to the Minimum Cost Edge Installation Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Network design with weighted degree constraints.
Discret. Optim., 2010

An algorithm for constructing star-shaped drawings of plane graphs.
Comput. Geom., 2010

Minimum Degree Orderings.
Algorithmica, 2010

Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings.
Algorithmica, 2010

A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs.
Algorithmica, 2010

Generating Internally Triconnected Rooted Plane Graphs.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables.
Proceedings of the Learning and Intelligent Optimization, 4th International Conference, 2010

Generating Trees on Multisets.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Constant Time Generation of Biconnected Rooted Plane Graphs.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

FPTAS's for Some Cut Problems in Weighted Trees.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

Listing Triconnected Rooted Plane Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2010

Enumerating Rooted Graphs with Reflectional Block Structures.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009
Drawing slicing graphs with face areas.
Theor. Comput. Sci., 2009

Minimum Transversals in Posimodular Systems.
SIAM J. Discret. Math., 2009

Network Design with Edge-Connectivity and Degree Constraints.
Theory Comput. Syst., 2009

New Approximation to the One-sided Radial Crossing Minimization.
J. Graph Algorithms Appl., 2009

Exact algorithms for the two-dimensional strip packing problem with and without rotations.
Eur. J. Oper. Res., 2009

An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem.
Discret. Optim., 2009

Eulerian detachments with local edge-connectivity.
Discret. Appl. Math., 2009

A Detachment Algorithm for Inferring a Graph from Path Frequency.
Algorithmica, 2009

Bipartite Graph Representation of Multiple Decision Table Classifiers.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Upward Star-Shaped Polyhedral Graphs.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Approximating a vehicle scheduling problem with time windows and handling times.
Theor. Comput. Sci., 2008

An improved approximation algorithm for capacitated multicast routings in networks.
Theor. Comput. Sci., 2008

Enumerating Treelike Chemical Graphs with Given Path Frequency.
J. Chem. Inf. Model., 2008

Worst Case Analysis for Pickup and Delivery Problems with Transfer.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Performance Analysis of a Collision Detection Algorithm of Spheres Based on Slab Partitioning.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Convex drawings of graphs with non-convex boundary constraints.
Discret. Appl. Math., 2008

Robust cost colorings.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Approximating Crossing Minimization in Radial Layouts.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Removing Node Overlaps Using Multi-sphere Scheme.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Approximating the Generalized Capacitated Tree-Routing Problem.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Algorithmic Aspects of Graph Connectivity
Encyclopedia of Mathematics and its Applications 123, Cambridge University Press, ISBN: 9780511721649, 2008

2007
Practical Algorithms for Two-Dimensional Packing.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Vehicle Scheduling Problems in Graphs.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Minimum cost source location problem with local 3-vertex-connectivity requirements.
Theor. Comput. Sci., 2007

Approximability of the capacitated b-edge dominating set problem.
Theor. Comput. Sci., 2007

A Deterministic Algorithm for Finding All Minimum k-Way Cuts.
SIAM J. Comput., 2007

Approximating the minmax rooted-tree cover in a tree.
Inf. Process. Lett., 2007

Minimum cost subpartitions in graphs.
Inf. Process. Lett., 2007

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

Approximation Algorithms for Multicast Routings in a Network with Multi-Sources.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

Contention-Free lambda-Planes in Optically Burst-Switched WDM Networks.
IEICE Trans. Commun., 2007

Approximating a Generalization of Metric TSP.
IEICE Trans. Inf. Syst., 2007

Generalizing the induced matching by edge capacity constraints.
Discret. Optim., 2007

Drawing c-planar biconnected clustered graphs.
Discret. Appl. Math., 2007

An approximation algorithm for dissecting a rectangle into rectangles with specified areas.
Discret. Appl. Math., 2007

Bisecting a 4-connected graph with three resource sets.
Discret. Appl. Math., 2007

The source location problem with local 3-vertex-connectivity requirements.
Discret. Appl. Math., 2007

An Efficient Algorithm for Generating Colored Outerplanar Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2007

Orthogonal Drawings for Plane Graphs with Specified Face Areas.
Proceedings of the Theory and Applications of Models of Computation, 2007

A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

A Multi-sphere Scheme for 2D and 3D Packing Problems.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

The Set Connector Problem in Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Extension of ICF Classifiers to Real World Data Sets.
Proceedings of the New Trends in Applied Artificial Intelligence, 2007

"Rent-or-Buy" Scheduling and Cost Coloring Problems.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Linear-tree rule structure for firewall optimization.
Proceedings of the Sixth IASTED International Conference on Communications, 2007

A Novel Clustering Method for Analysis of Biological Networks using Maximal Components of Graphs.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006
Packing Soft Rectangles.
Int. J. Found. Comput. Sci., 2006

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

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

Some Theorems on Detachments Preserving Local-Edge-Connectivity.
Electron. Notes Discret. Math., 2006

Augmenting forests to meet odd diameter requirements.
Discret. Optim., 2006

Minmax subtree cover problem on cacti.
Discret. Appl. Math., 2006

Sparse connectivity certificates via MA orderings in graphs.
Discret. Appl. Math., 2006

Two equivalent measures on weighted hypergraphs.
Discret. Appl. Math., 2006

Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph.
Algorithmica, 2006

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs.
Algorithmica, 2006

Convex Drawings of Graphs with Non-convex Boundary.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Contention-Free l-Planes in Optically Burst-Switched WDM Networks.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

Minimum Transversals in Posi-modular Systems.
Proceedings of the Algorithms, 2006

2005
A robust algorithm for bisecting a triconnected graph with two resource sets.
Theor. Comput. Sci., 2005

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

Greedy splitting algorithms for approximating multiway partition problems.
Math. Program., 2005

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

On computing minimum (<i>s, t</i>)-cuts in digraphs.
Inf. Process. Lett., 2005

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

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

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

Packing Unit Squares in a Rectangle.
Electron. J. Comb., 2005

Bisecting a Four-Connected Graph with Three Resource Sets.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Approximation Algorithms for the <i>b</i>-Edge Dominating Set Problem and Its Related Problems.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times.
Theor. Comput. Sci., 2004

Counting edge crossings in a 2-layered drawing.
Inf. Process. Lett., 2004

A simple recognition of maximal planar graphs.
Inf. Process. Lett., 2004

On generalized greedy splitting algorithms for multiway partition problems.
Discret. Appl. Math., 2004

A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree.
Discret. Appl. Math., 2004

Approximating the Minmax Subtree Cover Problem in a Cactus.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003
An Edge-Splitting Algorithm in Planar Graphs.
J. Comb. Optim., 2003

A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem.
Inf. Process. Lett., 2003

Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs.
Electron. Notes Theor. Comput. Sci., 2003

A primal-dual approximation algorithm for the survivable network design problem in hypergraphs.
Discret. Appl. Math., 2003

On the minimum local-vertex-connectivity augmentation in graphs.
Discret. Appl. Math., 2003

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

2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
Discret. Appl. Math., 2003

Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Convex Drawing for c-Planar Biconnected Clustered Graphs.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

An Improved Approximation to the One-Sided Bilayer Drawing.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks.
Networks, 2002

Graph connectivity and its augmentation: applications of MA orderings.
Discret. Appl. Math., 2002

A 2-approximation algorithm for the minimum weight edge dominating set problem.
Discret. Appl. Math., 2002

Convex Embeddings and Bisections of 3-Connected Graphs 1.
Comb., 2002

Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

File Transfer Tree Problems.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001
Multigraph augmentation under biconnectivity and general edge-connectivity requirements.
Networks, 2001

Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.
J. Comb. Optim., 2001

Augmenting a Submodular and Posi-modular Set Function by a Multigraph.
J. Comb. Optim., 2001

An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate.
J. Algorithms, 2001

Minimum cost source location problem with vertex-connectivity requirements in digraphs.
Inf. Process. Lett., 2001

Bounds on the number of isolates in sum graph labeling.
Discret. Math., 2001

Independent spanning trees with small depths in iterated line digraphs.
Discret. Appl. Math., 2001

A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.
Proceedings of the STACS 2001, 2001

A Unified Framework for Approximating Multiway Partition Problems.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times.
Proceedings of the Algorithms, 2001

2000
A fast algorithm for computing minimum 3-way and 4-way cuts.
Math. Program., 2000

Totally balanced combinatorial optimization games.
Math. Program., 2000

A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs.
J. Comb. Optim., 2000

Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph.
J. Comb. Optim., 2000

Polyhedral structure of submodular and posi-modular systems.
Discret. Appl. Math., 2000

A Simplified <i>Õ</i>(<i>nm</i>) Time Edge-Splitting Algorithm in Undirected Graphs.
Algorithmica, 2000

On the Minimum Augmentation of an <i>l</i>-Connected Graph to a <i>k</i>-Connected Graph.
Proceedings of the Algorithm Theory, 2000

Simultaneous Augmentation of Two Graphs to an <i>l</i>-Edge-Connected Graph and a Biconnected Graph.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999
Algorithmic Aspects of the Core of Combinatorial Optimization Games.
Math. Oper. Res., 1999

Drawing Clustered Graphs on an Orthogonal Grid.
J. Graph Algorithms Appl., 1999

Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time.
J. Algorithms, 1999

Bisecting Two Subsets in 3-Connected Graphs.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph.
Proceedings of the Algorithms, 1999

An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Two Arc-Disjoint Paths in Eulerian Digraphs.
SIAM J. Discret. Math., 1998

A Note on Minimizing Submodular Functions.
Inf. Process. Lett., 1998

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

Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997
Computing All Small Cuts in an Undirected Network.
SIAM J. Discret. Math., 1997

Complexity of the Minimum Base Game on Matroids.
Math. Oper. Res., 1997

Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs.
J. Comb. Optim., 1997

Vehicle scheduling on a tree with release and handling times.
Ann. Oper. Res., 1997

Computing Edge-Connectivity Augmentation Function in Õ(nm) Time.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Combinatorial Optimization Games.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Augmenting Edge and Vertex Connectivities Simultaneously.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996
Deterministic <i>Õ</i>(nm) Time Edge-Splitting in Undirected Graphs.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995
Optimal Coteries for Rings and Related Networks.
Distributed Comput., 1995

Two Arc Disjoint Paths in Eulerian Diagraphs.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994
An exact lower bound on the number of cut-sets in multigraphs.
Networks, 1994

Implementing an efficient minimum capacity cut algorithm.
Math. Program., 1994

Computing All Small Cuts in Undirected Networks.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993
On sparse subgraphs preserving connectivity properties.
Journal of Graph Theory, 1993

1992
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs.
SIAM J. Discret. Math., 1992

A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph.
Algorithmica, 1992

Optimal Coteries for Rings and Related Networks.
Proceedings of the 12th International Conference on Distributed Computing Systems, 1992

1991
Maximum flows in probabilistic networks.
Networks, 1991

1990
Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities.
Networks, 1990

Multicommodity flows in certain planar directed networks.
Discret. Appl. Math., 1990

Computing Edge-Connectivity in Multiple and Capacitated Graphs.
Proceedings of the Algorithms, 1990

1989
On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks.
Inf. Process. Lett., 1989


  Loading...