Radio aggregation scheduling.

Rajiv Gandhi

Rajiv Gandhi Magnús M. Halldórsson Christian Konrad 0001 Guy Kortsarz Hoon Oh Radio aggregation scheduling. 143-153 2020 840 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2020.07.032 db/journals/tcs/tcs840.html#GandhiHKKO20

Rajiv Gandhi Mohammad Taghi Hajiaghayi Guy Kortsarz Manish Purohit Kanthi K. Sarpatwar On maximum leaf trees and connections to connected maximum cut problems. 31-34 2018 129 Inf. Process. Lett. https://doi.org/10.1016/j.ipl.2017.06.002 db/journals/ipl/ipl129.html#GandhiHKPS18

Amey Bhangale Rajiv Gandhi Mohammad Taghi Hajiaghayi Rohit Khandekar Guy Kortsarz Bi-Covering: Covering Edges with Two Small Subsets of Vertices. 2626-2646 2017 31 SIAM J. Discret. Math. 4 https://doi.org/10.1137/16M1082421 db/journals/siamdm/siamdm31.html#BhangaleGHKK17

Amey Bhangale Rajiv Gandhi Mohammad Taghi Hajiaghayi Rohit Khandekar Guy Kortsarz Bicovering: Covering Edges With Two Small Subsets of Vertices. 6:1-6:12 2016 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2016.6 conf/icalp/2016 db/conf/icalp/icalp2016.html#BhangaleGHKK16

Mohammad Taghi Hajiaghayi Amey Bhangale Rajiv Gandhi Rohit Khandekar Guy Kortsarz Bicovering: Covering edges with two small subsets of vertices. TR16-112 2016 TR16 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2016/112 db/journals/eccc/eccc23.html#HajiaghayiBGKK16

Rajiv Gandhi Guy Kortsarz On set expansion problems and the small set expansion conjecture. 93-101 2015 194 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2015.05.028 https://www.wikidata.org/entity/Q123002417 db/journals/dam/dam194.html#GandhiK15

Rajiv Gandhi Magnús M. Halldórsson Christian Konrad 0001 Guy Kortsarz Hoon Oh Radio Aggregation Scheduling. 169-182 2015 ALGOSENSORS https://doi.org/10.1007/978-3-319-28472-9_13 conf/algosensors/2015 db/conf/algosensors/algosensors2015.html#GandhiHKKO15 Rajiv Gandhi Guy Kortsarz On Set Expansion Problems and the Small Set Expansion Conjecture. 189-200 2014 WG https://doi.org/10.1007/978-3-319-12340-0_16 conf/wg/2014 db/conf/wg/wg2014.html#GandhiK14

James M. Davis Rajiv Gandhi Vijay H. Kothari Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine. 121-125 2013 41 Oper. Res. Lett. 2 https://doi.org/10.1016/j.orl.2012.12.001 db/journals/orl/orl41.html#DavisGK13

Rajiv Gandhi Magnús M. Halldórsson Guy Kortsarz Hadas Shachnai Corrigendum: Improved results for data migration and open shop scheduling. 34:1-34:7 2013 9 ACM Trans. Algorithms 4 https://doi.org/10.1145/2500123 db/journals/talg/talg9.html#GandhiHKS13

Rajiv Gandhi Guy Kortsarz Edge covering with budget constrains. 2013 CoRR http://arxiv.org/abs/1311.0713 abs/1311.0713 db/journals/corr/corr1311.html#GandhiK13

Rajiv Gandhi Yoo-Ah Kim Seungjoon Lee Jiho Ryu Peng-Jun Wan Approximation Algorithms for Data Broadcast in Wireless Networks. 1237-1248 2012 11 IEEE Trans. Mob. Comput. 7 https://doi.org/10.1109/TMC.2011.162 http://doi.ieeecomputersociety.org/10.1109/TMC.2011.162 db/journals/tmc/tmc11.html#GandhiKLRW12

