N. R. Aravind

Orcid: 0000-0002-6590-7952

According to our database1, N. R. Aravind authored at least 32 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Chess is hard even for a single player.
Theor. Comput. Sci., 2024

The Parameterized Complexity of Terminal Monitoring Set.
Proceedings of the WALCOM: Algorithms and Computation, 2024

2023
Perfectly matched sets in graphs: Parameterized and exact computation.
Theor. Comput. Sci., 2023

Line-Constrained k-Semi-Obnoxious Facility Location.
CoRR, 2023

Parameterized Complexity of Path Set Packing.
Proceedings of the WALCOM: Algorithms and Computation, 2023

2022
Planar projections of graphs.
Discret. Appl. Math., 2022

Vertex partitioning problems on graphs with bounded tree width.
Discret. Appl. Math., 2022

2021
Intersection dimension and graph invariants.
Discuss. Math. Graph Theory, 2021

Perfectly Matched Sets in Graphs: Hardness, Kernelization Lower Bound, and FPT and Exact Algorithms.
CoRR, 2021

An FPT algorithm for Matching Cut.
CoRR, 2021

Structure and Colour in Triangle-Free Graphs.
Electron. J. Comb., 2021

An FPT Algorithm for Matching Cut and d-Cut.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020
Parameterized complexity of happy coloring problems.
Theor. Comput. Sci., 2020

2019
H-Free Coloring on Graphs with Bounded Tree-Width.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018
Bipartitioning Problems on Graphs with Bounded Tree-Width.
CoRR, 2018

2017
Dichotomy Results on the Hardness of H-free Edge Modification Problems.
SIAM J. Discret. Math., 2017

Algorithms and hardness results for happy coloring problems.
CoRR, 2017

On Polynomial Kernelization of H-free Edge Deletion.
Algorithmica, 2017

On Structural Parameterizations of the Matching Cut Problem.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Linear Time Algorithms for Happy Vertex Coloring Problems for Trees.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015
On the expressive power of read-once determinants.
Electron. Colloquium Comput. Complex., 2015

The chromatic discrepancy of graphs.
Discret. Appl. Math., 2015

Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
On Polynomial Kernelization of $\mathcal{H}$-free Edge Deletion.
CoRR, 2014

On Polynomial Kernelization of <i>H</i> -free Edge Deletion.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013
Forbidden subgraph colorings and the oriented chromatic number.
Eur. J. Comb., 2013

2011
Bounds on vertex colorings with restrictions on the union of color classes.
J. Graph Theory, 2011

Oriented colouring of some graph products.
Discuss. Math. Graph Theory, 2011

Bounding χ in terms of ω and Δ for some classes of graphs.
Discret. Math., 2011

2010
Bounds on Edge Colorings with Restrictions on the Union of Color Classes.
SIAM J. Discret. Math., 2010

2009
Intersection Dimension and Maximum Degree.
Electron. Notes Discret. Math., 2009


  Loading...