| Publication | Date of Publication | Type |
|---|
| Prime vertex-minors of a prime graph | 2024-03-26 | Paper |
| A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups | 2024-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187839 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065388 | 2023-11-14 | Paper |
| Computing pivot-minors | 2023-11-08 | Paper |
| Reuniting $\chi$-boundedness with polynomial $\chi$-boundedness | 2023-10-17 | Paper |
| A polynomial kernel for 3-leaf power deletion | 2023-10-06 | Paper |
| 3‐Degenerate induced subgraph of a planar graph | 2023-10-04 | Paper |
| \(\Gamma\)-graphic delta-matroids and their applications | 2023-10-04 | Paper |
| Graphs of bounded depth‐2 rank‐brittleness | 2023-09-29 | Paper |
| A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors | 2023-08-10 | Paper |
| Note on Hamiltonicity of basis graphs of even delta-matroids | 2023-08-10 | Paper |
| Twin-width of subdivisions of multigraphs | 2023-06-08 | Paper |
| Intertwining Connectivities for Vertex-Minors and Pivot-Minors | 2023-03-30 | Paper |
| Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) | 2023-03-23 | Paper |
| Rank connectivity and pivot-minors of graphs | 2022-12-01 | Paper |
| Independent domination of graphs with bounded maximum degree | 2022-11-28 | Paper |
| Bounds for the Twin-Width of Graphs | 2022-10-06 | Paper |
| A unified Erd\H{o}s-P\'{o}sa theorem for cycles in graphs labelled by multiple abelian groups | 2022-09-20 | Paper |
| The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs | 2022-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089163 | 2022-07-18 | Paper |
| Obstructions for partitioning into forests and outerplanar graphs | 2022-03-24 | Paper |
| Characterizing matroids whose bases form graphic delta-matroids | 2022-01-13 | Paper |
| Tree Pivot-Minors and Linear Rank-Width | 2022-01-07 | Paper |
| Finding Branch-Decompositions of Matroids, Hypergraphs, and More | 2021-12-01 | Paper |
| Obstructions for Bounded Branch-depth in Matroids | 2021-11-05 | Paper |
| Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k | 2021-09-25 | Paper |
| Finding branch-decompositions of matroids, hypergraphs, and more | 2021-07-28 | Paper |
| Obstructions for bounded shrub-depth and rank-depth | 2021-06-18 | Paper |
| Intertwining connectivities for vertex-minors and pivot-minors | 2021-06-07 | Paper |
| Equitable partition of planar graphs | 2021-04-28 | Paper |
| The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor | 2021-04-12 | Paper |
| The average cut-rank of graphs | 2021-02-08 | Paper |
| Branch-depth: generalizing tree-depth of graphs | 2021-02-08 | Paper |
| Tangle-tree duality in abstract separation systems | 2020-12-30 | Paper |
| Fragile minor-monotone parameters under random edge perturbation | 2020-05-20 | Paper |
| Scattered Classes of Graphs | 2020-04-07 | Paper |
| Improper colouring of graphs with no odd clique minor | 2020-04-06 | Paper |
| Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded | 2020-01-15 | Paper |
| Tangle-tree duality: in graphs, matroids and beyond | 2019-11-21 | Paper |
| A polynomial kernel for $3$-leaf power deletion | 2019-11-11 | Paper |
| Online Ramsey theory for a triangle on ‐free graphs | 2019-10-31 | Paper |
| Defective colouring of graphs excluding a subgraph or minor | 2019-09-04 | Paper |
| Graphs of bounded depth-$2$ rank-brittleness | 2019-06-13 | Paper |
| Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs | 2019-03-11 | Paper |
| Chi-boundedness of graph classes excluding wheel vertex-minors | 2019-02-08 | Paper |
| A remark on the paper ``Properties of intersecting families of ordered sets by O. Einstein | 2019-02-01 | Paper |
| Computing small pivot-minors | 2018-11-22 | Paper |
| Approximating rank-width and clique-width quickly | 2018-11-05 | Paper |
| Vertex-minors and the Erdős-Hajnal conjecture | 2018-10-23 | Paper |
| Constructive algorithm for path-width of matroids | 2018-07-16 | Paper |
| The “Art of Trellis Decoding” Is Fixed-Parameter Tractable | 2018-06-27 | Paper |
| Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs | 2018-06-07 | Paper |
| An FPT 2-approximation for tree-cut decomposition | 2018-02-28 | Paper |
| Chi-boundedness of graph classes excluding wheel vertex-minors | 2018-01-18 | Paper |
| Partitioning \(H\)-minor free graphs into three subgraphs with no large components | 2017-11-28 | Paper |
| Rank-width: algorithmic and structural results | 2017-09-12 | Paper |
| Even-cycle decompositions of graphs with no odd-\(K_4\)-minor | 2017-08-31 | Paper |
| An upper bound on tricolored ordered sum-free sets | 2017-08-23 | Paper |
| Majority colourings of digraphs | 2017-06-13 | Paper |
| Strongly Even-Cycle Decomposable Graphs | 2017-02-01 | Paper |
| Excluded vertex-minors for graphs of linear rank-width at most k. | 2017-01-30 | Paper |
| Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors | 2017-01-26 | Paper |
| Classification of real Bott manifolds and acyclic digraphs | 2017-01-10 | Paper |
| Partitioning \(H\)-minor free graphs into three subgraphs with no large components | 2016-10-14 | Paper |
| Dynamic coloring of graphs having no \(K_5\) minor | 2016-05-02 | Paper |
| Unavoidable induced subgraphs in large graphs with no homogeneous sets | 2016-03-14 | Paper |
| An FPT 2-approximation for tree-cut decomposition | 2016-02-26 | Paper |
| A Relative of Hadwiger's Conjecture | 2016-01-04 | Paper |
| Number of Cliques in Graphs with a Forbidden Subdivision | 2015-10-30 | Paper |
| Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract) | 2015-09-09 | Paper |
| Hyperbolic surface subgroups of one-ended doubles of free groups | 2014-12-22 | Paper |
| Unavoidable vertex-minors in large prime graphs | 2014-09-02 | Paper |
| Excluded vertex-minors for graphs of linear rank-width at most \(k\) | 2014-09-02 | Paper |
| Faster algorithms for vertex partitioning problems parameterized by clique-width | 2014-04-29 | Paper |
| Graphs of small rank-width are pivot-minors of graphs of small tree-width | 2014-04-02 | Paper |
| Guest editors' foreword | 2014-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857429 | 2013-11-01 | Paper |
| Finding minimum clique capacity | 2013-08-06 | Paper |
| Deciding First Order Properties of Matroids | 2012-11-01 | Paper |
| Rank-width of random graphs | 2012-07-10 | Paper |
| Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices | 2012-04-19 | Paper |
| Perfect matchings in claw-free cubic graphs | 2011-06-01 | Paper |
| Rank-width and tree-width of \(H\)-minor-free graphs | 2010-10-18 | Paper |
| Computing rank-width exactly | 2010-08-20 | Paper |
| Certifying large branch-width | 2010-08-16 | Paper |
| Real Bott manifolds and acyclic digraphs | 2010-02-25 | Paper |
| Finding Branch-Decompositions and Rank-Decompositions | 2009-06-22 | Paper |
| Circle graph obstructions under pivoting | 2009-06-16 | Paper |
| Rank-Width and Well-Quasi-Ordering | 2009-05-27 | Paper |
| Excluding a bipartite circle graph from line graphs | 2009-03-04 | Paper |
| Finding Branch-Decompositions and Rank-Decompositions | 2008-09-25 | Paper |
| Rank‐width is less than or equal to branch‐width | 2008-03-20 | Paper |
| Rank-width and Well-quasi-ordering of Skew-symmetric Matrices | 2007-05-29 | Paper |
| Testing branch-width | 2007-04-16 | Paper |
| Vertex-minors, monadic second-order logic, and a conjecture by Seese | 2007-01-11 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Approximating clique-width and branch-width | 2006-07-12 | Paper |
| Rank-width and vertex-minors | 2005-09-28 | Paper |
