| Publication | Date of Publication | Type |
|---|
| On approximating degree-bounded network design problems | 2023-10-31 | Paper |
| Generating sparse 2—spanners | 2022-12-09 | 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 |
| On approximating degree-bounded network design problems | 2022-05-03 | Paper |
| Tight bounds on subexponential time approximation of set cover and related problems | 2022-03-22 | Paper |
| The minimum degree group Steiner problem | 2022-01-13 | Paper |
| Network design under general wireless interference | 2021-11-19 | Paper |
| Spanning Trees With Edge Conflicts and Wireless Connectivity | 2021-07-28 | Paper |
| Approximating Spanners and Directed Steiner Forest | 2021-05-03 | Paper |
| Radio aggregation scheduling | 2020-09-17 | Paper |
| From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More | 2020-08-18 | Paper |
| Approximation algorithms for connected maximum cut and related problems | 2020-03-12 | Paper |
| Improved approximation algorithms for minimum power covering problems | 2019-10-18 | Paper |
| Matroid Secretary for Regular and Decomposable Matroids | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633905 | 2019-05-06 | Paper |
| Improved approximation algorithms for minimum power covering problems | 2019-01-15 | Paper |
| Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights | 2018-11-12 | Paper |
| Improved bounds for scheduling conflicting jobs with minsum criteria | 2018-11-05 | Paper |
| A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2 | 2018-11-05 | Paper |
| Approximation Algorithms for Movement Repairmen | 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 |
| Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner | 2018-10-30 | Paper |
| The Densest $k$-Subhypergraph Problem | 2018-07-18 | Paper |
| Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds | 2018-07-16 | Paper |
| The minimum color sum of bipartite graphs | 2018-07-04 | Paper |
| A bounded-risk mechanism for the kidney exchange game | 2018-05-24 | Paper |
| The Densest k-Subhypergraph Problem | 2018-04-19 | Paper |
| LP-Relaxations for Tree Augmentation. | 2018-04-19 | Paper |
| LP-relaxations for tree augmentation | 2018-03-21 | Paper |
| Bicovering: Covering edges with two small subsets of vertices | 2017-12-19 | Paper |
| Bi-Covering: Covering Edges with Two Small Subsets of Vertices | 2017-12-11 | Paper |
| On maximum leaf trees and connections to connected maximum cut problems | 2017-10-18 | Paper |
| Approximating source location and star survivable network problems | 2017-05-12 | Paper |
| A tight algorithm for strongly connected Steiner subgraph on two terminals with demands | 2017-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969613 | 2017-03-22 | Paper |
| Approximating Source Location and Star Survivable Network Problems | 2016-10-21 | Paper |
| A Bounded-Risk Mechanism for the Kidney Exchange Game | 2016-05-03 | Paper |
| On fixed cost \(k\)-flow problems | 2016-03-21 | Paper |
| Approximation algorithms for connected maximum cut and related problems | 2015-11-19 | Paper |
| A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) | 2015-09-15 | Paper |
| On Set Expansion Problems and the Small Set Expansion Conjecture | 2015-09-09 | Paper |
| On network design problems: fixed cost flows and the covering steiner problem | 2015-09-02 | Paper |
| Improved results for data migration and open shop scheduling | 2015-09-02 | Paper |
| An improved algorithm for radio broadcast | 2015-09-02 | Paper |
| On set expansion problems and the small set expansion conjecture | 2015-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501786 | 2015-08-14 | Paper |
| Matroid Secretary for Regular and Decomposable Matroids | 2015-02-09 | Paper |
| On a local protocol for concurrent file transfers | 2015-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934722 | 2014-12-18 | Paper |
| Corrigendum | 2014-12-05 | Paper |
| Prize-collecting steiner network problems | 2014-12-05 | Paper |
| On the advantage of overlapping clusters for minimizing conductance | 2014-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921674 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921751 | 2014-10-13 | Paper |
| Approximating the domatic number | 2014-09-26 | Paper |
| Sum edge coloring of multigraphs via configuration LP | 2014-09-09 | Paper |
| On Fixed Cost k-Flow Problems | 2014-09-02 | Paper |
| Steiner Forest Orientation Problems | 2014-01-21 | Paper |
| Fixed-Parameter and Approximation Algorithms: A New Look | 2013-12-10 | Paper |
| Approximation Algorithms for Movement Repairmen | 2013-10-04 | Paper |
| Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner | 2013-08-12 | Paper |
| On some network design problems with degree constraints | 2013-07-24 | Paper |
| A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\) | 2013-04-04 | Paper |
| Two-stage robust network design with exponential scenarios | 2013-03-05 | Paper |
| Local search algorithms for the red-blue median problem | 2012-12-06 | Paper |
| Approximating Fault-Tolerant Group-Steiner problems | 2012-10-24 | Paper |
| The checkpoint problem | 2012-10-11 | Paper |
| Steiner Forest Orientation Problems | 2012-09-25 | Paper |
| Advantage of Overlapping Clusters for Minimizing Conductance | 2012-06-29 | Paper |
| Improved approximation algorithms for directed Steiner forest | 2012-05-11 | Paper |
| Approximating fault-tolerant group-Steiner problems | 2012-03-13 | Paper |
| Approximating some network design problems with node costs | 2011-09-12 | Paper |
| Network-Design with Degree Constraints | 2011-08-17 | Paper |
| Approximating minimum-power degree and connectivity problems | 2011-07-01 | Paper |
| Approximating Maximum Subgraphs without Short Cycles | 2011-03-15 | Paper |
| Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design | 2010-11-04 | Paper |
| The Checkpoint Problem | 2010-09-10 | Paper |
| Budgeted Red-Blue Median and Its Generalizations | 2010-09-06 | Paper |
| Asymmetric k-center is log * n -hard to approximate | 2010-08-15 | Paper |
| Approximation algorithm for k-node connected subgraphs via critical graphs | 2010-08-15 | Paper |
| Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem | 2010-08-05 | Paper |
| Prize-Collecting Steiner Network Problems | 2010-06-22 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Approximating Some Network Design Problems with Node Costs | 2009-10-28 | Paper |
| Approximating minimum-power edge-covers and 2,3-connectivity | 2009-06-24 | Paper |
| Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees | 2009-05-13 | Paper |
| A note on two source location problems | 2009-05-13 | Paper |
| Tight Approximation Algorithm for Connectivity Augmentation Problems | 2009-03-12 | Paper |
| Asymmetric k -center is log * n -hard to approximate | 2008-12-21 | Paper |
| Approximating Maximum Subgraphs without Short Cycles | 2008-11-27 | Paper |
| Two-Stage Robust Network Design with Exponential Scenarios | 2008-11-25 | Paper |
| Complete partitions of graphs | 2008-10-21 | Paper |
| Tight approximation algorithm for connectivity augmentation problems | 2008-06-26 | Paper |
| Min Sum Edge Coloring in Multigraphs Via Configuration LP | 2008-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387684 | 2008-05-27 | Paper |
| An Improved Approximation of the Achromatic Number on Bipartite Graphs | 2008-05-22 | Paper |
| Approximating Minimum-Power Degree and Connectivity Problems | 2008-04-15 | Paper |
| The minimum shift design problem | 2008-01-25 | Paper |
| Integrality Ratio for Group Steiner Trees and Directed Steiner Trees | 2007-10-22 | Paper |
| Power Optimization for Connectivity Problems | 2007-08-30 | Paper |
| Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees | 2007-08-28 | Paper |
| Power optimization for connectivity problems | 2007-04-19 | Paper |
| Approximating the minimal sensor selection for supervisory control | 2006-11-17 | Paper |
| An approximation algorithm for the directed telephone multicast problem | 2006-09-26 | Paper |
| Sublogarithmic approximation for telephone multicast | 2006-06-30 | Paper |
| A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem | 2006-06-01 | Paper |
| Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem | 2006-06-01 | Paper |
| A greedy approximation algorithm for the group Steiner problem | 2006-01-10 | Paper |
| An improved approximation algorithm for vertex cover with hard capacities | 2006-01-10 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Approximating k-node Connected Subgraphs via Critical Graphs | 2005-10-28 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Greedy approximation algorithms for directed multicuts | 2005-08-05 | Paper |
| Hardness of Approximation for Vertex-Connectivity Network Design Problems | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828914 | 2004-11-29 | Paper |
| Logarithmic inapproximability of the radio broadcast problem | 2004-11-23 | Paper |
| Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs | 2004-09-22 | Paper |
| On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471276 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471309 | 2004-07-28 | Paper |
| Approximating node connectivity problems via set covers | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449173 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449177 | 2004-02-08 | Paper |
| Multicoloring trees. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411287 | 2003-07-07 | Paper |
| Approximating theDomatic Number | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780785 | 2002-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780787 | 2002-11-21 | Paper |
| A matched approximation bound for the sum of a greedy coloring | 2002-07-25 | Paper |
| Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees | 2002-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766683 | 2002-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768311 | 2002-03-14 | Paper |
| On the hardness of approximating spanners | 2002-02-19 | Paper |
| On Approximating the Achromatic Number | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753740 | 2001-11-11 | Paper |
| The dense \(k\)-subgraph problem | 2001-04-17 | Paper |
| Sum Multicoloring of Graphs | 2000-12-19 | Paper |
| Generalized submodular cover problems and applications | 2000-12-12 | Paper |
| Minimum Color Sum of Bipartite Graphs | 2000-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941827 | 2000-03-19 | Paper |
| Approximating the weight of shallow Steiner trees | 2000-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400851 | 1998-10-25 | Paper |
| Generating Low-Degree 2-Spanners | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128918 | 1997-08-03 | Paper |
| Approximation Algorithms for Minimum-Time Broadcast | 1996-01-10 | Paper |
| Generating Sparse 2-Spanners | 1995-11-22 | Paper |
| Traffic-light scheduling on the grid | 1994-12-11 | Paper |
| How to Allocate Network Centers | 1994-03-22 | Paper |
