Publications
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.
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.
2000. On local search and placement of meters in networks. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. :319-328.
2004. Equivalence of two linear programming relaxations for broadcast scheduling. Operations Research Letters. 32(5):473-478.
1993. The lattice structure of flow in planar graphs. SIAM Journal on Discrete Mathematics. 6:477-477.
2007. Finding Most Probable Worlds of Probabilistic Logic Programs. Scalable Uncertainty Management. 4772:45-59.
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.
1998. Facility Location with Dynamic Distance Functions. Journal of Combinatorial Optimization. 2(3):199-217.
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.