| Publication | Date of Publication | Type |
|---|
Chess is hard even for a single player
Theoretical Computer Science | 2024-10-07 | Paper |
| The parameterized complexity of terminal monitoring set | 2024-07-19 | Paper |
| Chess is hard even for a single player | 2024-05-16 | Paper |
Parameterized complexity of path set packing
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Perfectly matched sets in graphs: parameterized and exact computation
Theoretical Computer Science | 2023-04-12 | Paper |
Vertex partitioning problems on graphs with bounded tree width
Discrete Applied Mathematics | 2022-08-04 | Paper |
Planar projections of graphs
Discrete Applied Mathematics | 2022-08-04 | Paper |
An FPT algorithm for matching cut and d-cut
(available as arXiv preprint) | 2022-03-22 | Paper |
Structure and colour in triangle-free graphs
The Electronic Journal of Combinatorics | 2021-06-21 | Paper |
Intersection dimension and graph invariants
Discussiones Mathematicae Graph Theory | 2020-12-08 | Paper |
Parameterized complexity of happy coloring problems
Theoretical Computer Science | 2020-08-17 | Paper |
Planar projections of graphs
Lecture Notes in Computer Science | 2020-07-21 | Paper |
| \(H\)-free coloring on graphs with bounded tree-width | 2019-10-10 | Paper |
| On structural parameterizations of the matching cut problem | 2018-03-26 | Paper |
On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}
Algorithmica | 2017-11-09 | Paper |
Dichotomy results on the hardness of \(H\)-free edge modification problems
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Parameterized lower bounds and dichotomy results for the NP-completeness of \(H\)-free edge modification problems
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Parameterized lower bound and NP-completeness of some \(H\)-free edge deletion problems
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
On the Expressive Power of Read-Once Determinants
Fundamentals of Computation Theory | 2015-09-29 | Paper |
On Polynomial Kernelization of $$\mathcal {H}$$-free Edge Deletion
Parameterized and Exact Computation | 2015-09-15 | Paper |
The chromatic discrepancy of graphs
Discrete Applied Mathematics | 2015-04-28 | Paper |
Intersection dimension and maximum degree
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Forbidden subgraph colorings and the oriented chromatic number
European Journal of Combinatorics | 2013-01-24 | Paper |
Oriented colouring of some graph products
Discussiones Mathematicae. Graph Theory | 2012-09-05 | Paper |
Bounds on edge colorings with restrictions on the union of color classes
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
Discrete Mathematics | 2011-05-16 | Paper |
Bounds on vertex colorings with restrictions on the union of color classes
Journal of Graph Theory | 2011-03-21 | Paper |
Forbidden subgraph colorings and the oriented chromatic number
Lecture Notes in Computer Science | 2009-12-11 | Paper |
