| Publication | Date of Publication | Type |
|---|
| Graph coloring below guarantees via co-triangle packing | 2026-10-01 | Paper |
| Faster edge coloring by partition sieving | 2026-06-24 | Paper |
| Faster algorithms on linear delta-matroids | 2026-06-24 | Paper |
| Subexponential algorithms for clique cover on unit disk and unit ball graphs | 2026-05-29 | Paper |
| A polynomial time algorithm for Steiner tree when terminals avoid a rooted K₄-minor | 2026-05-29 | Paper |
| Binary matrix completion under diameter constraints | 2026-04-21 | Paper |
Determinantal sieving
TheoretiCS | 2025-10-22 | Paper |
The complexity of finding fair many-to-one matchings
ACM Transactions on Algorithms | 2025-07-22 | Paper |
| Vertex cover and feedback vertex set above and below structural guarantees | 2025-06-23 | Paper |
Structural parameterizations of the biclique-free vertex deletion problem
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2025-05-07 | Paper |
| Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication | 2025-01-06 | Paper |
| Correlating theory and practice in finding clubs and plexes | 2025-01-06 | Paper |
| FPT approximation and subexponential algorithms for covering few or many edges | 2024-12-03 | Paper |
| Determinantal sieving | 2024-11-28 | Paper |
| Induced matching below guarantees: average paves the way for fixed-parameter tractability | 2024-10-08 | Paper |
| The complexity of finding fair many-to-one matchings | 2024-06-24 | Paper |
| Covering many (or few) edges with \(k\) vertices in sparse graphs | 2024-04-23 | Paper |
FPT approximation and subexponential algorithms for covering few or many edges
Information Processing Letters | 2024-03-13 | Paper |
| The PACE 2021 parameterized algorithms and computational experiments challenge: cluster editing | 2024-02-12 | Paper |
| Essentially tight kernels for (weakly) closed graphs | 2024-01-15 | 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 7765378 (Why is no real title available?) | 2023-11-14 | Paper |
| Parameterized Complexity of Geodetic Set | 2023-11-13 | Paper |
Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
Algorithmic Game Theory | 2023-07-28 | 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 |
Parameterized Algorithms for Matrix Completion with Radius Constraints.
(available as arXiv preprint) | 2023-02-07 | Paper |
| Exploiting c-Closure in Kernelization Algorithms for Graph Problems | 2023-02-07 | Paper |
The complexity of binary matrix completion under diameter constraints
Journal of Computer and System Sciences | 2023-01-09 | Paper |
Exploiting c-closure in kernelization algorithms for graph problems
SIAM Journal on Discrete Mathematics | 2022-11-15 | Paper |
Parameterized complexity of geodetic set
Journal of Graph Algorithms and Applications | 2022-11-14 | Paper |
The complexity of gerrymandering over graphs: paths and trees
Discrete Applied Mathematics | 2022-11-11 | Paper |
Data Reduction for Maximum Matching on Real-World Graphs
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
The complexity of gerrymandering over graphs: paths and trees
Graph-Theoretic Concepts in Computer Science | 2022-06-08 | Paper |
Detecting and enumerating small induced subgraphs in c-closed graphs
Discrete Applied Mathematics | 2021-08-02 | Paper |
Parameterized complexity of min-power asymmetric connectivity
Theory of Computing Systems | 2021-06-11 | Paper |
Parameterized complexity of min-power asymmetric connectivity
Lecture Notes in Computer Science | 2020-02-25 | Paper |
