| Publication | Date of Publication | Type |
|---|
| On the parameterized complexity of odd coloring | 2025-06-20 | Paper |
Dynamic coloring on restricted graph classes
Theoretical Computer Science | 2025-05-12 | Paper |
On locally identifying coloring of Cartesian product and tensor product of graphs
Discrete Applied Mathematics | 2024-09-26 | Paper |
Conflict-free coloring: graphs of bounded clique-width and intersection graphs
Algorithmica | 2024-08-02 | Paper |
On structural parameterizations of load coloring
Discrete Applied Mathematics | 2024-01-24 | Paper |
| Star Coloring of Tensor Product of Two Graphs | 2023-10-07 | Paper |
Dynamic coloring on restricted graph classes
Lecture Notes in Computer Science | 2023-10-04 | Paper |
On structural parameterizations of star coloring
Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
On locally identifying coloring of graphs
Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
| On Color Critical Graphs of Star Coloring | 2023-05-29 | Paper |
| On Locally Identifying Coloring of Cartesian Product and Tensor Product of Graphs | 2023-05-27 | Paper |
On structural parameterizations of load coloring
(available as arXiv preprint) | 2022-03-24 | Paper |
Conflict-free coloring: graphs of bounded clique width and intersection graphs
(available as arXiv preprint) | 2022-03-22 | Paper |
Parameterized complexity of happy coloring problems
Theoretical Computer Science | 2020-08-17 | Paper |
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three
Theoretical Computer Science | 2020-04-08 | Paper |
| Parameterized algorithms for Graph Burning problem | 2020-02-25 | Paper |
On structural parameterizations of firefighting
Theoretical Computer Science | 2019-06-06 | Paper |
Parameterized algorithms for conflict-free colorings of graphs
Theoretical Computer Science | 2018-09-24 | Paper |
On the parallel parameterized complexity of the graph isomorphism problem
(available as arXiv preprint) | 2018-06-15 | Paper |
| On structural parameterizations of happy coloring, empire coloring and boxicity | 2018-06-15 | Paper |
The parameterized complexity of happy colorings
(available as arXiv preprint) | 2018-06-15 | Paper |
On structural parameterizations of firefighting
Lecture Notes in Computer Science | 2018-06-05 | Paper |
On structural parameterizations of graph motif and chromatic number
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Logspace and FPT algorithms for graph isomorphism for subclasses of bounded tree-width graphs
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
