default search action
N. R. Aravind
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]N. R. Aravind, Neeldhara Misra
, Harshil Mittal:
Chess is hard even for a single player. Theor. Comput. Sci. 1015: 114726 (2024) - [c13]N. R. Aravind, Roopam Saxena:
The Parameterized Complexity of Terminal Monitoring Set. WALCOM 2024: 76-90 - [i15]N. R. Aravind, Roopam Saxena:
The Parameterized Complexity of Terminal Monitoring Set. CoRR abs/2406.01730 (2024) - 2023
- [j15]N. R. Aravind, Roopam Saxena:
Perfectly matched sets in graphs: Parameterized and exact computation. Theor. Comput. Sci. 954: 113797 (2023) - [c12]N. R. Aravind, Roopam Saxena:
Parameterized Complexity of Path Set Packing. WALCOM 2023: 291-302 - [i14]Vishwanath R. Singireddy, Manjanna Basappa, N. R. Aravind:
Line-Constrained k-Semi-Obnoxious Facility Location. CoRR abs/2307.03488 (2023) - 2022
- [j14]N. R. Aravind
Planar projections of graphs. Discret. Appl. Math. 319: 216-222 (2022) - [j13]N. R. Aravind
Vertex partitioning problems on graphs with bounded tree width. Discret. Appl. Math. 319: 254-270 (2022) - [c11]N. R. Aravind, Neeldhara Misra, Harshil Mittal:
Chess Is Hard Even for a Single Player. FUN 2022: 5:1-5:20 - [i13]N. R. Aravind, Neeldhara Misra, Harshil Mittal:
Chess is hard even for a single player. CoRR abs/2203.14864 (2022) - [i12]N. R. Aravind, Roopam Saxena:
Parameterized Complexity of Path Set Packing. CoRR abs/2209.08757 (2022) - 2021
- [j12]N. R. Aravind, Stijn Cambie
Structure and Colour in Triangle-Free Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j11]N. R. Aravind, C. R. Subramanian:
Intersection dimension and graph invariants. Discuss. Math. Graph Theory 41(1): 153-166 (2021) - [c10]N. R. Aravind, Roopam Saxena:
An FPT Algorithm for Matching Cut and d-Cut. IWOCA 2021: 531-543 - [i11]N. R. Aravind, Roopam Saxena:
An FPT algorithm for Matching Cut. CoRR abs/2101.06998 (2021) - [i10]N. R. Aravind, Roopam Saxena:
Perfectly Matched Sets in Graphs: Hardness, Kernelization Lower Bound, and FPT and Exact Algorithms. CoRR abs/2107.08584 (2021) - 2020
- [j10]Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram
Parameterized complexity of happy coloring problems. Theor. Comput. Sci. 835: 58-81 (2020) - [c9]N. R. Aravind
Planar Projections of Graphs. CALDAM 2020: 453-462 - [i9]N. R. Aravind, Udit Maniyar:
Planar projections of graphs. CoRR abs/2010.01286 (2020)
2010 – 2019
- 2019
- [c8]N. R. Aravind, Subrahmanyam Kalyanasundaram
H-Free Coloring on Graphs with Bounded Tree-Width. CALDAM 2019: 231-244 - [i8]N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg
Structure and colour in triangle-free graphs. CoRR abs/1912.13328 (2019) - 2018
- [i7]N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare:
Bipartitioning Problems on Graphs with Bounded Tree-Width. CoRR abs/1804.04016 (2018) - 2017
- [j9]N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
On Polynomial Kernelization of H-free Edge Deletion. Algorithmica 79(3): 654-666 (2017) - [j8]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) - [c7]N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
On Structural Parameterizations of the Matching Cut Problem. COCOA (2) 2017: 475-482 - [i6]N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri:
Algorithms and hardness results for happy coloring problems. CoRR abs/1705.08282 (2017) - 2016
- [c6]N. R. Aravind, Subrahmanyam Kalyanasundaram
Linear Time Algorithms for Happy Vertex Coloring Problems for Trees. IWOCA 2016: 281-292 - [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 - 2015
- [j7]N. R. Aravind, Subrahmanyam Kalyanasundaram
The chromatic discrepancy of graphs. Discret. Appl. Math. 184: 40-49 (2015) - [c4]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 - [c3]N. R. Aravind, Pushkar S. Joglekar:
On the Expressive Power of Read-Once Determinants. FCT 2015: 95-105 - [i5]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) - [i4]N. R. Aravind, Pushkar S. Joglekar:
On the expressive power of read-once determinants. CoRR abs/1508.06511 (2015) - [i3]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) - [i2]Pushkar S. Joglekar, N. R. Aravind:
On the expressive power of read-once determinants. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c2]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) - 2013
- [j6]N. R. Aravind, C. R. Subramanian:
Forbidden subgraph colorings and the oriented chromatic number. Eur. J. Comb. 34(3): 620-631 (2013) - 2011
- [j5]N. R. Aravind, T. Karthick, C. R. Subramanian:
Bounding χ in terms of ω and Δ for some classes of graphs. Discret. Math. 311(12): 911-920 (2011) - [j4]N. R. Aravind, N. Narayanan, C. R. Subramanian:
Oriented colouring of some graph products. Discuss. Math. Graph Theory 31(4): 675-686 (2011) - [j3]N. R. Aravind, C. R. Subramanian:
Bounds on vertex colorings with restrictions on the union of color classes. J. Graph Theory 66(3): 213-234 (2011) - 2010
- [j2]N. R. Aravind, C. R. Subramanian:
Bounds on Edge Colorings with Restrictions on the Union of Color Classes. SIAM J. Discret. Math. 24(3): 841-852 (2010)
2000 – 2009
- 2009
- [j1]N. R. Aravind, C. R. Subramanian:
Intersection Dimension and Maximum Degree. Electron. Notes Discret. Math. 35: 353-358 (2009) - [c1]N. R. Aravind, C. R. Subramanian:
Forbidden Subgraph Colorings and the Oriented Chromatic Number. IWOCA 2009: 60-71
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-09-10 01:17 CEST 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: