Dependent Rounding in Bipartite Graphs. - Rajiv Gandhi; Samir Khuller; Srinivasan Parthasarathy 002; Aravind Srinivasan (FOCS, 2002)

Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks. - Srinivasan Parthasarathy 002; Rajiv Gandhi (FSTTCS, 2004)

Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. - Rajiv Gandhi; Magnús M. Halldórsson; Guy Kortsarz; Hadas Shachnai (WAOA, 2004)

Algorithms for Minimizing Response Time in Broadcast Scheduling. - Rajiv Gandhi; Samir Khuller; Yoo Ah Kim; Yung-Chun (Justin) Wan (Algorithmica, 2004)

Approximation algorithms for partial covering problems. - Rajiv Gandhi; Samir Khuller; Aravind Srinivasan (J. Algorithms, 2004)

Dependent rounding and its applications to approximation algorithms. - Rajiv Gandhi; Samir Khuller; Srinivasan Parthasarathy 002; Aravind Srinivasan (J. ACM, 2006)

An improved approximation algorithm for vertex cover with hard capacities. - Rajiv Gandhi; Eran Halperin; Samir Khuller; Guy Kortsarz; Aravind Srinivasan (J. Comput. Syst. Sci., 2006)

Approximation algorithms for channel allocation problems in broadcast networks. - Rajiv Gandhi; Samir Khuller; Aravind Srinivasan; Nan Wang 001 (Networks, 2006)

Improved results for data migration and open shop scheduling. - Rajiv Gandhi; Magnús M. Halldórsson; Guy Kortsarz; Hadas Shachnai (ACM Trans. Algorithms, 2006)

Distributed algorithms for connected domination in wireless networks. - Rajiv Gandhi; Srinivasan Parthasarathy 002 (J. Parallel Distributed Comput., 2007)

Improved bounds for scheduling conflicting jobs with minsum criteria. - Rajiv Gandhi; Magnús M. Halldórsson; Guy Kortsarz; Hadas Shachnai (ACM Trans. Algorithms, 2008)

Minimizing broadcast latency and redundancy in ad hoc networks. - Rajiv Gandhi; Arunesh Mishra; Srinivasan Parthasarathy 002 (IEEE/ACM Trans. Netw., 2008)

Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. - Rajiv Gandhi; Julián Mestre (Algorithmica, 2009)

Sub-Coloring and Hypo-Coloring Interval Graphs. - Rajiv Gandhi; Bradford Greening; Sriram V. Pemmaraju; Rajiv Raman 001 (Discret. Math. Algorithms Appl., 2010)

Approximation Algorithms for Data Broadcast in Wireless Networks. - Rajiv Gandhi; Yoo-Ah Kim; Seungjoon Lee; Jiho Ryu; Peng-Jun Wan (IEEE Trans. Mob. Comput., 2012)

Edge covering with budget constrains. - Rajiv Gandhi; Guy Kortsarz (CoRR, 2013)

Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine. - James M. Davis; Rajiv Gandhi; Vijay H. Kothari (Oper. Res. Lett., 2013)

Corrigendum: Improved results for data migration and open shop scheduling. - Rajiv Gandhi; Magnús M. Halldórsson; Guy Kortsarz; Hadas Shachnai (ACM Trans. Algorithms, 2013)

On set expansion problems and the small set expansion conjecture. - Rajiv Gandhi; Guy Kortsarz (Discret. Appl. Math., 2015)

Bicovering: Covering edges with two small subsets of vertices. - Mohammad Taghi Hajiaghayi; Amey Bhangale; Rajiv Gandhi; Rohit Khandekar; Guy Kortsarz (Electron. Colloquium Comput. Complex., 2016)

Bi-Covering: Covering Edges with Two Small Subsets of Vertices. - Amey Bhangale; Rajiv Gandhi; Mohammad Taghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz (SIAM J. Discret. Math., 2017)

On maximum leaf trees and connections to connected maximum cut problems. - Rajiv Gandhi; Mohammad Taghi Hajiaghayi; Guy Kortsarz; Manish Purohit; Kanthi K. Sarpatwar (Inf. Process. Lett., 2018)

Radio aggregation scheduling. - Rajiv Gandhi; Magnús M. Halldórsson; Christian Konrad 001; Guy Kortsarz; Hoon Oh (Theor. Comput. Sci., 2020)