| Publication | Date of Publication | Type |
|---|
| A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths | 2025-01-14 | Paper |
| Approximation algorithms for node and element connectivity augmentation problems | 2024-11-12 | Paper |
| Improved approximations for relative survivable network design | 2024-07-19 | Paper |
| 2-node-connectivity network design | 2024-03-01 | Paper |
| On rooted \(k\)-connectivity problems in quasi-bipartite digraphs | 2024-02-20 | Paper |
| An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths | 2024-01-12 | Paper |
| Practical budgeted submodular maximization | 2023-04-28 | Paper |
| Approximating k-Connected m-Dominating Sets | 2023-02-07 | Paper |
| Bounded Degree Group Steiner Tree Problems | 2022-10-13 | Paper |
| Approximating activation edge-cover and facility location problems | 2022-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092379 | 2022-07-21 | Paper |
| Approximating \(k\)-connected \(m\)-dominating sets | 2022-06-01 | Paper |
| 2-node-connectivity network design | 2022-03-22 | Paper |
| On rooted \(k\)-connectivity problems in quasi-bipartite digraphs | 2022-03-21 | Paper |
| Approximation algorithms for connectivity augmentation problems | 2022-03-21 | Paper |
| The minimum degree group Steiner problem | 2022-01-13 | Paper |
| A \(4+\epsilon\) approximation for \(k\)-connected subgraphs | 2021-10-28 | Paper |
| A polylogarithmic approximation algorithm for 2-edge-connected dominating set | 2021-10-19 | Paper |
| Covering users by a connected swarm efficiently | 2021-07-08 | Paper |
| On the tree augmentation problem | 2021-03-26 | Paper |
| A 4 + ε approximation for k-connected subgraphs | 2021-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111750 | 2020-05-27 | Paper |
| Improved approximation algorithms for minimum power covering problems | 2019-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633904 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633905 | 2019-05-06 | Paper |
| Improved approximation algorithms for minimum power covering problems | 2019-01-15 | Paper |
| Erratum | 2018-11-13 | Paper |
| Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights | 2018-11-12 | Paper |
| Approximation algorithms and hardness results for cycle packing problems | 2018-11-05 | Paper |
| A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2 | 2018-11-05 | Paper |
| A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2 | 2018-10-30 | Paper |
| Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems | 2018-10-19 | Paper |
| Approximating Steiner trees and forests with minimum number of Steiner points | 2018-10-17 | Paper |
| Improved approximation algorithms for minimum cost node-connectivity augmentation problems | 2018-06-01 | Paper |
| LP-Relaxations for Tree Augmentation. | 2018-04-19 | Paper |
| LP-relaxations for tree augmentation | 2018-03-21 | Paper |
| Approximating source location and star survivable network problems | 2017-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969613 | 2017-03-22 | Paper |
| Approximating Source Location and Star Survivable Network Problems | 2016-10-21 | Paper |
| Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems | 2016-07-25 | Paper |
| On fixed cost \(k\)-flow problems | 2016-03-21 | Paper |
| Approximating Steiner Trees and Forests with Minimum Number of Steiner Points | 2015-11-20 | Paper |
| Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design | 2015-10-08 | Paper |
| Approximating minimum power edge-multi-covers | 2015-09-28 | Paper |
| Degree constrained node-connectivity problems | 2015-01-19 | Paper |
| Prize-collecting steiner network problems | 2014-12-05 | Paper |
| Approximating minimum-cost connectivity problems via uncrossable bifamilies | 2014-12-05 | Paper |
| Approximating connectivity augmentation problems | 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 | 2014-09-02 | Paper |
| Approximating minimum-cost edge-covers of crossing biset-families | 2014-08-14 | Paper |
| Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions | 2014-07-25 | Paper |
| Small \(\ell\)-edge-covers in \(k\)-connected graphs | 2014-04-22 | Paper |
| Steiner forest orientation problems | 2014-01-21 | Paper |
| A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius | 2013-12-19 | Paper |
| Survivable network activation problems | 2013-12-11 | Paper |
| Approximating survivable networks with minimum number of Steiner points | 2013-08-06 | Paper |
| On some network design problems with degree constraints | 2013-07-24 | Paper |
| Approximating subset \(k\)-connectivity problems | 2013-06-24 | Paper |
| A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\) | 2013-04-04 | Paper |
| Approximating fault-tolerant group-Steiner problems | 2012-10-24 | Paper |
| Improved approximation algorithms for maximum lifetime problems in wireless networks | 2012-10-11 | Paper |
| Steiner forest orientation problems | 2012-09-25 | Paper |
| Approximating minimum power edge-multi-covers | 2012-09-10 | Paper |
| Approximating subset \(k\)-connectivity problems | 2012-07-16 | Paper |
| Degree-constrained node-connectivity | 2012-06-29 | Paper |
| Survivable network activation problems | 2012-06-29 | Paper |
| Improved approximation algorithms for directed Steiner forest | 2012-05-11 | Paper |
| Approximating node-connectivity augmentation problems | 2012-04-26 | Paper |
| Approximating fault-tolerant group-Steiner problems | 2012-03-13 | Paper |
| A note on labeling schemes for graph connectivity | 2012-03-09 | Paper |
| Approximating some network design problems with node costs | 2011-09-12 | Paper |
| Network-design with degree constraints | 2011-08-17 | Paper |
| A \((1 + \ln 2)\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius | 2011-08-17 | Paper |
| Approximating survivable networks with \(\beta \)-metric costs | 2011-07-29 | Paper |
| Approximating minimum-power degree and connectivity problems | 2011-07-01 | Paper |
| Approximating Steiner networks with node-weights | 2011-04-04 | Paper |
| Approximating maximum subgraphs without short cycles | 2011-03-15 | Paper |
| Approximating directed weighted-degree constrained networks | 2011-02-21 | Paper |
| Approximating survivable networks with minimum number of Steiner points | 2011-02-15 | Paper |
| Wireless network design via 3-decompositions | 2010-09-01 | Paper |
| A note on Rooted Survivable Networks | 2010-09-01 | Paper |
| Approximation algorithm for \(k\)-node connected subgraphs via critical graphs | 2010-08-15 | Paper |
| Covering a laminar family by leaf to leaf links | 2010-08-13 | Paper |
| Prize-collecting Steiner network problems | 2010-06-22 | Paper |
| Approximating minimum power covers of intersecting families and directed edge-connectivity problems | 2010-06-07 | Paper |
| Approximating rooted connectivity augmentation problems | 2010-05-26 | Paper |
| On minimum power connectivity problems | 2010-05-25 | Paper |
| Approximating maximum satisfiable subsystems of linear equations of bounded width | 2010-04-19 | Paper |
| Approximating Some Network Design Problems with Node Costs | 2009-10-28 | Paper |
| Approximating Node-Connectivity Augmentation Problems | 2009-10-28 | Paper |
| Approximating minimum-power edge-covers and 2,3-connectivity | 2009-06-24 | Paper |
| Inapproximability of survivable networks | 2009-05-28 | Paper |
| A note on two source location problems | 2009-05-13 | Paper |
| On \((t,k)\)-shredders in \(k\)-connected graphs. | 2009-05-06 | Paper |
| Tight Approximation Algorithm for Connectivity Augmentation Problems | 2009-03-12 | Paper |
| Listing minimal edge-covers of intersecting families with applications to connectivity problems | 2009-03-04 | Paper |
| Inapproximability of Survivable Networks | 2008-11-27 | Paper |
| Approximating Directed Weighted-Degree Constrained Networks | 2008-11-27 | Paper |
| Approximating Maximum Subgraphs without Short Cycles | 2008-11-27 | Paper |
| Approximating Interval Scheduling Problems with Bounded Profits | 2008-09-25 | Paper |
| On Minimum Power Connectivity Problems | 2008-09-25 | Paper |
| Tight approximation algorithm for connectivity augmentation problems | 2008-06-26 | Paper |
| On shredders and vertex connectivity augmentation | 2008-05-16 | Paper |
| On extremal \(k\)-outconnected graphs | 2008-05-13 | Paper |
| Approximating Minimum-Power Degree and Connectivity Problems | 2008-04-15 | Paper |
| Approximating Steiner Networks with Node Weights | 2008-04-15 | Paper |
| Power Optimization for Connectivity Problems | 2007-08-30 | Paper |
| Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems | 2007-08-28 | Paper |
| Power optimization for connectivity problems | 2007-04-19 | Paper |
| Packing directed cycles efficiently | 2007-02-19 | Paper |
| A \((1-1/e)\)-approximation algorithm for the generalized assignment problem | 2006-06-30 | Paper |
| Approximating rooted connectivity augmentation problems | 2006-06-14 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Approximating k-node Connected Subgraphs via Critical Graphs | 2005-10-28 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Greedy approximation algorithms for directed multicuts | 2005-08-05 | Paper |
| Approximating node connectivity problems via set covers | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780785 | 2002-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234099 | 2002-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753740 | 2001-11-11 | Paper |
| On rooted node-connectivity problems | 2001-10-14 | Paper |
| A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs | 2001-01-07 | Paper |
| A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph | 2000-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520241 | 2000-12-12 | Paper |
| On integrality, stability and composition of dicycle packings and covers | 2000-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252426 | 1999-06-17 | Paper |
| Faster approximation algorithms for weighted triconnectivity augmentation problems | 1999-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400846 | 1998-08-02 | Paper |
| On Mobile Robots Flow In Locally Uniform Networks | 1998-03-17 | Paper |
| Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs | 1997-11-12 | Paper |
| On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope | 1996-07-28 | Paper |
| On the integral dicycle packings and covers and the linear ordering polytope | 1995-07-24 | Paper |
