| Publication | Date of Publication | Type |
|---|
Fair short paths in vertex-colored graphs
Theoretical Computer Science | 2026-09-29 | Paper |
| Fault-tolerant matroid bases | 2026-08-31 | Paper |
On the complexity of minimum membership dominating set
Theoretical Computer Science | 2026-08-25 | Paper |
| When distances lie: Euclidean embeddings in the presence of outliers and distance violations | 2026-08-11 | Paper |
| When does FTP become FPT? | 2026-07-10 | Paper |
| Tight approximation and kernelization bounds for vertex-disjoint shortest paths | 2026-06-24 | Paper |
When does FTP become FPT??
Theoretical Computer Science | 2026-06-15 | Paper |
| The parameterized complexity landscape of two-sets cut-uncut | 2026-05-29 | Paper |
| PACE solver description: lunch -- linear uncrossing heuristics | 2026-05-29 | Paper |
| Breaking a graph into connected components with small dominating sets | 2026-05-12 | Paper |
| Using a geometric Lens to find k disjoint shortest paths | 2026-05-12 | Paper |
Tight approximation and kernelization bounds for vertex-disjoint shortest paths
Theory of Computing Systems | 2026-04-27 | Paper |
The parameterized complexity landscape of two-sets cut-uncut
Theoretical Computer Science | 2026-02-04 | Paper |
| Two-sets cut-uncut on planar graphs | 2026-01-14 | Paper |
| Correlation clustering with vertex splitting | 2025-12-02 | Paper |
| On the complexity of finding a sparse connected spanning subgraph in a non-uniform failure model | 2025-09-24 | Paper |
| Cluster editing with overlapping communities | 2025-09-24 | Paper |
Cluster editing with vertex splitting
Discrete Applied Mathematics | 2025-05-19 | Paper |
| Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication | 2025-01-06 | Paper |
Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
Games and Economic Behavior | 2024-01-11 | Paper |
| scientific article; zbMATH DE number 7765394 (Why is no real title available?) | 2023-11-14 | Paper |
A multivariate complexity analysis of the material consumption scheduling problem
Journal of Scheduling | 2023-08-28 | Paper |
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths
SIAM Journal on Discrete Mathematics | 2023-08-11 | Paper |
Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
Algorithmic Game Theory | 2023-07-28 | Paper |
On reachable assignments in cycles
(available as arXiv preprint) | 2023-03-31 | Paper |
Polynomial-time data reduction for weighted problems beyond additive goal functions
Discrete Applied Mathematics | 2023-02-22 | Paper |
Parameterized complexity of diameter
Algorithmica | 2023-02-16 | Paper |
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks
Algorithms for Sensor Systems | 2022-12-09 | Paper |
The complexity of gerrymandering over graphs: paths and trees
Discrete Applied Mathematics | 2022-11-11 | Paper |
The structural complexity landscape of finding balance-fair shortest paths
Theoretical Computer Science | 2022-09-27 | Paper |
| An Adaptive Version of Brandes' Algorithm for Betweenness Centrality | 2022-07-21 | Paper |
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
INFORMS Journal on Computing | 2022-06-28 | Paper |
Tree containment with soft polytomies
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
The complexity of gerrymandering over graphs: paths and trees
Graph-Theoretic Concepts in Computer Science | 2022-06-08 | Paper |
Length-bounded cuts: proper interval graphs and structural parameters
Journal of Computer and System Sciences | 2022-03-29 | Paper |
Parameterized complexity of min-power asymmetric connectivity
Theory of Computing Systems | 2021-06-11 | Paper |
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
Journal of Graph Algorithms and Applications | 2020-11-05 | Paper |
| scientific article; zbMATH DE number 7238964 (Why is no real title available?) | 2020-08-25 | Paper |
Parameterized complexity of min-power asymmetric connectivity
Lecture Notes in Computer Science | 2020-02-25 | Paper |
Parameterized complexity of diameter
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
Journal of Scheduling | 2019-10-08 | Paper |
Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions
(available as arXiv preprint) | 2019-10-01 | Paper |
Parameterized aspects of triangle enumeration
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Parameterized aspects of triangle enumeration
Lecture Notes in Computer Science | 2017-11-22 | Paper |
