| Publication | Date of Publication | Type |
|---|
Upward and rectilinear planarity are W[1]-hard parameterized by treewidth
SIAM Journal on Discrete Mathematics | 2026-06-03 | Paper |
| Combining crown structures for vulnerability measures | 2026-05-29 | Paper |
| Subexponential algorithms for clique cover on unit disk and unit ball graphs | 2026-05-29 | Paper |
| PACE solver description: crossy -- an exact solver for one-sided crossing minimization | 2026-05-29 | Paper |
Entanglement generation in QED scattering processes
International Journal of Quantum Information | 2026-05-20 | Paper |
| On coresets for fair clustering in metric and Euclidean spaces and their applications | 2026-05-12 | Paper |
Combining crown structures for vulnerability measures
Algorithmica | 2025-11-25 | Paper |
| Consistency checking problems: a gateway to parameterized sample complexity | 2025-09-24 | Paper |
| The st-planar edge completion problem is fixed-parameter tractable | 2025-07-24 | Paper |
| FPT approximation for fair minimum-load clustering | 2025-06-23 | Paper |
| Longest cycle above Erdős-Gallai bound | 2025-06-19 | Paper |
Parameterized complexity of feature selection for categorical data clustering
ACM Transactions on Computation Theory | 2025-02-24 | Paper |
Fixed-parameter tractability of maximum colored path and beyond
ACM Transactions on Algorithms | 2025-02-21 | Paper |
The fine-grained complexity of graph homomorphism parameterized by clique-width
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| Tree containment above minimum degree is FPT | 2024-11-28 | Paper |
Counting vanishing matrix-vector products
Theoretical Computer Science | 2024-11-18 | Paper |
| Approximating long cycle above Dirac's guarantee | 2024-11-14 | Paper |
Longest cycle above Erdős-Gallai bound
SIAM Journal on Discrete Mathematics | 2024-11-05 | Paper |
| Upward and orthogonal planarity are W[1]-hard parameterized by treewidth | 2024-10-14 | Paper |
Approximating long cycle above Dirac's guarantee
Algorithmica | 2024-08-13 | Paper |
| Long cycles in graphs: extremal combinatorics meets parameterized algorithms (invited talk) | 2024-08-06 | Paper |
| Algorithmic extensions of Dirac's theorem | 2024-07-19 | Paper |
| Counting vanishing matrix-vector products | 2024-07-19 | Paper |
| Weighted model counting with twin-width | 2024-07-12 | Paper |
| The fine-grained complexity of graph homomorphism parameterized by clique-width | 2024-06-24 | Paper |
| Fixed-parameter tractability of maximum colored path and beyond | 2024-05-14 | Paper |
| Parameterized algorithms for upward planarity | 2024-05-14 | Paper |
| Proportionally Fair Matching with Multiple Groups | 2024-05-03 | Paper |
| Turán’s Theorem Through Algorithmic Lens | 2024-05-03 | Paper |
| Detours in directed graphs | 2024-04-23 | Paper |
On coresets for fair clustering in metric and Euclidean spaces and their applications
Journal of Computer and System Sciences | 2024-03-11 | Paper |
Socially fair matching: exact and approximation algorithms
Lecture Notes in Computer Science | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7788495 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7759269 (Why is no real title available?) | 2023-11-02 | Paper |
Low-Rank Binary Matrix Approximation in Column-Sum Norm.
(available as arXiv preprint) | 2023-10-31 | Paper |
How to find a good explanation for clustering?
Artificial Intelligence | 2023-08-28 | Paper |
Lossy kernelization of same-size clustering
Theory of Computing Systems | 2023-08-17 | Paper |
Testing upward planarity of partial 2-trees
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Parameterized Complexity of Feature Selection for Categorical Data Clustering.
(available as arXiv preprint) | 2023-08-08 | Paper |
Detours in directed graphs
Journal of Computer and System Sciences | 2023-07-10 | Paper |
| Parameterized k-Clustering: Tractability Island | 2023-02-03 | Paper |
Building large \(k\)-cores from sparse graphs
Journal of Computer and System Sciences | 2023-01-09 | Paper |
Building large \(k\)-cores from sparse graphs
(available as arXiv preprint) | 2022-07-18 | Paper |
| Longest Cycle above Erd\H{o}s-Gallai Bound | 2022-02-07 | Paper |
Parameterized \(k\)-clustering: tractability island
Journal of Computer and System Sciences | 2021-02-02 | Paper |
