| Publication | Date of Publication | Type |
|---|
| Erratum to “Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems” | 2024-03-01 | Paper |
| The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP | 2024-02-23 | Paper |
| A combinatorial cut-toggling algorithm for solving Laplacian linear systems | 2023-12-13 | Paper |
| A 4/3-approximation algorithm for half-integral cycle cut instances of the TSP | 2023-11-09 | Paper |
| A Lower Bound for the Max Entropy Algorithm for TSP | 2023-11-03 | Paper |
| The two-stripe symmetric circulant TSP is in P | 2022-08-16 | Paper |
| Graph coloring and semidefinite rank | 2022-08-16 | Paper |
| Tight Bounds for Online Weighted Tree Augmentation | 2022-07-21 | Paper |
| Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model | 2022-07-06 | Paper |
| Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps | 2022-05-17 | Paper |
| Tight bounds for online weighted tree augmentation | 2022-03-25 | Paper |
| Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems | 2020-09-01 | Paper |
| Prize-Collecting TSP with a Budget Constraint | 2020-05-27 | Paper |
| Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP | 2020-05-26 | Paper |
| Easy capacitated facility location problems, with connections to lot-sizing | 2020-04-07 | Paper |
| Easy Capacitated Facility Location Problems, with Connections to Lot-Sizing | 2020-01-08 | Paper |
| Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem | 2019-12-18 | Paper |
| Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP | 2019-07-26 | Paper |
| Network Flow Algorithms | 2019-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743492 | 2019-05-10 | Paper |
| Greedy algorithms for the single-demand facility location problem | 2019-02-22 | Paper |
| Online constrained forest and prize-collecting network design | 2019-01-11 | Paper |
| Primal-dual approximation algorithms for feedback problems in planar graphs | 2019-01-11 | Paper |
| Rank aggregation: new bounds for MCx | 2018-12-10 | Paper |
| Offline and online facility leasing | 2018-10-18 | Paper |
| Assortment optimization over time | 2018-09-28 | Paper |
| An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem | 2018-08-06 | Paper |
| The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem | 2018-08-03 | Paper |
| Simple approximation algorithms for balanced MAX~2SAT | 2018-04-11 | Paper |
| An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem | 2017-10-10 | Paper |
| Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds | 2017-06-28 | Paper |
| An Experimental Evaluation of Incremental and Hierarchical k -Median Algorithms | 2017-06-16 | Paper |
| Pricing Problems Under the Nested Logit Model with a Quality Consistency Constraint | 2017-06-02 | Paper |
| Maximizing a submodular function with viability constraints | 2017-03-06 | Paper |
| A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem | 2016-12-21 | Paper |
| The online prize-collecting facility location problem | 2016-10-17 | Paper |
| .879-approximation algorithms for MAX CUT and MAX 2SAT | 2016-09-01 | Paper |
| Simple Approximation Algorithms for Balanced MAX 2SAT | 2016-05-03 | Paper |
| An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem | 2015-11-19 | Paper |
| Adversarial queuing theory | 2015-09-20 | Paper |
| A primal-dual approximation algorithm for generalized Steiner network problems | 2015-05-07 | Paper |
| A 3/2-approximation algorithm for some minimum-cost graph problems | 2015-04-16 | Paper |
| On the integrality gap of the subtour LP for the 1,2-TSP | 2015-04-16 | Paper |
| Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming | 2015-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934723 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921713 | 2014-10-13 | Paper |
| 2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture | 2014-07-11 | Paper |
| Popular ranking | 2014-05-05 | Paper |
| On Some Recent Approximation Algorithms for MAX SAT | 2014-03-31 | Paper |
| The Online Connected Facility Location Problem | 2014-03-31 | Paper |
| Maximizing a submodular function with viability constraints | 2013-09-17 | Paper |
| A Dual-Fitting $\frac{3}{2}$ -Approximation Algorithm for Some Minimum-Cost Graph Problems | 2012-09-25 | Paper |
| On the Integrality Gap of the Subtour LP for the 1,2-TSP | 2012-06-29 | Paper |
| A note on the generalized min-sum set cover problem | 2012-04-05 | Paper |
| An O(logn)-Competitive Algorithm for Online Constrained Forest Problems | 2011-07-06 | Paper |
| The Design of Approximation Algorithms | 2011-07-01 | Paper |
| Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems | 2011-04-27 | Paper |
| A General Approach for Incremental Approximation and Hierarchical Clustering | 2011-04-04 | Paper |
| Approximating the smallest k -edge connected spanning subgraph by LP-rounding | 2010-11-24 | Paper |
| A simple GAP-canceling algorithm for the generalized maximum flow problem | 2010-08-16 | Paper |
| A general approach for incremental approximation and hierarchical clustering | 2010-08-16 | Paper |
| Stackelberg thresholds in network routing games or the value of altruism | 2009-08-27 | Paper |
| A simple GAP-canceling algorithm for the generalized maximum flow problem | 2009-05-04 | Paper |
| Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements | 2009-02-12 | Paper |
| A Faster, Better Approximation Algorithm for the Minimum Latency Problem | 2008-10-28 | Paper |
| Offline and Online Facility Leasing | 2008-06-10 | Paper |
| Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems | 2008-02-20 | Paper |
| A simpler and better derandomization of an approximation algorithm for single source rent-or-buy | 2008-01-21 | Paper |
| On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems | 2006-09-14 | Paper |
| Improved approximation algorithms for capacitated facility location problems | 2005-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829040 | 2004-11-29 | Paper |
| Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming | 2004-11-22 | Paper |
| Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation | 2004-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471278 | 2004-07-28 | Paper |
| On the number of small cut in a graph | 2003-06-24 | Paper |
| The primal-dual method for approximation algorithms | 2002-12-01 | Paper |
| Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems | 2002-12-01 | Paper |
| Improved Approximation Algorithms for MAX SAT | 2002-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537735 | 2002-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331300 | 2002-05-15 | Paper |
| The Approximability of Constraint Satisfaction Problems | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263705 | 2001-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526965 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952605 | 2001-01-18 | Paper |
| Gadgets, Approximation, and Linear Programming | 2000-10-18 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4228491 | 2000-04-04 | Paper |
| Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout | 2000-03-19 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4234151 | 1999-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228514 | 1999-03-01 | Paper |
| Short Shop Schedules | 1998-07-06 | Paper |
| Approximation algorithms | 1998-04-03 | Paper |
| Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming | 1998-01-28 | Paper |
| An approximation algorithm for minimum-cost vertex-connectivity problems | 1997-10-09 | 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 |
| Scheduling Parallel Machines On-Line | 1996-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886063 | 1996-08-22 | Paper |
| A General Approximation Technique for Constrained Forest Problems | 1996-03-18 | Paper |
| A primal-dual approximation algorithm for generalized Steiner network problems | 1995-10-17 | Paper |
| Approximating minimum-cost graph problems with spanning tree edges | 1995-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763416 | 1995-04-11 | Paper |
| New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem | 1994-12-20 | Paper |
| A note on the prize collecting traveling salesman problem | 1994-08-16 | Paper |
| Analysis of the Held-Karp lower bound for the asymmetric TSP | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010317 | 1992-09-27 | Paper |
| Permutation vs. non-permutation flow shop schedules | 1992-06-27 | Paper |
| Analyzing the Held-Karp TSP bound: A monotonicity property with application | 1990-01-01 | Paper |
