| Publication | Date of Publication | Type |
|---|
| Glauber dynamics on trees and hyperbolic graphs | 2026-05-08 | Paper |
| Approximation schemes for minimizing average weighted completion time with release dates | 2026-05-06 | Paper |
| A randomized approximation scheme for metric MAX-CUT | 2025-10-29 | Paper |
Scheduling independent multiprocessor tasks
1477.68043 | 2021-12-20 | Paper |
Alternation and redundancy analysis of the intersection problem
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| Approximation schemes for multidimensional packing | 2015-08-03 | Paper |
| Approximation schemes for metric bisection and partitioning | 2015-08-03 | Paper |
Matchings in lattice graphs
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Dynamic TCP acknowledgement and other stories about e/(e-1)
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
| On profit-maximizing envy-free pricing | 2014-10-13 | Paper |
On the sum-of-squares algorithm for bin packing
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Polynomial-time approximation scheme for data broadcast
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Low Distortion Maps Between Point Sets
SIAM Journal on Computing | 2010-09-06 | Paper |
OPT versus LOAD in dynamic storage allocation
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Low distortion maps between point sets
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Huffman coding with unequal letter costs
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Lecture Notes in Computer Science | 2010-05-26 | Paper |
The reverse greedy algorithm for the metric k-median problem
Information Processing Letters | 2009-12-18 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
On the Sum-of-Squares algorithm for bin packing
Journal of the ACM | 2008-12-21 | Paper |
Oblivious Medians Via Online Bidding
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Mathematics of Operations Research | 2008-05-27 | Paper |
Incremental medians via online bidding
Algorithmica | 2008-04-23 | Paper |
On Hierarchical Diameter-Clustering, and the Supplier Problem
Approximation and Online Algorithms | 2008-02-21 | Paper |
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Lecture Notes in Computer Science | 2007-04-30 | Paper |
| scientific article; zbMATH DE number 5010484 (Why is no real title available?) | 2006-03-09 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
| scientific article; zbMATH DE number 2192355 (Why is no real title available?) | 2005-08-05 | Paper |
Glauber dynamics on trees and hyperbolic graphs
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2005-06-15 | Paper |
<i>OPT</i>Versus<i>LOAD</i>in Dynamic Storage Allocation
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2119687 (Why is no real title available?) | 2004-11-29 | Paper |
Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions
Information and Computation | 2004-11-23 | Paper |
Broadcasting on trees and the Ising model.
The Annals of Applied Probability | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2080224 (Why is no real title available?) | 2004-08-04 | Paper |
Dynamic TCP acknowledgment and other stories about e/(e-1)
Algorithmica | 2003-08-17 | Paper |
A PTAS for the average weighted completion time problem on unrelated machines.
Journal of Scheduling | 2003-07-27 | Paper |
The data broadcast problem with non-uniform transmission times
Algorithmica | 2003-06-02 | Paper |
| On the discrete Bak-Sneppen model of self-organized criticality | 2003-04-02 | Paper |
A randomized approximation scheme for metric MAX-CUT
Journal of Computer and System Sciences | 2002-07-04 | Paper |
Linear waste of best fit bin packing on skewed distributions
Random Structures & Algorithms | 2002-07-01 | Paper |
| Better approximation algorithms for bin covering | 2002-03-24 | Paper |
Scheduling independent multiprocessor tasks
Algorithmica | 2002-03-07 | Paper |
A near-optimal solution to a two-dimensional cutting stock problem
Mathematics of Operations Research | 2001-11-26 | Paper |
Approximating the number of monomer-dimer coverings of a lattice.
Journal of Statistical Physics | 2001-01-16 | Paper |
| scientific article; zbMATH DE number 1369845 (Why is no real title available?) | 2000-02-07 | Paper |
| scientific article; zbMATH DE number 1305447 (Why is no real title available?) | 1999-06-17 | Paper |
Multilayer neural networks and polyhedral dichotomies
Annals of Mathematics and Artificial Intelligence | 1999-05-03 | Paper |
| scientific article; zbMATH DE number 1256699 (Why is no real title available?) | 1999-03-01 | Paper |
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing
Journal of Algorithms | 1998-10-21 | Paper |
Data Structures' Maxima
SIAM Journal on Computing | 1998-02-10 | Paper |
PLANAR CAYLEY GRAPHS WITH REGULAR DUAL
International Journal of Algebra and Computation | 1997-07-20 | Paper |
| scientific article; zbMATH DE number 1003289 (Why is no real title available?) | 1997-04-23 | Paper |
Perfect matchings in the triangular lattice
Discrete Mathematics | 1997-01-13 | Paper |
| scientific article; zbMATH DE number 871944 (Why is no real title available?) | 1996-09-22 | Paper |
| scientific article; zbMATH DE number 871933 (Why is no real title available?) | 1996-06-18 | Paper |
| scientific article; zbMATH DE number 871932 (Why is no real title available?) | 1996-04-28 | Paper |
Finding a target subnetwork in sparse networks with random faults
Information Processing Letters | 1994-09-25 | Paper |
On boolean decision trees with faulty nodes
Random Structures & Algorithms | 1994-09-19 | Paper |
| scientific article; zbMATH DE number 417272 (Why is no real title available?) | 1993-12-15 | Paper |
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
SIAM Journal on Computing | 1993-05-17 | Paper |
How to take short cuts
Discrete & Computational Geometry | 1993-01-16 | Paper |
Maximum queue size and hashing with lazy deletion
Algorithmica | 1991-01-01 | Paper |
ON EVALUATING BOOLEAN FUNCTIONS WITH UNRELIABLE TESTS
International Journal of Foundations of Computer Science | 1990-01-01 | Paper |
