| Publication | Date of Publication | Type |
|---|
| Bicriteria approximation for k-edge-connectivity | 2026-08-31 | Paper |
| Tight analysis of the primal-dual method for edge-covering pliable set families | 2026-08-05 | Paper |
A logarithmic approximation algorithm for the activation edge-multicover problem
Theoretical Computer Science | 2026-06-15 | Paper |
| Parameterized algorithms for node connectivity augmentation problems | 2026-05-26 | Paper |
Extending the primal-dual 2-approximation algorithm beyond uncrossable set families
Mathematical Programming. Series A. Series B | 2026-05-08 | Paper |
| Data structures for node connectivity queries | 2025-06-19 | Paper |
| Improved approximation algorithms for covering pliable set families and flexible graph connectivity | 2025-06-06 | Paper |
| Extending the primal-dual 2-approximation algorithm beyond uncrossable set families | 2025-02-07 | Paper |
A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
Information Processing Letters | 2025-01-14 | Paper |
Approximation algorithms for node and element connectivity augmentation problems
Theory of Computing Systems | 2024-11-12 | Paper |
| Improved approximations for relative survivable network design | 2024-07-19 | Paper |
2-node-connectivity network design
Theoretical Computer Science | 2024-03-01 | Paper |
On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
SN Operations Research Forum | 2024-02-20 | Paper |
An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
Lecture Notes in Computer Science | 2024-01-12 | Paper |
Practical budgeted submodular maximization
Algorithmica | 2023-04-28 | Paper |
| Approximating k-Connected m-Dominating Sets | 2023-02-07 | Paper |
Bounded Degree Group Steiner Tree Problems
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Approximating activation edge-cover and facility location problems
Theoretical Computer Science | 2022-08-25 | Paper |
| Approximating activation edge-cover and facility location problems | 2022-07-21 | Paper |
Approximating \(k\)-connected \(m\)-dominating sets
Algorithmica | 2022-06-01 | Paper |
2-node-connectivity network design
(available as arXiv preprint) | 2022-03-22 | Paper |
Approximation algorithms for connectivity augmentation problems
(available as arXiv preprint) | 2022-03-21 | Paper |
On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
(available as arXiv preprint) | 2022-03-21 | Paper |
The minimum degree group Steiner problem
Discrete Applied Mathematics | 2022-01-13 | Paper |
A 4+ approximation for k-connected subgraphs
Journal of Computer and System Sciences | 2021-10-28 | Paper |
A polylogarithmic approximation algorithm for 2-edge-connected dominating set
Information Processing Letters | 2021-10-19 | Paper |
| Covering users by a connected swarm efficiently | 2021-07-08 | Paper |
On the tree augmentation problem
Algorithmica | 2021-03-26 | Paper |
On the tree augmentation problem
Algorithmica | 2021-03-26 | Paper |
A 4 + <i>ε</i> approximation for <i>k</i>-connected subgraphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| scientific article; zbMATH DE number 7205039 (Why is no real title available?) | 2020-05-27 | Paper |
Improved approximation algorithms for minimum power covering problems
Theoretical Computer Science | 2019-10-18 | Paper |
| An almost O( k)-approximation for k-connected subgraphs | 2019-05-06 | Paper |
| Improved approximating algorithms for directed Steiner forest | 2019-05-06 | Paper |
Improved approximation algorithms for minimum power covering problems
Approximation and Online Algorithms | 2019-01-15 | Paper |
Erratum: ``Approximating minimum-cost connectivity problems via uncrossable bifamilies''
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Improved Approximation Algorithm for Steiner <i>k</i> -Forest with Nearly Uniform Weights
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Approximation algorithms and hardness results for cycle packing problems
ACM Transactions on Algorithms | 2018-11-05 | Paper |
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
ACM Transactions on Algorithms | 2018-11-05 | Paper |
A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems
Information Processing Letters | 2018-10-19 | Paper |
Approximating Steiner trees and forests with minimum number of Steiner points
Journal of Computer and System Sciences | 2018-10-17 | Paper |
Improved approximation algorithms for minimum cost node-connectivity augmentation problems
Theory of Computing Systems | 2018-06-01 | Paper |
| LP-relaxations for tree augmentation | 2018-04-19 | Paper |
LP-relaxations for tree augmentation
Discrete Applied Mathematics | 2018-03-21 | Paper |
Approximating source location and star survivable network problems
Theoretical Computer Science | 2017-05-12 | Paper |
| Improved approximation algorithm for Steiner k-Forest with nearly uniform weights | 2017-03-22 | Paper |
Approximating source location and star survivable network problems
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Improved approximation algorithms for min-cost connectivity augmentation problems
Computer Science – Theory and Applications | 2016-07-25 | Paper |
On fixed cost k-flow problems
Theory of Computing Systems | 2016-03-21 | Paper |
Approximating Steiner trees and forests with minimum number of Steiner points
Approximation and Online Algorithms | 2015-11-20 | Paper |
Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
SIAM Journal on Computing | 2015-10-08 | Paper |
Approximating minimum power edge-multi-covers
Journal of Combinatorial Optimization | 2015-09-28 | Paper |
Degree constrained node-connectivity problems
Algorithmica | 2015-01-19 | Paper |
Approximating minimum-cost connectivity problems via uncrossable bifamilies
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Prize-collecting steiner network problems
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Approximating connectivity augmentation problems
ACM Transactions on Algorithms | 2014-11-18 | Paper |
| Approximating connectivity augmentation problems | 2014-10-13 | Paper |
| Approximation algorithms for cycle packing problems | 2014-10-13 | Paper |
On fixed cost \(k\)-flow problems
Approximation and Online Algorithms | 2014-09-02 | Paper |
Approximating minimum-cost edge-covers of crossing biset-families
Combinatorica | 2014-08-14 | Paper |
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Small \(\ell\)-edge-covers in \(k\)-connected graphs
Discrete Applied Mathematics | 2014-04-22 | Paper |
Steiner forest orientation problems
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
Theoretical Computer Science | 2013-12-19 | Paper |
Survivable network activation problems
Theoretical Computer Science | 2013-12-11 | Paper |
Approximating survivable networks with minimum number of Steiner points
Networks | 2013-08-06 | Paper |
On some network design problems with degree constraints
Journal of Computer and System Sciences | 2013-07-24 | Paper |
Approximating subset \(k\)-connectivity problems
Journal of Discrete Algorithms | 2013-06-24 | Paper |
A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
Information Processing Letters | 2013-04-04 | Paper |
| Approximating fault-tolerant group-Steiner problems | 2012-10-24 | Paper |
Improved approximation algorithms for maximum lifetime problems in wireless networks
Theoretical Computer Science | 2012-10-11 | Paper |
Steiner forest orientation problems
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Approximating minimum power edge-multi-covers
Lecture Notes in Computer Science | 2012-09-10 | Paper |
Approximating subset k-connectivity problems
Approximation and Online Algorithms | 2012-07-16 | Paper |
Degree-constrained node-connectivity
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Survivable network activation problems
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Improved approximation algorithms for directed Steiner forest
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Approximating node-connectivity augmentation problems
Algorithmica | 2012-04-26 | Paper |
Approximating fault-tolerant group-Steiner problems
Theoretical Computer Science | 2012-03-13 | Paper |
A note on labeling schemes for graph connectivity
Information Processing Letters | 2012-03-09 | Paper |
Approximating some network design problems with node costs
Theoretical Computer Science | 2011-09-12 | Paper |
A (1 + 2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Network-design with degree constraints
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Approximating survivable networks with \(\beta \)-metric costs
Journal of Discrete Algorithms | 2011-07-29 | Paper |
Approximating minimum-power degree and connectivity problems
Algorithmica | 2011-07-01 | Paper |
Approximating Steiner networks with node-weights
SIAM Journal on Computing | 2011-04-04 | Paper |
Approximating maximum subgraphs without short cycles
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
Approximating directed weighted-degree constrained networks
Theoretical Computer Science | 2011-02-21 | Paper |
Approximating survivable networks with minimum number of Steiner points
Lecture Notes in Computer Science | 2011-02-15 | Paper |
A note on Rooted Survivable Networks
Information Processing Letters | 2010-09-01 | Paper |
Wireless network design via 3-decompositions
Information Processing Letters | 2010-09-01 | Paper |
Approximation algorithm for k-node connected subgraphs via critical graphs
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Covering a laminar family by leaf to leaf links
Discrete Applied Mathematics | 2010-08-13 | Paper |
Prize-collecting Steiner network problems
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Approximating minimum power covers of intersecting families and directed edge-connectivity problems
Theoretical Computer Science | 2010-06-07 | Paper |
Approximating rooted connectivity augmentation problems
Lecture Notes in Computer Science | 2010-05-26 | Paper |
On minimum power connectivity problems
Journal of Discrete Algorithms | 2010-05-25 | Paper |
Approximating maximum satisfiable subsystems of linear equations of bounded width
Information Processing Letters | 2010-04-19 | Paper |
Approximating Some Network Design Problems with Node Costs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Approximating Node-Connectivity Augmentation Problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
