| Publication | Date of Publication | Type |
|---|
| Polynomial-delay enumeration algorithms in set systems | 2023-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875563 | 2023-02-03 | Paper |
| On the enumeration of minimal non-pairwise compatibility graphs | 2022-10-18 | Paper |
| A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem | 2022-08-30 | Paper |
| Enumeration of support-closed subsets in confluent systems | 2022-05-03 | Paper |
| Re-embedding a 1-plane graph for a straight-line drawing in linear time | 2021-10-21 | Paper |
| A method for enumerating pairwise compatibility graphs with a given number of vertices | 2021-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002797 | 2021-07-28 | Paper |
| On the enumeration of minimal non-pairwise compatibility graphs | 2021-04-21 | Paper |
| Path-monotonic upward drawings of graphs | 2021-04-21 | Paper |
| Optimal coteries for rings and related networks | 2020-11-30 | Paper |
| Characterizing star-PCGs | 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 | 2019-11-21 | Paper |
| COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets | 2019-08-06 | Paper |
| A linear-time algorithm for testing full outer-2-planarity | 2019-02-20 | Paper |
| Characterizing star-PCGs | 2018-10-04 | Paper |
| Simpler algorithms for testing two-page book embedding of partitioned graphs | 2018-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636548 | 2018-04-19 | Paper |
| Exact algorithms for maximum independent set | 2017-08-08 | Paper |
| Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game | 2017-04-05 | Paper |
| Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time | 2017-02-21 | Paper |
| A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs | 2017-02-01 | Paper |
| Complexity and kernels for bipartition into degree-bounded induced graphs | 2016-12-23 | Paper |
| An exact strip packing algorithm based on canonical forms | 2016-11-11 | Paper |
| Testing Full Outer-2-planarity in Linear Time | 2016-10-21 | Paper |
| A note on minimizing submodular functions | 2016-06-09 | Paper |
| Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game | 2016-05-03 | Paper |
| An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure | 2016-03-29 | Paper |
| An improved exact algorithm for TSP in graphs of maximum degree 4 | 2016-03-09 | Paper |
| An Improved Algorithm for Parameterized Edge Dominating Set Problem | 2016-03-03 | Paper |
| An exact algorithm for maximum independent set in degree-5 graphs | 2015-12-10 | Paper |
| Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501844 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501852 | 2015-08-14 | Paper |
| An improved exact algorithm for undirected feedback vertex set | 2015-07-28 | Paper |
| Exact algorithms for dominating induced matching based on graph partition | 2015-07-06 | Paper |
| An approximation of the minimum vertex cover in a graph | 2015-03-03 | Paper |
| A fast algorithm for cactus representations of minimum cuts | 2015-03-03 | Paper |
| An Improved Algorithm for Parameterized Edge Dominating Set Problem | 2015-02-27 | Paper |
| A refined exact algorithm for edge dominating set | 2014-12-02 | Paper |
| Unranking of small combinations from large sets | 2014-11-24 | Paper |
| Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs | 2014-09-26 | Paper |
| An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs | 2014-04-03 | Paper |
| Approximating the Bipartite TSP and Its Biased Generalization | 2014-02-18 | Paper |
| Exact Algorithms for Maximum Independent Set | 2014-01-14 | Paper |
| Parameterized edge dominating set in graphs with degree bounded by 3 | 2013-12-19 | Paper |
| An Improved Exact Algorithm for Undirected Feedback Vertex Set | 2013-12-10 | Paper |
| Minmax Tree Cover in the Euclidean Space | 2013-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2843925 | 2013-08-27 | Paper |
| CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS | 2013-06-12 | Paper |
| An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure | 2013-05-28 | Paper |
| Linear Layouts in Submodular Systems | 2013-03-21 | Paper |
| Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs | 2013-02-19 | Paper |
| FPTASs for trimming weighted trees | 2013-02-19 | Paper |
| AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS | 2012-11-23 | Paper |
| Characterizing Mechanisms in Obnoxious Facility Game | 2012-11-02 | Paper |
| An Improved Exact Algorithm for TSP in Degree-4 Graphs | 2012-09-25 | Paper |
| Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints | 2012-08-10 | Paper |
| A Refined Exact Algorithm for Edge Dominating Set | 2012-07-16 | Paper |
| Submodular Minimization via Pathwidth | 2012-07-16 | Paper |
| Network design with weighted degree constraints | 2012-06-20 | Paper |
| A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners | 2012-04-26 | Paper |
| Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems | 2012-04-26 | Paper |
| A plane graph representation of triconnected graphs | 2012-04-03 | Paper |
| An FPT algorithm for edge subset feedback edge set | 2012-03-09 | Paper |
| Improved Bounds for Minimum Fault-Tolerant Gossip Graphs | 2011-12-16 | Paper |
| Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra | 2011-12-14 | Paper |
| An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem | 2011-11-11 | Paper |
| On the one-dimensional stock cutting problem in the paper tube industry | 2011-10-18 | Paper |
| Further Improvement on Maximum Independent Set in Degree-4 Graphs | 2011-08-12 | Paper |
| Parameterized Edge Dominating Set in Cubic Graphs | 2011-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2999651 | 2011-05-16 | Paper |
| Efficient branch-and-bound algorithms for weighted MAX-2-SAT | 2011-05-11 | Paper |
| Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming | 2011-05-11 | Paper |
| Approximating capacitated tree-routings in networks | 2011-03-17 | Paper |
| Cop-robber guarding game with cycle robber-region | 2011-02-02 | Paper |
| Listing Triconnected Rooted Plane Graphs | 2011-01-10 | Paper |
| Generating Trees on Multisets | 2010-12-09 | Paper |
| A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs | 2010-09-16 | Paper |
| Approximation algorithms for minimizing edge crossings in radial drawings | 2010-09-16 | Paper |
| Constant Time Generation of Biconnected Rooted Plane Graphs | 2010-09-07 | Paper |
| FPTAS’s for Some Cut Problems in Weighted Trees | 2010-09-07 | Paper |
| Convex drawings of hierarchical planar graphs and clustered planar graphs | 2010-08-18 | Paper |
| On the approximation of the generalized capacitated tree-routing problem | 2010-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579461 | 2010-08-06 | Paper |
| Generating Internally Triconnected Rooted Plane Graphs | 2010-06-17 | Paper |
| Minimum Transversals in Posimodular Systems | 2010-06-01 | Paper |
| Enumerating Rooted Graphs with Reflectional Block Structures | 2010-05-28 | Paper |
| Approximating the minmax rooted-tree cover in a tree | 2010-03-24 | Paper |
| Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs | 2010-02-23 | Paper |
| Minimum degree orderings | 2010-02-23 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| Minimum cost subpartitions in graphs | 2010-01-29 | Paper |
| Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming | 2009-12-17 | Paper |
| Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems | 2009-12-17 | Paper |
| Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries | 2009-12-17 | Paper |
| Upward Star-Shaped Polyhedral Graphs | 2009-12-17 | Paper |
| An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem | 2009-11-23 | Paper |
| Bipartite Graph Representation of Multiple Decision Table Classifiers | 2009-11-19 | Paper |
| An algorithm for constructing star-shaped drawings of plane graphs | 2009-11-16 | Paper |
| New Approximation to the One-sided Radial Crossing Minimization | 2009-10-21 | Paper |
| Network design with edge-connectivity and degree constraints | 2009-09-02 | Paper |
| On computing minimum\((s,t)\)-cuts in digraphs | 2009-08-27 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Counting edge crossings in a 2-layered drawing | 2009-07-21 | Paper |
| Cop-Robber Guarding Game with Cycle Robber Region | 2009-07-14 | Paper |
| A simple recognition of maximal planar graphs | 2009-07-09 | Paper |
| Exact algorithms for the two-dimensional strip packing problem with and without rotations | 2009-06-30 | Paper |
| Eulerian detachments with local edge-connectivity | 2009-06-30 | Paper |
| A detachment algorithm for inferring a graph from path frequency | 2009-04-29 | Paper |
| A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem | 2009-03-23 | Paper |
| Drawing slicing graphs with face areas | 2009-03-20 | Paper |
| Removing Node Overlaps Using Multi-sphere Scheme | 2009-03-03 | Paper |
| Minmax Tree Cover in the Euclidean Space | 2009-02-24 | Paper |
| Network Design with Weighted Degree Constraints | 2009-02-24 | Paper |
| Algorithmic Aspects of Graph Connectivity | 2008-12-04 | Paper |
| Convex drawings of graphs with non-convex boundary constraints | 2008-09-29 | Paper |
| Convex Drawings of Graphs with Non-convex Boundary | 2008-09-04 | Paper |
| Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints | 2008-07-10 | Paper |
| Approximating the Generalized Capacitated Tree-Routing Problem | 2008-07-10 | Paper |
| Minimum Degree Orderings | 2008-05-27 | Paper |
| Approximation to the Minimum Cost Edge Installation Problem | 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) | 2008-04-29 | Paper |
| “Rent-or-Buy” Scheduling and Cost Coloring Problems | 2008-04-24 | Paper |
| Approximating Crossing Minimization in Radial Layouts | 2008-04-15 | Paper |
| Approximating a vehicle scheduling problem with time windows and handling times | 2008-04-15 | Paper |
| Minimum Transversals in Posi-modular Systems | 2008-03-11 | Paper |
| An improved approximation algorithm for capacitated multicast routings in networks | 2008-03-05 | Paper |
| Network Design with Edge-Connectivity and Degree Constraints | 2008-02-21 | Paper |
| Generalizing the induced matching by edge capacity constraints | 2008-01-18 | Paper |
| The source location problem with local 3-vertex-connectivity requirements | 2007-11-30 | Paper |
| The Set Connector Problem in Graphs | 2007-11-29 | Paper |
| A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem | 2007-11-29 | Paper |
| A Multi-sphere Scheme for 2D and 3D Packing Problems | 2007-11-29 | Paper |
| Approximating Capacitated Tree-Routings in Networks | 2007-11-13 | Paper |
| An Efficient Algorithm for Generating Colored Outerplanar Graphs | 2007-11-13 | Paper |
| Orthogonal Drawings for Plane Graphs with Specified Face Areas | 2007-11-13 | Paper |
| A Deterministic Algorithm for Finding All Minimum k‐Way Cuts | 2007-10-22 | Paper |
| Approximability of the capacitated \(b\)-edge dominating set problem | 2007-10-18 | Paper |
| A Detachment Algorithm for Inferring a Graph from Path Frequency | 2007-09-10 | Paper |
| Bisecting a 4-connected graph with three resource sets | 2007-07-19 | Paper |
| Drawing \(c\)-planar biconnected clustered graphs | 2007-06-08 | Paper |
| Some Theorems on Detachments Preserving Local-Edge-Connectivity | 2007-05-29 | Paper |
| Minimum cost source location problem with local 3-vertex-connectivity requirements | 2007-03-15 | Paper |
| An approximation algorithm for dissecting a rectangle into rectangles with specified areas | 2007-03-08 | Paper |
| Two equivalent measures on weighted hypergraphs | 2007-01-09 | Paper |
| Sparse connectivity certificates via MA orderings in graphs | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| PACKING SOFT RECTANGLES | 2006-10-16 | Paper |
| Augmenting forests to meet odd diameter requirements | 2006-10-10 | Paper |
| Minmax subtree cover problem on cacti | 2006-06-30 | Paper |
| Straight-line drawing algorithms for hierarchical graphs and clustered graphs | 2006-06-14 | Paper |
| Augmenting a \((k-1)\)-vertex-connected multigraph to an \(\ell\)-edge-connected and \(k\)-vertex-connected multigraph | 2006-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3368663 | 2006-02-08 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Packing unit squares in a rectangle | 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 connected graph | 2005-09-28 | Paper |
| A robust algorithm for bisecting a triconnected graph with two resource sets | 2005-09-22 | Paper |
| An improved bound on the one-sided minimum crossing number in two-layered drawings | 2005-08-02 | Paper |
| GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(<Special Issue>Network Design, Control and Optimization) | 2005-04-23 | Paper |
| On the one-sided crossing minimization in a bipartite graph with large degrees | 2005-04-06 | Paper |
| Greedy splitting algorithms for approximating multiway partition problems | 2005-03-17 | Paper |
| On generalized greedy splitting algorithms for multiway partition problems | 2004-11-23 | Paper |
| An approximability result of the multi-vehicle scheduling problem on a path with release and handling times | 2004-10-27 | Paper |
| A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472505 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474072 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474082 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474133 | 2004-08-04 | Paper |
| Convex embeddings and bisections of 3-connected graphs | 2003-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425954 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427866 | 2003-09-14 | Paper |
| 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. | 2003-09-09 | Paper |
| On the minimum local-vertex-connectivity augmentation in graphs | 2003-09-09 | Paper |
| An edge-splitting algorithm in planar graphs | 2003-08-28 | Paper |
| An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree | 2003-03-09 | Paper |
| A primal-dual approximation algorithm for the survivable network design problem in hypergraphs | 2003-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796177 | 2003-03-02 | Paper |
| Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks | 2002-09-29 | Paper |
| Graph connectivity and its augmentation: Applications of MA orderings | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548331 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548337 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548783 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548785 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548786 | 2002-08-26 | Paper |
| Minimum cost source location problem with vertex-connectivity requirements in digraphs | 2002-07-25 | Paper |
| Bounds on the number of isolates in sum graph labeling | 2002-06-27 | Paper |
| A 2-approximation algorithm for the minimum weight edge dominating set problem | 2002-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331296 | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762526 | 2002-01-09 | Paper |
| Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts | 2002-01-08 | Paper |
| Multigraph augmentation under biconnectivity and general edge-connectivity requirements | 2001-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511243 | 2001-11-28 | Paper |
| Augmenting a submodular and posi-modular set function by a multigraph | 2001-09-19 | Paper |
| An Efficient Algorithm for a Sparse k-Edge-Connectivity Certificate | 2001-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721988 | 2001-07-11 | Paper |
| Totally balanced combinatorial optimization games | 2001-06-10 | Paper |
| A fast algorithm for computing minimum 3-way and 4-way cuts | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761860 | 2001-02-21 | Paper |
| Polyhedral structure of submodular and posi-modular systems | 2001-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525700 | 2001-01-24 | Paper |
| Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph | 2001-01-14 | Paper |
| Independent spanning trees with small depths in iterated line digraphs | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511240 | 2000-10-30 | Paper |
| A faster algorithm for computing minimum 5-way and 6-way cuts in graphs | 2000-10-30 | Paper |
| Drawing Clustered Graphs on an Orthogonal Grid | 2000-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494938 | 2000-08-20 | Paper |
| Algorithmic Aspects of the Core of Combinatorial Optimization Games | 2000-07-19 | Paper |
| A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs | 2000-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953342 | 2000-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938784 | 2000-03-27 | Paper |
| A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938657 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937876 | 2000-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937178 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705030 | 1999-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703145 | 1999-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703856 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253477 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268432 | 1999-10-31 | Paper |
| Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263725 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249524 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249525 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249538 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250193 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228455 | 1999-05-18 | Paper |
| A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons | 1999-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370202 | 1998-12-02 | Paper |
| Two Arc-Disjoint Paths in Eulerian Digraphs | 1998-09-21 | Paper |
| Complexity Of The Single Vehicle Scheduling Problem On Graphs | 1998-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840350 | 1998-08-10 | Paper |
| Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs | 1998-04-13 | Paper |
| Computing All Small Cuts in an Undirected Network | 1998-02-09 | Paper |
| VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS | 1997-10-30 | Paper |
| Complexity of the Minimum Base Game on Matroids | 1997-10-05 | Paper |
| Vehicle scheduling on a tree with release and handling times | 1997-06-16 | Paper |
| CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK | 1997-01-22 | Paper |
| Implementing an efficient minimum capacity cut algorithm | 1995-09-27 | Paper |
| An exact lower bound on the number of cut‐sets in multigraphs | 1995-02-16 | Paper |
| Canonical cactus representation for miminum cuts | 1995-01-19 | Paper |
| On sparse subgraphs preserving connectivity properties | 1993-08-24 | Paper |
| On Onaga's upper bound on the mean values of probabilistic maximum flows | 1993-01-16 | Paper |
| A linear time algorithm for computing 3-edge-connected components in a multigraph | 1993-01-16 | Paper |
| Counting the number of minimum cuts in undirected multigraphs | 1992-06-28 | Paper |
| Computing Edge-Connectivity in Multigraphs and Capacitated Graphs | 1992-06-28 | Paper |
| A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph | 1992-06-28 | Paper |
| Maximum flows in probabilistic networks | 1992-06-27 | Paper |
| Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities | 1990-01-01 | Paper |
| Multicommodity flows in certain planar directed networks | 1990-01-01 | Paper |
| On max-flow min-cut and integral flow properties for multicommodity flows in directed networks | 1989-01-01 | Paper |
