Publications

Export 7148 results:
[ Author(Asc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
K
Khuller S, Kim Y-A.  2004.  Equivalence of two linear programming relaxations for broadcast scheduling. Operations Research Letters. 32(5):473-478.
Khuller S, Martinez M, Nau DS, Sliva A, Simari G, Subrahmanian V.  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.
Khuller S, Rivlin E, Rosenfeld A.  1995.  Graphbots: Mobility in discrete spaces. Automata, Languages and Programming. :593-604.
Khuller S, Raghavachari B, Young N.  1998.  Low Degree Spanning Trees of Small Weight. UMIACS-TR-94-1
Khuller S, Kim YA, Wan YCJ.  2010.  Broadcasting on networks of workstations. Algorithmica. 57(4):848-868.
Khuller S, Vazirani VV.  1991.  Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.
Khuller S, Vishkin U.  1994.  Biconnectivity approximations and graph carvings. Journal of the ACM (JACM). 41(2):214-235.
Khuller S, Martinez V, Nau DS, Simari G, Sliva A, Subrahmanian V.  2007.  Finding Most Probable Worlds of Probabilistic Logic Programs. Scalable Uncertainty Management. 4772:45-59.
Khuller S, Raghavachari B, Rosenfeld A.  1996.  Landmarks in graphs. Discrete Applied Mathematics. 70(3):217-229.
Khuller S, Malekian A, Mestre J.  2007.  To fill or not to fill: the gas station problem. Algorithms–ESA 2007. :534-545.
Khuller S, Sussmann YJ.  2000.  The capacitated k-center problem. SIAM Journal on Discrete Mathematics. 13:403-403.
Khuller S, Schieber B.  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.
Khuller S, Raghavachari B, Young N.  1995.  Balancing minimum spanning trees and shortest-path trees. Algorithmica. 14(4):305-321.
Khuller S, Sussmann YJ, Bhatia R, Guha S.  1998.  Facility Location with Dynamic Distance Functions. Journal of Combinatorial Optimization. 2(3):199-217.
Khuller S.  1990.  Coloring algorithms for K5-minor free graphs. Information Processing Letters. 34(4):203-208.
Khuller S, Rosenfeld A, Wu A.  2000.  Centers of sets of pixels. Discrete Applied Mathematics. 103(1–3):297-306.
Khuller S, Vishkin U, Young N.  1994.  A primal-dual parallel approximation technique applied to weighted set and vertex covers. Journal Algorithms. 17(2):280-289.
Khuller S, Raghavachari B, Young N.  1996.  On strongly connected digraphs with bounded cycle length. Discrete Applied Mathematics. 69(3):281-289.
Khuller S.  1989.  On computing graph closures. Information Processing Letters. 31(5):249-255.
Khuller S, Raghavachari B, Young N.  1995.  Approximating the minimum equivalent digraph. SIAM Journal on Computing (SICOMP). 24(4):859-872.
Khuller S, Pless R, Sussmann YJ.  2000.  Fault tolerant K-center problems. Theoretical Computer Science. 242(1–2):237-245.
Khuller S, Mitchell JSB.  1990.  On a triangle counting problem. Information Processing Letters. 33(6):319-321.
Khuller S, Naor J.  1994.  Flow in planar graphs with vertex capacities. Algorithmica. 11(3):200-225.
Khuller S, Kim Y-A, Wan Y-C J.  2005.  Broadcasting on networks of workstations. Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures. :279-288.
Khuller S, Raghavachari B.  1996.  Graph and network algorithms. ACM Computing Surveys. 28(1):43-45.

Pages