| Publication | Date of Publication | Type |
|---|
| List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs | 2026-05-26 | Paper |
| Hitting meets packing: how hard can it be? | 2026-05-26 | Paper |
Counting answers to unions of conjunctive queries: natural tractability criteria and meta-complexity
ACM Transactions on Computational Logic | 2026-03-26 | Paper |
| Fundamental problems on bounded-treewidth graphs: the real source of hardness | 2026-01-14 | Paper |
| Multicut problems in embedded graphs: the dependency of complexity on the demand pattern | 2025-11-24 | Paper |
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. I: Algorithmic results
ACM Transactions on Algorithms | 2025-10-01 | Paper |
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. II: Hardness results
ACM Transactions on Computation Theory | 2025-08-01 | Paper |
Approximately counting answers to conjunctive queries with disequalities and negations
ACM Transactions on Algorithms | 2025-02-21 | Paper |
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds | 2024-07-19 | Paper |
| Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs | 2024-05-14 | Paper |
Counting Small Induced Subgraphs with Hereditary Properties
SIAM Journal on Computing | 2024-03-19 | Paper |
| scientific article; zbMATH DE number 7788475 (Why is no real title available?) | 2024-01-15 | Paper |
Counting small induced subgraphs with hereditary properties
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Counting small induced subgraphs with hereditary properties
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments
ACM Journal of Experimental Algorithmics | 2023-05-23 | Paper |
The complexity of approximately counting retractions
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
The Complexity of Approximately Counting Retractions to Square-free Graphs
ACM Transactions on Algorithms | 2022-02-16 | Paper |
Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2
SIAM Journal on Discrete Mathematics | 2021-12-01 | Paper |
The complexity of approximately counting retractions
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
The complexity of counting surjective homomorphisms and compactions
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
| Minimum spanning tree under explorable uncertainty in theory and experiments | 2018-08-13 | Paper |
| The complexity of counting surjective homomorphisms and compactions | 2018-03-15 | Paper |
The complexity of counting surjective homomorphisms and compactions
(available as arXiv preprint) | 2018-03-15 | Paper |
