Holger Dell

According to our database1, Holger Dell authored at least 32 papers between 2007 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Approximately counting and sampling small witnesses using a colourful decision oracle.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Finding Detours is Fixed-Parameter Tractable.
SIAM J. Discrete Math., 2019

Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes.
Theory Comput. Syst., 2019

A Fixed-Parameter Perspective on #BIS.
Algorithmica, 2019

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

The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Counting Answers to Existential Questions.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Weisfeiler-Leman meets Homomorphisms.
CoRR, 2018

Fine-grained reductions from approximate counting to decision.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Extensor-coding.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

More consequences of falsifying SETH and the orthogonal vectors conjecture.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Lovász Meets Weisfeiler and Leman.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

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

Complexity and Approximability of Parameterized MAX-CSPs.
Algorithmica, 2017

Homomorphisms are a good basis for counting small subgraphs.
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.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

2016
On Problems as Hard as CNF-SAT.
ACM Trans. Algorithms, 2016

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

The First Parameterized Algorithms and Computational Experiments Challenge.
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.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Exponential Time Complexity of the Permanent and the Tutte Polynomial.
ACM Trans. Algorithms, 2014

Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses.
J. ACM, 2014

A simple proof that AND-compression of NP-complete problems is hard.
Electronic Colloquium on Computational Complexity (ECCC), 2014

2013
Is Valiant-Vazirani's isolation probability improvable?
Computational Complexity, 2013

2012
Complexity and Approximability of the Cover Polynomial.
Computational Complexity, 2012

Kernelization of packing problems.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Sparse instances of hard problems.
PhD thesis, 2011

On Problems as Hard as CNFSAT
CoRR, 2011

2010
Complexity of the Bollobás-Riordan Polynomial. Exceptional Points and Uniform Reductions.
Theory Comput. Syst., 2010

Exponential Time Complexity of the Permanent and the Tutte Polynomial.
Electronic Colloquium on Computational Complexity (ECCC), 2010

2008
Complexity of the Bollobás-Riordan Polynomial.
Proceedings of the Computer Science, 2008

2007
Complexity of the Cover Polynomial.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007


  Loading...