default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRajiv Raman 0001
Person information
- affiliation: Indraprastha Institute of Information Technology, New Delhi, India
Other persons with the same name
- Rajiv Raman 0002 — Vision Research Foundation, Chennai, India
- Rajiv Raman 0003 — Shri Bhagwan Mahavir Vitreoretinal Services, Sankara Nethralaya, Chennai, Tamil Nadu, India
- Rajiv Raman 0004
![[0000-0001-5842-0233]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-5842-0233")
— Sankara Nethralaya Medical Research Foundation, Chennai, India - Rajiv Raman 0005 — Texas A&M University, College Station, TX, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c21]Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, Saurabh Ray:
Sweeping Arrangements of Non-Piercing Regions in the Plane. SoCG 2024: 45:1-45:15- [i5]Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, Saurabh Ray:
Sweeping Arrangements of Non-Piercing Curves in Plane. CoRR abs/2403.16474 (2024) - [i4]Ambar Pal, Rajiv Raman, Saurabh Ray, Karamjeet Singh:
A fast algorithm for computing a planar support for non-piercing rectangles. CoRR abs/2410.02449 (2024) - 2023
- [j15]Aritra Banik, Rajiv Raman, Saurabh Ray:
On the geometric priority set cover problem. Comput. Geom. 112: 101984 (2023) - [i3]Rajiv Raman, Karamjeet Singh:
On Hypergraph Supports. CoRR abs/2303.16515 (2023) - 2022
- [j14]Rajiv Raman, Saurabh Ray:
On the Geometric Set Multicover Problem. Discret. Comput. Geom. 68(2): 566-591 (2022) - 2021
- [c20]Aritra Banik, Rajiv Raman, Saurabh Ray:
On Geometric Priority Set Cover Problems. ISAAC 2021: 12:1-12:14 - 2020
- [j13]Rajiv Raman, Saurabh Ray:
Constructing Planar Support for Non-Piercing Regions. Discret. Comput. Geom. 64(3): 1098-1122 (2020) - [c19]Rajiv Raman, Saurabh Ray:
Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. ESA 2020: 78:1-78:16
2010 – 2019
- 2018
- [j12]Aniket Basu Roy, Sathish Govindarajan, Rajiv Raman, Saurabh Ray:
Packing and Covering with Non-Piercing Regions. Discret. Comput. Geom. 60(2): 471-492 (2018) - [j11]Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman:
On the approximability of the maximum interval constrained coloring problem. Discret. Optim. 27: 57-72 (2018) - [j10]Pawan Aurora, Monalisa Jena, Rajiv Raman:
Constant factor approximation for the weighted partial degree bounded edge packing problem. J. Comb. Optim. 36(4): 1243-1261 (2018) - [c18]Rajiv Raman, Saurabh Ray:
Planar Support for Non-piercing Regions and Applications. ESA 2018: 69:1-69:14 - 2016
- [c17]Pawan Aurora, Monalisa Jena, Rajiv Raman:
Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem. COCOA 2016: 187-201 - [c16]Sathish Govindarajan, Rajiv Raman, Saurabh Ray, Aniket Basu Roy:
Packing and Covering with Non-Piercing Regions. ESA 2016: 47:1-47:17 - 2015
- [j9]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: 228-237 (2015) - [j8]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): 1650-1669 (2015) - 2014
- [j7]T.-H. Hubert Chan, Kevin L. Chang, Rajiv Raman:
An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function. Algorithmica 69(3): 605-618 (2014) - [c15]Nabil H. Mustafa, Rajiv Raman:
A Separator Theorem for Intersecting Objects in the Plane. CCCG 2014 - [c14]Ajay Shankar Bidyarthy, Rajiv Raman, Dilys Thomas:
A toolbox for fast and approximate solutions for large linear and semidefinite programs. COMPUTE 2014: 8:1-8:8 - [c13]Nabil H. Mustafa, Rajiv Raman, Saurabh Ray:
Settling the APX-Hardness Status for Geometric Set Cover. FOCS 2014: 541-550 - [i2]Nabil H. Mustafa, Rajiv Raman, Saurabh Ray:
QPTAS for Geometric Set-Cover Problems via Optimal Separators. CoRR abs/1403.0835 (2014) - 2012
- [j6]Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries:
Colouring vertices of triangle-free graphs without forests. Discret. Math. 312(7): 1372-1385 (2012) - [j5]Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters:
On the complexity of the highway problem. Theor. Comput. Sci. 460: 70-77 (2012) - 2011
- [j4]Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan:
Max-coloring and online coloring with bandwidths on interval graphs. ACM Trans. Algorithms 7(3): 35:1-35:21 (2011) - 2010
- [j3]Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman:
Sub-Coloring and Hypo-Coloring Interval Graphs. Discret. Math. Algorithms Appl. 2(3): 331-346 (2010) - [c12]Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman:
On the Approximability of the Maximum Interval Constrained Coloring Problem. ISAAC (2) 2010: 168-179 - [c11]Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries:
Colouring Vertices of Triangle-Free Graphs. WG 2010: 184-195
2000 – 2009
- 2009
- [c10]José R. Correa, Nicole Megow, Rajiv Raman, Karol Suchan:
Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. CTW 2009: 347-350 - [c9]T.-H. Hubert Chan, Kevin L. Chang, Rajiv Raman:
An SDP primal-dual algorithm for approximating the Lovász-theta function. ISIT 2009: 2808-2812 - [c8]Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters:
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. SAGT 2009: 275-286 - [c7]Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters:
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. SODA 2009: 1210-1219 - [c6]Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman:
Sub-coloring and Hypo-coloring Interval Graphs. WG 2009: 122-132 - [i1]Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray:
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. CoRR abs/0901.1140 (2009) - 2008
- [j2]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: 3.3:1-3.3:21 (2008) - 2005
- [j1]Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman:
Approximating interval coloring and max-coloring in chordal graphs. ACM J. Exp. Algorithmics 10 (2005) - [c5]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: 167-179 - [c4]Bruno Codenotti, Benton McCune, Rajiv Raman, Kasturi R. Varadarajan:
Computing Equilibrium Prices: Does Theory Meet Practice?. ESA 2005: 83-94 - [c3]Sriram V. Pemmaraju, Rajiv Raman:
Approximation Algorithms for the Max-coloring Problem. ICALP 2005: 1064-1075 - 2004
- [c2]Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan:
Buffer minimization using max-coloring. SODA 2004: 562-571 - [c1]Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman:
Approximating Interval Coloring and Max-Coloring in Chordal Graphs. WEA 2004: 399-416
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
