On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Recursive Randomized Coloring Beats Fair Dice Random Colorings
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On Constrained Hypergraph Coloring and Scheduling
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Algorithms Based on Randomization and Linear and Semidefinite Programming
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Theoretical Computer Science
Combinatorics, Probability and Computing
Bounds and constructions for the star-discrepancy via δ-covers
Journal of Complexity
Solving Generalized Maximum Dispersion with Linear Programming
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
A polynomial-time approximation scheme for embedding hypergraph in a cycle
ACM Transactions on Algorithms (TALG)
Bounds and constructions for the star-discrepancy via δ-covers
Journal of Complexity
Randomly rounding rationals with cardinality constraints and derandomizations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
Journal of Complexity
Inapproximability of b-matching in k-uniform hypergraphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Generating randomized roundings with cardinality constraints and derandomizations
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Roundings respecting hard constraints
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The lovász-local-lemma and scheduling
Efficient Approximation and Online Algorithms
Improved approximation algorithms for the Min-Max Selecting Items problem
Information Processing Letters
Hi-index | 0.00 |