| 2024 | ESA | List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs. | Baris Can Esmer, Jacob Focke, Dniel Marx, Pawel Rzazewski |
| 2024 | ESA | Hitting Meets Packing: How Hard Can It Be? | Jacob Focke, Fabian Frei, Shaohua Li, Dniel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki |
| 2024 | ICALP | Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. | Baris Can Esmer, Jacob Focke, Dniel Marx, Pawel Rzazewski |
| 2023 | SODA | Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. | Jacob Focke, Dniel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz |
| 2022 | PODS | Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. | Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivn |
| 2022 | SODA | Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. | Jacob Focke, Dniel Marx, Pawel Rzazewski |
| 2022 | STOC | Counting small induced subgraphs with hereditary properties. | Jacob Focke, Marc Roth |
| 2021 | SODA | Counting Homomorphisms to | Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivn |
| 2019 | SODA | The Complexity of Approximately Counting Retractions. | Jacob Focke, Leslie Ann Goldberg, Stanislav Zivn |
| 2018 | SODA | The Complexity of Counting Surjective Homomorphisms and Compactions. | Jacob Focke, Leslie Ann Goldberg, Stanislav Zivn |