A. Chow, L. Golubchik, S. Khuller and Y. Yao. Multi-tree Streaming: A fresh look. Submitted for publication.
J. Chang, T. Erlebach, R. Gailis and S. Khuller. Broadcast Scheduling: Algorithms and Complexity. SODA (2008)
A. Deshpande, S. Khuller, A. Malekian and M. Toossi. Energy Efficient Monitoring in Sensor Networks. LATIN 2008
S. Khuller, A. Malekian and J. Mestre. The Gas Station Problem. ESA 2007.
S. Kashyap, S. Khuller, Y-C. Wan and L. Golubchik. Fast Reconfiguration of Data Placement in Parallel Disks. 2006 ALENEX.
M. Charikar and S. Khuller. A robust maximum completion time measure for scheduling. ACM-SIAM SODA (2006).
J. Bleiholder, S. Khuller, F. Naumann, L. Raschid and Y. Wu. Query Planning in the presence of overlapping sources. EDBT (2006).
A. Kashyap, S. Khuller and M. Shayman. Relay placement for higher order connectivity in sensor networks. INFOCOM (2006). Submitted to ACM Transactions on Sensor Networks.
G. Aggarwal, T. Feder, K. Kenthapadi, S. Khuller, R. Panigrahy, D. Thomas and A. Zhu. Achieving anonymity via clustering. ACM PODS (2006). Accepted to ACM Trans. on Algorithms.
S. Khuller, Y-A. Kim, A.Malekian. Improved algorithms for Data migration. APPROX 2006.
S. Khuller, B. Raghavachari and N. Young. Greedy Methods. Book Chapter.
S. Khuller, K. Lee and M. Shayman. On Degree Constrained Shortest Paths. ESA 2005.
S. Khuller, Y. Kim and Y-C. Wan. Broadcasting on Networks of Workstations. 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '05).. Submitted to Algorithmica.
S. Khuller, Y. Kim and G. Woeginger. A polynomial time approximation scheme for broadcasting in heterogenous networks. APPROX 2004. Algorithmica, Vol 48(1):1--21 (2007)(merged with SODA 2004 paper).
S. Khuller and Y. Kim. On broadcasting in heterogenous networks. SODA 2004. Algorithmica, Vol 48(1):1--21 (2007).
S. Khuller and Y. Kim. Equivalence of Two Linear Programming Relaxations for Broadcast Scheduling. Operations Research Letters Vol 32(5):473--478 (2004)
S. Khuller, Y. Kim and Y-C. Wan. On generalized broadcasting and gossiping. ESA 2003. Journal of Algorithms (2005) .
S. Kashyap and S. Khuller. Algorithms for Non-Uniform Size Data Placement on Parallel Disks. FST&TCS 2003. Journal of Algorithms (2005) .
R. Gandhi, S. Khuller, A. Srinivasan and N. Wang. Approximation algorithms for channel allocation problems in broadcast networks . APPROX 2003. Networks (2006).
R.Gandhi, E. Halperin, S. Khuller, G. Kortsarz and A.Srinivasan. An improved approximation algorithm for vertex cover with hard capacities. ICALP 2003 . JCSS Vol 72(1):16--33 (2006).
B. Cheng, C.F. Chou, L. Golubchik, S. Khuller, Y-C. Wan. Large scale data collection: a co-ordinated approach. . INFOCOM 2003. IEEE Journal on Special Areas in Communication (Special Issue on Design, Implementation and Analysis of Communication Protocols). Vol 22(1): 2004--2019, (2004).
S. Banerjee, C. Kommareddy, K. Kar, B. Bhattacharjee and S. Khuller. Construction of an Efficient Overlay Multicast Infrastructure for Real-Time Applications. INFOCOM 2003
S. Khuller, Y. Kim and Y-C. Wan. Algorithms for Data Migration with Cloning. 22nd ACM Principles of Database Conference (PODS) 2003. SIAM J. on Computing Vol 33(2): 448--461, (2004).
C.F Chou, Y-C. Wan, B. Cheng, L. Golubchik, S. Khuller. A performance study of a large scale data collection problem, . 7th International Workshop on Web Content Caching and Distribution, (IWCW 2002), (Aug '02),
R. Gandhi, S. Khuller, Y. Kim and Y-C. Wan. Approximation algorithms for broadcast scheduling. 9th Conference on Integer Programming and Combinatorial Optimization (IPCO) 2002. Algorithmica Vol 38: 597--608, (2004).
R. Gandhi, S. Khuller, S. Parthasarathy and A. Srinivasan. Dependent Rounding on Bipartite Graphs. 43rd Conference Foundations of Computer Science (FOCS), (Nov '02). To appear in JACM.
S. Khuller and A. Zhu. The General Steiner Tree-Star Problem. Information Processing Letters (2002) .
Sudipto Guha, Rafi Hassin, Samir Khuller and Einat Or. Capacitated vertex covering with applications . SODA 2002. J. of Algorithms Vol 48(1), pp. 257--270, (2003).
Leonid Zosin and Samir Khuller. On directed Steiner trees. SODA 2002.
Ruth Ben-Yashar, Samir Khuller, Sarit Kraus. Optimal collective dichotomous choice under partial order constraints. Mathematical Social Sciences Vol 41, pp. 349--364, (2001).
Rafi Hassin, Samir Khuller. Z-Approximations. Journal of Algorithms Vol 41(2), pp. 429--442 (2001).
Rajiv Gandhi, Samir Khuller and Aravind Srinivasan. Approximation Algorithms for Partial Covering Problems. ICALP 2001. J. of Algorithms Vol 53(1): 55--84 (2004).
Suman Banerjee and Samir Khuller. A Clustering Scheme for Hierarchical Routing in Wireless Networks. INFOCOM 2001.
Moses Charikar, Samir Khuller, Giri Narasimhan and Dave Mount. Facility Location with Outliers. 12th Symposium on Discrete Algorithms (SODA), (Jan 2001), Washington DC.
B. Cheng, C.F Chou, L. Golubchik, S. Khuller. A Secure and Scalable Web Upload Service Architecture. International Conference on Internet Computing (IC 2001), (Jun '01),
Leana Golubchik, Sanjeev Khanna, Samir Khuller, Ramki Thurimella and An Zhu. Approximation Algorithms for Data Placement on Parallel Disks. 11th Symposium on Discrete Algorithms (SODA), (Jan 2000), San Francisco. To appear ACM Trans. on Algorithms.
Samir Khuller, Randeep Bhatia and Robert Pless. On Local Search and Placement of Meters in Networks. 11th Symposium on Discrete Algorithms (SODA), (Jan 2000), San Francisco. SIAM Journal on Computing Vol 32(2), pp. 470--487, (2003).
Samir Khuller, Azriel Rosenfeld and Angela Wu. Centers of sets of pixels. Discrete Applied Mathematics Vol 103, pp. 297--306, (2000).
S. Bhattacharjee, W. C. Cheng, C.-F. Chou, L. Golubchik, S. Khuller. Bistro: a Platform for Building Scalable Wide-Area Upload Applications. ACM SIGMETRICS Performance Evaluation Review (also presented at the Workshop on Performance and Architecture of Web Servers (PAWS) in June 2000). Volume 28, Number 2, September 2000, pp. 29-35.
Randeep Bhatia, Samir Khuller, Robert Pless and Yoram J. Sussmann. The Full Degree Spanning Tree Problem. 10th Symposium on Discrete Algorithms (SODA), (Jan '99), Baltimore. (short paper). Networks Vol 36(4), pp. 1--7, (2000) .
Samir Khuller, Balaji Raghavachari and An Zhu. A Uniform Framework for Approximating Weighted Connectivity Problems. 10th Symposium on Discrete Algorithms (SODA), (Jan '99), Baltimore. (short paper).
Samir Khuller. An O(V^2) algorithm for Single Connectedness. Information Processing Letters Vol 72(3-4), pp. 105--107, (1999) .
Samir Khuller, Anna Moss and Joseph Naor. The Budgeted Maximum Coverage Problem. Information Processing Letters Vol. 70(1), pp. 39--45, (1999) .
Nili Guttmann-Beck, Rafi Hassin, Samir Khuller and Balaji Raghavachari. Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. 1998 FST&TCS Conference (Madras, India). Algorithmica Vol 28 pp. 422--437, (2000).
Moses Charikar, Samir Khuller and Balaji Raghavachari. Algorithms for Capacitated Vehicle Routing. 30th Symposium on Theory of Computing (STOC), (May '98), Dallas. SIAM Journal on Computing Vol 31(3), pp. 665--682 (2001).
Sudipto Guha and Samir Khuller. Greedy Strikes Back: Improved Algorithms for Facility Location. 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), (Jan '98), San Francisco, CA. Journal of Algorithms Vol 31(1) (1999), pp. 228-248.
Randeep Bhatia, Sudipto Guha, Samir Khuller and Yoram J. Sussmann. Facility Location with Dynamic Distance Functions. 6th Scandinavian Workshop on Algorithm Theory (SWAT), (Jul '98), Stockholm, Sweden. Invited to Journal of Combinatorial Optimization Vol 2 (1998) pp. 199--217.
Sudipto Guha and Samir Khuller. Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. 1998 FST&TCS Conference (Madras, India). Information and Computation Vol 150, pp. 57--74 (1999).
Samir Khuller, Robert Pless and Yoram J. Sussmann. Fault Tolerant K-Center Problems. 3rd Italian Conference on Algorithms and Complexity (CIAC), (Mar '97), Rome, Italy. Theoretical Computer Science Vol 242 (1-2), pp. 237-245, (2000).
S. Khuller, B. Raghavachari and A. Rosenfeld. Landmarks in Graphs Discrete Applied Mathematics, Vol. 70 (3), pp. 217-229 (1996).
Samir Khuller and Yoram J. Sussmann. The Capacitated K-Center Problem. 4th Annual European Symposium on Algorithms (ESA), (Sep '96), Barcelona, Spain. SIAM Journal on Discrete Mathematics Vol 13(3), pp. 403--418, (2000).
Sudipto Guha and Samir Khuller. Approximation Algorithms for Connected Dominating Sets. 4th Annual European Symposium on Algorithms (ESA), (Sep '96), Barcelona, Spain. Algorithmica Vol 20 (1998), pp. 374--387.
Sandor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari and Neal Young. A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. 5th Integer Programming and Combinatorial Optimization Conference (IPCO), (June '96), Vancouver, Canada. Journal of Algorithms Vol 24(2) (1997) pp 310--324.
S. Khuller, B. Raghavachari and N. Young. On Strongly Connected Digraphs with Bounded Cycle Length. Discrete Applied Mathematics, Vol 69 (3) (1996) pp. 281--289.
A. Bar-Noy, S. Khuller and B. Schieber. The complexity of finding most vital arcs and nodes. CS-TR-3539. Technical Report, University of Maryland (1995).
S. Khuller and Y. Matias. A Simple Randomized Sieve Algorithm for the Closest-Pair Problem Information and Computation, Vol 188 (1), pp. 34--37, (1995).
Samir Khuller and Balaji Raghavachari. Improved Approximation Algorithms for Uniform Connectivity Problems. 27th Symposium on Theory of Computing (STOC), (May '95), Las Vegas. Journal of Algorithms Vol 21(2) (1996) pp. 434--450.
Randeep Bhatia, Samir Khuller and Joseph (Seffi) Naor. The Loading Time Scheduling Problem. 36th Conference on Foundations of Computer Science (FOCS), (Oct '95), Milwaukee. Journal of Algorithms Vol 36(1), pp. 1--33 (2000).
S. Khuller, A. Rosenfeld and E. Rivlin. Graphbots: Mobility in Discrete Spaces . 22nd International Colloquium on Automata, Languages and Programming Conference (ICALP), (July '95), Szeged, Hungary. IEEE Transactions on Systems, Man and Cybernetics Vol 28(1) (1998) pp 29-38.
S. Khuller and U. Vishkin. On the Parallel Complexity of Digraph Reachability. Information Processing Letters Vol 52 (5), pp. 239--241, (1994) .
Samir Khuller, Balaji Raghavachari and Neal Young. Approximating the Minimum Equivalent Digraph . ACM-SIAM Symp. on Discrete Algorithms (SODA) (Jan '94). SIAM Journal on Computing, Vol 24 (4) pp. 859--872, (1995).
Samir Khuller, Balaji Raghavachari and Neal Young. Low Degree Spanning Trees of Small Weight . 26th Symposium on Theory of Computing (STOC), (May '94), Montreal. SIAM Journal on Computing Vol 25 (2) pp. 355--368, (1996).
S. Khuller, J. Naor and P. Klein. The Lattice Structure of Flow in Planar Graphs. SIAM Journal of Discrete Mathematics, Vol 6 (3) pp. 477--490, (1993).
S. Khuller, B. Raghavachari and N. Young. Designing Multi-Commodity Flow Trees . Workshop on Algorithms and Data Structures (WADS), (Aug '93), Montreal, Canada. Information Processing Letters, Vol 50(1) (1994) pp. 49--55.
S. Khuller, B. Raghavachari and N. Young, Balancing Minimum Spanning and Shortest Path Trees. 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), (Jan '93), Austin. Algorithmica, Vol 14(4) (1995) pp. 305--321.