| Publication | Date of Publication | Type |
|---|
| Variants of the Gyárfás-Sumner conjecture: oriented trees and rainbow paths | 2024-11-24 | Paper |
| Maximal induced matchings in \(K_4\)-free and \(K_5\)-free graphs | 2024-11-06 | Paper |
| Gallai's Path Decomposition for 2-degenerate Graphs | 2024-04-18 | Paper |
| Weakening total coloring conjecture and Hadwiger's conjecture on total graphs | 2024-02-19 | Paper |
| Upper bounds on the acyclic chromatic index of degenerate graphs | 2024-02-19 | Paper |
| Acyclic chromatic index of chordless graphs | 2023-05-31 | Paper |
| The linear arboricity conjecture for 3-degenerate graphs | 2022-12-21 | Paper |
| Variants of the Gy\`arf\`as-Sumner Conjecture: Oriented Trees and Rainbow Paths | 2021-11-25 | Paper |
| Ramsey numbers for line graphs | 2020-07-21 | Paper |
| The linear arboricity conjecture for graphs of low degeneracy | 2020-07-12 | Paper |
| On induced colourful paths in triangle-free graphs | 2019-02-20 | Paper |
| Separation dimension and sparsity | 2018-10-31 | Paper |
| On the kernelization complexity of string problems | 2018-05-17 | Paper |
| Parameterized algorithms for survivable network design with uniform demands | 2018-03-15 | Paper |
| On induced colourful paths in triangle-free graphs | 2018-01-18 | Paper |
| Connecting Vertices by Independent Trees | 2017-04-25 | Paper |
| Partially Polynomial Kernels for Set Cover and Test Cover | 2017-02-21 | Paper |
| Maximal induced matchings in triangle-free graphs | 2016-11-16 | Paper |
| Partially polynomial kernels for set cover and test cover | 2016-07-22 | Paper |
| Separation dimension of graphs and hypergraphs | 2016-06-28 | Paper |
| Separation dimension of bounded degree graphs | 2015-11-27 | Paper |
| Strong chromatic index of chordless graphs | 2015-09-29 | Paper |
| Boxicity and separation dimension | 2015-09-09 | Paper |
| Maximal induced matchings in triangle-free graphs | 2015-09-09 | Paper |
| Rainbow connection number of graph power and graph products | 2015-01-20 | Paper |
| 2-connecting outerplanar graphs without blowing up the pathwidth | 2014-10-06 | Paper |
| On the kernelization complexity of string problems | 2014-09-26 | Paper |
| Rainbow connection number and radius | 2014-09-19 | Paper |
| Parameterized algorithms to preserve connectivity | 2014-07-01 | Paper |
| Separation dimension of sparse graphs | 2014-04-17 | Paper |
| Acyclic chromatic index of fully subdivided graphs and Halin graphs | 2014-03-25 | Paper |
| 2-connecting outerplanar graphs without blowing up the pathwidth | 2013-06-11 | Paper |
| Pairwise Suitable Family of Permutations and Boxicity | 2012-12-30 | Paper |
| Acyclic edge coloring of triangle-free planar graphs | 2012-11-23 | Paper |
| Maximum weight independent sets in hole- and dart-free graphs | 2012-10-19 | Paper |
| Acyclic edge coloring of 2-degenerate graphs | 2012-02-08 | Paper |
| Acyclic edge-coloring of planar graphs | 2011-10-27 | Paper |
| d‐Regular graphs of acyclic chromatic index at least d+2 | 2010-03-15 | Paper |
| Acyclic edge coloring of graphs with maximum degree 4 | 2009-12-18 | Paper |
| A note on acyclic edge coloring of complete bipartite graphs | 2009-12-10 | Paper |
| Acyclic edge coloring of subcubic graphs | 2009-01-28 | Paper |
