| Publication | Date of Publication | Type |
|---|
| Mathematical Thinking | 2023-10-30 | Paper |
| Near-optimal disjoint-path facility location through set cover by pairs | 2020-11-04 | Paper |
| Disjoint-path facility location: theory and practice | 2019-09-12 | Paper |
| Capacitated metric labeling | 2017-09-29 | Paper |
| On construction of \(k\)-wise independent random variables | 2016-09-01 | Paper |
| A lower bound of \(8/(7+\frac{1}{k-1})\) on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut | 2016-06-16 | Paper |
| On the convergence time of a path-vector protocol | 2015-08-03 | Paper |
| Compressing rectilinear pictures and minimizing access control lists | 2014-12-18 | Paper |
| On earthmover distance, metric labeling, and 0-extension | 2014-11-25 | Paper |
| An improved approximation algorithm for \textsc{Resource Allocation} | 2014-09-09 | Paper |
| Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP | 2014-07-25 | Paper |
| Fast algorithms for constructing maximum entropy summary trees | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417679 | 2014-05-22 | Paper |
| Sequential dependency computation via geometric data structures | 2014-01-22 | Paper |
| Scheduling to minimize staleness and stretch in real-time data warehouses | 2012-12-10 | Paper |
| On parsimonious explanations for 2-D tree- and linearly-ordered data | 2012-01-23 | Paper |
| Improved approximation algorithms for label cover problems | 2011-08-16 | Paper |
| Improved approximation algorithms for prize-collecting Steiner tree and TSP | 2011-07-29 | Paper |
| OPT versus LOAD in dynamic storage allocation | 2010-08-16 | Paper |
| On the fractal behavior of {TCP} | 2010-08-16 | Paper |
| On earthmover distance, metric labeling, and 0-extension | 2010-04-29 | Paper |
| Linear programming. | 2010-03-24 | Paper |
| Improved Approximation Algorithms for Label Cover Problems | 2009-10-29 | Paper |
| On the integrality ratio for tree augmentation | 2009-03-04 | Paper |
| New algorithms for an ancient scheduling problem. | 2008-12-21 | Paper |
| On the Integrality Ratio for the Asymmetric Traveling Salesman Problem | 2008-05-27 | Paper |
| Lower bounds for linear locally decodable codes and private information retrieval | 2007-01-24 | Paper |
| Caching with Expiration Times for Internet Applications | 2006-05-09 | Paper |
| SEPARATING POINTS BY AXIS-PARALLEL LINES | 2006-03-13 | Paper |
| Approximating directed multicuts | 2006-01-26 | Paper |
| OPTVersusLOADin Dynamic Storage Allocation | 2005-02-21 | Paper |
| Approximation Algorithms for the 0-Extension Problem | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828981 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737541 | 2004-08-11 | Paper |
| A new approximation algorithm for finding heavy planar subgraphs | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542519 | 2002-08-01 | Paper |
| Approximation algorithms for the 0-extension problem | 2002-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230341 | 2002-01-17 | Paper |
| A decomposition theorem for task systems and bounds for randomized server problems | 2001-03-19 | Paper |
| An improved approximation algorithm of MULTIWAY CUT. | 2000-11-21 | Paper |
| New Results on the Old k-opt Algorithm for the Traveling Salesman Problem | 1999-10-28 | Paper |
| How Good is the Goemans--Williamson MAX CUT Algorithm? | 1999-10-28 | Paper |
| Competitive Algorithms for Layered Graph Traversal | 1998-09-21 | Paper |
| On construction of \(k\)-wise independent random variables | 1998-01-05 | Paper |
| A Better Approximation Algorithm for Finding Planar Subgraphs | 1998-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335205 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875171 | 1996-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4893741 | 1996-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875164 | 1996-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228497 | 1996-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138905 | 1994-09-19 | Paper |
| Algebraic methods for interactive proof systems | 1994-08-21 | Paper |
| A better lower bound for on-line scheduling | 1994-06-15 | Paper |
| Fast algorithms for approximately counting mismatches | 1994-06-09 | Paper |
| Lower Bounds for Randomized k-Server and Motion-Planning Algorithms | 1994-05-10 | Paper |
| Randomized algorithms and pseudorandom numbers | 1993-12-06 | Paper |
| Fast geometric approximation techniques and geometric embedding problems | 1993-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4000282 | 1992-09-18 | Paper |
| Connectivity vs. reachability | 1991-01-01 | Paper |
| How Long Can a Euclidean Traveling Salesman Tour Be? | 1989-01-01 | Paper |
| The iterated mod problem | 1989-01-01 | Paper |
| An NC algorithm for Brooks' theorem | 1989-01-01 | Paper |
| Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques | 1988-01-01 | Paper |
| Coloring planar graphs in parallel | 1987-01-01 | Paper |
| Efficient parallel algorithms for edge coloring problems | 1987-01-01 | Paper |
| A Las Vegas RNC algorithm for maximum matching | 1986-01-01 | Paper |
