| Publication | Date of Publication | Type |
|---|
The parameter report: an orientation guide for data-driven parameterization
Journal of Graph Algorithms and Applications | 2026-09-25 | Paper |
| Timeline problems in temporal graphs: vertex cover vs. dominating set | 2026-09-23 | Paper |
Temporal dominating set and temporal vertex cover under the lens of degree restrictions
Theoretical Computer Science | 2026-09-14 | Paper |
| Polynomial-size enumeration kernelizations for long path enumeration | 2026-07-10 | Paper |
| Maximizing phylogenetic diversity under ecological constraints: a parameterized complexity study | 2026-06-12 | Paper |
| When can cluster deletion with bounded weights be solved efficiently? | 2026-06-08 | Paper |
| Modularity clustering parameterized by max leaf number | 2026-05-29 | Paper |
| SubModST: a fast generic solver for submodular maximization with size constraints | 2026-05-26 | Paper |
| On the complexity of community-aware network sparsification | 2026-05-12 | Paper |
| Refined notions of parameterized enumeration kernels with applications to matching cut enumeration | 2026-04-21 | Paper |
| Colored cut games | 2026-03-23 | Paper |
When can cluster deletion with bounded weights be solved efficiently?
Discrete Applied Mathematics | 2026-02-24 | Paper |
A multivariate complexity analysis of the generalized Noah's ark problem
Discrete Applied Mathematics | 2026-02-11 | Paper |
| A multivariate complexity analysis of the generalized Noah's ark problem | 2025-11-17 | Paper |
| Parameterized local search for vertex cover: when only the search radius is crucial | 2025-06-23 | Paper |
Finding 3-swap-optimal independent sets and dominating sets is hard
ACM Transactions on Computation Theory | 2025-04-23 | Paper |
| Protective and nonprotective subset sum games: a parameterized complexity analysis | 2025-03-25 | Paper |
Can local optimality be used for efficient data reduction?
Theory of Computing Systems | 2025-02-28 | Paper |
Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs
Journal of Combinatorial Optimization | 2024-12-03 | Paper |
| On the complexity of computing time series medians under the move-split-merge metric | 2024-12-03 | Paper |
| On the complexity of parameterized local search for the maximum parsimony problem | 2024-10-21 | Paper |
On critical node problems with vulnerable vertices
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
The role of twins in computing planar supports of hypergraphs
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
| Finding 3-swap-optimal independent sets and dominating sets is hard | 2024-08-06 | Paper |
| Covering many (or few) edges with \(k\) vertices in sparse graphs | 2024-04-23 | Paper |
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs
Discrete Mathematics & Theoretical Computer Science | 2024-04-18 | Paper |
| Essentially tight kernels for (weakly) closed graphs | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7765378 (Why is no real title available?) | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7759294 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-02 | Paper |
The parameterized complexity of \(s\)-club with triangle and seed constraints
Theory of Computing Systems | 2023-10-30 | Paper |
Computing dense and sparse subgraphs of weakly closed graphs
Algorithmica | 2023-06-28 | Paper |
Essentially tight kernels for (weakly) closed graphs
Algorithmica | 2023-06-05 | Paper |
| Can local optimality be used for efficient data reduction? | 2023-03-22 | Paper |
On computing exact means of time series using the move-split-merge metric
Data Mining and Knowledge Discovery | 2023-02-28 | Paper |
| scientific article; zbMATH DE number 7651108 (Why is no real title available?) | 2023-02-07 | Paper |
| Exploiting c-Closure in Kernelization Algorithms for Graph Problems | 2023-02-07 | Paper |
Exploiting c-closure in kernelization algorithms for graph problems
SIAM Journal on Discrete Mathematics | 2022-11-15 | Paper |
Colored cut games
Theoretical Computer Science | 2022-10-21 | Paper |
Refined parameterizations for computing colored cuts in edge-colored graphs
Theory of Computing Systems | 2022-10-04 | Paper |
Destroying Bicolored $P_3$s by Deleting Few Edges
Discrete Mathematics & Theoretical Computer Science | 2022-09-30 | Paper |
The parameterized complexity of \(s\)-club with triangle and seed constraints
(available as arXiv preprint) | 2022-08-30 | Paper |
| On critical node problems with vulnerable vertices | 2022-08-30 | Paper |
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
Journal of Artificial Intelligence Research | 2022-08-02 | Paper |
Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges
(available as arXiv preprint) | 2022-06-08 | Paper |
| Sorting by multi-cut rearrangements | 2022-03-24 | Paper |
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
Journal of Computer and System Sciences | 2021-10-28 | Paper |
Enumerating connected induced subgraphs: improved delay and experimental comparison
Discrete Applied Mathematics | 2021-09-15 | Paper |
| scientific article; zbMATH DE number 7378605 (Why is no real title available?) | 2021-08-04 | Paper |
Solving partition problems almost always requires pushing many vertices around
(available as arXiv preprint) | 2021-08-04 | Paper |
Your rugby mates don't need to know your colleagues: triadic closure with edge colors
Journal of Computer and System Sciences | 2021-06-30 | Paper |
FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
On the maximum colorful arborescence problem and color hierarchy graph structure
(available as arXiv preprint) | 2020-12-16 | Paper |
Revisiting the parameterized complexity of maximum-duo preservation string mapping
Theoretical Computer Science | 2020-11-06 | Paper |
Enumerating connected induced subgraphs: improved delay and experimental comparison
SOFSEM 2019: Theory and Practice of Computer Science | 2020-10-22 | Paper |
Graph motif problems parameterized by dual
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
Refined parameterizations for computing colored cuts in edge-colored graphs
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
Discrete Applied Mathematics | 2020-06-29 | Paper |
Parameterized algorithms for module map problems
Discrete Applied Mathematics | 2020-06-29 | Paper |
| The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration | 2020-05-27 | Paper |
| Revisiting the parameterized complexity of maximum-duo preservation string mapping | 2020-05-25 | Paper |
| scientific article; zbMATH DE number 7203332 (Why is no real title available?) | 2020-05-25 | Paper |
Destroying bicolored \(P_3\)s by deleting few edges
(available as arXiv preprint) | 2020-05-12 | Paper |
Solving partition problems almost always requires pushing many vertices around
SIAM Journal on Discrete Mathematics | 2020-03-11 | Paper |
On the relation of strong triadic closure and cluster deletion
Algorithmica | 2020-02-28 | Paper |
Your rugby mates don't need to know your colleagues: triadic closure with edge colors
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Tight running time lower bounds for vertex deletion problems
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
| Approximation algorithms for mixed, windy, and capacitated arc routing problems | 2019-10-24 | Paper |
| Multivariate algorithmics for NP-hard string problems | 2019-07-03 | Paper |
Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
When can graph hyperbolicity be computed in linear time?
Algorithmica | 2019-05-07 | Paper |
The parameterized complexity of the rainbow subgraph problem
Algorithms | 2019-03-26 | Paper |
Finding supported paths in heterogeneous networks
Algorithms | 2019-03-26 | Paper |
Multivariate algorithmics for finding cohesive subnetworks
Algorithms | 2019-03-26 | Paper |
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
European Journal of Operational Research | 2019-02-11 | Paper |
On the relation of strong triadic closure and cluster deletion
Lecture Notes in Computer Science | 2018-11-22 | Paper |
Parameterized algorithms for module map problems
Lecture Notes in Computer Science | 2018-08-17 | Paper |
Parameterizing edge modification problems above lower bounds
Theory of Computing Systems | 2018-06-01 | Paper |
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
Journal of Computer and System Sciences | 2017-11-14 | Paper |
| Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs | 2017-10-17 | Paper |
Graph motif problems parameterized by dual
(available as arXiv preprint) | 2017-10-17 | Paper |
Parameterized complexity of critical node cuts
(available as arXiv preprint) | 2017-09-29 | Paper |
When can graph hyperbolicity be computed in linear time?
Lecture Notes in Computer Science | 2017-09-22 | Paper |
When can graph hyperbolicity be computed in linear time?
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Assessing the computational complexity of multi-layer subgraph detection
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Assessing the computational complexity of multi-layer subgraph detection
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Parameterized complexity of critical node cuts
Theoretical Computer Science | 2017-03-16 | Paper |
Twins in Subdivision Drawings of Hypergraphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
\(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments
Artificial Intelligence | 2016-10-21 | Paper |
Parameterizing edge modification problems above lower bounds
Lecture Notes in Computer Science | 2016-07-25 | Paper |
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets
Journal of Discrete Algorithms | 2016-07-15 | Paper |
Polynomial-time data reduction for the subset interconnection design problem
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
On the Sound Covering Cycle Problem in Paired de Bruijn Graphs
Frontiers in Algorithmics | 2015-11-12 | Paper |
Editing graphs into few cliques: complexity, approximation, and kernelization schemes
Lecture Notes in Computer Science | 2015-10-30 | Paper |
The parameterized complexity of the rainbow subgraph problem
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
Discrete Applied Mathematics | 2015-07-24 | Paper |
| Well-Formed Separator Sequences, with an Application to Hypergraph Drawing | 2015-07-08 | Paper |
| A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments | 2015-06-18 | Paper |
Towards an algorithmic guide to Spiral Galaxies
Theoretical Computer Science | 2015-05-26 | Paper |
On structural parameterizations for the 2-club problem
Discrete Applied Mathematics | 2015-04-28 | Paper |
Parameterized algorithmics and computational experiments for finding 2-clubs
Journal of Graph Algorithms and Applications | 2015-04-22 | Paper |