Rajiv Gandhi Bradford Greening Sriram V. Pemmaraju Rajiv Raman 0001 Sub-Coloring and Hypo-Coloring Interval Graphs. 331-346 2010 2 Discret. Math. Algorithms Appl. 3 https://doi.org/10.1142/S1793830910000693 db/journals/dmaa/dmaa2.html#GandhiGPR10

Rajiv Gandhi Julián Mestre Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. 54-71 2009 54 Algorithmica 1 https://doi.org/10.1007/s00453-007-9118-2 db/journals/algorithmica/algorithmica54.html#GandhiM09

Rajiv Gandhi Yoo-Ah Kim Seungjoon Lee Jiho Ryu Peng-Jun Wan Approximation Algorithms for Data Broadcast in Wireless Networks. 2681-2685 2009 INFOCOM https://doi.org/10.1109/INFCOM.2009.5062211 conf/infocom/2009 db/conf/infocom/infocom2009.html#GandhiKLRW09 Rajiv Gandhi Bradford Greening Sriram V. Pemmaraju Rajiv Raman 0001 Sub-coloring and Hypo-coloring Interval Graphs. 122-132 2009 WG https://doi.org/10.1007/978-3-642-11409-0_11 conf/wg/2009 db/conf/wg/wg2009.html#GandhiGPR09

Rajiv Gandhi Magnús M. Halldórsson Guy Kortsarz Hadas Shachnai Improved bounds for scheduling conflicting jobs with minsum criteria. 2008 4 ACM Trans. Algorithms 1 https://doi.org/10.1145/1328911.1328922 db/journals/talg/talg4.html#GandhiHKS08 11:1-11:20

Rajiv Gandhi Arunesh Mishra Srinivasan Parthasarathy 0002 Minimizing broadcast latency and redundancy in ad hoc networks. 840-851 2008 16 IEEE/ACM Trans. Netw. 4 http://doi.acm.org/10.1145/1453698.1453706 db/journals/ton/ton16.html#GandhiMP08

Rajiv Gandhi Srinivasan Parthasarathy 0002 Distributed algorithms for connected domination in wireless networks. 848-862 2007 67 J. Parallel Distributed Comput. 7 https://doi.org/10.1016/j.jpdc.2007.04.003 db/journals/jpdc/jpdc67.html#GandhiP07

Rajiv Gandhi Samir Khuller Srinivasan Parthasarathy 0002 Aravind Srinivasan Dependent rounding and its applications to approximation algorithms. 324-360 2006 53 J. ACM 3 https://doi.org/10.1145/1147954.1147956 db/journals/jacm/jacm53.html#GandhiKPS06

Rajiv Gandhi Eran Halperin Samir Khuller Guy Kortsarz Aravind Srinivasan An improved approximation algorithm for vertex cover with hard capacities. 16-33 2006 72 J. Comput. Syst. Sci. 1 https://doi.org/10.1016/j.jcss.2005.06.004 db/journals/jcss/jcss72.html#GandhiHKKS06

Rajiv Gandhi Samir Khuller Aravind Srinivasan Nan Wang 0001 Approximation algorithms for channel allocation problems in broadcast networks. 225-236 2006 47 Networks 4 https://doi.org/10.1002/net.20111 db/journals/networks/networks47.html#GandhiKSW06

Rajiv Gandhi Magnús M. Halldórsson Guy Kortsarz Hadas Shachnai Improved results for data migration and open shop scheduling. 116-129 2006 2 ACM Trans. Algorithms 1 https://doi.org/10.1145/1125994.1126001 db/journals/talg/talg2.html#GandhiHKS06

Rajiv Gandhi Julián Mestre Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. 128-139 2006 conf/approx/2006 APPROX-RANDOM https://doi.org/10.1007/11830924_14 db/conf/approx/approx2006.html#GandhiM06

Rajiv Gandhi Samir Khuller Yoo Ah Kim Yung-Chun (Justin) Wan Algorithms for Minimizing Response Time in Broadcast Scheduling. 597-608 2004 38 Algorithmica 4 https://doi.org/10.1007/s00453-003-1058-x db/journals/algorithmica/algorithmica38.html#GandhiKKW04

