| Publication | Date of Publication | Type |
|---|
| Faster computation of 3-edge-connected components in digraphs | 2024-05-14 | Paper |
| Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage | 2024-03-25 | Paper |
| Computing and listing avoidable vertices and paths | 2024-01-09 | Paper |
| Structural parameterization of cluster deletion | 2023-11-24 | Paper |
| Computing and listing avoidable vertices and paths | 2023-07-26 | Paper |
| Node multiway cut and subset feedback vertex set on graphs of bounded mim-width | 2022-12-21 | Paper |
| Graph square roots of small distance from degree one graphs | 2022-10-13 | Paper |
| Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage | 2022-08-30 | Paper |
| Graph square roots of small distance from degree one graphs | 2022-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092370 | 2022-07-21 | Paper |
| Node multiway cut and subset feedback vertex set on graphs of bounded mim-width | 2022-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009483 | 2021-08-04 | Paper |
| Cluster deletion on interval graphs and split related graphs | 2021-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136273 | 2020-11-25 | Paper |
| Graph Square Roots of Small Distance from Degree One Graphs | 2020-10-12 | Paper |
| Maximizing the strong triadic closure in split graphs and proper interval graphs | 2020-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116487 | 2020-08-25 | Paper |
| Parameterized aspects of strong subgraph closure | 2020-05-21 | Paper |
| Subset feedback vertex set on graphs of bounded independent set size | 2020-03-12 | Paper |
| Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs | 2019-03-22 | Paper |
| Strong triadic closure in cographs and graphs of low maximum degree | 2018-06-08 | Paper |
| Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs | 2017-11-22 | Paper |
| Sparse certificates for 2-connectivity in directed graphs | 2017-11-06 | Paper |
| Strong triadic closure in cographs and graphs of low maximum degree | 2017-10-23 | Paper |
| On the performance of the first-fit coloring algorithm on permutation graphs | 2016-06-16 | Paper |
| Clique-width of path powers | 2016-04-07 | Paper |
| Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs | 2015-11-19 | Paper |
| A characterisation of clique-width through nested partitions | 2015-06-10 | Paper |
| Enumerating minimal subset feedback vertex sets | 2014-11-19 | Paper |
| Counting spanning trees using modular decomposition | 2014-03-13 | Paper |
| A new representation of proper interval graphs with an application to clique-width | 2013-07-04 | Paper |
| Restricted vertex multicut on permutation graphs | 2012-08-14 | Paper |
| A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs | 2012-08-08 | Paper |
| Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs | 2012-05-11 | Paper |
| Cutwidth of Split Graphs and Threshold Graphs | 2012-03-15 | Paper |
| A simple linear-time recognition algorithm for weakly quasi-threshold graphs | 2012-01-24 | Paper |
| Strongly chordal and chordal bipartite graphs are sandwich monotone | 2011-12-15 | Paper |
| Graphs of linear clique-width at most 3 | 2011-10-10 | Paper |
| Enumerating minimal subset feedback vertex sets | 2011-08-12 | Paper |
| Counting spanning trees in graphs using modular decomposition | 2011-02-20 | Paper |
| Counting spanning trees in cographs: an algorithmic approach | 2011-02-11 | Paper |
| Characterizing and computing minimal cograph completions | 2010-05-25 | Paper |
| Clustering with partial information | 2010-03-09 | Paper |
| Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone | 2009-07-23 | Paper |
| Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs | 2009-06-23 | Paper |
| A Complete Characterisation of the Linear Clique-Width of Path Powers | 2009-06-03 | Paper |
| Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions | 2009-03-06 | Paper |
| Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions | 2009-02-19 | Paper |
| Clustering with Partial Information | 2009-02-03 | Paper |
| Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs | 2009-01-20 | Paper |
| Drawing graphs using modular decomposition | 2009-01-19 | Paper |
| A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs | 2008-09-04 | Paper |
| Characterizing and Computing Minimal Cograph Completions | 2008-06-19 | Paper |
| Graphs of Linear Clique-Width at Most 3 | 2008-05-27 | Paper |
| On the number of spanning trees of \(K^m_n \pm G\) graphs | 2008-05-27 | Paper |
| Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions | 2008-04-24 | Paper |
| Minimal comparability completions of arbitrary graphs | 2008-03-18 | Paper |
| An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs | 2007-02-19 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708545 | 2005-11-18 | Paper |
| The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs | 2005-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154670 | 2005-01-14 | Paper |
