The Complexity of Counting Surjective Homomorphisms and Compactions. - Jacob Focke; Leslie Ann Goldberg; Stanislav Zivný (SIAM J. Discret. Math., 2019)

Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. - Jacob Focke; Nicole Megow; Julie Meißner (ACM J. Exp. Algorithmics, 2020)

The Complexity of Approximately Counting Retractions. - Jacob Focke; Leslie Ann Goldberg; Stanislav Zivný (ACM Trans. Comput. Theory, 2020)

Counting Homomorphisms to K4-minor-free Graphs, modulo 2. - Jacob Focke; Leslie Ann Goldberg; Marc Roth; Stanislav Zivný (SODA, 2021)

Counting Homomorphisms to K4-Minor-Free Graphs, Modulo 2. - Jacob Focke; Leslie Ann Goldberg; Marc Roth; Stanislav Zivný (SIAM J. Discret. Math., 2021)

The Complexity of Approximately Counting Retractions to Square-free Graphs. - Jacob Focke; Leslie Ann Goldberg; Stanislav Zivný (ACM Trans. Algorithms, 2021)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. - Jacob Focke; Dániel Marx; Fionn Mc Inerney; Daniel Neuen; Govind S. Sankar; Philipp Schepper; Philip Wellnitz (SODA, 2023)

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. - Jacob Focke; Florian Hörsch; Shaohua Li 005; Dániel Marx (SoCG, 2024)

List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs. - Baris Can Esmer; Jacob Focke; Dániel Marx; Pawel Rzazewski (ESA, 2024)

Hitting Meets Packing: How Hard Can It Be? - Jacob Focke; Fabian Frei; Shaohua Li 005; Dániel Marx; Philipp Schepper; Roohani Sharma; Karol Wegrzycki (ESA, 2024)

Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. - Baris Can Esmer; Jacob Focke; Dániel Marx; Pawel Rzazewski (ICALP, 2024)

Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. - Jacob Focke; Leslie Ann Goldberg; Marc Roth; Stanislav Zivný (Proc. ACM Manag. Data, 2024)

Counting Small Induced Subgraphs with Hereditary Properties. - Jacob Focke; Marc Roth (SIAM J. Comput., 2024)

Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds. - Jacob Focke; Dániel Marx; Pawel Rzazewski (ACM Trans. Algorithms, 2024)

Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. - Jacob Focke; Leslie Ann Goldberg; Marc Roth; Stanislav Zivný (ACM Trans. Algorithms, 2025)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. - Jacob Focke; Dániel Marx; Fionn Mc Inerney; Daniel Neuen; Govind S. Sankar; Philipp Schepper; Philip Wellnitz (ACM Trans. Comput. Theory, 2025)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs - Part I: Algorithmic Results. - Jacob Focke; Dániel Marx; Fionn Mc Inerney; Daniel Neuen; Govind S. Sankar; Philipp Schepper; Philip Wellnitz (ACM Trans. Algorithms, 2025)