Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Lopsided Lova´sz Local Lemma and Latin transversals
ARIDAM III Selected papers on Third advanced research institute of discrete applied mathematics
A lower bound for radio broadcast
Journal of Computer and System Sciences
Improved Approximation Algorithms for Shop Scheduling Problems
SIAM Journal on Computing
On the approximation of maximum satisfiability
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
Chernoff-Hoeffding Bounds for Applications with Limited Independence
SIAM Journal on Discrete Mathematics
Handbook of combinatorics (vol. 2)
Static and dynamic path selection on expander graphs (preliminary version): a random walk approach
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Further algorithmic aspects of the local lemma
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Improved bounds for acyclic job shop scheduling (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An extension of the Lovász local lemma, and its applications to integer programming
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Better approximation guarantees for job-shop scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
New algorithmic aspects of the Local Lemma with applications to routing and partitioning
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A deterministic approximation algorithm for a minmax integer programming problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for MAX SAT
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A Theoretical Framework of Hybrid Approaches to MAX SAT
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Improved Bounds and Algorithms for Hypergraph Two-Coloring
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Journal of Graph Theory
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Random Structures & Algorithms
Testing hypergraph colorability
Theoretical Computer Science - Automata, languages and programming
Job shop scheduling with unit processing times
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Job Shop Scheduling with Unit Processing Times
Mathematics of Operations Research
Improved algorithmic versions of the Lovász Local Lemma
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Tight Bounds for Permutation Flow Shop Scheduling
Mathematics of Operations Research
Improved Bounds for Flow Shop Scheduling
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Real-Time Message Routing and Scheduling
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Conflict-free colourings of graphs and hypergraphs
Combinatorics, Probability and Computing
Tight bounds for permutation flow shop scheduling
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
How many conflicts does it need to be unsatisfiable?
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Deterministic algorithms for the Lovász Local Lemma
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Hardness of Approximating Flow and Job Shop Scheduling Problems
Journal of the ACM (JACM)
The lovász-local-lemma and scheduling
Efficient Approximation and Online Algorithms
Improved approximation algorithms for routing shop scheduling
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.00 |