default search action
R. B. Sandeep
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j9]Dhanyamol Antony
, Sagartanu Pal, R. B. Sandeep:
Algorithms for subgraph complementation to some classes of graphs. Inf. Process. Lett. 188: 106530 (2025) - 2024
- [c13]Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni:
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity. CALDAM 2024: 29-43 - [c12]Dhanyamol Antony, Yixin Cao, Sagartanu Pal, R. B. Sandeep:
Switching Classes: Characterization and Computation. MFCS 2024: 11:1-11:15 - [i15]Dhanyamol Antony, Yixin Cao, Sagartanu Pal, R. B. Sandeep:
Switching Classes: Characterization and Computation. CoRR abs/2403.04263 (2024) - [i14]Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni:
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. CoRR abs/2403.09122 (2024) - [i13]Florent Foucaud, Clara Marcille, R. B. Sandeep, Sagnik Sen, S. Taruni:
Algorithms and complexity for monitoring edge-geodetic sets in graphs. CoRR abs/2409.19067 (2024) - [i12]Anand Shripad Hegde, R. B. Sandeep, P. Shashank:
Erdős-Gyárfás conjecture on graphs without long induced paths. CoRR abs/2410.22842 (2024) - 2023
- [c11]Dipayan Chakraborty
Contracting Edges to Destroy a Pattern: A Complexity Study. FCT 2023: 118-131 - [i11]Dipayan Chakraborty, R. B. Sandeep:
Contracting edges to destroy a pattern: A complexity study. CoRR abs/2302.13605 (2023) - [i10]Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep:
Algorithms for subgraph complementation to some classes of graphs. CoRR abs/2303.15873 (2023) - 2022
- [j8]Yixin Cao
A Polynomial Kernel for Diamond-Free Editing. Algorithmica 84(1): 197-215 (2022) - [j7]Dhanyamol Antony
On Subgraph Complementation to H-free Graphs. Algorithmica 84(10): 2842-2870 (2022) - [j6]Dániel Marx
Incompressibility of H-free edge modification problems: Towards a dichotomy. J. Comput. Syst. Sci. 125: 25-58 (2022) - [c10]Dhanyamol Antony
Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees. LATIN 2022: 3-19 - [i9]Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini:
Cutting a tree with Subgraph Complementation is hard, except for some small trees. CoRR abs/2202.13620 (2022) - 2021
- [c9]Dhanyamol Antony
On Subgraph Complementation to H-free Graphs. WG 2021: 118-129 - [i8]Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini:
On subgraph complementation to H-free graphs. CoRR abs/2103.02936 (2021) - 2020
- [j5]Yixin Cao, R. B. Sandeep:
Minimum fill-in: Inapproximability and almost tight lower bounds. Inf. Comput. 271: 104514 (2020) - [c8]Dániel Marx, R. B. Sandeep:
Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy. ESA 2020: 72:1-72:25 - [i7]Dániel Marx, R. B. Sandeep:
Incompressibility of H-free edge modification problems: Towards a dichotomy. CoRR abs/2004.11761 (2020)
2010 – 2019
- 2018
- [c7]Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye:
A Polynomial Kernel for Diamond-Free Editing. ESA 2018: 10:1-10:13 - [i6]Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye
A Polynomial Kernel for Diamond-Free Editing. CoRR abs/1803.03358 (2018) - 2017
- [j4]N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
On Polynomial Kernelization of H-free Edge Deletion. Algorithmica 79(3): 654-666 (2017) - [j3]N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
Dichotomy Results on the Hardness of H-free Edge Modification Problems. SIAM J. Discret. Math. 31(1): 542-561 (2017) - [c6]Yixin Cao, R. B. Sandeep:
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds. SODA 2017: 875-880 - 2016
- [c5]N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems. LATIN 2016: 82-95 - [c4]Pål Grønås Drange, Markus S. Dregi, R. B. Sandeep:
Compressing Bounded Degree Graphs. LATIN 2016: 362-375 - [i5]Yixin Cao, R. B. Sandeep:
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds. CoRR abs/1606.08141 (2016) - 2015
- [j2]N. R. Aravind, Subrahmanyam Kalyanasundaram
The chromatic discrepancy of graphs. Discret. Appl. Math. 184: 40-49 (2015) - [c3]N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems. COCOA 2015: 424-438 - [c2]R. B. Sandeep, Naveen Sivadasan:
Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion. IPEC 2015: 365-376 - [i4]N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
Parameterized lower bound and NP-completeness of some H-free Edge Deletion problems. CoRR abs/1507.06341 (2015) - [i3]R. B. Sandeep, Naveen Sivadasan:
Parameterized lower bound and improved kernel for Diamond-free Edge Deletion. CoRR abs/1507.08792 (2015) - [i2]N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of $H$-free Edge Modification Problems. CoRR abs/1509.08807 (2015) - 2014
- [c1]N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
On Polynomial Kernelization of H -free Edge Deletion. IPEC 2014: 28-38 - [i1]N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
On Polynomial Kernelization of $\mathcal{H}$-free Edge Deletion. CoRR abs/1407.7156 (2014) - 2011
- [j1]R. B. Sandeep:
Perfectly colorable graphs. Inf. Process. Lett. 111(19): 960-961 (2011)
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-12-01 00:16 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: