| Publication | Date of Publication | Type |
|---|
| Space-efficient parameterized algorithms on graphs of low shrubdepth | 2025-01-06 | Paper |
| Tree pivot-minors and linear rank-width | 2024-10-18 | Paper |
| Generalisations of matrix partitions: complexity and obstructions | 2024-06-28 | Paper |
| Erratum to: ``More applications of the \(d\)-neighbor equivalence: acyclicity and connectivity constraints | 2024-04-23 | Paper |
| Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) | 2024-04-23 | Paper |
| Computing pivot-minors | 2023-11-08 | Paper |
| Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) | 2023-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874536 | 2023-02-07 | Paper |
| Letter graphs and geometric grid classes of permutations | 2022-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092436 | 2022-07-21 | Paper |
| More applications of the \(d\)-neighbor equivalence: connectivity and acyclicity constraints | 2022-05-11 | Paper |
| A linear fixed parameter tractable algorithm for connected pathwidth | 2022-03-15 | Paper |
| Tree pivot-minors and linear rank-width | 2022-01-07 | Paper |
| Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k | 2021-09-25 | Paper |
| Maximal strongly connected cliques in directed graphs: algorithms and bounds | 2021-09-15 | Paper |
| More applications of the \(d\)-neighbor equivalence: acyclicity and connectivity constraints | 2021-08-20 | Paper |
| Enumerating minimal transversals of hypergraphs without small holes | 2021-08-04 | Paper |
| On maximal cliques with connectivity constraints in directed graphs | 2020-11-25 | Paper |
| Between clique-width and linear clique-width of bipartite graphs | 2020-06-08 | Paper |
| An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width | 2020-04-14 | Paper |
| Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph | 2020-04-07 | Paper |
| Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs | 2020-02-25 | Paper |
| On the parameterized complexity of the geodesic hull number | 2019-09-10 | Paper |
| Fast exact algorithms for some connectivity problems parameterized by clique-width | 2019-06-06 | Paper |
| Counting minimal transversals of \(\beta\)-acyclic hypergraphs | 2019-01-25 | Paper |
| Computing small pivot-minors | 2018-11-22 | Paper |
| Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions | 2018-09-07 | Paper |
| Output-polynomial enumeration on graphs of bounded (local) linear MIM-width | 2018-04-06 | Paper |
| Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph | 2017-10-23 | Paper |
| An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion | 2017-10-10 | Paper |
| An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion | 2017-09-29 | Paper |
| An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width | 2017-09-22 | Paper |
| On the geodetic rank of a graph | 2017-07-25 | Paper |
| Counting minimal dominating sets | 2017-05-19 | Paper |
| Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm | 2017-05-11 | Paper |
| Minimal dominating sets in interval graphs and trees | 2016-11-24 | Paper |
| A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs | 2016-10-21 | Paper |
| Finding paths in grids with forbidden transitions | 2016-10-21 | Paper |
| Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs | 2016-03-04 | Paper |
| Output-polynomial enumeration on graphs of bounded (local) linear MIM-width | 2016-01-11 | Paper |
| Enumerating minimal dominating sets in chordal bipartite graphs | 2015-12-10 | Paper |
| Polynomial delay algorithm for listing minimal edge dominating sets in graphs | 2015-10-30 | Paper |
| Linear rank-width of distance-hereditary graphs | 2015-09-09 | Paper |
| Linear rank-width and linear clique-width of trees | 2015-06-01 | Paper |
| On the enumeration of minimal dominating sets and related notions | 2015-04-17 | Paper |
| An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width | 2014-12-18 | Paper |
| Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs | 2014-11-04 | Paper |
| An exact algorithm to check the existence of (elementary) paths and a generalisation of the cut problem in graphs with forbidden transitions | 2014-11-04 | Paper |
| On the enumeration and counting of minimal dominating sets in interval and permutation graphs | 2014-01-14 | Paper |
| Linear rank-width and linear clique-width of trees | 2013-12-06 | Paper |
| The rank-width of edge-coloured graphs | 2013-08-01 | Paper |
| Connectivity check in 3-connected planar graphs with obstacles | 2013-06-28 | Paper |
| A Note on Graphs of Linear Rank-Width 1 | 2013-06-06 | Paper |
| Trees in graphs with conflict edges or forbidden transitions | 2013-05-28 | Paper |
| On the neighbourhood Helly of some graph classes and applications to the enumeration of minimal dominating sets | 2013-03-21 | Paper |
| Well-quasi-ordering of matrices under Schur complement and applications to directed graphs | 2012-09-12 | Paper |
| Enumeration of minimal dominating sets and variants | 2011-08-19 | Paper |
| \(\mathbb F\)-rank-width of (edge-colored) graphs | 2011-07-08 | Paper |
| Compact labelings for efficient first-order model-checking | 2011-02-18 | Paper |
| Directed rank-width and displit decomposition | 2010-01-21 | Paper |
| Graph operations characterizing rank-width | 2009-06-30 | Paper |
| Graph Operations Characterizing Rank-Width and Balanced Graph Expressions | 2008-07-01 | Paper |
| Efficient First-Order Model-Checking Using Short Labels | 2008-06-19 | Paper |
| Vertex-minor reductions can simulate edge contractions | 2007-10-29 | Paper |
| Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions | N/A | Paper |
