Publications

Export 7148 results:
[ Author(Desc)] 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, Li J, Saha B.  2010.  Energy efficient scheduling via partial shutdown. Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. :1360-1372.
Khuller S, Mitchell SG, Vazirani VV.  1992.  Processor efficient parallel algorithms for the two disjoint paths problem and for finding a Kuratowski homeomorph. SIAM Journal on Computing. 21:486-486.
Khuller S, Vishkin U.  1994.  On the parallel complexity of digraph reachability. Information Processing Letters. 52(5):239-241.
Khuller S, Martinez V, Nau DS, Simari G, Sliva A, Subrahmanian V.  2007.  Finding most probable worlds of probabilistic logic programs. Scalable Uncertainty Management. :45-59.
Khuller S, Mitchell SG, Vazirani VV.  1990.  On-line algorithms for weighted matching and stable marriages. TR90-1143
Khuller S, Bhatia R, Pless R.  2000.  On local search and placement of meters in networks. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. :319-328.
Khuller S, Naor JS, Klein P.  1993.  The lattice structure of flow in planar graphs. SIAM Journal on Discrete Mathematics. 6:477-477.
Khuller S, Kim Y-A.  2004.  Equivalence of two linear programming relaxations for broadcast scheduling. Operations Research Letters. 32(5):473-478.
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, 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, 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, Sussmann YJ.  2000.  The capacitated k-center problem. SIAM Journal on Discrete Mathematics. 13:403-403.
Khuller S, Raghavachari B, Young N.  1995.  Balancing minimum spanning trees and shortest-path trees. Algorithmica. 14(4):305-321.
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, 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, 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.

Pages