| Publication | Date of Publication | Type |
|---|
Polynomial-delay enumeration algorithms in set systems
Theoretical Computer Science | 2023-06-15 | Paper |
| Two arc disjoint paths in Eulerian digraphs | 2023-03-21 | Paper |
| scientific article; zbMATH DE number 7650236 (Why is no real title available?) | 2023-02-03 | Paper |
On the enumeration of minimal non-pairwise compatibility graphs
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Enumeration of support-closed subsets in confluent systems
Algorithmica | 2022-05-03 | Paper |
Re-embedding a 1-plane graph for a straight-line drawing in linear time
Theoretical Computer Science | 2021-10-21 | Paper |
A method for enumerating pairwise compatibility graphs with a given number of vertices
Discrete Applied Mathematics | 2021-09-15 | Paper |
Brief announcement: Bounded-degree cut is fixed-parameter tractable
(available as arXiv preprint) | 2021-07-28 | Paper |
| Path-monotonic upward drawings of graphs | 2021-04-21 | Paper |
On the enumeration of minimal non-pairwise compatibility graphs
Lecture Notes in Computer Science | 2021-04-21 | Paper |
Optimal coteries for rings and related networks
Distributed Computing | 2020-11-30 | Paper |
Characterizing star-PCGs
Algorithmica | 2020-10-12 | Paper |
| A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming | 2020-09-28 | Paper |
Some reduction operations to pairwise compatibility graphs
Information Processing Letters | 2019-11-21 | Paper |
COOMA: a components overlaid mining algorithm for enumerating connected subgraphs with common itemsets
Journal of Graph Algorithms and Applications | 2019-08-06 | Paper |
A linear-time algorithm for testing full outer-2-planarity
Discrete Applied Mathematics | 2019-02-20 | Paper |
Characterizing star-PCGs
Lecture Notes in Computer Science | 2018-10-04 | Paper |
Simpler algorithms for testing two-page book embedding of partitioned graphs
Theoretical Computer Science | 2018-05-15 | Paper |
scientific article; zbMATH DE number 6861995 (Why is no real title available?)
(available as arXiv preprint) | 2018-04-19 | Paper |
Exact algorithms for maximum independent set
Information and Computation | 2017-08-08 | Paper |
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
Lecture Notes in Computer Science | 2017-02-21 | Paper |
A polynomial-space exact algorithm for TSP in degree-6 graphs
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Complexity and kernels for bipartition into degree-bounded induced graphs
Theoretical Computer Science | 2016-12-23 | Paper |
An exact strip packing algorithm based on canonical forms
Computers & Operations Research | 2016-11-11 | Paper |
Testing Full Outer-2-planarity in Linear Time
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
A note on minimizing submodular functions
Information Processing Letters | 2016-06-09 | Paper |
Parameterization of strategy-proof mechanisms in the obnoxious facility game
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure
Algorithmica | 2016-03-29 | Paper |
An improved exact algorithm for TSP in graphs of maximum degree 4
Theory of Computing Systems | 2016-03-09 | Paper |
An improved algorithm for parameterized edge dominating set problem
Journal of Graph Algorithms and Applications | 2016-03-03 | Paper |
An exact algorithm for maximum independent set in degree-5 graphs
Discrete Applied Mathematics | 2015-12-10 | Paper |
Complexity and kernels for bipartition into degree-bounded induced graphs
Algorithms and Computation | 2015-09-11 | Paper |
| scientific article; zbMATH DE number 6472650 (Why is no real title available?) | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6472642 (Why is no real title available?) | 2015-08-14 | Paper |
An improved exact algorithm for undirected feedback vertex set
Journal of Combinatorial Optimization | 2015-07-28 | Paper |
Exact algorithms for dominating induced matching based on graph partition
Discrete Applied Mathematics | 2015-07-06 | Paper |
An approximation of the minimum vertex cover in a graph
Japan Journal of Industrial and Applied Mathematics | 2015-03-03 | Paper |
A fast algorithm for cactus representations of minimum cuts
Japan Journal of Industrial and Applied Mathematics | 2015-03-03 | Paper |
An improved algorithm for parameterized edge dominating set problem
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
A refined exact algorithm for edge dominating set
Theoretical Computer Science | 2014-12-02 | Paper |
Unranking of small combinations from large sets
Journal of Discrete Algorithms | 2014-11-24 | Paper |
Simpler algorithms for testing two-page book embedding of partitioned graphs
Lecture Notes in Computer Science | 2014-09-26 | Paper |
An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Approximating the bipartite TSP and its biased generalization
Algorithms and Computation | 2014-02-18 | Paper |
Exact Algorithms for Maximum Independent Set
Algorithms and Computation | 2014-01-14 | Paper |
Parameterized edge dominating set in graphs with degree bounded by 3
Theoretical Computer Science | 2013-12-19 | Paper |
An Improved Exact Algorithm for Undirected Feedback Vertex Set
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Minmax tree cover in the Euclidean space
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
| Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs | 2013-08-27 | Paper |
CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS
Journal of the Operations Research Society of Japan | 2013-06-12 | Paper |
An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Linear layouts in submodular systems
Algorithms and Computation | 2013-03-21 | Paper |
Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs
Theoretical Computer Science | 2013-02-19 | Paper |
FPTASs for trimming weighted trees
Theoretical Computer Science | 2013-02-19 | Paper |
An approximation algorithm for locating maximal disks within convex polygons
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
Characterizing mechanisms in obnoxious facility game
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
An improved exact algorithm for TSP in degree-4 graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
Theoretical Computer Science | 2012-08-10 | Paper |
A refined exact algorithm for edge dominating set
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Submodular minimization via pathwidth
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Network design with weighted degree constraints
Discrete Optimization | 2012-06-20 | Paper |
A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
Algorithmica | 2012-04-26 | Paper |
Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
Algorithmica | 2012-04-26 | Paper |
A plane graph representation of triconnected graphs
Theoretical Computer Science | 2012-04-03 | Paper |
An FPT algorithm for edge subset feedback edge set
Information Processing Letters | 2012-03-09 | Paper |
Improved bounds for minimum fault-tolerant gossip graphs
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
Algorithmica | 2011-12-14 | Paper |
An A* algorithm framework for the point-to-point time-dependent shortest path problem
Lecture Notes in Computer Science | 2011-11-11 | Paper |
On the one-dimensional stock cutting problem in the paper tube industry
Journal of Scheduling | 2011-10-18 | Paper |
Further Improvement on Maximum Independent Set in Degree-4 Graphs
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Parameterized edge dominating set in cubic graphs (extended abstract)
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
| Survivable network design problems with weighted degree constraints | 2011-05-16 | Paper |
Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming
Journal of Mathematical Chemistry | 2011-05-11 | Paper |
Efficient branch-and-bound algorithms for weighted MAX-2-SAT
Mathematical Programming. Series A. Series B | 2011-05-11 | Paper |
Approximating capacitated tree-routings in networks
Journal of Combinatorial Optimization | 2011-03-17 | Paper |
Cop-robber guarding game with cycle robber-region
Theoretical Computer Science | 2011-02-02 | Paper |
Listing triconnected rooted plane graphs
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Generating trees on multisets
Algorithms and Computation | 2010-12-09 | Paper |
A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs
Algorithmica | 2010-09-16 | Paper |
Approximation algorithms for minimizing edge crossings in radial drawings
Algorithmica | 2010-09-16 | Paper |
FPTAS’s for Some Cut Problems in Weighted Trees
Frontiers in Algorithmics | 2010-09-07 | Paper |
Constant Time Generation of Biconnected Rooted Plane Graphs
Frontiers in Algorithmics | 2010-09-07 | Paper |
Convex drawings of hierarchical planar graphs and clustered planar graphs
Journal of Discrete Algorithms | 2010-08-18 | Paper |
On the approximation of the generalized capacitated tree-routing problem
Journal of Discrete Algorithms | 2010-08-18 | Paper |
| scientific article; zbMATH DE number 5764868 (Why is no real title available?) | 2010-08-06 | Paper |
Generating internally triconnected rooted plane graphs
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Minimum transversals in posimodular systems
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
Enumerating rooted graphs with reflectional block structures
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Approximating the minmax rooted-tree cover in a tree
Information Processing Letters | 2010-03-24 | Paper |
Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
Algorithmica | 2010-02-23 | Paper |
Minimum degree orderings
Algorithmica | 2010-02-23 | Paper |
Comparing hypergraphs by areas of hyperedges drawn on a convex polygon
Lecture Notes in Computer Science | 2010-02-05 | Paper |
Minimum cost subpartitions in graphs
Information Processing Letters | 2010-01-29 | Paper |
Upward star-shaped polyhedral graphs
Algorithms and Computation | 2009-12-17 | Paper |
Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
Algorithms and Computation | 2009-12-17 | Paper |
Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming
Algorithms and Computation | 2009-12-17 | Paper |
Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries
Algorithms and Computation | 2009-12-17 | Paper |
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
Discrete Optimization | 2009-11-23 | Paper |
Bipartite Graph Representation of Multiple Decision Table Classifiers
Stochastic Algorithms: Foundations and Applications | 2009-11-19 | Paper |
An algorithm for constructing star-shaped drawings of plane graphs
Computational Geometry | 2009-11-16 | Paper |
New Approximation to the One-sided Radial Crossing Minimization
Journal of Graph Algorithms and Applications | 2009-10-21 | Paper |
Network design with edge-connectivity and degree constraints
Theory of Computing Systems | 2009-09-02 | Paper |
On computing minimum(s,t)-cuts in digraphs
Information Processing Letters | 2009-08-27 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Counting edge crossings in a 2-layered drawing
Information Processing Letters | 2009-07-21 | Paper |
Cop-Robber Guarding Game with Cycle Robber Region
Frontiers in Algorithmics | 2009-07-14 | Paper |
A simple recognition of maximal planar graphs
Information Processing Letters | 2009-07-09 | Paper |
Exact algorithms for the two-dimensional strip packing problem with and without rotations
European Journal of Operational Research | 2009-06-30 | Paper |
Eulerian detachments with local edge-connectivity
Discrete Applied Mathematics | 2009-06-30 | Paper |
A detachment algorithm for inferring a graph from path frequency
Algorithmica | 2009-04-29 | Paper |
A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem
Information Processing Letters | 2009-03-23 | Paper |
Drawing slicing graphs with face areas
Theoretical Computer Science | 2009-03-20 | Paper |
Removing Node Overlaps Using Multi-sphere Scheme
Graph Drawing | 2009-03-03 | Paper |
Network Design with Weighted Degree Constraints
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
Minmax Tree Cover in the Euclidean Space
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
| Algorithmic Aspects of Graph Connectivity | 2008-12-04 | Paper |
Convex drawings of graphs with non-convex boundary constraints
Discrete Applied Mathematics | 2008-09-29 | Paper |
Convex Drawings of Graphs with Non-convex Boundary
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Approximating the Generalized Capacitated Tree-Routing Problem
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Minimum Degree Orderings
Algorithms and Computation | 2008-05-27 | Paper |
Approximation to the Minimum Cost Edge Installation Problem
Algorithms and Computation | 2008-05-27 | Paper |
APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
Journal of the Operations Research Society of Japan | 2008-04-29 | Paper |
“Rent-or-Buy” Scheduling and Cost Coloring Problems
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Approximating a vehicle scheduling problem with time windows and handling times
Theoretical Computer Science | 2008-04-15 | Paper |
Approximating Crossing Minimization in Radial Layouts
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Minimum Transversals in Posi-modular Systems
Lecture Notes in Computer Science | 2008-03-11 | Paper |
An improved approximation algorithm for capacitated multicast routings in networks
Theoretical Computer Science | 2008-03-05 | Paper |
Network Design with Edge-Connectivity and Degree Constraints
Approximation and Online Algorithms | 2008-02-21 | Paper |
Generalizing the induced matching by edge capacity constraints
Discrete Optimization | 2008-01-18 | Paper |
The source location problem with local 3-vertex-connectivity requirements
Discrete Applied Mathematics | 2007-11-30 | Paper |
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics | 2007-11-29 | Paper |
A Multi-sphere Scheme for 2D and 3D Packing Problems
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics | 2007-11-29 | Paper |
The Set Connector Problem in Graphs
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Approximating Capacitated Tree-Routings in Networks
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Orthogonal Drawings for Plane Graphs with Specified Face Areas
Lecture Notes in Computer Science | 2007-11-13 | Paper |
An Efficient Algorithm for Generating Colored Outerplanar Graphs
Lecture Notes in Computer Science | 2007-11-13 | Paper |
A Deterministic Algorithm for Finding All Minimum <i>k</i>‐Way Cuts
SIAM Journal on Computing | 2007-10-22 | Paper |
Approximability of the capacitated \(b\)-edge dominating set problem
Theoretical Computer Science | 2007-10-18 | Paper |
A Detachment Algorithm for Inferring a Graph from Path Frequency
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Bisecting a 4-connected graph with three resource sets
Discrete Applied Mathematics | 2007-07-19 | Paper |
Drawing \(c\)-planar biconnected clustered graphs
Discrete Applied Mathematics | 2007-06-08 | Paper |
Some Theorems on Detachments Preserving Local-Edge-Connectivity
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Minimum cost source location problem with local 3-vertex-connectivity requirements
Theoretical Computer Science | 2007-03-15 | Paper |
An approximation algorithm for dissecting a rectangle into rectangles with specified areas
Discrete Applied Mathematics | 2007-03-08 | Paper |
Two equivalent measures on weighted hypergraphs
Discrete Applied Mathematics | 2007-01-09 | Paper |
Sparse connectivity certificates via MA orderings in graphs
Discrete Applied Mathematics | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
PACKING SOFT RECTANGLES
International Journal of Foundations of Computer Science | 2006-10-16 | Paper |
Augmenting forests to meet odd diameter requirements
Discrete Optimization | 2006-10-10 | Paper |
Minmax subtree cover problem on cacti
Discrete Applied Mathematics | 2006-06-30 | Paper |
Straight-line drawing algorithms for hierarchical graphs and clustered graphs
Algorithmica | 2006-06-14 | Paper |
Augmenting a \((k-1)\)-vertex-connected multigraph to an \(\ell\)-edge-connected and \(k\)-vertex-connected multigraph
Algorithmica | 2006-06-14 | Paper |
| Scheduling vehicles on trees | 2006-02-08 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Packing unit squares in a rectangle
The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
Packing unit squares in a rectangle
The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
A <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-approximation for the minimum 2-local-vertex-connectivity augmentation in a co
Journal of Algorithms | 2005-09-28 | Paper |
A robust algorithm for bisecting a triconnected graph with two resource sets
Theoretical Computer Science | 2005-09-22 | Paper |
An improved bound on the one-sided minimum crossing number in two-layered drawings
Discrete & Computational Geometry | 2005-08-02 | Paper |
GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(<Special Issue>Network Design, Control and Optimization)
Journal of the Operations Research Society of Japan | 2005-04-23 | Paper |
On the one-sided crossing minimization in a bipartite graph with large degrees
Theoretical Computer Science | 2005-04-06 | Paper |
Greedy splitting algorithms for approximating multiway partition problems
Mathematical Programming. Series A. Series B | 2005-03-17 | Paper |
On generalized greedy splitting algorithms for multiway partition problems
Discrete Applied Mathematics | 2004-11-23 | Paper |
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
Theoretical Computer Science | 2004-10-27 | Paper |
A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
Discrete Applied Mathematics | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080985 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080977 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081031 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080257 (Why is no real title available?) | 2004-08-04 | Paper |
Convex embeddings and bisections of 3-connected graphs
Combinatorica | 2003-10-14 | Paper |
| scientific article; zbMATH DE number 1979499 (Why is no real title available?) | 2003-09-14 | Paper |
| scientific article; zbMATH DE number 1979520 (Why is no real title available?) | 2003-09-14 | Paper |
2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
Discrete Applied Mathematics | 2003-09-09 | Paper |
On the minimum local-vertex-connectivity augmentation in graphs
Discrete Applied Mathematics | 2003-09-09 | Paper |
An edge-splitting algorithm in planar graphs
Journal of Combinatorial Optimization | 2003-08-28 | Paper |
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
Discrete Applied Mathematics | 2003-03-09 | Paper |
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
Discrete Applied Mathematics | 2003-03-09 | Paper |
| scientific article; zbMATH DE number 1875418 (Why is no real title available?) | 2003-03-02 | Paper |
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
Networks | 2002-09-29 | Paper |
Graph connectivity and its augmentation: Applications of MA orderings
Discrete Applied Mathematics | 2002-09-17 | Paper |
| scientific article; zbMATH DE number 1788731 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1788735 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1789187 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1789188 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1789189 (Why is no real title available?) | 2002-08-26 | Paper |
Minimum cost source location problem with vertex-connectivity requirements in digraphs
Information Processing Letters | 2002-07-25 | Paper |
Bounds on the number of isolates in sum graph labeling
Discrete Mathematics | 2002-06-27 | Paper |
A 2-approximation algorithm for the minimum weight edge dominating set problem
Discrete Applied Mathematics | 2002-06-24 | Paper |
| scientific article; zbMATH DE number 1741101 (Why is no real title available?) | 2002-05-15 | Paper |
| scientific article; zbMATH DE number 1688385 (Why is no real title available?) | 2002-01-09 | Paper |
Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
Journal of Combinatorial Optimization | 2002-01-08 | Paper |
Multigraph augmentation under biconnectivity and general edge-connectivity requirements
Networks | 2001-12-19 | Paper |
| scientific article; zbMATH DE number 1522947 (Why is no real title available?) | 2001-11-28 | Paper |
Augmenting a submodular and posi-modular set function by a multigraph
Journal of Combinatorial Optimization | 2001-09-19 | Paper |
An efficient \({\mathcal {NC}}\) algorithm for a sparse \(k\)-edge-connectivity certificate
Journal of Algorithms | 2001-07-23 | Paper |
| scientific article; zbMATH DE number 1617267 (Why is no real title available?) | 2001-07-11 | Paper |
Totally balanced combinatorial optimization games
Mathematical Programming. Series A. Series B | 2001-06-10 | Paper |
A fast algorithm for computing minimum 3-way and 4-way cuts
Mathematical Programming. Series A. Series B | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1568056 (Why is no real title available?) | 2001-02-21 | Paper |
Polyhedral structure of submodular and posi-modular systems
Discrete Applied Mathematics | 2001-02-18 | Paper |
| scientific article; zbMATH DE number 1555934 (Why is no real title available?) | 2001-01-24 | Paper |
Optimal augmentation of a 2-vertex-connected multigraph to an -edge-connected and 3-vertex-connected multigraph
Journal of Combinatorial Optimization | 2001-01-14 | Paper |
Independent spanning trees with small depths in iterated line digraphs
Discrete Applied Mathematics | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1522944 (Why is no real title available?) | 2000-10-30 | Paper |
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
Journal of Combinatorial Optimization | 2000-10-30 | Paper |
Drawing Clustered Graphs on an Orthogonal Grid
Journal of Graph Algorithms and Applications | 2000-09-19 | Paper |
| scientific article; zbMATH DE number 1486639 (Why is no real title available?) | 2000-08-20 | Paper |
Algorithmic Aspects of the Core of Combinatorial Optimization Games
Mathematics of Operations Research | 2000-07-19 | Paper |
A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs
Algorithmica | 2000-07-19 | Paper |
| scientific article; zbMATH DE number 1444313 (Why is no real title available?) | 2000-05-09 | Paper |
| scientific article; zbMATH DE number 1405799 (Why is no real title available?) | 2000-03-27 | Paper |
| scientific article; zbMATH DE number 1405676 (Why is no real title available?) | 2000-02-23 | Paper |
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs
Lecture Notes in Computer Science | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1404253 (Why is no real title available?) | 2000-02-20 | Paper |
| scientific article; zbMATH DE number 1398062 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1379520 (Why is no real title available?) | 1999-12-15 | Paper |
| scientific article; zbMATH DE number 1377714 (Why is no real title available?) | 1999-12-14 | Paper |
| scientific article; zbMATH DE number 1372654 (Why is no real title available?) | 1999-12-01 | Paper |
| scientific article; zbMATH DE number 1322437 (Why is no real title available?) | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1354119 (Why is no real title available?) | 1999-10-31 | Paper |
Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time
Journal of Algorithms | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1342143 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1303025 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1303026 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1303567 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1303037 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1256720 (Why is no real title available?) | 1999-05-18 | Paper |
A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons
Combinatorica | 1999-03-14 | Paper |
| scientific article; zbMATH DE number 1104329 (Why is no real title available?) | 1998-12-02 | Paper |
Two Arc-Disjoint Paths in Eulerian Digraphs
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
Complexity Of The Single Vehicle Scheduling Problem On Graphs
INFOR: Information Systems and Operational Research | 1998-09-07 | Paper |
| scientific article; zbMATH DE number 1187145 (Why is no real title available?) | 1998-08-10 | Paper |
Deterministic O(nm) time edge-splitting in undirected graphs
Journal of Combinatorial Optimization | 1998-04-13 | Paper |
Computing All Small Cuts in an Undirected Network
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS
Journal of the Operations Research Society of Japan | 1997-10-30 | Paper |
Complexity of the Minimum Base Game on Matroids
Mathematics of Operations Research | 1997-10-05 | Paper |
Vehicle scheduling on a tree with release and handling times
Annals of Operations Research | 1997-06-16 | Paper |
CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK
Journal of the Operations Research Society of Japan | 1997-01-22 | Paper |
Implementing an efficient minimum capacity cut algorithm
Mathematical Programming. Series A. Series B | 1995-09-27 | Paper |
An exact lower bound on the number of cut‐sets in multigraphs
Networks | 1995-02-16 | Paper |
Canonical cactus representation for miminum cuts
Japan Journal of Industrial and Applied Mathematics | 1995-01-19 | Paper |
On sparse subgraphs preserving connectivity properties
Journal of Graph Theory | 1993-08-24 | Paper |
On Onaga's upper bound on the mean values of probabilistic maximum flows
IEEE Transactions on Reliability | 1993-01-16 | Paper |
A linear time algorithm for computing 3-edge-connected components in a multigraph
Japan Journal of Industrial and Applied Mathematics | 1993-01-16 | Paper |
Counting the number of minimum cuts in undirected multigraphs
IEEE Transactions on Reliability | 1992-06-28 | Paper |
A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
Algorithmica | 1992-06-28 | Paper |
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
SIAM Journal on Discrete Mathematics | 1992-06-28 | Paper |
Maximum flows in probabilistic networks
Networks | 1992-06-27 | Paper |
Multicommodity flows in certain planar directed networks
Discrete Applied Mathematics | 1990-01-01 | Paper |
Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
Networks | 1990-01-01 | Paper |
On max-flow min-cut and integral flow properties for multicommodity flows in directed networks
Information Processing Letters | 1989-01-01 | Paper |
