| Publication | Date of Publication | Type |
|---|
| Independent Set in P5-Free Graphs in Polynomial Time | 2019-06-20 | Paper |
| Large induced subgraphs via triangulations and CMSO | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743514 | 2019-05-10 | Paper |
| FPT algorithms for domination in sparse graphs and beyond | 2019-05-02 | Paper |
| Output-polynomial enumeration on graphs of bounded (local) linear MIM-width | 2018-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965491 | 2017-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2963897 | 2017-02-21 | Paper |
| Tight bounds for parameterized complexity of Cluster Editing | 2017-01-30 | Paper |
| Searching for better fill-in | 2017-01-30 | Paper |
| Large Induced Subgraphs via Triangulations and CMSO | 2017-01-13 | Paper |
| Treewidth and pathwidth parameterized by the vertex cover number | 2016-11-24 | Paper |
| Minimal dominating sets in interval graphs and trees | 2016-11-24 | Paper |
| Maximal induced matchings in triangle-free graphs | 2016-11-16 | Paper |
| Exploring the subexponential complexity of completion problems | 2016-10-24 | Paper |
| Largest chordal and interval subgraphs faster than \(2^n\) | 2016-10-21 | Paper |
| On the parameterised complexity of string morphism problems | 2016-09-21 | 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 |
| Maximal induced matchings in triangle-free graphs | 2015-09-09 | Paper |
| On the parameterized complexity of finding separators with non-hereditary properties | 2015-09-02 | Paper |
| An incremental polynomial time algorithm to enumerate all minimal edge dominating sets | 2015-09-02 | Paper |
| Minimum fill-in of sparse graphs: kernelization and approximation | 2015-03-02 | Paper |
| A multi-parameter analysis of hard problems on deterministic finite automata | 2015-02-20 | Paper |
| Induced subgraph isomorphism on proper interval and bipartite permutation graphs | 2014-12-02 | Paper |
| Enumerating minimal subset feedback vertex sets | 2014-11-19 | Paper |
| Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\) | 2014-10-13 | Paper |
| Kernel(s) for problems with no kernel | 2014-09-09 | Paper |
| Tight bounds for parameterized complexity of cluster editing with a small number of clusters | 2014-06-10 | Paper |
| Searching for better fill-in | 2014-06-10 | Paper |
| Subexponential Parameterized Algorithm for Minimum Fill-In | 2014-04-11 | Paper |
| A Polynomial Kernel for Proper Interval Vertex Deletion | 2014-04-10 | Paper |
| Solving Capacitated Dominating Set by using covering by subsets and maximum matching | 2014-04-02 | Paper |
| Parameterized complexity of vertex deletion into perfect graph classes | 2014-01-13 | Paper |
| Connecting Terminals and 2-Disjoint Connected Subgraphs | 2013-12-06 | Paper |
| Largest Chordal and Interval Subgraphs Faster Than 2 n | 2013-09-17 | Paper |
| Treewidth and Pathwidth Parameterized by the Vertex Cover Number | 2013-08-12 | Paper |
| Treewidth computation and extremal combinatorics | 2013-08-06 | Paper |
| An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets | 2013-08-06 | Paper |
| Proper interval vertex deletion | 2013-05-16 | Paper |
| A Multivariate Analysis of Some DFA Problems | 2013-03-18 | Paper |
| On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties | 2012-11-06 | Paper |
| Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs | 2012-09-25 | Paper |
| A Polynomial Kernel for Proper Interval Vertex Deletion | 2012-09-25 | Paper |
| FPT Algorithms for Domination in Biclique-Free Graphs | 2012-09-25 | Paper |
| Minimum fill-in of sparse graphs: kernelization and approximation | 2012-08-31 | Paper |
| Local search: is brute-force avoidable? | 2012-08-17 | Paper |
| k-Gap Interval Graphs | 2012-06-29 | Paper |
| Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves | 2012-04-24 | Paper |
| Finding Induced Subgraphs via Minimal Triangulations | 2012-01-23 | Paper |
| Faster parameterized algorithms for \textsc{Minimum Fill-in} | 2011-12-14 | Paper |
| Exact Algorithm for the Maximum Induced Planar Subgraph Problem | 2011-09-16 | Paper |
| Parameterized Complexity of Vertex Deletion into Perfect Graph Classes | 2011-08-19 | Paper |
| Enumerating Minimal Subset Feedback Vertex Sets | 2011-08-12 | Paper |
| Induced Subgraph Isomorphism on Interval and Proper Interval Graphs | 2010-12-09 | Paper |
| Proper Interval Vertex Deletion | 2010-12-07 | Paper |
| Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching | 2010-11-16 | Paper |
| A Quartic Kernel for Pathwidth-One Vertex Deletion | 2010-11-16 | Paper |
| A Parameterized Algorithm for Chordal Sandwich | 2010-05-28 | Paper |
| Computing Pathwidth Faster Than 2 n | 2010-01-14 | Paper |
| Interval Completion Is Fixed Parameter Tractable | 2009-11-06 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Exact Algorithms for Treewidth and Minimum Fill-In | 2009-06-22 | Paper |
| Improved Algorithms for the Feedback Vertex Set Problems | 2009-02-17 | Paper |
| Faster Parameterized Algorithms for Minimum Fill-In | 2009-01-29 | Paper |
| Parameterized Complexity for Domination Problems on Degenerate Graphs | 2009-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549635 | 2009-01-05 | Paper |
| Improved algorithms for feedback vertex set problems | 2008-11-19 | Paper |
| Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In | 2008-09-18 | Paper |
| Treewidth Computation and Extremal Combinatorics | 2008-08-28 | Paper |
| Capacitated Domination and Covering: A Parameterized Perspective | 2008-06-05 | Paper |
| Characterizing Minimal Interval Completions | 2007-09-03 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376) | 2006-06-01 | Paper |
| A wide-range algorithm for minimal triangulation from an arbitrary ordering | 2006-04-28 | Paper |
| A vertex incremental approach for maintaining chordality | 2006-03-29 | Paper |
| Lex M versus MCS-M | 2006-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411390 | 2003-07-08 | Paper |
