Rajiv Gandhi

Mohammad Taghi Hajiaghayi

Manish Purohit

Kanthi K. Sarpatwar

Inf. Process. Lett., 2018

2017

Bi-Covering: Covering Edges with Two Small Subsets of Vertices.

[BibT_eX]

[DOI]

Amey Bhangale

Mohammad Taghi Hajiaghayi

Rohit Khandekar

SIAM J. Discret. Math., 2017

2016

Bicovering: Covering Edges With Two Small Subsets of Vertices.

[BibT_eX]

[DOI]

Amey Bhangale

Mohammad Taghi Hajiaghayi

Rohit Khandekar

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Radio Aggregation Scheduling.

[BibT_eX]

[DOI]

Christian Konrad

Hoon Oh

Proceedings of the Algorithms for Sensor Systems, 2015

2014

On Set Expansion Problems and the Small Set Expansion Conjecture.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013

Corrigendum: Improved results for data migration and open shop scheduling.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2013

Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine.

[BibT_eX]

[DOI]

James M. Davis

Vijay H. Kothari

Oper. Res. Lett., 2013

Edge covering with budget constrains.

[BibT_eX]

[DOI]

CoRR, 2013

2009

Sub-coloring and Hypo-coloring Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Approximation Algorithms for Data Broadcast in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008

Improved bounds for scheduling conflicting jobs with minsum criteria.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

2007

Distributed algorithms for connected domination in wireless networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2007

2006

Dependent rounding and its applications to approximation algorithms.

[BibT_eX]

[DOI]

Aravind Srinivasan

J. ACM, 2006

Combinatorial Algorithms for Data Migration to Minimize Average Completion Time.

[BibT_eX]

[DOI]

Julián Mestre

Proceedings of the Approximation, 2006

2004

Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Improved Results for Data Migration and Open Shop Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003

Approximation Algorithms for Channel Allocation Problems in Broadcast Networks.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2003

Minimizing broadcast latency and redundancy in ad hoc networks.

[BibT_eX]

[DOI]

Arunesh Mishra

Proceedings of the 4th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2003

An Improved Approximation Algorithm for Vertex Cover with Hard Capacities.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Algorithms for Minimizing Response Time in Broadcast Scheduling.

[BibT_eX]

[DOI]

Yoo Ah Kim

Yung-Chun (Justin) Wan

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

Dependent Rounding in Bipartite Graphs.

[BibT_eX]

[DOI]

Aravind Srinivasan

Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002

2001

Approximation Algorithms for Partial Covering Problems.

[BibT_eX]

[DOI]