Rajiv Gandhi Samir Khuller Aravind Srinivasan Approximation algorithms for partial covering problems. 55-84 2004 53 J. Algorithms 1 https://doi.org/10.1016/j.jalgor.2004.04.002 db/journals/jal/jal53.html#GandhiKS04

Srinivasan Parthasarathy 0002 Rajiv Gandhi Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks. 447-459 https://doi.org/10.1007/978-3-540-30538-5_37 2004 conf/fsttcs/2004 FSTTCS db/conf/fsttcs/fsttcs2004.html#ParthasarathyG04 Rajiv Gandhi Magnús M. Halldórsson Guy Kortsarz Hadas Shachnai Improved Results for Data Migration and Open Shop Scheduling. 658-669 https://doi.org/10.1007/978-3-540-27836-8_56 2004 conf/icalp/2004 ICALP db/conf/icalp/icalp2004.html#GandhiHKS04 Rajiv Gandhi Magnús M. Halldórsson Guy Kortsarz Hadas Shachnai Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. 68-82 https://doi.org/10.1007/978-3-540-31833-0_8 2004 conf/waoa/2004 WAOA db/conf/waoa/waoa2004.html#GandhiHKS04 Rajiv Gandhi Eran Halperin Samir Khuller Guy Kortsarz Aravind Srinivasan An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. 164-175 2003 conf/icalp/2003 ICALP https://doi.org/10.1007/3-540-45061-0_15 db/conf/icalp/icalp2003.html#GandhiHKKS03 Rajiv Gandhi Srinivasan Parthasarathy 0002 Arunesh Mishra Minimizing broadcast latency and redundancy in ad hoc networks. 222-232 2003 conf/mobihoc/2003 MobiHoc https://doi.org/10.1145/778415.778442 db/conf/mobihoc/mobihoc2003.html#GandhiPM03 Rajiv Gandhi Samir Khuller Aravind Srinivasan Nan Wang 0001 Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. 47-58 https://doi.org/10.1007/978-3-540-45198-3_5 2003 conf/random/2003 RANDOM-APPROX db/conf/random/random2003.html#GandhiKSW03 Rajiv Gandhi Samir Khuller Srinivasan Parthasarathy 0002 Aravind Srinivasan Dependent Rounding in Bipartite Graphs. 323-332 2002 conf/focs/2002 FOCS https://doi.org/10.1109/SFCS.2002.1181955 https://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181955 db/conf/focs/focs2002.html#GandhiKPS02 Rajiv Gandhi Samir Khuller Yoo Ah Kim Yung-Chun (Justin) Wan Algorithms for Minimizing Response Time in Broadcast Scheduling. 425-438 2002 conf/ipco/2002 IPCO https://doi.org/10.1007/3-540-47867-1_30 db/conf/ipco/ipco2002.html#GandhiKKW02 Rajiv Gandhi Samir Khuller Aravind Srinivasan Approximation Algorithms for Partial Covering Problems. 225-236 2001 conf/icalp/2001 ICALP https://doi.org/10.1007/3-540-48224-5_19 db/conf/icalp/icalp2001.html#GandhiKS01 Amey Bhangale James M. Davis Bradford Greening Mohammad HajiaghayiMohammad Taghi Hajiaghayi Magnús M. Halldórsson Eran Halperin Rohit Khandekar Samir Khuller Yoo-Ah KimYoo Ah Kim Christian Konrad 0001 Guy Kortsarz Vijay H. Kothari Seungjoon Lee Julián Mestre Arunesh Mishra Hoon Oh Srinivasan Parthasarathy 0002 Sriram V. Pemmaraju Manish Purohit Rajiv Raman 0001 Jiho Ryu Kanthi K. Sarpatwar Hadas Shachnai Aravind Srinivasan Peng-Jun Wan Yung-Chun (Justin) Wan Nan Wang 0001