N. R. Aravind

From MaRDI portal
Person:536212

Available identifiers

zbMath Open aravind.n-rMaRDI QIDQ536212

List of research outcomes





PublicationDate of PublicationType
Chess is hard even for a single player2024-10-07Paper
The parameterized complexity of terminal monitoring set2024-07-19Paper
Chess is hard even for a single player2024-05-16Paper
Parameterized complexity of path set packing2023-11-24Paper
Perfectly matched sets in graphs: parameterized and exact computation2023-04-12Paper
Planar projections of graphs2022-08-04Paper
Vertex partitioning problems on graphs with bounded tree width2022-08-04Paper
An FPT algorithm for matching cut and d-cut2022-03-22Paper
Structure and colour in triangle-free graphs2021-06-21Paper
Intersection dimension and graph invariants2020-12-08Paper
Parameterized complexity of happy coloring problems2020-08-17Paper
Planar projections of graphs2020-07-21Paper
\(H\)-free coloring on graphs with bounded tree-width2019-10-10Paper
On structural parameterizations of the matching cut problem2018-03-26Paper
On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}2017-11-09Paper
Dichotomy Results on the Hardness of $H$-free Edge Modification Problems2017-05-24Paper
Linear Time Algorithms for Happy Vertex Coloring Problems for Trees2016-09-29Paper
Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems2016-05-03Paper
Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems2016-02-05Paper
On the Expressive Power of Read-Once Determinants2015-09-29Paper
On Polynomial Kernelization of $$\mathcal {H}$$-free Edge Deletion2015-09-15Paper
The chromatic discrepancy of graphs2015-04-28Paper
Intersection dimension and maximum degree2013-07-19Paper
Forbidden subgraph colorings and the oriented chromatic number2013-01-24Paper
Oriented colouring of some graph products2012-09-05Paper
Bounds on Edge Colorings with Restrictions on the Union of Color Classes2011-06-17Paper
Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs2011-05-16Paper
Bounds on vertex colorings with restrictions on the union of color classes2011-03-21Paper
Forbidden Subgraph Colorings and the Oriented Chromatic Number2009-12-11Paper

Research outcomes over time

This page was built for person: N. R. Aravind