| Publication | Date of Publication | Type |
|---|
| Shrunk subspaces via operator Sinkhorn iteration | 2024-05-14 | Paper |
| Improved bounds for on-line load balancing | 2024-01-29 | Paper |
| Polynomiality for Bin Packing with a Constant Number of Item Types | 2022-12-08 | Paper |
| Approximating Incremental Combinatorial Optimization Problems | 2021-07-28 | Paper |
| Polynomiality for Bin Packing with a Constant Number of Item Types | 2019-06-20 | Paper |
| Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633864 | 2019-05-06 | Paper |
| The strongest facets of the acyclic subgraph polytope are unknown | 2019-01-11 | Paper |
| A supermodular relaxation for scheduling with release dates | 2019-01-11 | Paper |
| Primal-dual approximation algorithms for feedback problems in planar graphs | 2019-01-11 | Paper |
| Congestion games viewed from M-convexity | 2018-09-28 | Paper |
| Stochastic Block Model for Hypergraphs: Statistical limits and a semidefinite programming approach | 2018-07-08 | Paper |
| An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem | 2017-09-26 | Paper |
| Matroids Are Immune to Braess’ Paradox | 2017-09-22 | Paper |
| Discrete Newton's algorithm for parametric submodular function minimization | 2017-08-31 | Paper |
| .878-approximation algorithms for MAX CUT and MAX 2SAT | 2016-09-01 | Paper |
| Smallest compact formulation for the permutahedron | 2015-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501838 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501356 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501314 | 2015-08-03 | Paper |
| A primal-dual approximation algorithm for generalized Steiner network problems | 2015-05-07 | Paper |
| Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming | 2015-02-27 | Paper |
| Adaptivity and approximation for stochastic packing problems | 2014-10-13 | Paper |
| Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417632 | 2014-05-22 | Paper |
| Matroids and integrality gaps for hypergraphic steiner tree relaxations | 2014-05-13 | Paper |
| Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations | 2013-09-26 | Paper |
| A flow model based on polylinking system | 2012-10-15 | Paper |
| Tight approximation algorithms for maximum separable assignment problems | 2012-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3099402 | 2011-12-01 | Paper |
| Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity | 2011-04-27 | Paper |
| Approximating the smallest k -edge connected spanning subgraph by LP-rounding | 2010-11-24 | Paper |
| Tight approximation algorithms for maximum general assignment problems | 2010-08-16 | Paper |
| An approximate König's theorem for edge-coloring weighted bipartite graphs | 2010-08-15 | Paper |
| Deformable Polygon Representation and Near-Mincuts | 2009-02-12 | Paper |
| Stochastic Covering and Adaptivity | 2008-09-18 | Paper |
| Improved Bounds on Nonblocking 3-Stage Clos Networks | 2008-06-19 | Paper |
| On the Integrality Ratio for the Asymmetric Traveling Salesman Problem | 2008-05-27 | Paper |
| Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data | 2008-03-11 | Paper |
| Covering minimum spanning trees of random subgraphs | 2007-02-07 | Paper |
| When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? | 2005-11-11 | Paper |
| Trade-offs on the location of the core node in a network | 2005-02-23 | Paper |
| Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming | 2004-11-22 | Paper |
| Cooperative facility location games | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449247 | 2004-02-08 | Paper |
| Wide partitions, Latin tableaux, and Rota's basis conjecture | 2003-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780776 | 2002-11-21 | Paper |
| Single machine scheduling with release dates | 2002-04-23 | Paper |
| Approximate edge splitting | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517107 | 2000-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252309 | 2000-09-26 | Paper |
| A 1. 47-approximation for a preemptive single-machine scheduling problem | 2000-09-04 | Paper |
| Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler | 2000-07-20 | Paper |
| Semidefinite programs and association schemes | 2000-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952603 | 2000-05-10 | Paper |
| On the single-source unsplittable flow problem | 1999-12-08 | Paper |
| Primal-dual approximation algorithms for feedback problems in planar graphs | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234132 | 1999-10-28 | Paper |
| An efficient approximation algorithm for the survivable network design problem | 1999-10-18 | Paper |
| A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs | 1999-09-23 | Paper |
| An improved approximation ratio for the minimum latency problem | 1999-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234151 | 1999-03-16 | Paper |
| Semidefinite programming and combinatorial optimization | 1998-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398367 | 1998-07-19 | Paper |
| Semidefinite programming in combinatorial optimization | 1998-05-25 | Paper |
| The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover | 1998-05-11 | Paper |
| Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming | 1998-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347896 | 1997-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128895 | 1997-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128880 | 1997-04-23 | Paper |
| Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances | 1996-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875179 | 1996-09-16 | Paper |
| A General Approximation Technique for Constrained Forest Problems | 1996-03-18 | Paper |
| Worst-case comparison of valid inequalities for the TSP | 1996-02-28 | Paper |
| Minimizing submodular functions over families of sets | 1996-01-24 | Paper |
| A primal-dual approximation algorithm for generalized Steiner network problems | 1995-10-17 | Paper |
| An approximation algorithm for scheduling on three dedicated machines | 1995-08-27 | Paper |
| Approximating minimum-cost graph problems with spanning tree edges | 1995-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763416 | 1995-04-11 | Paper |
| On the Maximum Number of Triangles in Wheel-Free Graphs | 1995-03-09 | Paper |
| New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem | 1994-12-20 | Paper |
| Arborescence polytopes for series-parallel graphs | 1994-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138916 | 1994-09-19 | Paper |
| A note on the prize collecting traveling salesman problem | 1994-08-16 | Paper |
| The Steiner tree polytope and related polyhedra | 1994-05-05 | Paper |
| Survivable networks, linear programming relaxations and the parsimonious property | 1993-12-06 | Paper |
| A Lower Bound on the Expected Cost of an Optimal Assignment | 1993-08-05 | Paper |
| A catalog of steiner tree formulations | 1993-06-29 | Paper |
| A generalization of Petersen's theorem | 1993-06-20 | Paper |
| Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem | 1991-01-01 | Paper |
| 2-change for k-connected networks | 1991-01-01 | Paper |
| Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds | 1989-01-01 | Paper |
| Number of faults a system can withstand without repairs | N/A | Paper |
