| Publication | Date of Publication | Type |
|---|
Approximating weighted completion time via stronger negative correlation
Journal of Scheduling | 2024-10-16 | Paper |
| Improved bi-point rounding algorithms and a golden barrier for \(k\)-median | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7799609 (Why is no real title available?) | 2024-02-05 | Paper |
scientific article; zbMATH DE number 7768368 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-20 | Paper |
Partial resampling to approximate covering integer programs
Random Structures & Algorithms | 2023-10-11 | Paper |
A lottery model for center-type problems with outliers
(available as arXiv preprint) | 2021-07-28 | Paper |
Lift-and-round to improve weighted completion time on unrelated machines
SIAM Journal on Computing | 2021-06-29 | Paper |
Online stochastic matching: new algorithms and bounds
Algorithmica | 2020-10-12 | Paper |
Mix and match: Markov chains and mixing times for matching in rideshare
(available as arXiv preprint) | 2020-06-30 | Paper |
| Better greedy sequence clustering with fast banded alignment | 2020-05-27 | Paper |
The Moser--Tardos Framework with Partial Resampling
Journal of the ACM | 2020-02-11 | Paper |
| Approximation algorithms for stochastic clustering | 2020-02-07 | Paper |
Approximation algorithms for stochastic clustering
(available as arXiv preprint) | 2020-02-07 | Paper |
Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts
Algorithmica | 2020-01-16 | Paper |
Algorithms to approximate column-sparse packing problems
ACM Transactions on Algorithms | 2019-12-02 | Paper |
A Lottery Model for Center-Type Problems With Outliers
ACM Transactions on Algorithms | 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
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
A constructive algorithm for the Lovász local lemma on permutations
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Improved bounds in stochastic matching and optimization
Algorithmica | 2019-01-11 | Paper |
Algorithmic and enumerative aspects of the Moser-Tardos distribution
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks
ACM Transactions on Algorithms | 2018-11-05 | Paper |
An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
ACM Transactions on Algorithms | 2018-11-05 | Paper |
A new approximation technique for resource-allocation problems
Random Structures & Algorithms | 2018-09-05 | Paper |
Partial resampling to approximate covering integer programs
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Algorithmic and enumerative aspects of the Moser-Tardos distribution
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
An improved approximation algorithm for knapsack median using sparsification
Algorithmica | 2018-05-23 | Paper |
| scientific article; zbMATH DE number 6850331 (Why is no real title available?) | 2018-03-15 | Paper |
| New algorithms, better bounds, and a novel model for online stochastic matching | 2018-03-02 | Paper |
Improved bounds and algorithms for graph cuts and network reliability
Random Structures & Algorithms | 2018-01-16 | Paper |
Approximation algorithms for stochastic and risk-averse optimization
SIAM Journal on Discrete Mathematics | 2018-01-12 | Paper |
A constructive Lovász local lemma for permutations
Theory of Computing | 2018-01-10 | Paper |
An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Lift-and-round to improve weighted completion time on unrelated machines
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Improved bounds in stochastic matching and optimization | 2017-08-31 | Paper |
Fast randomized algorithms for distributed edge coloring (extended abstract)
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
A constructive algorithm for the LLL on permutations
(available as arXiv preprint) | 2016-12-08 | Paper |
Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Efficient computation of sparse structures
Random Structures & Algorithms | 2016-09-15 | Paper |
Improved algorithms via approximations of probability distributions (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Low discrepancy sets yield approximate min-wise independent permutation families
Information Processing Letters | 2016-06-16 | Paper |
A note on near-optimal coloring of shift hypergraphs
Random Structures & Algorithms | 2016-02-03 | Paper |
An improved approximation algorithm for knapsack median using sparsification
Algorithms - ESA 2015 | 2015-11-19 | Paper |
A unified approach to scheduling on unrelated parallel machines
Journal of the ACM | 2015-11-11 | Paper |
| scientific article; zbMATH DE number 6472637 (Why is no real title available?) | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6472647 (Why is no real title available?) | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6469213 (Why is no real title available?) | 2015-08-03 | Paper |
| scientific article; zbMATH DE number 6469247 (Why is no real title available?) | 2015-08-03 | Paper |
Randomness-optimal unique element isolation, with applications to perfect matching and related problems
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Efficient lookup on unstructured topologies
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
| scientific article; zbMATH DE number 6381764 (Why is no real title available?) | 2014-12-18 | Paper |
Solving packing integer programs via randomized rounding with alterations
Theory of Computing | 2014-10-06 | Paper |
The value of strong inapproximability results for clique
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Constraint satisfaction, packet routing, and the lovasz local lemma
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
New constructive aspects of the Lovász local lemma
Journal of the ACM | 2014-02-17 | Paper |
Efficient computation of balanced structures
Automata, Languages, and Programming | 2013-08-07 | Paper |
The effect of random edge removal on network degree sequence
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Maximum bipartite flow in networks with adaptive channel width
Theoretical Computer Science | 2011-06-07 | Paper |
scientific article; zbMATH DE number 5899242 (Why is no real title available?)
Theory of Computing | 2011-05-24 | Paper |
| scientific article; zbMATH DE number 5764785 (Why is no real title available?) | 2010-08-06 | Paper |
Fault-tolerant facility location: a randomized dependent LP-rounding algorithm
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
On \(k\)-column sparse packing programs
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
A note on the distribution of the number of prime factors of the integers
Information Processing Letters | 2010-06-09 | Paper |
Approximation algorithms for channel allocation problems in broadcast networks
Lecture Notes in Computer Science | 2010-05-26 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Scheduling on unrelated machines under tree-like precedence constraints
Algorithmica | 2009-07-24 | Paper |
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Automata, Languages and Programming | 2009-07-14 | Paper |
Dependent rounding and its applications to approximation algorithms
Journal of the ACM | 2008-12-21 | Paper |
Budgeted Allocations in the Full-Information Setting
Lecture Notes in Computer Science | 2008-11-27 | Paper |
The Randomized Coloring Procedure with Symmetry-Breaking
Automata, Languages and Programming | 2008-08-28 | Paper |
Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems
Algorithms and Computation | 2008-04-24 | Paper |
Cost-sharing mechanisms for network design
Algorithmica | 2008-02-18 | Paper |
Integrality Ratio for Group Steiner Trees and Directed Steiner Trees
SIAM Journal on Computing | 2007-10-22 | Paper |
An Extension of the Lovász Local Lemma, and its Applications to Integer Programming
SIAM Journal on Computing | 2007-06-26 | Paper |
Contention resolution with constant expected delay
Journal of the ACM | 2006-09-12 | Paper |
Approximation algorithms for channel allocation problems in broadcast networks
Networks | 2006-09-12 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Provable algorithms for parallel generalized sweep scheduling
Journal of Parallel and Distributed Computing | 2006-06-30 | Paper |
An improved approximation algorithm for vertex cover with hard capacities
Journal of Computer and System Sciences | 2006-01-10 | Paper |
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Journal of Computer and System Sciences | 2005-12-07 | Paper |
Finding Large Independent Sets in Graphs and Hypergraphs
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Approximation algorithms for partial covering problems
Journal of Algorithms | 2004-11-12 | Paper |
| scientific article; zbMATH DE number 2102778 (Why is no real title available?) | 2004-09-24 | Paper |
On the approximability of clique and related maximization problems
Journal of Computer and System Sciences | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2079350 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2079403 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2038708 (Why is no real title available?) | 2004-02-08 | Paper |
Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry
Journal of Graph Algorithms and Applications | 2003-11-30 | Paper |
When does a random Robin Hood win?
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1947055 (Why is no real title available?) | 2003-07-07 | Paper |
| New approaches to covering and packing problems | 2003-06-17 | Paper |
Approximating theDomatic Number
SIAM Journal on Computing | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1848401 (Why is no real title available?) | 2003-01-05 | Paper |
The one-inclusion graph algorithm is near-optimal for the prediction model of learning
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Approximating low-congestion routing and column-restricted packing problems
Information Processing Letters | 2002-07-25 | Paper |
Approximation algorithms for the covering Steiner problem
Random Structures & Algorithms | 2002-07-01 | Paper |
| Domatic partitions and the Lovász local lemma | 2002-06-30 | Paper |
| scientific article; zbMATH DE number 1754596 (Why is no real title available?) | 2002-06-12 | Paper |
Retrieval scheduling for collaborative multimedia presentations
Multimedia Systems | 2002-05-20 | Paper |
New algorithmic aspects of the local lemma with applications to routing and partitioning
SIAM Journal on Computing | 2002-04-23 | Paper |
| scientific article; zbMATH DE number 1263224 (Why is no real title available?) | 2002-01-29 | Paper |
Approximation algorithms for disjoint paths and related routing and packing problems
Mathematics of Operations Research | 2001-11-26 | Paper |
| scientific article; zbMATH DE number 1670531 (Why is no real title available?) | 2001-11-11 | Paper |
Improved bounds on the sample complexity of learning
Journal of Computer and System Sciences | 2001-09-09 | Paper |
| scientific article; zbMATH DE number 1512071 (Why is no real title available?) | 2001-09-04 | Paper |
A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
SIAM Journal on Computing | 2001-06-21 | Paper |
Improved algorithms via approximations of probability distributions
Journal of Computer and System Sciences | 2001-05-20 | Paper |
| scientific article; zbMATH DE number 1560336 (Why is no real title available?) | 2001-04-26 | Paper |
Better approximation guarantees for job-shop scheduling
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1559547 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1241396 (Why is no real title available?) | 2001-02-05 | Paper |
| scientific article; zbMATH DE number 1418263 (Why is no real title available?) | 2000-12-03 | Paper |
| Improved bounds and algorithms for hypergraph 2-coloring | 2000-08-16 | Paper |
| scientific article; zbMATH DE number 1405893 (Why is no real title available?) | 2000-06-25 | Paper |
| scientific article; zbMATH DE number 1445318 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1261820 (Why is no real title available?) | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1261812 (Why is no real title available?) | 2000-04-26 | Paper |
Improved Approximation Guarantees for Packing and Covering Integer Programs
SIAM Journal on Computing | 2000-03-19 | Paper |
Computing with Very Weak Random Sources
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1263202 (Why is no real title available?) | 1999-09-15 | Paper |
Approximating hyper-rectangles: Learning and pseudorandom sets
Journal of Computer and System Sciences | 1999-02-21 | Paper |
Explicit OR-dispersers with polylogarithmic degree
Journal of the ACM | 1998-12-10 | Paper |
Improved parallel approximation of a class of integer programming problems
Algorithmica | 1997-09-04 | Paper |
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
SIAM Journal on Computing | 1997-05-26 | Paper |
| scientific article; zbMATH DE number 871894 (Why is no real title available?) | 1996-09-16 | Paper |
On the Complexity of Distributed Network Decomposition
Journal of Algorithms | 1996-05-06 | Paper |
The local nature of \(\Delta\)-coloring and its algorithmic applications
Combinatorica | 1996-04-16 | Paper |
Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems
SIAM Journal on Computing | 1996-01-24 | Paper |
Chernoff–Hoeffding Bounds for Applications with Limited Independence
SIAM Journal on Discrete Mathematics | 1995-07-03 | Paper |
| scientific article; zbMATH DE number 437558 (Why is no real title available?) | 1994-12-12 | Paper |
On finding the minimum bandwidth of interval graphs
Information and Computation | 1992-06-28 | Paper |
