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