Buffer minimization using max-coloring. - Sriram V. Pemmaraju; Rajiv Raman 001; Kasturi R. Varadarajan (SODA, 2004)

Computing Equilibrium Prices: Does Theory Meet Practice?. - Bruno Codenotti; Benton McCune; Rajiv Raman 001; Kasturi R. Varadarajan (ESA, 2005)

Approximation Algorithms for the Max-coloring Problem. - Sriram V. Pemmaraju; Rajiv Raman 001 (ICALP, 2005)

Approximating interval coloring and max-coloring in chordal graphs. - Sriram V. Pemmaraju; Sriram Penumatcha; Rajiv Raman 001 (ACM J. Exp. Algorithmics, 2005)

An experimental study of different approaches to solve the market equilibrium problem. - Bruno Codenotti; Benton McCune; Sriram V. Pemmaraju; Rajiv Raman 001; Kasturi R. Varadarajan (ACM J. Exp. Algorithmics, 2008)

Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. - José R. Correa; Nicole Megow; Rajiv Raman 001; Karol Suchan (CTW, 2009)

On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. - Khaled M. Elbassioni; Rajiv Raman 001; Saurabh Ray; René Sitters (SAGT, 2009)

On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. - Khaled M. Elbassioni; Rajiv Raman 001; Saurabh Ray; René Sitters (SODA, 2009)

On Profit-Maximizing Pricing for the Highway and Tollbooth Problems - Khaled M. Elbassioni; Rajiv Raman 001; Saurabh Ray (CoRR, 2009)

Colouring Vertices of Triangle-Free Graphs. - Konrad K. Dabrowski; Vadim V. Lozin; Rajiv Raman 001; Bernard Ries (WG, 2010)

Sub-Coloring and Hypo-Coloring Interval Graphs. - Rajiv Gandhi; Bradford Greening; Sriram V. Pemmaraju; Rajiv Raman 001 (Discret. Math. Algorithms Appl., 2010)

Max-coloring and online coloring with bandwidths on interval graphs. - Sriram V. Pemmaraju; Rajiv Raman 001; Kasturi R. Varadarajan (ACM Trans. Algorithms, 2011)

Colouring vertices of triangle-free graphs without forests. - Konrad K. Dabrowski; Vadim V. Lozin; Rajiv Raman 001; Bernard Ries (Discret. Math., 2012)

On the complexity of the highway problem. - Khaled M. Elbassioni; Rajiv Raman 001; Saurabh Ray; René Sitters (Theor. Comput. Sci., 2012)

A Separator Theorem for Intersecting Objects in the Plane. - Nabil H. Mustafa; Rajiv Raman 001 (CCCG, 2014)

A toolbox for fast and approximate solutions for large linear and semidefinite programs. - Ajay Shankar Bidyarthy; Rajiv Raman 001; Dilys Thomas (COMPUTE, 2014)

Settling the APX-Hardness Status for Geometric Set Cover. - Nabil H. Mustafa; Rajiv Raman 001; Saurabh Ray (FOCS, 2014)

An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function. - T.-H. Hubert Chan; Kevin L. Chang; Rajiv Raman 001 (Algorithmica, 2014)

QPTAS for Geometric Set-Cover Problems via Optimal Separators. - Nabil H. Mustafa; Rajiv Raman 001; Saurabh Ray (CoRR, 2014)

Assignment of trainees to software project requirements: A stable matching based approach. - Mangesh S. Gharote; Rahul Patil; Sachin Lodha; Rajiv Raman 001 (Comput. Ind. Eng., 2015)

Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces. - Nabil H. Mustafa; Rajiv Raman 001; Saurabh Ray (SIAM J. Comput., 2015)

Planar Support for Non-piercing Regions and Applications. - Rajiv Raman 001; Saurabh Ray (ESA, 2018)

Packing and Covering with Non-Piercing Regions. - Aniket Basu Roy; Sathish Govindarajan; Rajiv Raman 001; Saurabh Ray (Discret. Comput. Geom., 2018)

On the approximability of the maximum interval constrained coloring problem. - Stefan Canzar; Khaled M. Elbassioni; Amr Elmasry; Rajiv Raman 001 (Discret. Optim., 2018)

Constant factor approximation for the weighted partial degree bounded edge packing problem. - Pawan Aurora; Monalisa Jena; Rajiv Raman 001 (J. Comb. Optim., 2018)

Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. - Rajiv Raman 001; Saurabh Ray (ESA, 2020)

Constructing Planar Support for Non-Piercing Regions. - Rajiv Raman 001; Saurabh Ray (Discret. Comput. Geom., 2020)

On Geometric Priority Set Cover Problems. - Aritra Banik; Rajiv Raman 001; Saurabh Ray (ISAAC, 2021)

On the Geometric Set Multicover Problem. - Rajiv Raman 001; Saurabh Ray (Discret. Comput. Geom., 2022)

On Hypergraph Supports. - Rajiv Raman 001; Karamjeet Singh 002 (CoRR, 2023)

On the geometric priority set cover problem. - Aritra Banik; Rajiv Raman 001; Saurabh Ray (Comput. Geom., 2023)

Sweeping Arrangements of Non-Piercing Regions in the Plane. - Suryendu Dalal; Rahul Gangopadhyay; Rajiv Raman 001; Saurabh Ray (SoCG, 2024)

A Fast Algorithm for Computing a Planar Support for Non-Piercing Rectangles. - Ambar Pal; Rajiv Raman 001; Saurabh Ray; Karamjeet Singh 002 (ISAAC, 2024)

Sweeping Arrangements of Non-Piercing Curves in Plane. - Suryendu Dalal; Rahul Gangopadhyay; Rajiv Raman 001; Saurabh Ray (CoRR, 2024)

On Supports for graphs of bounded genus. - Rajiv Raman 001; Karamjeet Singh 002 (CoRR, 2025)

Supports for Outerplanar and Bounded Treewidth Graphs. - Rajiv Raman 001; Karamjeet Singh (CoRR, 2025)