Rajiv Raman
Rajiv Raman
Iowa, Warwick, MPI, IIIT
Verified email at iiitd.ac.in
Title
Cited by
Cited by
Year
Buffer minimization using max-coloring.
SV Pemmaraju, R Raman, KR Varadarajan
SODA 4, 562-571, 2004
1042004
Approximation algorithms for the max-coloring problem
SV Pemmaraju, R Raman
International Colloquium on Automata, Languages, and Programming, 1064-1075, 2005
632005
Colouring vertices of triangle-free graphs without forests
KK Dabrowski, V Lozin, R Raman, B Ries
Discrete Mathematics 312 (7), 1372-1385, 2012
462012
On profit-maximizing pricing for the highway and tollbooth problems
K Elbassioni, R Raman, S Ray, R Sitters
International Symposium on Algorithmic Game Theory, 275-286, 2009
332009
Approximating interval coloring and max-coloring in chordal graphs
SV Pemmaraju, S Penumatcha, R Raman
Journal of Experimental Algorithmics (JEA) 10, 2.8-es, 2005
272005
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
K Elbassioni, R Raman, S Ray, R Sitters
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
252009
Quasi-polynomial time approximation scheme for weighted geometric set cover on pseudodisks and halfspaces
NH Mustafa, R Raman, S Ray
SIAM Journal on Computing 44 (6), 1650-1669, 2015
212015
Settling the APX-hardness status for geometric set cover
NH Mustafa, R Raman, S Ray
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 541-550, 2014
212014
An experimental study of different approaches to solve the market equilibrium problem
B Codenotti, B Mccune, S Pemmaraju, R Raman, K Varadarajan
Journal of Experimental Algorithmics (JEA) 12, 1-21, 2008
192008
Assignment of trainees to software project requirements: A stable matching based approach
M Gharote, R Patil, S Lodha, R Raman
Computers & Industrial Engineering 87, 228-237, 2015
182015
An SDP primal-dual algorithm for approximating the Lovász-theta function
THH Chan, KL Chang, R Raman
2009 IEEE International Symposium on Information Theory, 2808-2812, 2009
172009
Packing and covering with non-piercing regions
S Govindarajan, R Raman, S Ray, A Basu Roy
24th Annual European Symposium on Algorithms (ESA 2016), 2016
162016
QPTAS for geometric set-cover problems via optimal separators
NH Mustafa, R Raman, S Ray
arXiv preprint arXiv:1403.0835, 2014
152014
Max-coloring and online coloring with bandwidths on interval graphs
SV Pemmaraju, R Raman, K Varadarajan
ACM Transactions on Algorithms (TALG) 7 (3), 1-21, 2011
152011
Packing and covering with non-piercing regions
AB Roy, S Govindarajan, R Raman, S Ray
Discrete & Computational Geometry 60 (2), 471-492, 2018
112018
Colouring vertices of triangle-free graphs
K Dabrowski, V Lozin, R Raman, B Ries
International Workshop on Graph-Theoretic Concepts in Computer Science, 184-195, 2010
112010
Opinion of New Zealand physicians on management of acute ischaemic stroke: results of a national survey
SL Ardern‐Holmes, R Raman, NE Anderson, AJ Charleston, P Bennett
Australian and New Zealand journal of medicine 29 (3), 324-330, 1999
91999
Planar support for non-piercing regions and applications
R Raman, S Ray
26th Annual European Symposium on Algorithms (ESA 2018), 2018
72018
Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs.
JR Correa, N Megow, R Raman, K Suchan
CTW, 347-350, 2009
72009
Approximating interval coloring and max-coloring in chordal graphs
SV Pemmaraju, S Penumatcha, R Raman
International Workshop on Experimental and Efficient Algorithms, 399-416, 2004
72004
The system can't perform the operation now. Try again later.
Articles 1–20