| Publication | Date of Publication | Type |
|---|
Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
Discrete Applied Mathematics | 2025-01-06 | Paper |
Structural parameterizations of vertex integrity
Theoretical Computer Science | 2024-12-12 | Paper |
Polynomial-delay enumeration of large maximal common independent sets in two matroids
| 2024-12-03 | Paper |
Algorithmic meta-theorems for combinatorial reconfiguration revisited
Algorithmica | 2024-10-24 | 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 |
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 |
Optimally computing compressed indexing arrays based on the compact directed acyclic word graph
| 2024-05-29 | Paper |
Reconfiguration of time-respecting arborescences
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Parameterized Complexity of Graph Burning
| 2023-11-13 | Paper |
Polynomial-delay and polynomial-space enumeration of large maximal matchings
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
On structural parameterizations of Node Kayles
| 2023-03-31 | Paper |
Reconfiguring directed trees in a digraph
| 2023-03-30 | Paper |
Exploring the gap between treedepth and vertex cover through vertex integrity
Lecture Notes in Computer Science | 2023-03-22 | Paper |
scientific article; zbMATH DE number 7650221 (Why is no real title available?)
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650265 (Why is no real title available?)
| 2023-02-03 | Paper |
Reconfiguring (non-spanning) arborescences
Theoretical Computer Science | 2023-01-05 | Paper |
Parameterized Complexity of $$(A,\ell )$$-Path Packing
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Parameterized complexity of graph burning
Algorithmica | 2022-08-03 | Paper |
scientific article; zbMATH DE number 7559431 (Why is no real title available?)
| 2022-07-18 | Paper |
Reconfiguration of regular induced subgraphs
| 2022-07-13 | Paper |
Exploring the gap between treedepth and vertex cover through vertex integrity
Theoretical Computer Science | 2022-05-10 | Paper |
An improved deterministic parameterized algorithm for cactus vertex deletion
Theory of Computing Systems | 2022-05-09 | Paper |
Independent set reconfiguration on directed graphs
| 2022-03-24 | Paper |
Parameterized complexity of \((A,\ell)\)-path packing
Algorithmica | 2022-03-22 | Paper |
An optimal algorithm for bisection for bounded-treewidth graph
| 2021-07-08 | Paper |
Metric learning for ordered labeled trees with \(pq\)-grams
| 2021-07-06 | Paper |
A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs
Theoretical Computer Science | 2021-06-22 | Paper |
Computing the largest bond and the maximum connected cut of a graph
Algorithmica | 2021-04-19 | Paper |
Finding a maximum minimal separator: graph classes and fixed-parameter tractability
Theoretical Computer Science | 2021-04-08 | Paper |
Subgraph isomorphism on graph classes that exclude a substructure
Algorithmica | 2020-11-11 | Paper |
An improved fixed-parameter algorithm for one-page crossing minimization
| 2020-05-27 | Paper |
Algorithms and hardness results for the maximum balanced connected subgraph problem
| 2020-05-13 | Paper |
On Structural Parameterizations of Node Kayles
| 2020-03-26 | Paper |
An improved fixed-parameter algorithm for max-cut parameterized by crossing number
| 2020-02-25 | Paper |
Treedepth Parameterized by Vertex Cover Number.
| 2018-04-10 | Paper |
Improved methods for computing distances between unordered trees using integer programming
| 2018-03-26 | Paper |
Mathematical model for calcium-assisted epidermal homeostasis
Journal of Theoretical Biology | 2016-09-01 | Paper |
Computing directed pathwidth in \(O(1.89^n)\) time
Algorithmica | 2016-06-28 | Paper |
A faster fixed parameter algorithm for two-layer crossing minimization
Information Processing Letters | 2016-05-18 | Paper |
On the pathwidth of almost semicomplete digraphs
Algorithms - ESA 2015 | 2015-11-19 | Paper |
A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
Algorithmica | 2015-09-02 | Paper |
Computing the pathwidth of directed graphs with small vertex cover
Information Processing Letters | 2014-12-09 | Paper |
A linear edge kernel for two-layer crossing minimization
Theoretical Computer Science | 2014-10-06 | Paper |
A linear edge kernel for two-layer crossing minimization
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Computing Directed Pathwidth in O(1.89 n ) Time
Parameterized and Exact Computation | 2013-01-07 | Paper |
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
Algorithms – ESA 2012 | 2012-09-25 | Paper |
\(k\)-cyclic orientations of graphs
Algorithms and Computation | 2010-12-09 | Paper |
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
| N/A | Paper |
