dblp.uni-trier.dewww.uni-trier.de

Rajiv Gandhi

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
19EERajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai: Improved bounds for scheduling conflicting jobs with minsum criteria. ACM Transactions on Algorithms 4(1): (2008)
18EERajiv Gandhi, Arunesh Mishra, Srinivasan Parthasarathy: Minimizing broadcast latency and redundancy in ad hoc networks. IEEE/ACM Trans. Netw. 16(4): 840-851 (2008)
2007
17EERajiv Gandhi, Srinivasan Parthasarathy: Distributed algorithms for connected domination in wireless networks. J. Parallel Distrib. Comput. 67(7): 848-862 (2007)
2006
16EERajiv Gandhi, Julián Mestre: Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. APPROX-RANDOM 2006: 128-139
15EERajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai: Improved results for data migration and open shop scheduling. ACM Transactions on Algorithms 2(1): 116-129 (2006)
14EERajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan: Dependent rounding and its applications to approximation algorithms. J. ACM 53(3): 324-360 (2006)
13EERajiv 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)
12EERajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang: Approximation algorithms for channel allocation problems in broadcast networks. Networks 47(4): 225-236 (2006)
2004
11EESrinivasan Parthasarathy, Rajiv Gandhi: Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks. FSTTCS 2004: 447-459
10EERajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai: Improved Results for Data Migration and Open Shop Scheduling. ICALP 2004: 658-669
9EERajiv 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
8EERajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan: Algorithms for Minimizing Response Time in Broadcast Scheduling. Algorithmica 38(4): 597-608 (2004)
7EERajiv Gandhi, Samir Khuller, Aravind Srinivasan: Approximation algorithms for partial covering problems. J. Algorithms 53(1): 55-84 (2004)
2003
6EERajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan: An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. ICALP 2003: 164-175
5EERajiv Gandhi, Srinivasan Parthasarathy, Arunesh Mishra: Minimizing broadcast latency and redundancy in ad hoc networks. MobiHoc 2003: 222-232
4EERajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang: Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. RANDOM-APPROX 2003: 47-58
2002
3EERajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan: Dependent Rounding in Bipartite Graphs. FOCS 2002: 323-332
2EERajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan: Algorithms for Minimizing Response Time in Broadcast Scheduling. IPCO 2002: 425-438
2001
1EERajiv Gandhi, Samir Khuller, Aravind Srinivasan: Approximation Algorithms for Partial Covering Problems. ICALP 2001: 225-236

Coauthor Index

1Magnús M. Halldórsson [9] [10] [15] [19]
2Eran Halperin [6] [13]
3Samir Khuller [1] [2] [3] [4] [6] [7] [8] [12] [13] [14]
4Yoo-Ah Kim (Yoo Ah Kim) [2] [8]
5Guy Kortsarz [6] [9] [10] [13] [15] [19]
6Julián Mestre [16]
7Arunesh Mishra [5] [18]
8Srinivasan Parthasarathy [3] [5] [11] [14] [17] [18]
9Hadas Shachnai [9] [10] [15] [19]
10Aravind Srinivasan [1] [3] [4] [6] [7] [12] [13] [14]
11Yung-Chun (Justin) Wan [2] [8]
12Nan Wang [4] [12]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)