Publications

Export 481 results:
[ Author(Desc)] 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 
K
Khuller S, Naor J.  1994.  Flow in planar graphs with vertex capacities. Algorithmica. 11(3):200-225.
Khuller S, Raghavachari B.  1996.  Graph and network algorithms. ACM Computing Surveys. 28(1):43-45.
Khuller S, Rosenfeld A, Wu A.  2000.  Centers of sets of pixels. Discrete Applied Mathematics. 103(1–3):297-306.
Khuller S, Mestre J.  2008.  An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. Algorithms-ESA 2008. :601-610.
Khuller S, Vazirani VV.  1991.  Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.
Khuller S, Matias Y.  1995.  A simple randomized sieve algorithm for the closest-pair problem. Information and Computation. 118(1):34-37.
Khuller S, Raghavachari B, Young N.  1998.  Low Degree Spanning Trees of Small Weight. UMIACS-TR-94-1
Khuller S, Kim YA, Malekian A.  2006.  Improved algorithms for data migration. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :164-175.
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, 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, 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.  1990.  Coloring algorithms for K5-minor free graphs. Information Processing Letters. 34(4):203-208.
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. 4772:45-59.
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, 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.  1989.  On computing graph closures. Information Processing Letters. 31(5):249-255.
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, Malekian A, Mestre J.  2007.  To fill or not to fill: the gas station problem. Algorithms–ESA 2007. :534-545.
Khuller S, Mitchell JSB.  1990.  On a triangle counting problem. Information Processing Letters. 33(6):319-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.

Pages