Rajiv Gandhi

According to our database, Rajiv Gandhi authored at least 23 papers between 2002 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Radio aggregation scheduling.

Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh

Theor. Comput. Sci., 2020

2018

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

2017

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

2016

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

2015

On set expansion problems and the small set expansion conjecture.

Rajiv Gandhi, Guy Kortsarz

Discret. Appl. Math., 2015

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

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

Edge covering with budget constrains.

Rajiv Gandhi, Guy Kortsarz

CoRR, 2013

2012

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

2010

Sub-Coloring and Hypo-Coloring Interval Graphs.

Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman

Discret. Math. Algorithms Appl., 2010

2009

Combinatorial Algorithms for Data Migration to Minimize Average Completion Time.

Rajiv Gandhi, Julián Mestre

Algorithmica, 2009

2008

Minimizing broadcast latency and redundancy in ad hoc networks.

Rajiv Gandhi, Arunesh Mishra, Srinivasan Parthasarathy

IEEE/ACM Trans. Netw., 2008

Improved bounds for scheduling conflicting jobs with minsum criteria.

Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai

ACM Trans. Algorithms, 2008

2007

Distributed algorithms for connected domination in wireless networks.

Rajiv Gandhi, Srinivasan Parthasarathy

J. Parallel Distributed Comput., 2007

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

Approximation algorithms for channel allocation problems in broadcast networks.

Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang

Networks, 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

Dependent rounding and its applications to approximation algorithms.

Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan

J. ACM, 2006

2004

Approximation algorithms for partial covering problems.

Rajiv Gandhi, Samir Khuller, Aravind Srinivasan

J. Algorithms, 2004

Algorithms for Minimizing Response Time in Broadcast Scheduling.

Rajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan

Algorithmica, 2004

Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria.

Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks.

Srinivasan Parthasarathy, Rajiv Gandhi

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2002

Dependent Rounding in Bipartite Graphs.

Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002