Profiles
Research Units
Publications
Sign Up
Faculty Login
X
27 Publications
11 Journals
N.R. Aravind
Associate Professor
Department of Computer Science and Engineering
aravind@cse.iith.ac.in (Work)
Follow
Publications - 27
Overview
Publications (27)
Network (1)
Publications (27)
Sort by Year (most recent)
Sort by Year (most recent)
Sort by Year (oldest first)
Sort by Most Cited
Sort by Recently Added
Sort (A-Z)
Sort (Z-A)
Conferences
Parameterized Complexity of Path Set Packing
N.R. Aravind
and
R. Saxena
2023 | Springer Science and Business Media Deutschland GmbH
Articles
Perfectly matched sets in graphs: Parameterized and exact computation
N.R. Aravind
and
R. Saxena
2023 | Elsevier B.V.
Download
PDF
Postprint
Articles
Planar projections of graphs
N.R. Aravind
and
U. Maniyar
2022 | Elsevier B.V.
Download
PDF
Postprint
Conferences
Chess Is Hard Even for a Single Player
N.R. Aravind
,
N. Misra
and
H. Mittal
2022 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Articles
Vertex partitioning problems on graphs with bounded tree width
N.R. Aravind
,
Subrahmanyam Kalyanasundaram
and
A.S. Kare
2022 | Elsevier B.V.
Articles
Structure and colour in triangle-free graphs
N.R. Aravind
,
W.C. van Batenburg
,
...
,
V. Patel
(6 authors)
2021 | Australian National University
Download
PDF
Publisher Copy
Conferences
An FPT Algorithm for Matching Cut and d-Cut
N.R. Aravind
and
R. Saxena
2021 | Springer Science and Business Media Deutschland GmbH
Articles
Parameterized complexity of happy coloring problems
A. Agrawal
,
N.R. Aravind
,
Subrahmanyam Kalyanasundaram
,
...
,
I.V. Reddy
(7 authors)
2020 | Elsevier B.V.
Conferences
Planar Projections of Graphs
N.R. Aravind
and
U. Maniyar
2020 | Springer
Articles
Intersection Dimension and Graph Invariants
N.R. Aravind
and
C.R. Subramanian
2020 | Sciendo
Download
PDF
Publisher Copy
Conferences
H-free coloring on graphs with bounded tree-width
N.R. Aravind
,
Subrahmanyam Kalyanasundaram
and
A.S. Kare
2019 | Springer Verlag
Articles
Dichotomy results on the hardness of H-free edge modification problems
N.R. Aravind
,
R.B. Sandeep
and
N. Sivadasan
2017 | Society for Industrial and Applied Mathematics Publications
Articles
On Polynomial Kernelization of H -free Edge Deletion
N.R. Aravind
,
R.B. Sandeep
and
N. Sivadasan
2017 | Springer New York LLC
Conferences
On structural parameterizations of the matching cut problem
N.R. Aravind
,
Subrahmanyam Kalyanasundaram
and
A.S. Kare
2017 | Springer Verlag
Conferences
Linear time algorithms for happy vertex coloring problems for trees
N.R. Aravind
,
Subrahmanyam Kalyanasundaram
and
A.S. Kare
2016 | Springer Verlag
Conferences
Parameterized lower bounds and dichotomy results for the NP-completeness of H-free edge modification problems
N.R. Aravind
,
R.B. Sandeep
and
N. Sivadasan
2016 | Springer Verlag
Conferences
Parameterized lower bound and np-completeness of some h-free edge deletion problems
N.R. Aravind
,
R.B. Sandeep
and
N. Sivadasan
2015 | Springer Verlag
Articles
The chromatic discrepancy of graphs
N.R. Aravind
,
Subrahmanyam Kalyanasundaram
,
...
,
N. Sivadasan
(4 authors)
2015 | Elsevier B.V.
Conferences
On the expressive power of read-once determinants
N.R. Aravind
and
P.S. Joglekar
2015 | Springer Verlag
Conferences
On polynomial kernelization of h-free edge deletion
N.R. Aravind
,
R.B. Sandeep
and
N. Sivadasan
2014 | Springer Verlag
Showing 1-20 of 27 results
prev
1
2
next
Get all the updates from N.R. Aravind
Follow