Year |
Citation |
Score |
2020 |
Gandhi R, Halldórsson MM, Konrad C, Kortsarz G, Oh H. Radio aggregation scheduling Theoretical Computer Science. DOI: 10.1016/J.Tcs.2020.07.032 |
0.529 |
|
2018 |
Gandhi R, Hajiaghayi MT, Kortsarz G, Purohit M, Sarpatwar KK. On maximum leaf trees and connections to connected maximum cut problems Information Processing Letters. 129: 31-34. DOI: 10.1016/J.Ipl.2017.06.002 |
0.488 |
|
2017 |
Bhangale A, Gandhi R, Hajiaghayi MT, Khandekar R, Kortsarz G. Bi-Covering: Covering Edges with Two Small Subsets of Vertices Siam Journal On Discrete Mathematics. 31: 2626-2646. DOI: 10.1137/16M1082421 |
0.492 |
|
2014 |
Gandhi R, Kortsarz G. On set expansion problems and the small set expansion conjecture Discrete Applied Mathematics. DOI: 10.1016/J.Dam.2015.05.028 |
0.547 |
|
2013 |
Gandhi R, Halldórsson MM, Kortsarz G, Shachnai H. Corrigendum: Improved results for data migration and open shop scheduling Acm Transactions On Algorithms. 9: 34. DOI: 10.1145/2500123 |
0.485 |
|
2013 |
Davis JM, Gandhi R, Kothari VH. Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine Operations Research Letters. 41: 121-125. DOI: 10.1016/J.Orl.2012.12.001 |
0.501 |
|
2012 |
Gandhi R, Kim Y, Lee S, Ryu J, Wan P. Approximation Algorithms for Data Broadcast in Wireless Networks Ieee Transactions On Mobile Computing. 11: 1237-1248. DOI: 10.1109/Tmc.2011.162 |
0.664 |
|
2010 |
Gandhi R, Greening B, Pemmaraju SV, Raman R. Sub-Coloring And Hypo-Coloring Interval Graphs Discrete Mathematics, Algorithms and Applications. 2: 331-345. DOI: 10.1142/S1793830910000693 |
0.48 |
|
2009 |
Gandhi R, Mestre J. Combinatorial Algorithms for Data Migration to Minimize Average Completion Time Algorithmica. 54: 54-71. DOI: 10.1007/S00453-007-9118-2 |
0.71 |
|
2008 |
Gandhi R, Halldórsson MM, Kortsarz G, Shachnai H. Improved bounds for scheduling conflicting jobs with minsum criteria Acm Transactions On Algorithms. 4: 11. DOI: 10.1145/1328911.1328922 |
0.496 |
|
2008 |
Gandhi R, Mishra A, Parthasarathy S. Minimizing broadcast latency and redundancy in ad hoc networks Ieee Acm Transactions On Networking. 16: 840-851. DOI: 10.1109/Tnet.2007.905588 |
0.431 |
|
2007 |
Gandhi R, Parthasarathy S. Distributed algorithms for connected domination in wireless networks Journal of Parallel and Distributed Computing. 67: 848-862. DOI: 10.1016/J.Jpdc.2007.04.003 |
0.488 |
|
2006 |
Gandhi R, Khuller S, Parthasarathy S, Srinivasan A. Dependent rounding and its applications to approximation algorithms Journal of the Acm. 53: 324-360. DOI: 10.1145/1147954.1147956 |
0.703 |
|
2006 |
Gandhi R, Halldórsson MM, Kortsarz G, Shachnai H. Improved results for data migration and open shop scheduling Acm Transactions On Algorithms. 2: 116-129. DOI: 10.1145/1125994.1126001 |
0.619 |
|
2006 |
Gandhi R, Halperin E, Khuller S, Kortsarz G, Srinivasan A. An improved approximation algorithm for vertex cover with hard capacities Journal of Computer and System Sciences. 72: 16-33. DOI: 10.1016/J.Jcss.2005.06.004 |
0.718 |
|
2006 |
Gandhi R, Khuller S, Srinivasan A, Wang N. Approximation algorithms for channel allocation problems in broadcast networks Networks. 47: 225-236. DOI: 10.1002/Net.V47:4 |
0.648 |
|
2004 |
Gandhi R, Khuller S, Srinivasan A. Approximation algorithms for partial covering problems Journal of Algorithms. 53: 55-84. DOI: 10.1016/J.Jalgor.2004.04.002 |
0.642 |
|
2004 |
Gandhi R, Khuller S, Kim Y, Wan Y(. Algorithms for Minimizing Response Time in Broadcast Scheduling Algorithmica. 38: 597-608. DOI: 10.1007/S00453-003-1058-X |
0.686 |
|
Show low-probability matches. |