Export 481 results:
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is K  [Clear All Filters]
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 
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, Kim YA, Malekian A.  2006.  Improved algorithms for data migration. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :164-175.
Khuller S, Thurimella R.  1993.  Approximation Algorithms for Graph Augmentation. Journal of Algorithms. 14(2):214-225.
Khuller S, Raghavachari B.  1995.  Improved approximation algorithms for uniform connectivity problems. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. :1-10.
Khuller S, Pless R, Sussmann YJ.  2000.  Fault tolerant K-center problems. Theoretical Computer Science. 242(1–2):237-245.
Khuller S.  1990.  Coloring algorithms for K5-minor free graphs. Information Processing Letters. 34(4):203-208.
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, Vishkin U.  1994.  On the parallel complexity of digraph reachability. Information Processing Letters. 52(5):239-241.
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.  1989.  On computing graph closures. Information Processing Letters. 31(5):249-255.
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, Naor JS, Klein P.  1993.  The lattice structure of flow in planar graphs. SIAM Journal on Discrete Mathematics. 6:477-477.
Khuller S, Rivlin E, Rosenfeld A.  1995.  Graphbots: Mobility in discrete spaces. Automata, Languages and Programming. :593-604.
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, Mitchell JSB.  1990.  On a triangle counting problem. Information Processing Letters. 33(6):319-321.
Khuller S, Malekian A, Mestre J.  2007.  To fill or not to fill: the gas station problem. Algorithms–ESA 2007. :534-545.
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, Lee K, Shayman M.  2005.  On degree constrained shortest paths. Algorithms–ESA 2005. :259-270.
Khuller S, Schieber B.  1992.  On independent spanning trees. Information Processing Letters. 42(6):321-323.
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, Raghavachari B, Young N.  1995.  Balancing minimum spanning trees and shortest-path trees. Algorithmica. 14(4):305-321.
Khuller S, Sussmann YJ.  2000.  The capacitated k-center problem. SIAM Journal on Discrete Mathematics. 13:403-403.
Khuller S.  1990.  Extending planar graph algorithms to K3,3-free graphs. Information and Computation. 84(1):13-25.
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.