Since most of these papers are published,
the copyright has been transferred to the respective publishers. Therefore,
the papers may be downloaded for personal and research purposes only.
Journal Papers

R. Gandhi, M. Hajiaghayi, G. Kortsarz, M. Purohit, and K. Sarpatwar.
On Maximum Leaf Trees and Connections to Connected Maximum Cut Problems
Information Processing Letters, accepted, June 2017.

R. Gandhi and G. Kortsarz.
On Set Expansion Problems and
the Small Set Expansion Conjecture
Discrete Applied Mathematics, 194:93101, October 2015.

J. Davis, R. Gandhi, and V. Kothari.
Combinatorial Algorithms for
Minimizing the Weighted Sum of Completion Times on a Single Machine
Operations Research Letters, 41(2):121125, March 2013.

R. Gandhi, Y. Kim, S. Lee, J. Ryu, and PJ. Wan.
Approximation Algorithms for Data Broadcast in Wireless Networks.
IEEE Transactions on Mobile Computing, 11(7):12371248, July 2012.

R. Gandhi, B. Greening Jr., S. Pemmaraju, and R. Raman.
Subcoloring and Hypocoloring Interval Graphs.
Discrete Mathematics, Algorithms, and Applications, 2(3):331345, September 2010.

R. Gandhi and J. Mestre.
Combinatorial Algorithms for Data Migration to Minimize Average
Completion Time.
Algorithmica, 54(1):5471, May 2009.

R. Gandhi, A. Mishra, and S. Parthasarathy.
Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks.
IEEE/ACM Transactions on Networking, 16(4): 840851, August 2008.

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

R. Gandhi and S. Parthasarathy.
Distributed Algorithms for Connected Domination in Wireless Networks.
Journal of Parallel and Distributed Computing, 67(7):848862, July 2007.

R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan.
Dependent Rounding and its Applications to Approximation Algorithms.
Journal of the ACM, 53(3):324360, May 2006.

R. Gandhi, S. Khuller, A. Srinivasan, and N. Wang.
Approximation Algorithms for Channel Allocation Problems in Broadcast
Networks.
Networks, 47(4):225236, March 2006.

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):1633, February 2006.

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):116129, January 2006.

R. Gandhi, S. Khuller, and A. Srinivasan.
Approximation Algorithms for Partial Covering Problems.
Journal of Algorithms, 53(1):5584, October 2004.

R. Gandhi, S. Khuller, Y. Kim, and Y. C. Wan.
Algorithms for Minimizing Response Time in Broadcast Scheduling.
Algorithmica, 38(4):597608, January 2004.
Refereed Conference Publications

A. Bhangale, R. Gandhi, M. Hajiaghayi, R. Khandekar, and G. Kortsarz.
Bicovering: Covering Edges with Two Small Subsets of Vertices.
In Proc. of the FortyThird Int. Colloquium on Automata, Languages, and Programming (ICALP'16), July 2016.

R. Gandhi, M. M. Halldorsson, C. Konrad, G. Kortsarz, and H. Oh.
Radio Aggregation Scheduling.
In Proc. of the Eleventh Int. Symposium on Algorithms and
Experiments for Wireless Sensor Networks (ALGOSENSORS'15), September 2015.

R. Gandhi and G. Kortsarz.
On Set Expansion Problems and the
Small Set Expansion Conjecture.
In Proc. of the Fortieth Int. Workshop on GraphTheoretic
Concepts in Computer Science (WG'14), June 2014.

R. Gandhi, B. Greening Jr., S. Pemmaraju, and R. Raman.
Subcoloring and Hypocoloring Interval Graphs.
In Proc. of the ThirtyFifth Int. Workshop on GraphTheoretic
Concepts in Computer Science (WG'09), pages 122132, June 2009.

R. Gandhi, Y. Kim, S. Lee, J. Ryu, and PJ. Wan.
Approximation Algorithms for Data Broadcast in Wireless Networks.
In Proc. of the 28th IEEE Int. Conference on Computer
Communications (INFOCOM'09), pages 26812685, April 2009

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 128139, August 2006.

S. Parthasarathy and R. Gandhi.
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks.
In Proc. of the TwentyFourth Conf. on
Found. of Software Technology and Theoretical Computer Science
(FSTTCS'04), pages 447459, Dec. 2004.

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 6882, Sep. 2004.

R. Gandhi, M. M. Halldorsson, G. Kortsarz, and H. Shachnai.
Improved Results for Data Migration and Open Shop Scheduling.
In Proc. of the ThirtyFirst Int. Colloquium on
Automata, Languages, and Programming (ICALP'04), pages 658669, Jul. 2004.

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 4758, Aug. 2003.

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 164175, Jul. 2003.

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 222232,
Jun. 2003.

R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan.
Dependent Rounding in Bipartite Graphs.
In Proc. of the FortyThird IEEE Symposium on Foundations of Computer Science
(FOCS'02), pages 323332, Nov. 2002.

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 425438, May 2002.

R. Gandhi, S. Khuller, and A. Srinivasan.
Approximation Algorithms for Partial Covering Problems.
In Proc. of the TwentyEighth Int. Colloquium on
Automata, Languages, and Programming (ICALP'01), LNCS 2076, pages 225236, Jul. 2001.

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 Webbased Information Visualization
(WebVis'00), pages 591598, Sep. 2000.
Back to Rajiv C. Gandhi's
home page.