| Publication | Date of Publication | Type |
|---|
| Kernelization for spreading points | 2025-01-06 | Paper |
| Lossy kernelization for (implicit) hitting set problems | 2025-01-06 | Paper |
| Finding long directed cycles is hard even when DFVS is small or girth is large | 2025-01-06 | Paper |
| Parameterized results on acyclic matchings with implications for related problems | 2024-12-27 | Paper |
| Parameterized analysis of the Cops and Robber game | 2024-12-03 | Paper |
| Meta-theorems for parameterized streaming algorithms | 2024-11-28 | Paper |
| (Re)packing equal disks into rectangle | 2024-11-22 | Paper |
| On computing homological hitting sets | 2024-09-25 | Paper |
| New algorithms for structure informed genome rearrangement | 2024-08-13 | Paper |
| Deleting, eliminating and decomposing to hereditary classes are all FPT-equivalent | 2024-07-19 | Paper |
| Subexponential Parameterized algorithms on disk graphs (extended abstract) | 2024-07-19 | Paper |
| (Re)packing equal disks into rectangle | 2024-06-24 | Paper |
| Long directed detours: reduction to 2-disjoint paths | 2024-06-07 | Paper |
| A framework for approximation schemes on disk graphs | 2024-05-14 | Paper |
| The parameterized complexity of guarding almost convex polygons | 2024-02-09 | Paper |
| An ETH-tight algorithm for bidirected Steiner connectivity | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147260 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147261 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147539 | 2024-01-15 | Paper |
| ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs | 2023-11-02 | Paper |
| Parameterized Study of Steiner Tree on Unit Disk Graphs | 2023-11-02 | Paper |
| Parameter analysis for guarding terrains | 2023-11-02 | Paper |
| The Parameterized Complexity of Guarding Almost Convex Polygons. | 2023-11-02 | Paper |
| Polynomial Kernel for Interval Vertex Deletion | 2023-10-23 | Paper |
| Erdős–Pósa property of obstructions to interval graphs | 2023-10-09 | Paper |
| Parameterized approaches to orthogonal compaction | 2023-08-14 | Paper |
| $\mathcal{P}$-matchings Parameterized by Treewidth | 2023-07-18 | Paper |
| Parameterized Results on Acyclic Matchings with Implications for Related Problems | 2023-07-11 | Paper |
| Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number | 2023-06-28 | Paper |
| Grid recognition: classical and parameterized computational perspectives | 2023-06-12 | Paper |
| Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems | 2023-04-26 | Paper |
| Parameterized study of Steiner tree on unit disk graphs | 2023-04-21 | Paper |
| Approximate search for known gene clusters in new genomes using PQ-trees | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875748 | 2023-02-03 | Paper |
| Parameterization Above a Multiplicative Guarantee | 2023-02-03 | Paper |
| Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths | 2022-10-19 | Paper |
| Parameterized Analysis of Art Gallery and Terrain Guarding | 2022-10-19 | Paper |
| Graph Hamiltonicity parameterized by proper interval deletion set | 2022-10-13 | Paper |
| Parameterized complexity of multi-node hubs | 2022-10-13 | Paper |
| Multiplicative Parameterization Above a Guarantee | 2022-09-24 | Paper |
| Parameterized analysis and crossing minimization problems | 2022-09-16 | Paper |
| Decomposition of Map Graphs with Applications. | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091216 | 2022-07-21 | Paper |
| Approximate Counting of k-Paths: Deterministic and in Polynomial Space | 2022-07-21 | Paper |
| Packing Arc-Disjoint Cycles in Tournaments | 2022-07-21 | Paper |
| A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs | 2022-07-21 | Paper |
| Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number | 2022-07-21 | Paper |
| Connecting the dots (with minimum crossings) | 2022-07-18 | Paper |
| Resolute control: forbidding candidates from winning an election is hard | 2022-05-31 | Paper |
| ETH-tight algorithms for long path and cycle on unit disk graphs | 2022-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075790 | 2022-05-11 | Paper |
| Parameter analysis for guarding terrains | 2022-03-22 | Paper |
| Computation of Hadwiger number and related contraction problems. Tight lower bounds | 2022-03-22 | Paper |
| Popular matching in roommates setting is NP-hard | 2022-03-22 | Paper |
| On treewidth and stable marriage: parameterized algorithms and hardness results (complete characterization) | 2022-03-15 | Paper |
| Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space | 2022-02-16 | Paper |
| r -Simple k -Path and Related Problems Parameterized by k / r | 2022-02-08 | Paper |
| Parameterized Algorithms | 2022-02-04 | Paper |
| Popular matching in roommates setting is \textsf{NP}-hard | 2021-08-30 | Paper |
| Balanced stable marriage: how close is close enough? | 2021-08-27 | Paper |
| Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems | 2021-08-04 | Paper |
| Parameterized complexity of multi-node hubs | 2021-08-04 | Paper |
| Brief announcement: Treewidth modulator: emergency exit for DFVS | 2021-07-28 | Paper |
| Reducing CMSO model checking to highly connected graphs | 2021-07-28 | Paper |
| Quasipolynomial representation of transversal matroids with applications in parameterized complexity | 2021-06-15 | Paper |
| A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs | 2021-06-11 | Paper |
| Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms | 2021-05-03 | Paper |
| Packing arc-disjoint cycles in tournaments | 2021-04-19 | Paper |
| Simultaneous feedback edge set: a parameterized perspective | 2021-03-26 | Paper |
| Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs | 2021-02-02 | Paper |
| Parameterized Complexity and Approximability of Directed Odd Cycle Transversal | 2021-02-02 | Paper |
| An exponential time parameterized algorithm for planar disjoint paths | 2021-01-19 | Paper |
| Hitting topological minors is FPT | 2021-01-19 | Paper |
| Balanced judicious bipartition is fixed-parameter tractable | 2020-11-25 | Paper |
| Revisiting the parameterized complexity of maximum-duo preservation string mapping | 2020-11-06 | Paper |
| The parameterized complexity of motion planning for snake-like robots | 2020-11-03 | Paper |
| Going far from degeneracy | 2020-10-29 | Paper |
| Erdös-Pósa Property of Obstructions to Interval Graphs | 2020-08-05 | Paper |
| Packing cycles faster than Erdős-Pósa | 2020-05-27 | Paper |
| Finding, hitting and packing cycles in subexponential time on unit disk graphs | 2020-05-27 | Paper |
| Parameterized Algorithms and Kernels for Rainbow Matching | 2020-05-26 | Paper |
| Revisiting the parameterized complexity of maximum-duo preservation string mapping | 2020-05-25 | Paper |
| Quadratic vertex kernel for rainbow matching | 2020-02-28 | Paper |
| Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree} | 2020-02-27 | Paper |
| The parameterized complexity of cycle packing: indifference is not an issue | 2020-02-12 | Paper |
| Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS | 2020-01-16 | Paper |
| Balanced stable marriage: how close is close enough? | 2020-01-16 | Paper |
| Split contraction: the untold story | 2019-12-16 | Paper |
| Finding, hitting and packing cycles in subexponential time on unit disk graphs | 2019-11-07 | Paper |
| Balanced Judicious Bipartition is Fixed-Parameter Tractable | 2019-10-28 | Paper |
| The parameterized complexity landscape of finding 2-partitions of digraphs | 2019-10-18 | Paper |
| On \(r\)-simple \(k\)-path and related problems parameterized by \(k/r\) | 2019-10-15 | Paper |
| Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity | 2019-10-15 | Paper |
| Interval vertex deletion admits a polynomial kernel | 2019-10-15 | Paper |
| Popular matching in roommates setting is NP-hard | 2019-10-15 | Paper |
| Parameterized computational geometry via decomposition theorems | 2019-10-15 | Paper |
| Parameterised algorithms for deletion to classes of DAGs | 2019-09-05 | Paper |
| Packing cycles faster than Erdős-Pósa | 2019-08-29 | Paper |
| Rank vertex cover as a natural problem for algebraic compression | 2019-08-29 | Paper |
| The parameterized complexity of cycle packing: indifference is not an issue | 2019-08-20 | Paper |
| Some hard stable marriage problems: a survey on multivariate analysis | 2019-05-28 | Paper |
| Improved parameterized algorithms for network query problems | 2019-05-17 | Paper |
| Parameterized algorithms and kernels for rainbow matching | 2019-04-25 | Paper |
| Subquadratic kernels for implicit 3-{\textsc{Hitting Set}} and 3-{\textsc{Set Packing}} problems | 2019-03-28 | Paper |
| Feedback vertex set inspired kernel for chordal vertex deletion | 2019-03-28 | Paper |
| Clique-width. III: Hamiltonian cycle and the odd case of graph coloring | 2019-03-28 | Paper |
| Parameterized algorithms for list \(K\)-cycle | 2019-03-11 | Paper |
| Kernelization. Theory of parameterized preprocessing | 2019-01-14 | Paper |
| \textsc{Max-Cut Above Spanning Tree} is fixed-parameter tractable | 2018-11-28 | Paper |
| Exact algorithms for terrain guarding | 2018-11-13 | Paper |
| Long directed \((s,t)\)-path: FPT algorithm | 2018-10-19 | Paper |
| \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel | 2018-10-18 | Paper |
| Exact algorithms for terrain guarding | 2018-08-13 | Paper |
| Feedback vertex set inspired kernel for chordal vertex deletion | 2018-07-16 | Paper |
| Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials | 2018-05-08 | Paper |
| Matrix Rigidity from the Viewpoint of Parameterized Complexity | 2018-05-02 | Paper |
| Simultaneous feedback edge set: a parameterized perspective | 2018-04-19 | Paper |
| Kernels for deletion to classes of acyclic digraphs | 2018-04-19 | Paper |
| Parameterized Algorithms for List K-Cycle | 2018-04-19 | Paper |
| Matrix Rigidity from the Viewpoint of Parameterized Complexity | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636602 | 2018-04-19 | Paper |
| Parameterized algorithms for stable matching with ties and incomplete lists | 2018-04-04 | Paper |
| Copy-number evolution problems: complexity and algorithms | 2018-03-23 | Paper |
| Parameterized algorithms for survivable network design with uniform demands | 2018-03-15 | Paper |
| Cliquewidth III: the odd case of graph coloring parameterized by cliquewidth | 2018-03-15 | Paper |
| Subquadratic kernels for implicit 3-hitting set and 3-set packing problems | 2018-03-15 | Paper |
| Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms | 2018-03-15 | Paper |
| Group activity selection on graphs: parameterized analysis | 2018-02-13 | Paper |
| The \(k\)-leaf spanning tree problem admits a klam value of 39 | 2017-11-14 | Paper |
| Kernels for deletion to classes of acyclic digraphs | 2017-11-14 | Paper |
| Maximum minimal vertex cover parameterized by vertex cover | 2017-11-02 | Paper |
| A linear-time algorithm for the copy number transformation problem | 2017-10-17 | Paper |
| Parameterized algorithms for graph partitioning problems | 2017-10-12 | Paper |
| A multivariate framework for weighted FPT algorithms | 2017-09-07 | Paper |
| Spotting trees with few leaves | 2017-05-24 | Paper |
| Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs | 2017-05-11 | Paper |
| Parameterized algorithms for the module motif problem | 2016-11-18 | Paper |
| Parameterized approximation algorithms for packing problems | 2016-09-12 | Paper |
| Deterministic parameterized algorithms for the graph motif problem | 2016-09-12 | Paper |
| \((k,n-k)\)-max-cut: an \({\mathcal O}^*(2^p)\)-time algorithm and a polynomial kernel | 2016-05-03 | Paper |
| A randomized algorithm for long directed cycle | 2016-04-06 | Paper |
| The \(k\)-leaf spanning tree problem admits a klam value of 39 | 2016-04-04 | Paper |
| The \(k\)-distinct language: parameterized automata constructions | 2016-02-26 | Paper |
| Representative families: a unified tradeoff-based approach | 2015-12-30 | Paper |
| A multivariate approach for weighted FPT algorithms | 2015-11-19 | Paper |
| Mixing Color Coding-Related Techniques | 2015-11-19 | Paper |
| Spotting trees with few leaves | 2015-10-27 | Paper |
| Deterministic algorithms for matching and packing problems based on representative sets | 2015-10-21 | Paper |
| Maximum minimal vertex cover parameterized by vertex cover | 2015-09-16 | Paper |
| Improved parameterized algorithms for network query problems | 2015-09-15 | Paper |
| The \(k\)-distinct language: parameterized automata constructions | 2015-09-15 | Paper |
| Parameterized algorithms for graph partitioning problems | 2015-09-09 | Paper |
| Partial information network queries | 2015-03-24 | Paper |
| Deterministic parameterized algorithms for the graph motif problem | 2014-10-14 | Paper |
| Representative families: a unified tradeoff-based approach | 2014-10-08 | Paper |
| Algorithms for topology-free and alignment network queries | 2014-07-07 | Paper |
| Partial information network queries | 2014-01-17 | Paper |
| Algorithms for \(k\)-internal out-branching | 2013-12-10 | Paper |
| Parameterized algorithms for module motif | 2013-09-20 | Paper |
