| Publication | Date of Publication | Type |
|---|
| Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions | 2024-11-14 | Paper |
Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions
Algorithmica | 2024-08-13 | Paper |
Approximation algorithms for flexible graph connectivity
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
| Approximation algorithms for flexible graph connectivity | 2024-02-05 | Paper |
| An improved approximation algorithm for the matching augmentation problem | 2024-01-15 | Paper |
A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case
(available as arXiv preprint) | 2023-10-31 | Paper |
Unconstrained traveling tournament problem is APX-complete
Operations Research Letters | 2023-09-12 | Paper |
On a partition LP relaxation for min-cost 2-node connected spanning subgraphs
Operations Research Letters | 2023-07-03 | Paper |
Approximation algorithms for feasible cut and multicut problems
Lecture Notes in Computer Science | 2023-05-08 | Paper |
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case
SIAM Journal on Discrete Mathematics | 2022-08-18 | Paper |
Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs
Discrete Mathematics | 2022-05-17 | Paper |
A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs
Operations Research Letters | 2022-03-11 | Paper |
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs
(available as arXiv preprint) | 2021-04-13 | Paper |
A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case
(available as arXiv preprint) | 2020-08-07 | Paper |
The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm
Mathematical Programming. Series A. Series B | 2020-06-26 | Paper |
On Eulerian orientations of even-degree hypercubes
Operations Research Letters | 2020-02-10 | Paper |
On Eulerian orientations of even-degree hypercubes
Operations Research Letters | 2020-02-10 | Paper |
| scientific article; zbMATH DE number 7053371 (Why is no real title available?) | 2019-05-10 | Paper |
Packing element-disjoint steiner trees
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Approximating rooted Steiner networks
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Approximating (unweighted) tree augmentation via lift-and-project. II
Algorithmica | 2018-04-06 | Paper |
Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
Algorithmica | 2018-04-06 | Paper |
On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy
Mathematical Programming. Series A. Series B | 2016-09-16 | Paper |
An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
Information Processing Letters | 2016-06-16 | Paper |
An <i>O</i> ( <i>VE</i> ) algorithm for ear decompositions of matching-covered graphs
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Approximating minimum-cost connected \(T\)-joins
Algorithmica | 2015-05-21 | Paper |
Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs
SIAM Journal on Computing | 2014-11-14 | Paper |
| An \(O(VE)\) algorithm for ear decompositions of matching-covered graphs | 2014-10-13 | Paper |
Packing of rigid spanning subgraphs and spanning trees
Journal of Combinatorial Theory. Series B | 2014-08-27 | Paper |
Approximation algorithms for minimum-cost \(k\)-\((S,T)\) connected digraphs
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy
Automata, Languages, and Programming | 2013-08-06 | Paper |
A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs
Discrete Optimization | 2013-03-13 | Paper |
On orienting graphs for connectivity: Projective planes and Halin graphs
Operations Research Letters | 2012-11-08 | Paper |
Approximating minimum-cost connected \(T\)-joins
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
Algorithmica | 2012-04-26 | Paper |
On the maximum size of a minimal \(k\)-edge connected augmentation
Journal of Combinatorial Theory. Series B | 2012-03-19 | Paper |
Approximation algorithms for network design with metric costs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Approximation algorithms for minimum-cost k-vertex connected subgraphs
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
On the integrality ratio for tree augmentation
Operations Research Letters | 2009-03-04 | Paper |
Approximation Algorithms for Network Design with Metric Costs
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
Hardness and approximation results for packing Steiner trees
Algorithmica | 2007-06-21 | Paper |
Network design via iterative rounding of setpair relaxations
Combinatorica | 2007-01-08 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Approximating directed multicuts
Combinatorica | 2006-01-26 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
An Approximation Algorithm for the Minimum-Cost <i>k</i>-Vertex Connected Subgraph
SIAM Journal on Computing | 2003-09-28 | Paper |
| scientific article; zbMATH DE number 1757945 (Why is no real title available?) | 2002-06-20 | Paper |
On rooted node-connectivity problems
Algorithmica | 2001-10-14 | Paper |
Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
Approximating the single-sink link-installation problem in network design
SIAM Journal on Optimization | 2001-03-19 | Paper |
Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching
SIAM Journal on Computing | 2000-10-18 | Paper |
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
Journal of Algorithms | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1405806 (Why is no real title available?) | 2000-09-27 | Paper |
| scientific article; zbMATH DE number 1256717 (Why is no real title available?) | 1999-05-18 | Paper |
| scientific article; zbMATH DE number 1187147 (Why is no real title available?) | 1998-08-10 | Paper |
| scientific article; zbMATH DE number 1182763 (Why is no real title available?) | 1998-08-02 | Paper |
| scientific article; zbMATH DE number 1079001 (Why is no real title available?) | 1998-04-22 | Paper |
Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory
SIAM Journal on Computing | 1998-02-10 | Paper |
| scientific article; zbMATH DE number 1003276 (Why is no real title available?) | 1997-10-05 | Paper |
An $o(n^3 )$-Time Maximum-Flow Algorithm
SIAM Journal on Computing | 1997-06-09 | Paper |
Hypercubes and Multicommodity Flows
SIAM Journal on Discrete Mathematics | 1997-05-26 | Paper |
| scientific article; zbMATH DE number 956857 (Why is no real title available?) | 1996-12-11 | Paper |
Algorithms for dense graphs and networks on the random access computer
Algorithmica | 1996-10-21 | Paper |
A Randomized Maximum-Flow Algorithm
SIAM Journal on Computing | 1995-05-30 | Paper |
| scientific article; zbMATH DE number 742980 (Why is no real title available?) | 1995-04-11 | Paper |
Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity
Combinatorica | 1995-02-01 | Paper |
| scientific article; zbMATH DE number 437526 (Why is no real title available?) | 1994-11-29 | Paper |
| scientific article; zbMATH DE number 515927 (Why is no real title available?) | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 177817 (Why is no real title available?) | 1993-05-18 | Paper |
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for <i>k</i>-Vertex Connectivity
SIAM Journal on Computing | 1993-05-16 | Paper |
Analysis of Preflow Push Algorithms for Maximum Network Flow
SIAM Journal on Computing | 1989-01-01 | Paper |
The parallel complexity of finding a blocking flow in a 3-layer network
Information Processing Letters | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4079142 (Why is no real title available?) | 1988-01-01 | Paper |
Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
Journal of Algorithms | 1988-01-01 | Paper |
