| Publication | Date of Publication | Type |
|---|
| Sequential and parallel algorithms for embedding problems on classes of partial k-trees | 2022-12-09 | Paper |
| The parallel complexity of tree embedding problems (extended abstract) | 2022-08-18 | Paper |
| Incremental optimization of independent sets under the reconfiguration framework | 2022-07-18 | Paper |
| Parameterized complexity of reconfiguration of atoms | 2022-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005179 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136265 | 2020-11-25 | Paper |
| Incremental optimization of independent sets under the reconfiguration framework | 2020-02-24 | Paper |
| Reconfiguring spanning and induced subgraphs | 2020-01-16 | Paper |
| Introduction to reconfiguration | 2019-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743428 | 2019-05-10 | Paper |
| On directed covering and domination problems | 2019-03-28 | Paper |
| Reconfiguring spanning and induced subgraphs | 2018-10-04 | Paper |
| Computing $k$-Atomicity in Polynomial Time | 2018-04-24 | Paper |
| Graph editing to a given neighbourhood degree list is fixed-parameter tractable | 2018-03-26 | Paper |
| Finding largest common embeddable subtrees | 2017-12-04 | Paper |
| Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width | 2017-11-16 | Paper |
| Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas | 2017-09-27 | Paper |
| On the parameterized complexity of reconfiguration problems | 2017-05-11 | Paper |
| The complexity of dominating set reconfiguration | 2017-03-16 | Paper |
| Reconfiguration of dominating sets | 2016-11-29 | Paper |
| Computing Weak Consistency in Polynomial Time | 2016-03-23 | Paper |
| The Complexity of Dominating Set Reconfiguration | 2015-10-30 | Paper |
| Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas | 2015-10-27 | Paper |
| Homotopy types and Nielsen numbers of periodic homotopy idempotents on tori | 2015-10-07 | Paper |
| The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration | 2015-09-15 | Paper |
| Reconfiguration over Tree Decompositions | 2015-09-15 | Paper |
| Vertex Cover Reconfiguration and Beyond | 2015-09-11 | Paper |
| FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT | 2015-04-29 | Paper |
| Reconfiguration of dominating sets | 2014-09-26 | Paper |
| On the parameterized complexity of reconfiguration problems | 2013-12-10 | Paper |
| Parameterized Enumeration of (Locally-) Optimal Aggregations | 2013-08-12 | Paper |
| Enumerating Neighbour and Closest Strings | 2013-01-07 | Paper |
| Faster fixed-parameter tractable algorithms for matching and packing problems | 2008-12-02 | Paper |
| On the parameterized complexity of layered graph drawing | 2008-12-02 | Paper |
| Solving \#SAT using vertex covers | 2007-12-10 | Paper |
| Solving #SAT Using Vertex Covers | 2007-09-04 | Paper |
| Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth | 2007-05-30 | Paper |
| Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs | 2007-05-29 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| A fixed-parameter approach to 2-layer planarization | 2006-08-11 | Paper |
| Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover | 2005-12-27 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Embeddings of \(k\)-connected graphs of pathwidth \(k\) | 2005-02-22 | Paper |
| Approximation algorithms for classes of graphs excluding single-crossing graphs as minors | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043700 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708579 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796197 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778544 | 2002-11-18 | Paper |
| On Graph Powers for Leaf-Labeled Trees | 2002-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721972 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721973 | 2001-07-11 | Paper |
| Efficient asynchronous simulation of a class of synchronous parallel algorithms | 2000-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944989 | 2000-03-22 | Paper |
| Characterizing multiterminal flow networks and computing flows in networks of small treewidth | 1999-02-21 | Paper |
| Interval Routing onk-Trees | 1998-06-23 | Paper |
| Finding largest subtrees and smallest supertrees | 1998-06-08 | Paper |
| Pointers versus arithmetic in PRAMs | 1997-03-31 | Paper |
| The complexity of subgraph isomorphism for classes of partial k-trees | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886100 | 1996-08-22 | Paper |
| The Parallel Complexity of Tree Embedding Problems | 1995-04-09 | Paper |
| A Model for Asynchronous Shared Memory Parallel Computation | 1995-04-06 | Paper |
| Restricted CRCW PRAMs | 1994-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028909 | 1993-03-28 | Paper |
