default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRajiv Gandhi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j18]Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh:
Radio aggregation scheduling. Theor. Comput. Sci. 840: 143-153 (2020)
2010 – 2019
- 2018
- [j17]Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Manish Purohit, Kanthi K. Sarpatwar:
On maximum leaf trees and connections to connected maximum cut problems. Inf. Process. Lett. 129: 31-34 (2018) - 2017
- [j16]Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Bi-Covering: Covering Edges with Two Small Subsets of Vertices. SIAM J. Discret. Math. 31(4): 2626-2646 (2017) - 2016
- [c15]Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Bicovering: Covering Edges With Two Small Subsets of Vertices. ICALP 2016: 6:1-6:12 - [i2]Mohammad Taghi Hajiaghayi, Amey Bhangale, Rajiv Gandhi, Rohit Khandekar, Guy Kortsarz:
Bicovering: Covering edges with two small subsets of vertices. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j15]Rajiv Gandhi, Guy Kortsarz:
On set expansion problems and the small set expansion conjecture. Discret. Appl. Math. 194: 93-101 (2015) - [c14]Rajiv Gandhi, Magnús M. Halldórsson
, Christian Konrad, Guy Kortsarz, Hoon Oh:
Radio Aggregation Scheduling. ALGOSENSORS 2015: 169-182 - 2014
- [c13]Rajiv Gandhi, Guy Kortsarz:
On Set Expansion Problems and the Small Set Expansion Conjecture. WG 2014: 189-200 - 2013
- [j14]James M. Davis, Rajiv Gandhi, Vijay H. Kothari:
Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine. Oper. Res. Lett. 41(2): 121-125 (2013) - [j13]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Corrigendum: Improved results for data migration and open shop scheduling. ACM Trans. Algorithms 9(4): 34:1-34:7 (2013) - [i1]Rajiv Gandhi, Guy Kortsarz:
Edge covering with budget constrains. CoRR abs/1311.0713 (2013) - 2012
- [j12]Rajiv Gandhi, Yoo-Ah Kim, Seungjoon Lee, Jiho Ryu, Peng-Jun Wan:
Approximation Algorithms for Data Broadcast in Wireless Networks. IEEE Trans. Mob. Comput. 11(7): 1237-1248 (2012) - 2010
- [j11]Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman:
Sub-Coloring and Hypo-Coloring Interval Graphs. Discret. Math. Algorithms Appl. 2(3): 331-346 (2010)
2000 – 2009
- 2009
- [j10]Rajiv Gandhi, Julián Mestre:
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. Algorithmica 54(1): 54-71 (2009) - [c12]Rajiv Gandhi, Yoo-Ah Kim, Seungjoon Lee, Jiho Ryu, Peng-Jun Wan:
Approximation Algorithms for Data Broadcast in Wireless Networks. INFOCOM 2009: 2681-2685 - [c11]Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman:
Sub-coloring and Hypo-coloring Interval Graphs. WG 2009: 122-132 - 2008
- [j9]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved bounds for scheduling conflicting jobs with minsum criteria. ACM Trans. Algorithms 4(1): 11:1-11:20 (2008) - [j8]Rajiv Gandhi, Arunesh Mishra, Srinivasan Parthasarathy:
Minimizing broadcast latency and redundancy in ad hoc networks. IEEE/ACM Trans. Netw. 16(4): 840-851 (2008) - 2007
- [j7]Rajiv Gandhi, Srinivasan Parthasarathy:
Distributed algorithms for connected domination in wireless networks. J. Parallel Distributed Comput. 67(7): 848-862 (2007) - 2006
- [j6]Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan:
Dependent rounding and its applications to approximation algorithms. J. ACM 53(3): 324-360 (2006) - [j5]Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan:
An improved approximation algorithm for vertex cover with hard capacities. J. Comput. Syst. Sci. 72(1): 16-33 (2006) - [j4]Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang:
Approximation algorithms for channel allocation problems in broadcast networks. Networks 47(4): 225-236 (2006) - [j3]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved results for data migration and open shop scheduling. ACM Trans. Algorithms 2(1): 116-129 (2006) - [c10]Rajiv Gandhi, Julián Mestre:
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. APPROX-RANDOM 2006: 128-139 - 2004
- [j2]Rajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
Algorithms for Minimizing Response Time in Broadcast Scheduling. Algorithmica 38(4): 597-608 (2004) - [j1]Rajiv Gandhi, Samir Khuller, Aravind Srinivasan:
Approximation algorithms for partial covering problems. J. Algorithms 53(1): 55-84 (2004) - [c9]Srinivasan Parthasarathy, Rajiv Gandhi:
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks. FSTTCS 2004: 447-459 - [c8]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved Results for Data Migration and Open Shop Scheduling. ICALP 2004: 658-669 - [c7]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. WAOA 2004: 68-82 - 2003
- [c6]Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan:
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. ICALP 2003: 164-175 - [c5]Rajiv Gandhi, Srinivasan Parthasarathy, Arunesh Mishra:
Minimizing broadcast latency and redundancy in ad hoc networks. MobiHoc 2003: 222-232 - [c4]Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang:
Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. RANDOM-APPROX 2003: 47-58 - 2002
- [c3]Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan:
Dependent Rounding in Bipartite Graphs. FOCS 2002: 323-332 - [c2]Rajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
Algorithms for Minimizing Response Time in Broadcast Scheduling. IPCO 2002: 425-438 - 2001
- [c1]Rajiv Gandhi, Samir Khuller, Aravind Srinivasan:
Approximation Algorithms for Partial Covering Problems. ICALP 2001: 225-236
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
