SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A trace bound for the hereditary discrepancy
Proceedings of the sixteenth annual symposium on Computational geometry
Lattice approximation and linear discrepency of totally unimodular matrices
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Recursive Randomized Coloring Beats Fair Dice Random Colorings
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Balanced Coloring: Equally Easy for All Numbers of Colors?
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Structured Randomized Rounding and Coloring
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Combinatorics, Probability and Computing
Linear and Hereditary Discrepancy
Combinatorics, Probability and Computing
Theoretical Computer Science
Matrix rounding and approximation
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Non-independent randomized rounding and coloring
Discrete Applied Mathematics - Special issue: Efficient algorithms
Matrix approximation and Tusnády's problem
European Journal of Combinatorics
Non-independent randomized rounding and coloring
Discrete Applied Mathematics - Special issue: Efficient algorithms
Hereditary Discrepancies in Different Numbers of Colors II
SIAM Journal on Discrete Mathematics
The entropy rounding method in approximation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Bin packing via discrepancy of permutations
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Bin Packing via Discrepancy of Permutations
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
The geometry of differential privacy: the sparse and approximate cases
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Integer feasibility of random polytopes: random integer programs
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |