Randomized rounding and discrete ham-sandwich theorems: provably good algorithms for routing and packing problems (integer programming)

Fast randomized algorithms for distributed edge coloring

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing

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

Approximate Constrained Bipartite Edge Coloring

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science

Approximate constrained bipartite edge coloring

Discrete Applied Mathematics

Optimizing yield in global routing

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design