Rajiv Gandhi - Citegraph

Author Info

Name	Affiliation	Papers
RAJIV GANDHI	Department of Computer Science, Rutgers University, Camden, New Jersey 08102	25
Collaborators	Citations	PageRank
29	445	24.52
Referers	Referees	References
851	459	385

Search Limit

100851

Publications (25 rows)

Collaborators (29 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Radio aggregation scheduling.	0	0.34	2020
On maximum leaf trees and connections to connected maximum cut problems.	0	0.34	2018
Bicovering: Covering Edges With Two Small Subsets of Vertices.	1	0.36	2017
Improved approximation algorithm for the Dense-3-Subhypergraph Problem.	0	0.34	2017
Bicovering: Covering edges with two small subsets of vertices.	0	0.34	2016
Radio Aggregation Scheduling.	1	0.35	2015
On Set Expansion Problems and the Small Set Expansion Conjecture.	0	0.34	2014
Edge covering with budget constrains.	0	0.34	2013
Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine.	0	0.34	2013
Corrigendum: Improved results for data migration and open shop scheduling	0	0.34	2013
Approximation Algorithms for Data Broadcast in Wireless Networks	19	0.65	2012
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time	11	0.63	2009
Sub-coloring and Hypo-coloring Interval Graphs	0	0.34	2009
Improved bounds for scheduling conflicting jobs with minsum criteria	11	0.69	2008
Distributed algorithms for connected domination in wireless networks	17	0.98	2007
Improved results for data migration and open shop scheduling	16	0.75	2006
Dependent rounding and its applications to approximation algorithms	98	3.71	2006
Approximation algorithms for channel allocation problems in broadcast networks	0	0.34	2006
Distributed algorithms for coloring and domination in wireless ad hoc networks	28	1.53	2004
Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria	11	0.56	2004
Minimizing broadcast latency and redundancy in ad hoc networks	102	4.22	2003
An improved approximation algorithm for vertex cover with hard capacities	32	1.47	2003
Algorithms for Minimizing Response Time in Broadcast Scheduling	0	0.34	2002
Dependent rounding in bipartite graphs	40	2.29	2002
Approximation Algorithms for Partial Covering Problems	58	2.62	2001