| 2026 | MFCS | Counting Equitable k-Colorings in Graphs of Bounded Clique-Width. | Holger Dell, Thore Husfeldt, Amir Nikabadi |
| 2026 | SODA | The Parameterised Complexity of Counting Small Sub-Hypergraphs. | Marco Bressan, Julian Christoph Brinkmann, Holger Dell, Marc Roth, Philip Wellnitz |
| 2025 | SODA | Solving Polynomial Equations Over Finite Fields. | Holger Dell, Anselm Haak, Melvin Kallmayer, Leo Wennmann |
| 2024 | ICALP | Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs. | Holger Dell, John Lapinskas, Kitty Meeks |
| 2021 | ESA | Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. | Radu Curticapean, Holger Dell, Thore Husfeldt |
| 2020 | SODA | Approximately counting and sampling small witnesses using a colourful decision oracle. | Holger Dell, John Lapinskas, Kitty Meeks |
| 2019 | ICALP | Counting Answers to Existential Questions. | Holger Dell, Marc Roth, Philip Wellnitz |
| 2019 | WG | The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. | Hubie Chen, Radu Curticapean, Holger Dell |
| 2018 | ICALP | Lovsz Meets Weisfeiler and Leman. | Holger Dell, Martin Grohe, Gaurav Rattan |
| 2018 | STOC | More consequences of falsifying SETH and the orthogonal vectors conjecture. | Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof |
| 2018 | STOC | Extensor-coding. | Cornelius Brand, Holger Dell, Thore Husfeldt |
| 2018 | STOC | Fine-grained reductions from approximate counting to decision. | Holger Dell, John Lapinskas |
| 2017 | ICALP | Finding Detours is Fixed-Parameter Tractable. | Ivona Bezkov, Radu Curticapean, Holger Dell, Fedor V. Fomin |
| 2017 | STOC | Homomorphisms are a good basis for counting small subgraphs. | Radu Curticapean, Holger Dell, Dniel Marx |
| 2017 | STACS | Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes. | Radu Curticapean, Holger Dell, Marc Roth |
| 2015 | ICALP | The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems. | Andreas Bjrklund, Holger Dell, Thore Husfeldt |
| 2012 | SODA | Kernelization of packing problems. | Holger Dell, Dniel Marx |
| 2010 | ICALP | Exponential Time Complexity of the Permanent and the Tutte Polynomial. | Holger Dell, Thore Husfeldt, Martin Wahlen |
| 2010 | STOC | Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. | Holger Dell, Dieter van Melkebeek |
| 2008 | CSR | Complexity of the Bollobs-Riordan Polynomial. | Markus Blser, Holger Dell, Johann A. Makowsky |
| 2007 | ICALP | Complexity of the Cover Polynomial. | Markus Blser, Holger Dell |