| Publication | Date of Publication | Type |
|---|
| Approximating weighted completion time via stronger negative correlation | 2024-10-16 | Paper |
| Improved bi-point rounding algorithms and a golden barrier for \(k\)-median | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187044 | 2024-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6090898 | 2023-11-20 | Paper |
| Partial Resampling to Approximate Covering Integer Programs | 2023-10-11 | Paper |
| A Lottery Model for Center-Type Problems with Outliers | 2021-07-28 | Paper |
| Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines | 2021-06-29 | Paper |
| Online stochastic matching: new algorithms and bounds | 2020-10-12 | Paper |
| Mix and match: Markov chains and mixing times for matching in rideshare | 2020-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111792 | 2020-05-27 | Paper |
| The Moser--Tardos Framework with Partial Resampling | 2020-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5214247 | 2020-02-07 | Paper |
| Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts | 2020-01-16 | Paper |
| Algorithms to Approximate Column-sparse Packing Problems | 2019-12-02 | Paper |
| A Lottery Model for Center-Type Problems With Outliers | 2019-11-25 | Paper |
| Online Matching Frameworks under Stochastic Rewards, Product Ranking, and Unknown Patience | 2019-07-08 | Paper |
| Improved bounds and algorithms for graph cuts and network reliability | 2019-06-20 | Paper |
| A constructive algorithm for the Lovász Local Lemma on permutations | 2019-06-20 | Paper |
| Improved bounds in stochastic matching and optimization | 2019-01-11 | Paper |
| Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution | 2018-11-05 | Paper |
| Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks | 2018-11-05 | Paper |
| An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization | 2018-11-05 | Paper |
| A new approximation technique for resource‐allocation problems | 2018-09-05 | Paper |
| Partial Resampling to Approximate Covering Integer Programs | 2018-07-16 | Paper |
| Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution | 2018-07-16 | Paper |
| An improved approximation algorithm for knapsack median using sparsification | 2018-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607900 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606293 | 2018-03-02 | Paper |
| Improved bounds and algorithms for graph cuts and network reliability | 2018-01-16 | Paper |
| Approximation Algorithms for Stochastic and Risk-Averse Optimization | 2018-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4602400 | 2018-01-10 | Paper |
| An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization | 2017-10-05 | Paper |
| Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines | 2017-09-29 | Paper |
| Improved Bounds in Stochastic Matching and Optimization | 2017-08-31 | Paper |
| Fast randomized algorithms for distributed edge coloring | 2017-08-21 | Paper |
| A constructive algorithm for the LLL on permutations | 2016-12-08 | Paper |
| Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems | 2016-10-24 | Paper |
| Efficient computation of sparse structures | 2016-09-15 | Paper |
| Improved algorithms via approximations of probability distributions (extended abstract) | 2016-09-01 | Paper |
| Low discrepancy sets yield approximate min-wise independent permutation families | 2016-06-16 | Paper |
| A note on near-optimal coloring of shift hypergraphs | 2016-02-03 | Paper |
| An Improved Approximation Algorithm for Knapsack Median Using Sparsification | 2015-11-19 | Paper |
| A unified approach to scheduling on unrelated parallel machines | 2015-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501839 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501849 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501331 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501366 | 2015-08-03 | Paper |
| Randomness-optimal unique element isolation, with applications to perfect matching and related problems | 2015-05-07 | Paper |
| Efficient lookup on unstructured topologies | 2015-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934726 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191563 | 2014-10-06 | Paper |
| The value of strong inapproximability results for clique | 2014-09-26 | Paper |
| Constraint satisfaction, packet routing, and the lovasz local lemma | 2014-08-07 | Paper |
| New Constructive Aspects of the Lovász Local Lemma | 2014-02-17 | Paper |
| Efficient Computation of Balanced Structures | 2013-08-07 | Paper |
| The effect of random edge removal on network degree sequence | 2012-06-12 | Paper |
| Maximum bipartite flow in networks with adaptive channel width | 2011-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002765 | 2011-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579374 | 2010-08-06 | Paper |
| Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm | 2010-06-22 | Paper |
| On k-Column Sparse Packing Programs | 2010-06-22 | Paper |
| A note on the distribution of the number of prime factors of the integers | 2010-06-09 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Scheduling on unrelated machines under tree-like precedence constraints | 2009-07-24 | Paper |
| Maximum Bipartite Flow in Networks with Adaptive Channel Width | 2009-07-14 | Paper |
| Dependent rounding and its applications to approximation algorithms | 2008-12-21 | Paper |
| Budgeted Allocations in the Full-Information Setting | 2008-11-27 | Paper |
| The Randomized Coloring Procedure with Symmetry-Breaking | 2008-08-28 | Paper |
| Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems | 2008-04-24 | Paper |
| Cost-sharing mechanisms for network design | 2008-02-18 | Paper |
| Integrality Ratio for Group Steiner Trees and Directed Steiner Trees | 2007-10-22 | Paper |
| An Extension of the Lovász Local Lemma, and its Applications to Integer Programming | 2007-06-26 | Paper |
| Contention resolution with constant expected delay | 2006-09-12 | Paper |
| Approximation algorithms for channel allocation problems in broadcast networks | 2006-09-12 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Provable algorithms for parallel generalized sweep scheduling | 2006-06-30 | Paper |
| An improved approximation algorithm for vertex cover with hard capacities | 2006-01-10 | Paper |
| Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons | 2005-12-07 | Paper |
| Finding Large Independent Sets in Graphs and Hypergraphs | 2005-09-16 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Approximation algorithms for partial covering problems | 2004-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818866 | 2004-09-24 | Paper |
| On the approximability of clique and related maximization problems | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471309 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471362 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449173 | 2004-02-08 | Paper |
| Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry | 2003-11-30 | Paper |
| When does a random Robin Hood win? | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411285 | 2003-07-07 | Paper |
| New approaches to covering and packing problems | 2003-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785582 | 2003-01-05 | Paper |
| Approximating theDomatic Number | 2003-01-05 | Paper |
| The one-inclusion graph algorithm is near-optimal for the prediction model of learning | 2002-08-04 | Paper |
| Approximating low-congestion routing and column-restricted packing problems | 2002-07-25 | Paper |
| Approximation algorithms for the covering Steiner problem | 2002-07-01 | Paper |
| Domatic partitions and the Lovász local lemma | 2002-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535021 | 2002-06-12 | Paper |
| Retrieval scheduling for collaborative multimedia presentations | 2002-05-20 | Paper |
| New algorithmic aspects of the local lemma with applications to routing and partitioning | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234096 | 2002-01-29 | Paper |
| Approximation algorithms for disjoint paths and related routing and packing problems | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753728 | 2001-11-11 | Paper |
| Improved bounds on the sample complexity of learning | 2001-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505696 | 2001-09-04 | Paper |
| A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria | 2001-06-21 | Paper |
| Improved algorithms via approximations of probability distributions | 2001-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527187 | 2001-04-26 | Paper |
| Better approximation guarantees for job-shop scheduling | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526996 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224936 | 2001-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941822 | 2000-12-03 | Paper |
| Improved bounds and algorithms for hypergraph 2-coloring | 2000-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938889 | 2000-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952633 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231923 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231915 | 2000-04-26 | Paper |
| Improved Approximation Guarantees for Packing and Covering Integer Programs | 2000-03-19 | Paper |
| Computing with Very Weak Random Sources | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234073 | 1999-09-15 | Paper |
| Approximating hyper-rectangles: Learning and pseudorandom sets | 1999-02-21 | Paper |
| Explicit OR-dispersers with polylogarithmic degree | 1998-12-10 | Paper |
| Improved parallel approximation of a class of integer programming problems | 1997-09-04 | Paper |
| Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds | 1997-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875163 | 1996-09-16 | Paper |
| On the Complexity of Distributed Network Decomposition | 1996-05-06 | Paper |
| The local nature of \(\Delta\)-coloring and its algorithmic applications | 1996-04-16 | Paper |
| Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems | 1996-01-24 | Paper |
| Chernoff–Hoeffding Bounds for Applications with Limited Independence | 1995-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140437 | 1994-12-12 | Paper |
| On finding the minimum bandwidth of interval graphs | 1992-06-28 | Paper |
