| Publication | Date of Publication | Type |
|---|
| Polynomial-time approximation schemes for independent packing problems on fractionally tree-independence-number-fragile graphs | 2024-10-16 | Paper |
Solving problems on generalized convex graphs via mim-width
Journal of Computer and System Sciences | 2024-01-04 | Paper |
| Bounding the Mim-Width of Hereditary Graph Classes. | 2023-11-13 | Paper |
Bounding the mim‐width of hereditary graph classes
Journal of Graph Theory | 2023-10-04 | Paper |
| Comparing Width Parameters on Graph Classes | 2023-08-10 | Paper |
On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs
Theoretical Computer Science | 2023-04-12 | Paper |
Non-empty intersection of longest paths in \(H\)-free graphs
The Electronic Journal of Combinatorics | 2023-03-21 | Paper |
| Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs | 2023-03-13 | Paper |
Non-empty intersection of longest paths in $H$-free graphs
(available as arXiv preprint) | 2023-02-14 | Paper |
On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
(available as arXiv preprint) | 2022-05-30 | Paper |
Solving problems on generalized convex graphs via mim-width
(available as arXiv preprint) | 2022-03-25 | Paper |
Jones' conjecture in subcubic graphs
The Electronic Journal of Combinatorics | 2021-10-26 | Paper |
List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective
Information Processing Letters | 2021-10-19 | Paper |
Sublinear longest path transversals
SIAM Journal on Discrete Mathematics | 2021-08-20 | Paper |
CPG graphs: some structural and hardness results
Discrete Applied Mathematics | 2021-01-13 | Paper |
| Sublinear Longest Path Transversals | 2020-05-06 | Paper |
Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
Theoretical Computer Science | 2020-03-12 | Paper |
Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
Theoretical Computer Science | 2020-03-12 | Paper |
On contact graphs of paths on a grid
(available as arXiv preprint) | 2019-02-15 | Paper |
| On contact graphs of paths on a grid | 2019-02-15 | Paper |
Triangle packings and transversals of some \(K_{4}\)-free graphs
Graphs and Combinatorics | 2018-09-14 | Paper |
Boundary classes for graph problems involving non-local properties
Theoretical Computer Science | 2017-09-05 | Paper |
On line graphs of subcubic triangle-free graphs
Discrete Mathematics | 2017-08-29 | Paper |
Bounded clique cover of some sparse graphs
Discrete Mathematics | 2017-06-23 | Paper |
The VC-dimension of graphs with respect to \(k\)-connected subgraphs
Discrete Applied Mathematics | 2016-11-02 | Paper |
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
(available as arXiv preprint) | N/A | Paper |
Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs
(available as arXiv preprint) | N/A | Paper |
