| Publication | Date of Publication | Type |
|---|
| Approximation algorithms for flexible graph connectivity | 2024-02-21 | Paper |
| Approximation algorithms for flexible graph connectivity | 2024-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147541 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6058192 | 2023-10-31 | Paper |
| Unconstrained traveling tournament problem is APX-complete | 2023-09-12 | Paper |
| On a partition LP relaxation for min-cost 2-node connected spanning subgraphs | 2023-07-03 | Paper |
| Approximation algorithms for feasible cut and multicut problems | 2023-05-08 | Paper |
| A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case | 2022-08-18 | Paper |
| Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs | 2022-05-17 | Paper |
| A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs | 2022-03-11 | Paper |
| A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs | 2021-04-13 | Paper |
| A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case | 2020-08-07 | Paper |
| The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm | 2020-06-26 | Paper |
| On Eulerian orientations of even-degree hypercubes | 2020-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743494 | 2019-05-10 | Paper |
| Packing element-disjoint steiner trees | 2018-11-05 | Paper |
| Approximating Rooted Steiner Networks | 2018-10-30 | Paper |
| Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP | 2018-04-06 | Paper |
| Approximating (unweighted) tree augmentation via lift-and-project. II | 2018-04-06 | Paper |
| On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy | 2016-09-16 | Paper |
| An analysis of the highest-level selection rule in the preflow-push max-flow algorithm | 2016-06-16 | Paper |
| An O ( VE ) algorithm for ear decompositions of matching-covered graphs | 2015-09-02 | Paper |
| Approximating minimum-cost connected \(T\)-joins | 2015-05-21 | Paper |
| Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs | 2014-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921696 | 2014-10-13 | Paper |
| Packing of rigid spanning subgraphs and spanning trees | 2014-08-27 | Paper |
| Approximation Algorithms for Minimum-Cost $k\hbox{-}(S,T)$ Connected Digraphs | 2014-01-21 | Paper |
| On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy | 2013-08-06 | Paper |
| A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs | 2013-03-13 | Paper |
| On orienting graphs for connectivity: Projective planes and Halin graphs | 2012-11-08 | Paper |
| Approximating Minimum-Cost Connected T-Joins | 2012-11-02 | Paper |
| Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs | 2012-04-26 | Paper |
| On the maximum size of a minimal \(k\)-edge connected augmentation | 2012-03-19 | Paper |
| Approximation algorithms for network design with metric costs | 2010-08-16 | Paper |
| Approximation algorithms for minimum-cost k-vertex connected subgraphs | 2010-08-05 | Paper |
| Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs | 2009-10-28 | Paper |
| On the integrality ratio for tree augmentation | 2009-03-04 | Paper |
| Approximation Algorithms for Network Design with Metric Costs | 2008-08-13 | Paper |
| Hardness and approximation results for packing Steiner trees | 2007-06-21 | Paper |
| Network design via iterative rounding of setpair relaxations | 2007-01-08 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Approximating directed multicuts | 2006-01-26 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph | 2003-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537732 | 2002-06-20 | Paper |
| On rooted node-connectivity problems | 2001-10-14 | Paper |
| Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph | 2001-03-19 | Paper |
| Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching | 2000-10-18 | Paper |
| Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938792 | 2000-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228452 | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840352 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400846 | 1998-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4361183 | 1998-04-22 | Paper |
| Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory | 1998-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128905 | 1997-10-05 | Paper |
| An $o(n^3 )$-Time Maximum-Flow Algorithm | 1997-06-09 | Paper |
| Hypercubes and Multicommodity Flows | 1997-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687265 | 1996-12-11 | Paper |
| Algorithms for dense graphs and networks on the random access computer | 1996-10-21 | Paper |
| A Randomized Maximum-Flow Algorithm | 1995-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763419 | 1995-04-11 | Paper |
| Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity | 1995-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140398 | 1994-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4283439 | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038695 | 1993-05-18 | Paper |
| Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity | 1993-05-16 | Paper |
| The parallel complexity of finding a blocking flow in a 3-layer network | 1989-01-01 | Paper |
| Analysis of Preflow Push Algorithms for Maximum Network Flow | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3809566 | 1988-01-01 | Paper |
| Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs | 1988-01-01 | Paper |
