| Publication | Date of Publication | Type |
|---|
| An improved spectral lower bound of treewidth | 2025-01-14 | Paper |
| Dichotomies for tree minor containment with structural parameters | 2025-01-08 | Paper |
| Structural parameterizations of vertex integrity | 2024-12-12 | Paper |
| Algorithmic meta-theorems for combinatorial reconfiguration revisited | 2024-10-24 | Paper |
| Extended MSO model checking via small vertex integrity | 2024-09-11 | Paper |
| Parameterized complexity of non-separating and non-disconnecting paths and sets | 2024-08-06 | Paper |
| Independent set reconfiguration on directed graphs | 2024-08-06 | Paper |
| Orientable burning number of graphs | 2024-07-19 | Paper |
| Dichotomies for tree minor containment with structural parameters | 2024-07-19 | Paper |
| Structural parameterizations of vertex integrity (best paper) | 2024-07-19 | Paper |
| On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes | 2024-07-19 | Paper |
| Sorting balls and water: equivalence and computational complexity | 2024-05-16 | Paper |
| Grouped domination parameterized by vertex cover, twin cover, and beyond | 2024-04-04 | Paper |
| Extended MSO model checking via small vertex integrity | 2024-01-09 | Paper |
| Computational complexity of jumping block puzzles | 2024-01-05 | Paper |
| Parameterized Complexity of Graph Burning | 2023-11-13 | Paper |
| Sorting balls and water: equivalence and computational complexity | 2023-10-12 | Paper |
| Grouped domination parameterized by vertex cover, twin cover, and beyond | 2023-10-04 | Paper |
| Sequentially swapping tokens: further on graph classes | 2023-08-14 | Paper |
| Reconfiguration of cliques in a graph | 2023-04-27 | Paper |
| Reconfiguring directed trees in a digraph | 2023-03-30 | Paper |
| Computational complexity of jumping block puzzles | 2023-03-30 | Paper |
| Exploring the gap between treedepth and vertex cover through vertex integrity | 2023-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874480 | 2023-02-07 | Paper |
| Low-congestion shortcut and graph parameters | 2023-02-03 | Paper |
| Reconfiguring (non-spanning) arborescences | 2023-01-05 | Paper |
| Linear-time recognition of double-threshold graphs | 2022-12-21 | Paper |
| A Survey on Spanning Tree Congestion | 2022-10-19 | Paper |
| Parameterized Complexity of $$(A,\ell )$$-Path Packing | 2022-10-13 | Paper |
| Grundy Distinguishes Treewidth from Pathwidth | 2022-08-18 | Paper |
| Parameterized complexity of graph burning | 2022-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090459 | 2022-07-18 | Paper |
| Reconfiguration of regular induced subgraphs | 2022-07-13 | Paper |
| Exploring the gap between treedepth and vertex cover through vertex integrity | 2022-05-10 | Paper |
| An improved deterministic parameterized algorithm for cactus vertex deletion | 2022-05-09 | Paper |
| Independent set reconfiguration on directed graphs | 2022-03-24 | Paper |
| Parameterized complexity of \((A,\ell)\)-path packing | 2022-03-22 | Paper |
| Linear-time recognition of double-threshold graphs | 2022-03-22 | Paper |
| Low-congestion shortcut and graph parameters | 2021-11-08 | Paper |
| On the security number of the Cartesian product of graphs | 2021-09-30 | Paper |
| Token sliding on split graphs | 2021-08-05 | Paper |
| Alliances in graphs of bounded clique-width | 2021-06-07 | Paper |
| Longest common subsequence in sublinear space | 2021-03-11 | Paper |
| Vertex Deletion Problems on Chordal Graphs | 2020-11-25 | Paper |
| Subgraph isomorphism on graph classes that exclude a substructure | 2020-11-11 | Paper |
| Symmetric assembly puzzles are hard, beyond a few pieces | 2020-10-23 | Paper |
| Parameterized Complexity of Safe Set | 2020-09-04 | Paper |
| Independent set reconfiguration parameterized by modular-width | 2020-09-03 | Paper |
| Reconfiguration of Colorable Sets in Classes of Perfect Graphs | 2020-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116488 | 2020-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3305723 | 2020-08-11 | Paper |
| Space-Efficient Algorithms for Longest Increasing Subsequence | 2020-08-05 | Paper |
| Exact algorithms for the max-min dispersion problem | 2020-07-07 | Paper |
| Parameterized orientable deletion | 2020-05-21 | Paper |
| Space-efficient algorithms for longest increasing subsequence | 2020-04-15 | Paper |
| Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph | 2020-04-07 | Paper |
| Independent set reconfiguration parameterized by modular-width | 2020-02-24 | Paper |
| Subgraph isomorphism on graph classes that exclude a substructure | 2020-02-06 | Paper |
| Parameterized complexity of safe set | 2020-02-06 | Paper |
| A lower bound on opaque sets | 2019-10-18 | Paper |
| Linear-Time Recognition of Double-Threshold Graphs | 2019-09-20 | Paper |
| On structural parameterizations of firefighting | 2019-06-06 | Paper |
| Reconfiguration of colorable sets in classes of perfect graphs | 2019-05-17 | Paper |
| On the classes of interval graphs of limited nesting and count of lengths | 2019-04-25 | Paper |
| How Bad is the Freedom to Flood-It? | 2019-02-14 | Paper |
| Safe sets in graphs: graph classes and structural parameters | 2018-12-06 | Paper |
| Vertex deletion problems on chordal graphs | 2018-09-24 | Paper |
| Computational complexity of robot arm simulation problems | 2018-09-06 | Paper |
| Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity | 2018-07-25 | Paper |
| On structural parameterizations of firefighting | 2018-06-05 | Paper |
| Swapping colored tokens on graphs | 2018-05-17 | Paper |
| On the Classes of Interval Graphs of Limited Nesting and Count of Lengths | 2018-04-19 | Paper |
| Degree-constrained orientation of maximum satisfaction: Graph classes and parameterized complexity | 2018-04-19 | Paper |
| A faster parameterized algorithm for pseudoforest deletion | 2018-04-10 | Paper |
| Induced minor free graphs: isomorphism and clique-width | 2018-02-28 | Paper |
| A Lower Bound on Opaque Sets | 2018-01-30 | Paper |
| A faster parameterized algorithm for pseudoforest deletion | 2018-01-11 | Paper |
| Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph | 2017-10-23 | Paper |
| Extending partial representations of interval graphs | 2017-10-09 | Paper |
| Extending partial representations of proper and unit interval graphs | 2017-05-02 | Paper |
| Safe Sets in Graphs: Graph Classes and Structural Parameters | 2017-02-01 | Paper |
| Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces | 2017-02-01 | Paper |
| Ferrers dimension of grid intersection graphs | 2016-11-24 | Paper |
| Thin strip graphs | 2016-11-24 | Paper |
| Induced minor free graphs: isomorphism and clique-width | 2016-10-21 | Paper |
| Finding a chain graph in a bipartite permutation graph | 2016-05-18 | Paper |
| A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares | 2016-01-18 | Paper |
| Sliding Token on Bipartite Permutation Graphs | 2016-01-11 | Paper |
| Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs | 2015-12-10 | Paper |
| On the treewidth of toroidal grids | 2015-12-07 | Paper |
| Swapping Colored Tokens on Graphs | 2015-10-30 | Paper |
| Competitive Diffusion on Weighted Graphs | 2015-10-30 | Paper |
| Reconfiguration of Cliques in a Graph | 2015-09-30 | Paper |
| Linear-time algorithm for sliding tokens on trees | 2015-09-16 | Paper |
| Polynomial-Time Algorithm for Sliding Tokens on Trees | 2015-09-11 | Paper |
| Depth-First Search Using $$O(n)$$ Bits | 2015-09-11 | Paper |
| Completely independent spanning trees in (partial) \(k\)-trees | 2015-08-04 | Paper |
| Extending partial representations of subclasses of chordal graphs | 2015-05-18 | Paper |
| Base-object location problems for base-monotone regions | 2014-10-06 | Paper |
| Efficient algorithms for network localization using cores of underlying graphs | 2014-09-18 | Paper |
| Lower bounds for treewidth of product graphs | 2014-09-12 | Paper |
| Extending partial representations of proper and unit interval graphs | 2014-09-02 | Paper |
| Reduction Techniques for Graph Isomorphism in the Context of Width Parameters | 2014-09-02 | Paper |
| A 4.31-approximation for the geometric unique coverage problem on unit disks | 2014-07-07 | Paper |
| Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs | 2014-04-16 | Paper |
| Intersection Dimension of Bipartite Graphs | 2014-04-16 | Paper |
| Approximating the path-distance-width for AT-free graphs and graphs in related classes | 2014-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403023 | 2014-03-25 | Paper |
| Bounded Representations of Interval and Proper Interval Graphs | 2014-01-14 | Paper |
| Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes | 2014-01-14 | Paper |
| On Complexity of Flooding Games on Graphs with Interval Representations | 2013-12-06 | Paper |
| Hardness results and an exact exponential algorithm for the spanning tree congestion problem | 2013-11-28 | Paper |
| The path-distance-width of hypercubes | 2013-11-11 | Paper |
| Base Location Problems for Base-Monotone Regions | 2013-04-12 | Paper |
| Isomorphism for Graphs of Bounded Connected-Path-Distance-Width | 2013-03-21 | Paper |
| Extending Partial Representations of Subclasses of Chordal Graphs | 2013-03-21 | Paper |
| A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks | 2013-03-21 | Paper |
| Parameterized complexity of the spanning tree congestion problem | 2012-11-21 | Paper |
| Subgraph isomorphism in graph classes | 2012-10-16 | Paper |
| Designing low-congestion networks with structural graph theory | 2012-09-05 | Paper |
| Spanning tree congestion of rook's graphs | 2012-09-05 | Paper |
| A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares | 2012-08-14 | Paper |
| Efficient enumeration of ordered trees with \(k\) leaves | 2012-08-08 | Paper |
| Random generation and enumeration of bipartite permutation graphs | 2012-05-11 | Paper |
| Approximability of the Path-Distance-Width for AT-free Graphs | 2011-12-16 | Paper |
| Extending partial representations of interval graphs | 2011-07-01 | Paper |
| Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem | 2011-07-01 | Paper |
| Spanning tree congestion of \(k\)-outerplanar graphs | 2011-05-16 | Paper |
| Bandwidth and pathwidth of three-dimensional grids | 2011-05-10 | Paper |
| Complexity Results for the Spanning Tree Congestion Problem | 2010-11-16 | Paper |
| The carving-width of generalized hypercubes | 2010-10-19 | Paper |
| Security number of grid-like graphs | 2010-04-28 | Paper |
| Random Generation and Enumeration of Bipartite Permutation Graphs | 2009-12-17 | Paper |
| On spanning tree congestion of graphs | 2009-12-10 | Paper |
| An improved algorithm for the longest induced path problem on \(k\)-chordal graphs | 2009-03-09 | Paper |
| Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) | 2009-02-24 | Paper |
| A lower bound for the vertex boundary-width of complete \(k\)-ary trees | 2008-05-13 | Paper |
| Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs | 2007-10-29 | Paper |
| An improved spectral lower bound of treewidth | N/A | Paper |
