Holger Dell

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 46

Top Venues

Humboldt University of Berlin (PHD)

Education History

Humboldt University of Berlin

PHD

Publications

Dennis Vetter, Jasper Forth, Gemma Roig, Holger Dell
Fairness Through Controlled (Un)Awareness in Node Embeddings. CoRR (2024)
Holger Dell, John Lapinskas, Kitty Meeks
Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs. ICALP (2024)
Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck
PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). IPEC (2023)
Holger Dell, Mark Richard Jerrum, Haiko Müller, Konrad Anand, Marcus Pappik
Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482). Dagstuhl Reports 12 (11) (2022)
Holger Dell, John Lapinskas, Kitty Meeks
Nearly optimal independence oracle algorithms for edge estimation in hypergraphs. CoRR (2022)
Holger Dell, John Lapinskas, Kitty Meeks
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle. SIAM J. Comput. 51 (4) (2022)
Radu Curticapean, Holger Dell, Thore Husfeldt
Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. ESA (2021)
Radu Curticapean, Holger Dell, Thore Husfeldt
Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths. CoRR (2021)
Holger Dell, John Lapinskas
Fine-Grained Reductions from Approximate Counting to Decision. ACM Trans. Comput. Theory 13 (2) (2021)
Holger Dell, John Lapinskas, Kitty Meeks
Approximately counting and sampling small witnesses using a colourful decision oracle. SODA (2020)
Holger Dell, Marc Roth, Philip Wellnitz
Counting Answers to Existential Questions. ICALP (2019)
Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
A Fixed-Parameter Perspective on #BIS. Algorithmica 81 (10) (2019)
Hubie Chen, Radu Curticapean, Holger Dell
The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. WG (2019)
Holger Dell, John Lapinskas, Kitty Meeks
Approximately counting and sampling small witnesses using a colourful decision oracle. CoRR (2019)
Cornelius Brand, Holger Dell, Marc Roth
Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. Algorithmica 81 (2) (2019)
Holger Dell, Marc Roth, Philip Wellnitz
Counting Answers to Existential Questions. CoRR (2019)
Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
Finding Detours is Fixed-Parameter Tractable. SIAM J. Discret. Math. 33 (4) (2019)
Radu Curticapean, Holger Dell, Marc Roth
Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes. Theory Comput. Syst. 63 (5) (2019)
Holger Dell, Martin Grohe, Gaurav Rattan
Lovász Meets Weisfeiler and Leman. ICALP (2018)
Holger Dell, Martin Grohe, Gaurav Rattan
Weisfeiler-Leman meets Homomorphisms. CoRR (2018)
Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof
More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture. CoRR (2018)
Holger Dell, John Lapinskas
Fine-grained reductions from approximate counting to decision. STOC (2018)
Cornelius Brand, Holger Dell, Thore Husfeldt
Extensor-Coding. CoRR (2018)
Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof
More consequences of falsifying SETH and the orthogonal vectors conjecture. STOC (2018)
Holger Dell, Dániel Marx
Kernelization of Packing Problems. CoRR (2018)
Cornelius Brand, Holger Dell, Thore Husfeldt
Extensor-coding. STOC (2018)
Radu Curticapean, Holger Dell, Marc Roth
Counting edge-injective homomorphisms and matchings on restricted graph classes. CoRR (2017)
Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
A Fixed-Parameter Perspective on #BIS. IPEC (2017)
Radu Curticapean, Holger Dell, Dániel Marx
Homomorphisms Are a Good Basis for Counting Small Subgraphs. CoRR (2017)
Radu Curticapean, Holger Dell, Marc Roth
Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes. STACS (2017)
Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
Finding Detours is Fixed-Parameter Tractable. ICALP (2017)
Holger Dell, John Lapinskas
Fine-grained reductions from approximate counting to decision. CoRR (2017)
Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. IPEC (2017)
Radu Curticapean, Holger Dell, Dániel Marx
Homomorphisms are a good basis for counting small subgraphs. STOC (2017)
Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
A Fixed-Parameter Perspective on #BIS. CoRR (2017)
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica 79 (1) (2017)
Holger Dell
Note on "The Complexity of Counting Surjective Homomorphisms and Compactions". CoRR (2017)
Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
Finding Detours is Fixed-parameter Tractable. CoRR (2016)
Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
On Problems as Hard as CNF-SAT. ACM Trans. Algorithms 12 (3) (2016)
Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond
The First Parameterized Algorithms and Computational Experiments Challenge. IPEC (2016)
Cornelius Brand, Holger Dell, Marc Roth
Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. IPEC (2016)
Cornelius Brand, Holger Dell, Marc Roth
Fine-grained dichotomies for the Tutte plane and Boolean #CSP. CoRR (2016)
Holger Dell
AND-Compression of NP-Complete Problems: Streamlined Proof and Minor Observations. Algorithmica 75 (2) (2016)
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
Complexity and Approximability of Parameterized MAX-CSPs. IPEC (2015)
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
Complexity and Approximability of Parameterized MAX-CSPs. CoRR (2015)
Andreas Björklund, Holger Dell, Thore Husfeldt
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems. ICALP (1) (2015)
Holger Dell
AND-compression of NP-complete Problems: Streamlined Proof and Minor Observations. IPEC (2014)
Holger Dell
A simple proof that AND-compression of NP-complete problems is hard. Electron. Colloquium Comput. Complex. 21 (2014)
Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen
Exponential Time Complexity of the Permanent and the Tutte Polynomial. ACM Trans. Algorithms 10 (4) (2014)
Holger Dell, Dieter van Melkebeek
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses. J. ACM 61 (4) (2014)
Holger Dell
A simple proof that AND-compression of NP-complete problems is hard. CoRR (2014)
Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe
Is Valiant-Vazirani's isolation probability improvable? Comput. Complex. 22 (2) (2013)
Markus Bläser, Holger Dell, Mahmoud Fouz
Complexity and Approximability of the Cover Polynomial. Comput. Complex. 21 (3) (2012)
Holger Dell, Dániel Marx
Kernelization of packing problems. SODA (2012)
Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe
Is Valiant-Vazirani's Isolation Probability Improvable? Computational Complexity Conference (2012)
Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen
Exponential Time Complexity of the Permanent and the Tutte Polynomial CoRR (2012)
Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
On Problems as Hard as CNF-SAT. Computational Complexity Conference (2012)
Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
On Problems as Hard as CNFSAT CoRR (2011)
Holger Dell, Thore Husfeldt, Martin Wahlen
Exponential Time Complexity of the Permanent and the Tutte Polynomial. ICALP (1) (2010)
Holger Dell, Thore Husfeldt, Martin Wahlen
Exponential Time Complexity of the Permanent and the Tutte Polynomial. Electron. Colloquium Comput. Complex. 17 (2010)
Dieter van Melkebeek, Holger Dell
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. Electron. Colloquium Comput. Complex. 17 (2010)
Markus Bläser, Holger Dell, Johann A. Makowsky
Complexity of the Bollobás-Riordan Polynomial. Exceptional Points and Uniform Reductions. Theory Comput. Syst. 46 (4) (2010)
Holger Dell, Dieter van Melkebeek
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. STOC (2010)
Holger Dell, Dieter van Melkebeek
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. Parameterized complexity and approximation algorithms (2009)
Markus Bläser, Holger Dell, Johann A. Makowsky
Complexity of the Bollobás-Riordan Polynomial. CSR (2008)
Markus Bläser, Holger Dell
Complexity of the Cover Polynomial. ICALP (2007)

Holger Dell.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Holger Dell