| Publication | Date of Publication | Type |
|---|
| On graphs coverable by \(k\) shortest paths | 2024-09-11 | Paper |
| On graphs coverable by \({k}\) shortest paths | 2024-06-25 | Paper |
| On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model | 2024-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6192485 | 2024-02-12 | Paper |
| A meta-theorem for distributed certification | 2024-01-25 | Paper |
| On the power of threshold-based algorithms for detecting cycles in the CONGEST model | 2024-01-11 | Paper |
| Energy-efficient distributed algorithms for synchronous networks | 2024-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168461 | 2023-08-08 | Paper |
| A cubic vertex-kernel for \textsc{Trivially Perfect Editing} | 2023-04-11 | Paper |
| Three notes on distributed property testing | 2023-02-03 | Paper |
| Local certification of graphs with bounded genus | 2022-12-08 | Paper |
| A meta-theorem for distributed certification | 2022-11-11 | Paper |
| On graphs coverable by k shortest paths | 2022-06-30 | Paper |
| The role of randomness in the broadcast congested clique model | 2021-11-25 | Paper |
| Compact distributed certification of planar graphs | 2021-06-30 | Paper |
| Compact Distributed Certification of Planar Graphs | 2021-03-15 | Paper |
| On the heapability of finite partial orders | 2021-01-05 | Paper |
| Graph reconstruction in the congested clique | 2020-06-09 | Paper |
| The Impact of Locality in the Broadcast Congested Clique Model | 2020-03-20 | Paper |
| On distributed Merlin-Arthur decision protocols | 2020-03-03 | Paper |
| The impact of locality on the detection of cycles in the broadcast congested clique model | 2020-02-12 | Paper |
| Large induced subgraphs via triangulations and CMSO | 2019-06-20 | Paper |
| Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques | 2019-03-11 | Paper |
| An \(O(n^2)\) time algorithm for the minimal permutation completion problem | 2019-02-08 | Paper |
| Two rounds are enough for reconstructing any graph (class) in the congested clique model | 2019-01-30 | Paper |
| Distributed testing of excluded subgraphs | 2018-08-16 | Paper |
| Algorithms parameterized by vertex cover and modular width, through potential maximal cliques | 2018-05-23 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| Large Induced Subgraphs via Triangulations and CMSO | 2017-01-13 | Paper |
| On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators | 2016-12-22 | Paper |
| Treewidth and pathwidth parameterized by the vertex cover number | 2016-11-24 | Paper |
| Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques | 2016-10-21 | Paper |
| An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem | 2016-10-21 | Paper |
| On treewidth approximations | 2016-07-01 | Paper |
| Injective colorings with arithmetic constraints | 2015-12-17 | Paper |
| Allowing each node to communicate only once in a distributed system: shared whiteboard models | 2015-07-22 | Paper |
| Exponential time algorithms for the minimum dominating set problem on some graph classes | 2014-11-18 | Paper |
| Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes | 2014-11-18 | Paper |
| Algorithms parameterized by vertex cover and modular width, through potential maximal cliques | 2014-09-02 | Paper |
| The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism | 2014-08-07 | Paper |
| (Circular) backbone colouring: forest backbones in planar graphs | 2014-05-06 | Paper |
| Solving Capacitated Dominating Set by using covering by subsets and maximum matching | 2014-04-02 | Paper |
| The complexity of the bootstraping percolation and other problems | 2014-01-16 | Paper |
| An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem | 2014-01-10 | Paper |
| Treewidth and Pathwidth Parameterized by the Vertex Cover Number | 2013-08-12 | Paper |
| A note on planar graphs with large width parameters and small grid-minors | 2012-05-30 | Paper |
| Exact Algorithm for the Maximum Induced Planar Subgraph Problem | 2011-09-16 | Paper |
| On dissemination thresholds in regular and irregular graph classes | 2011-03-02 | Paper |
| Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching | 2010-11-16 | Paper |
| An ${\mathcal{O}}(n^2)$ -time Algorithm for the Minimal Interval Completion Problem | 2010-06-17 | Paper |
| Computing branchwidth via efficient triangulations and blocks | 2010-04-28 | Paper |
| Minimal proper interval completions | 2010-04-19 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Constructing Brambles | 2009-10-16 | Paper |
| Pathwidth is NP-Hard for Weighted Trees | 2009-07-14 | Paper |
| Exact Algorithms for Treewidth and Minimum Fill-In | 2009-06-22 | Paper |
| Minimal interval completion through graph exploration | 2009-02-19 | Paper |
| Feedback vertex set on AT-free graphs | 2008-09-10 | Paper |
| Minimal Proper Interval Completions | 2008-09-04 | Paper |
| Pathwidth of Circular-Arc Graphs | 2008-07-01 | Paper |
| Minimal Interval Completion Through Graph Exploration | 2008-04-24 | Paper |
| On Dissemination Thresholds in Regular and Irregular Graph Classes | 2008-04-15 | Paper |
| On powers of graphs of bounded NLC-width (clique-width) | 2007-09-19 | Paper |
| Characterizing Minimal Interval Completions | 2007-09-03 | Paper |
| Connected Graph Searching in Outerplanar Graphs | 2007-05-29 | Paper |
| Treewidth of planar graphs: connections with duality | 2007-05-29 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| On treewidth approximations. | 2004-03-14 | Paper |
| Chordal embeddings of planar graphs | 2004-01-05 | Paper |
| Approximating the treewidth of AT-free graphs. | 2003-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766670 | 2002-07-22 | Paper |
| Listing all potential maximal cliques of a graph | 2002-07-15 | Paper |
| Treewidth and minimum fill-in: Grouping the minimal separators | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501558 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251051 | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252036 | 1999-06-17 | Paper |
