| Publication | Date of Publication | Type |
|---|
| Odd cycle transversal on \(P_5\)-free graphs in quasi-polynomial time | 2024-11-28 | Paper |
| \(b\)-coloring parameterized by clique-width | 2024-10-07 | Paper |
| On the complexity of rainbow vertex colouring diametral path graphs | 2024-09-11 | Paper |
| Reducing the vertex cover number via edge contractions | 2024-08-06 | Paper |
| A tight quasi-polynomial bound for \textsc{Global Label Min-Cut} | 2024-05-14 | Paper |
| Fixed-parameter tractability of \textsc{Directed Multicut} with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation | 2024-05-14 | Paper |
| Reducing the vertex cover number via edge contractions | 2023-06-12 | Paper |
| On the maximum number of edges in planar graphs of bounded degree and matching number | 2023-05-31 | Paper |
| Three problems on well-partitioned chordal graphs | 2023-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875582 | 2023-02-03 | Paper |
| Treewidth is NP-Complete on Cubic Graphs (and related results) | 2023-01-24 | Paper |
| Well-partitioned chordal graphs: obstruction set and disjoint paths | 2022-12-21 | Paper |
| On the maximum number of edges in chordal graphs of bounded degree and matching number | 2022-12-08 | Paper |
| Using edge contractions to reduce the semitotal domination number | 2022-11-17 | Paper |
| Graph square roots of small distance from degree one graphs | 2022-10-13 | Paper |
| On the maximum number of edges in chordal graphs of bounded degree and matching number | 2022-10-13 | Paper |
| Graph square roots of small distance from degree one graphs | 2022-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092403 | 2022-07-21 | Paper |
| A complexity dichotomy for critical values of the b-chromatic number of graphs | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089217 | 2022-07-18 | Paper |
| Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089236 | 2022-07-18 | Paper |
| Well-partitioned chordal graphs | 2022-06-14 | Paper |
| Taming graphs with no large creatures and skinny ladders | 2022-05-02 | Paper |
| Structural parameterizations of clique coloring | 2022-03-25 | Paper |
| Algorithms for the rainbow vertex coloring problem on graph classes | 2021-09-27 | Paper |
| Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs | 2021-08-04 | Paper |
| Reducing graph transversals via edge contractions | 2021-06-30 | Paper |
| Reducing the domination number of graphs via edge contractions and vertex deletions | 2021-01-21 | Paper |
| Graph Square Roots of Small Distance from Degree One Graphs | 2020-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116487 | 2020-08-25 | Paper |
| Finding connected secluded subgraphs | 2020-06-09 | Paper |
| Intersection of longest paths in graph classes | 2020-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111877 | 2020-05-27 | Paper |
| Parameterized aspects of strong subgraph closure | 2020-05-21 | Paper |
| Structural Parameterizations of Clique Coloring | 2020-05-10 | Paper |
| A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs | 2020-04-06 | Paper |
| Algorithms for the rainbow vertex coloring problem on graph classes | 2020-03-06 | Paper |
| Well-partitioned chordal graphs: obstruction set and disjoint paths | 2020-02-25 | Paper |
| Blocking dominating sets for $H$-free graphs via edge contractions | 2019-06-28 | Paper |
| Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 | 2019-05-21 | Paper |
| Classifying \(k\)-edge colouring for \(H\)-free graphs | 2019-04-26 | Paper |
| Reducing the domination number of graphs via edge contractions | 2019-03-05 | Paper |
| On the Parameterized Complexity of $k$-Edge Colouring | 2019-01-07 | Paper |
| Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 | 2018-01-04 | Paper |
| Intersection of longest paths in graph classes | 2017-02-14 | Paper |
| Tree decompositions meet induced matchings: beyond Max Weight Independent Set | N/A | Paper |
