Buffer minimization using max-coloring. SV Pemmaraju, R Raman, KR Varadarajan SODA 4, 562-571, 2004 | 112 | 2004 |

Approximation algorithms for the max-coloring problem SV Pemmaraju, R Raman Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005 | 71 | 2005 |

Colouring vertices of triangle-free graphs without forests KK Dabrowski, V Lozin, R Raman, B Ries Discrete Mathematics 312 (7), 1372-1385, 2012 | 49 | 2012 |

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 | 37 | 2014 |

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 | 35 | 2015 |

On profit-maximizing pricing for the highway and tollbooth problems K Elbassioni, R Raman, S Ray, R Sitters Algorithmic Game Theory: Second International Symposium, SAGT 2009, Paphos …, 2009 | 34 | 2009 |

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 | 30 | 2005 |

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 | 26 | 2009 |

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 | 22 | 2009 |

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 | 21 | 2016 |

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 | 20 | 2015 |

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 | 20 | 2008 |

Packing and covering with non-piercing regions A Basu Roy, S Govindarajan, R Raman, S Ray Discrete & Computational Geometry 60, 471-492, 2018 | 19 | 2018 |

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 | 16 | 2011 |

QPTAS for geometric set-cover problems via optimal separators NH Mustafa, R Raman, S Ray arXiv preprint arXiv:1403.0835, 2014 | 15 | 2014 |

Planar support for non-piercing regions and applications R Raman, S Ray 26th Annual European Symposium on Algorithms (ESA 2018), 2018 | 12 | 2018 |

Colouring vertices of triangle-free graphs K Dabrowski, V Lozin, R Raman, B Ries Graph Theoretic Concepts in Computer Science: 36th International Workshop …, 2010 | 12 | 2010 |

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 | 8 | 1999 |

Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. JR Correa, N Megow, R Raman, K Suchan CTW, 347-350, 2009 | 7 | 2009 |

Computing equilibrium prices: Does theory meet practice? B Codenotti, B McCune, R Raman, K Varadarajan Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca …, 2005 | 7 | 2005 |