Journal Papers

• R. Gandhi, A. Mishra, and S. Parthasarathy.
  Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks.
  Accepted to IEEE/ACM Transactions on Networking.
  [postscript]     [pdf]

• R. Gandhi, M. M. Halldorsson, G. Kortsarz, and H. Shachnai.
  Improved Bounds for Scheduling Conflicting Jobs with Minsum Criteria.
  ACM Transactions on Algorithms, 4(1), Article 11, March 2008
  [postscript]     [pdf]

• R. Gandhi and J. Mestre.
  Combinatorial Algorithms for Data Migration to Minimize Average Completion Time.
  Algorithmica, November 2007.
  [postscript]     [pdf]

• R. Gandhi and S. Parthasarathy.
  Distributed Algorithms for Connected Domination in Wireless Networks.
  Journal of Parallel and Distributed Computing, 67(7):848-862, July 2007.
  [postscript]     [pdf]

• R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan.
  Dependent Rounding and its Applications to Approximation Algorithms.
  Journal of the ACM, 53(3):324-360, May 2006.
  [postscript]     [pdf]

• R. Gandhi, S. Khuller, A. Srinivasan, and N. Wang.
  Approximation Algorithms for Channel Allocation Problems in Broadcast Networks.
  Networks, 47(4):225-236, March 2006.
  [postscript]     [pdf]

• R. Gandhi, E. Halperin, S. Khuller, G. Kortsarz, and A. Srinivasan.
  An Improved Approximation Algorithm for Vertex Cover with Hard Capacities.
  Journal of Computer and System Sciences, 72(1):16-33, February 2006.
  [postscript]     [pdf]

• R. Gandhi, M. M. Halldorsson, G. Kortsarz, and H. Shachnai.
  Improved Results for Data Migration and Open Shop Scheduling.
  ACM Transactions on Algorithms, 2(1):116-129, January 2006.
  [postscript]     [pdf]

• R. Gandhi, S. Khuller, and A. Srinivasan.
  Approximation Algorithms for Partial Covering Problems.
  Journal of Algorithms, 53(1):55-84, October 2004.
  [postscript]     [pdf]

• R. Gandhi, S. Khuller, Y. Kim, and Y. C. Wan.
  Algorithms for Minimizing Response Time in Broadcast Scheduling.
  Algorithmica, 38(4):597-608, January 2004.
  [postscript]     [pdf]

Refereed Conference Publications

• R. Gandhi and J. Mestre.
  Combinatorial Algorithms for Data Migration to Minimize Average Completion Time.
  In Proc. of the Ninth Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'06), pages 128-139, August 2006.
  [postscript]     [pdf]

• S. Parthasarathy and R. Gandhi.
  Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks.
  In Proc. of the Twenty-Fourth Conf. on Found. of Software Technology and Theoretical Computer Science (FSTTCS'04), pages 447-459, Dec. 2004.
  [postscript]     [pdf]

• R. Gandhi, M. M. Halldorsson, G. Kortsarz, and H. Shachnai.
  Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria.
  In Proc. of the Second Workshop on Approximation and Online Algorithms (WAOA'04), pages 68-82, Sep. 2004.
  [postscript]     [pdf]

• R. Gandhi, M. M. Halldorsson, G. Kortsarz, and H. Shachnai.
  Improved Results for Data Migration and Open Shop Scheduling.
  In Proc. of the Thirty-First Int. Colloquium on Automata, Languages, and Programming (ICALP'04), pages 658-669, Jul. 2004.
  [postscript]     [pdf]

• R. Gandhi, S. Khuller, A. Srinivasan, and N. Wang.
  Approximation Algorithms for Channel Allocation Problems in Broadcast Networks.
  In Proc. of the Sixth Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'03), pages 47-58, Aug. 2003.
  [postscript]     [pdf]

• R. Gandhi, E. Halperin, S. Khuller, G. Kortsarz, and A. Srinivasan.
  An Improved Approximation Algorithm for Vertex Cover with Hard Capacities.
  In Proc. of the Thirtieth Int. Colloquium on Automata, Languages, and Programming (ICALP'03), pages 164-175, Jul. 2003.
  [postscript]     [pdf]

• R. Gandhi, S. Parthasarathy, and A. Mishra.
  Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks.
  In Proc. of the Fourth ACM Int. Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'03), pages 222-232, Jun. 2003.
  [postscript]     [pdf]

• R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan.
  Dependent Rounding in Bipartite Graphs.
  In Proc. of the Forty-Third IEEE Symposium on Foundations of Computer Science (FOCS'02), pages 323-332, Nov. 2002.
  [postscript]     [pdf]

• R. Gandhi, S. Khuller, Y. Kim, and Y. C. Wan.
  Algorithms for Minimizing Response Time in Broadcast Scheduling.
  In Proc. of the Ninth Int. Conference on Integer Programming and Combinatorial Optimization (IPCO'02), LNCS 2337, pages 425-438, May 2002.
  [postscript]     [pdf]

• R. Gandhi, S. Khuller, and A. Srinivasan.
  Approximation Algorithms for Partial Covering Problems.
  In Proc. of the Twenty-Eighth Int. Colloquium on Automata, Languages, and Programming (ICALP'01), LNCS 2076, pages 225-236, Jul. 2001.
  [postscript]     [pdf]

• R. Gandhi, G. Kumar, B. Bederson, and B. Shneiderman.
  Domain Name Based Visualization of Web Histories in a Zoomable User Interface.
  In Proc. of the Second Int. Workshop on Web-based Information Visualization (WebVis'00), pages 591-598, Sep. 2000.
  [compressed postscript]     [pdf]

Back to Rajiv C. Gandhi's home page.