Rajiv Raman

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 14

Top Topics

Greedy Heuristics

Polynomial Time Approximation

Arbitrarily Shaped

Top Venues

Discret. Comput. Geom.

J. Comb. Optim.

Publications

Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, Saurabh Ray
Sweeping Arrangements of Non-Piercing Regions in the Plane. SoCG (2024)
Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, Saurabh Ray
Sweeping Arrangements of Non-Piercing Curves in Plane. CoRR (2024)
Rajiv Raman, Karamjeet Singh
On Hypergraph Supports. CoRR (2023)
Aritra Banik, Rajiv Raman, Saurabh Ray
On the geometric priority set cover problem. Comput. Geom. 112 (2023)
Rajiv Raman, Saurabh Ray
On the Geometric Set Multicover Problem. Discret. Comput. Geom. 68 (2) (2022)
Aritra Banik, Rajiv Raman, Saurabh Ray
On Geometric Priority Set Cover Problems. ISAAC (2021)
Rajiv Raman, Saurabh Ray
Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. ESA (2020)
Rajiv Raman, Saurabh Ray
Constructing Planar Support for Non-Piercing Regions. Discret. Comput. Geom. 64 (3) (2020)
Aniket Basu Roy, Sathish Govindarajan, Rajiv Raman, Saurabh Ray
Packing and Covering with Non-Piercing Regions. Discret. Comput. Geom. 60 (2) (2018)
Pawan Aurora, Monalisa Jena, Rajiv Raman
Constant factor approximation for the weighted partial degree bounded edge packing problem. J. Comb. Optim. 36 (4) (2018)
Rajiv Raman, Saurabh Ray
Planar Support for Non-piercing Regions and Applications. ESA (2018)
Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman
On the approximability of the maximum interval constrained coloring problem. Discret. Optim. 27 (2018)
Sathish Govindarajan, Rajiv Raman, Saurabh Ray, Aniket Basu Roy
Packing and Covering with Non-Piercing Regions. ESA (2016)
Pawan Aurora, Monalisa Jena, Rajiv Raman
Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem. COCOA (2016)
Mangesh S. Gharote, Rahul Patil, Sachin Lodha, Rajiv Raman
Assignment of trainees to software project requirements: A stable matching based approach. Comput. Ind. Eng. 87 (2015)
Nabil H. Mustafa, Rajiv Raman, Saurabh Ray
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces. SIAM J. Comput. 44 (6) (2015)
T.-H. Hubert Chan, Kevin L. Chang, Rajiv Raman
An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function. Algorithmica 69 (3) (2014)
Nabil H. Mustafa, Rajiv Raman, Saurabh Ray
Settling the APX-Hardness Status for Geometric Set Cover. FOCS (2014)
Nabil H. Mustafa, Rajiv Raman
A Separator Theorem for Intersecting Objects in the Plane. CCCG (2014)
Ajay Shankar Bidyarthy, Rajiv Raman, Dilys Thomas
A toolbox for fast and approximate solutions for large linear and semidefinite programs. COMPUTE (2014)
Nabil H. Mustafa, Rajiv Raman, Saurabh Ray
QPTAS for Geometric Set-Cover Problems via Optimal Separators. CoRR (2014)
Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters
On the complexity of the highway problem. Theor. Comput. Sci. 460 (2012)
Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries
Colouring vertices of triangle-free graphs without forests. Discret. Math. 312 (7) (2012)
Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan
Max-coloring and online coloring with bandwidths on interval graphs. ACM Trans. Algorithms 7 (3) (2011)
Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman
Sub-Coloring and Hypo-Coloring Interval Graphs. Discret. Math. Algorithms Appl. 2 (3) (2010)
Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman
On the Approximability of the Maximum Interval Constrained Coloring Problem. ISAAC (2) (2010)
Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries
Colouring Vertices of Triangle-Free Graphs. WG (2010)
Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman
Sub-coloring and Hypo-coloring Interval Graphs. WG (2009)
José R. Correa, Nicole Megow, Rajiv Raman, Karol Suchan
Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. CTW (2009)
Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems CoRR (2009)
Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. SAGT (2009)
T.-H. Hubert Chan, Kevin L. Chang, Rajiv Raman
An SDP primal-dual algorithm for approximating the Lovász-theta function. ISIT (2009)
Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. SODA (2009)
Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan
An experimental study of different approaches to solve the market equilibrium problem. ACM J. Exp. Algorithmics 12 (2008)
Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan
An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem. ALENEX/ANALCO (2005)
Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman
Approximating interval coloring and max-coloring in chordal graphs. ACM J. Exp. Algorithmics 10 (2005)
Bruno Codenotti, Benton McCune, Rajiv Raman, Kasturi R. Varadarajan
Computing Equilibrium Prices: Does Theory Meet Practice?. ESA (2005)
Sriram V. Pemmaraju, Rajiv Raman
Approximation Algorithms for the Max-coloring Problem. ICALP (2005)
Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan
Buffer minimization using max-coloring. SODA (2004)
Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman
Approximating Interval Coloring and Max-Coloring in Chordal Graphs. WEA (2004)