| Publication | Date of Publication | Type |
|---|
Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs
(available as arXiv preprint) | N/A | Paper |
| Maximum list r-colorable induced subgraphs in kp₃-free graphs | 2026-08-31 | Paper |
| Metric dimension and geodetic set parameterized by vertex cover | 2026-06-24 | Paper |
| Subexponential parameterized directed Steiner network problems on planar graphs: a complete classification | 2026-01-14 | Paper |
| Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover | 2026-01-14 | Paper |
Maximum list r-colorable induced subgraphs in kP₃-free graphs
Algorithmica | 2026-01-01 | Paper |
| Domination and cut problems on chordal graphs with bounded leafage | 2025-06-23 | Paper |
| Polynomial-time approximation schemes for independent packing problems on fractionally tree-independence-number-fragile graphs | 2024-10-16 | Paper |
| Metric dimension parameterized by feedback vertex set and other structural parameters | 2024-08-06 | Paper |
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
Algorithmica | 2024-04-24 | Paper |
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
SIAM Journal on Discrete Mathematics | 2023-10-13 | Paper |
Parameterized complexity of multicut in weighted trees
Theoretical Computer Science | 2023-10-12 | Paper |
Parameterized complexity of weighted multicut in trees
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
The complexity of blocking (semi)total dominating sets with edge contractions
Theoretical Computer Science | 2023-03-17 | Paper |
| Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs | 2023-03-13 | Paper |
scientific article; zbMATH DE number 7650254 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Using edge contractions to reduce the semitotal domination number
Theoretical Computer Science | 2022-11-17 | Paper |
Reducing the domination number of graphs via edge contractions
(available as arXiv preprint) | 2022-07-21 | Paper |
Reducing the domination number of ( P₃ + k P₂ )-free graphs via one edge contraction
Discrete Applied Mathematics | 2021-10-21 | Paper |
Blocking total dominating sets via edge contractions
Theoretical Computer Science | 2021-06-23 | Paper |
Reducing the domination number of graphs via edge contractions and vertex deletions
Discrete Mathematics | 2021-01-21 | Paper |
CPG graphs: some structural and hardness results
Discrete Applied Mathematics | 2021-01-13 | Paper |
Characterising circular-arc contact \(B_0\)-VPG graphs
Discrete Applied Mathematics | 2020-06-29 | 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 |
Blocking dominating sets for $H$-free graphs via edge contractions
(available as arXiv preprint) | 2019-06-28 | Paper |
Proper circular arc graphs as intersection graphs of paths on a grid
Discrete Applied Mathematics | 2019-05-23 | Paper |
Classifying \(k\)-edge colouring for \(H\)-free graphs
Information Processing Letters | 2019-04-26 | Paper |
Reducing the domination number of graphs via edge contractions
(available as arXiv preprint) | 2019-03-05 | 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 |
| On the Parameterized Complexity of k-Edge Colouring | 2019-01-07 | Paper |
On the Parameterized Complexity of $k$-Edge Colouring
(available as arXiv preprint) | 2019-01-01 | Paper |
| scientific article; zbMATH DE number 6677405 (Why is no real title available?) | 2017-01-24 | Paper |
