Holger Dell

According to our database, Holger Dell authored at least 39 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Solving Polynomial Equations Over Finite Fields.

Holger Dell, Anselm Haak, Melvin Kallmayer, Leo Wennmann

CoRR, 2024

Fairness Through Controlled (Un)Awareness in Node Embeddings.

Dennis Vetter, Jasper Forth, Gemma Roig, Holger Dell

CoRR, 2024

Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs.

Holger Dell, John Lapinskas, Kitty Meeks

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM).

Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2022

Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482).

Holger Dell, Mark Richard Jerrum, Haiko Müller, Konrad Anand, Marcus Pappik

Dagstuhl Reports, November, 2022

Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle.

Holger Dell, John Lapinskas, Kitty Meeks

SIAM J. Comput., 2022

2021

Fine-Grained Reductions from Approximate Counting to Decision.

Holger Dell, John Lapinskas

ACM Trans. Comput. Theory, 2021

Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths.

Radu Curticapean, Holger Dell, Thore Husfeldt

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Approximately counting and sampling small witnesses using a colourful decision oracle.

Holger Dell, John Lapinskas, Kitty Meeks

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Finding Detours is Fixed-Parameter Tractable.

Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin

SIAM J. Discret. Math., 2019

Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes.

Radu Curticapean, Holger Dell, Marc Roth

Theory Comput. Syst., 2019

A Fixed-Parameter Perspective on #BIS.

Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas

Algorithmica, 2019

Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP.

Cornelius Brand, Holger Dell, Marc Roth

Algorithmica, 2019

The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms.

Hubie Chen, Radu Curticapean, Holger Dell

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Counting Answers to Existential Questions.

Holger Dell, Marc Roth, Philip Wellnitz

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Weisfeiler-Leman meets Homomorphisms.

Holger Dell, Martin Grohe, Gaurav Rattan

CoRR, 2018

Extensor-coding.

Cornelius Brand, Holger Dell, Thore Husfeldt

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

More consequences of falsifying SETH and the orthogonal vectors conjecture.

Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Lovász Meets Weisfeiler and Leman.

Holger Dell, Martin Grohe, Gaurav Rattan

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Note on "The Complexity of Counting Surjective Homomorphisms and Compactions".

Holger Dell

CoRR, 2017

Complexity and Approximability of Parameterized MAX-CSPs.

Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke

Algorithmica, 2017

Homomorphisms are a good basis for counting small subgraphs.

Radu Curticapean, Holger Dell, Dániel Marx

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration.

Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

2016

On Problems as Hard as CNF-SAT.

Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström

ACM Trans. Algorithms, 2016

AND-Compression of NP-Complete Problems: Streamlined Proof and Minor Observations.

Holger Dell

Algorithmica, 2016

The First Parameterized Algorithms and Computational Experiments Challenge.

Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015

The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems.

Andreas Björklund, Holger Dell, Thore Husfeldt

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Exponential Time Complexity of the Permanent and the Tutte Polynomial.

Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen

ACM Trans. Algorithms, 2014

A simple proof that AND-compression of NP-complete problems is hard.

Holger Dell

Electron. Colloquium Comput. Complex., 2014

2013

Is Valiant-Vazirani's isolation probability improvable?

Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe

Comput. Complex., 2013

2012

Complexity and Approximability of the Cover Polynomial.

Markus Bläser, Holger Dell, Mahmoud Fouz

Comput. Complex., 2012

Kernelization of packing problems.

Holger Dell, Dániel Marx

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Sparse instances of hard problems.

Holger Dell

PhD thesis, 2011

On Problems as Hard as CNFSAT

Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström

CoRR, 2011

2010

Complexity of the Bollobás-Riordan Polynomial. Exceptional Points and Uniform Reductions.

Markus Bläser, Holger Dell, Johann A. Makowsky

Theory Comput. Syst., 2010

Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses.

Dieter van Melkebeek, Holger Dell

Electron. Colloquium Comput. Complex., 2010

Exponential Time Complexity of the Permanent and the Tutte Polynomial.

Holger Dell, Thore Husfeldt, Martin Wahlen

Electron. Colloquium Comput. Complex., 2010

2008

Complexity of the Bollobás-Riordan Polynomial.

Markus Bläser, Holger Dell, Johann A. Makowsky

Proceedings of the Computer Science, 2008

2007

Complexity of the Cover Polynomial.

Markus Bläser, Holger Dell

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007