Publications
1994. A primal-dual parallel approximation technique applied to weighted set and vertex covers. Journal Algorithms. 17(2):280-289.
1996. On strongly connected digraphs with bounded cycle length. Discrete Applied Mathematics. 69(3):281-289.
1995. Approximating the minimum equivalent digraph. SIAM Journal on Computing (SICOMP). 24(4):859-872.
2005. Broadcasting on networks of workstations. Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures. :279-288.
2007. Computing most probable worlds of action probabilistic logic programs: scalable estimation for 10^30,000 worlds. Annals of Mathematics and Artificial Intelligence. 51(2):295-331.
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.
2007. Finding Most Probable Worlds of Probabilistic Logic Programs. Scalable Uncertainty Management. 4772:45-59.
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.