Publications
1995. A simple randomized sieve algorithm for the closest-pair problem. Information and Computation. 118(1):34-37.
2006. Improved algorithms for data migration. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :164-175.
2008. An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. Algorithms-ESA 2008. :601-610.
1990. Extending planar graph algorithms to K3,3-free graphs. Information and Computation. 84(1):13-25.
1995. Improved approximation algorithms for uniform connectivity problems. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. :1-10.
2010. Energy efficient scheduling via partial shutdown. Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. :1360-1372.
1992. Processor efficient parallel algorithms for the two disjoint paths problem and for finding a Kuratowski homeomorph. SIAM Journal on Computing. 21:486-486.
1994. On the parallel complexity of digraph reachability. Information Processing Letters. 52(5):239-241.
2007. Finding most probable worlds of probabilistic logic programs. Scalable Uncertainty Management. :45-59.
2000. On local search and placement of meters in networks. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. :319-328.
1993. The lattice structure of flow in planar graphs. SIAM Journal on Discrete Mathematics. 6:477-477.
2004. Equivalence of two linear programming relaxations for broadcast scheduling. Operations Research Letters. 32(5):473-478.
1991. Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.
1989. Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs. Foundations of Computer Science, 1989., 30th Annual Symposium on. :288-293.