default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHolger Dell
Person information
- affiliation: Goethe University Frankfurt, Germany
- affiliation: IT University of Copenhagen, Denmark
- affiliation (former): Saarland University, Germany
- affiliation: University of Wisconsin, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c27]Holger Dell, John Lapinskas, Kitty Meeks:
Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs. ICALP 2024: 54:1-54:17- [i25]Dennis Vetter, Jasper Forth, Gemma Roig, Holger Dell:
Fairness Through Controlled (Un)Awareness in Node Embeddings. CoRR abs/2407.20024 (2024) - 2023
- [c26]Alexander Leonhardt
, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck:
PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). IPEC 2023: 37:1-37:7 - 2022
- [j14]Holger Dell, John Lapinskas, Kitty Meeks:
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle. SIAM J. Comput. 51(4): 849-899 (2022) - [e1]Holger Dell, Jesper Nederlof:
17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany. LIPIcs 249, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-260-0 [contents] - [i24]Holger Dell, John Lapinskas, Kitty Meeks:
Nearly optimal independence oracle algorithms for edge estimation in hypergraphs. CoRR abs/2211.03874 (2022) - [i23]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): 124-145 (2022) - 2021
- [j13]Holger Dell, John Lapinskas:
Fine-Grained Reductions from Approximate Counting to Decision. ACM Trans. Comput. Theory 13(2): 8:1-8:24 (2021) - [c25]Radu Curticapean, Holger Dell, Thore Husfeldt:
Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. ESA 2021: 34:1-34:17 - [i22]Radu Curticapean, Holger Dell, Thore Husfeldt:
Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths. CoRR abs/2107.00629 (2021) - 2020
- [c24]Holger Dell, John Lapinskas, Kitty Meeks:
Approximately counting and sampling small witnesses using a colourful decision oracle. SODA 2020: 2201-2211
2010 – 2019
- 2019
- [j12]Cornelius Brand, Holger Dell, Marc Roth:
Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. Algorithmica 81(2): 541-556 (2019) - [j11]Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas:
A Fixed-Parameter Perspective on #BIS. Algorithmica 81(10): 3844-3864 (2019) - [j10]Radu Curticapean, Holger Dell, Marc Roth:
Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes. Theory Comput. Syst. 63(5): 987-1026 (2019) - [j9]Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin:
Finding Detours is Fixed-Parameter Tractable. SIAM J. Discret. Math. 33(4): 2326-2345 (2019) - [c23]Holger Dell, Marc Roth, Philip Wellnitz:
Counting Answers to Existential Questions. ICALP 2019: 113:1-113:15 - [c22]Hubie Chen, Radu Curticapean, Holger Dell:
The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. WG 2019: 364-378 - [i21]Holger Dell, Marc Roth, Philip Wellnitz:
Counting Answers to Existential Questions. CoRR abs/1902.04960 (2019) - [i20]Holger Dell, John Lapinskas, Kitty Meeks:
Approximately counting and sampling small witnesses using a colourful decision oracle. CoRR abs/1907.04826 (2019) - 2018
- [c21]Holger Dell, Martin Grohe, Gaurav Rattan:
Lovász Meets Weisfeiler and Leman. ICALP 2018: 40:1-40:14 - [c20]Cornelius Brand, Holger Dell, Thore Husfeldt:
Extensor-coding. STOC 2018: 151-164 - [c19]Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof:
More consequences of falsifying SETH and the orthogonal vectors conjecture. STOC 2018: 253-266 - [c18]Holger Dell, John Lapinskas:
Fine-grained reductions from approximate counting to decision. STOC 2018: 281-288 - [i19]Holger Dell, Martin Grohe, Gaurav Rattan:
Weisfeiler-Leman meets Homomorphisms. CoRR abs/1802.08876 (2018) - [i18]Cornelius Brand, Holger Dell, Thore Husfeldt:
Extensor-Coding. CoRR abs/1804.09448 (2018) - [i17]Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof:
More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture. CoRR abs/1805.08554 (2018) - [i16]Holger Dell, Dániel Marx:
Kernelization of Packing Problems. CoRR abs/1812.03155 (2018) - 2017
- [j8]Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica 79(1): 230-250 (2017) - [c17]Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin:
Finding Detours is Fixed-Parameter Tractable. ICALP 2017: 54:1-54:14 - [c16]Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas:
A Fixed-Parameter Perspective on #BIS. IPEC 2017: 13:1-13:13 - [c15]Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller:
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. IPEC 2017: 30:1-30:12 - [c14]Radu Curticapean, Holger Dell, Marc Roth:
Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes. STACS 2017: 25:1-25:15 - [c13]Radu Curticapean, Holger Dell, Dániel Marx:
Homomorphisms are a good basis for counting small subgraphs. STOC 2017: 210-223 - [i15]Radu Curticapean, Holger Dell, Marc Roth:
Counting edge-injective homomorphisms and matchings on restricted graph classes. CoRR abs/1702.05447 (2017) - [i14]Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas:
A Fixed-Parameter Perspective on #BIS. CoRR abs/1702.05543 (2017) - [i13]Radu Curticapean, Holger Dell, Dániel Marx:
Homomorphisms Are a Good Basis for Counting Small Subgraphs. CoRR abs/1705.01595 (2017) - [i12]Holger Dell, John Lapinskas:
Fine-grained reductions from approximate counting to decision. CoRR abs/1707.04609 (2017) - [i11]Holger Dell:
Note on "The Complexity of Counting Surjective Homomorphisms and Compactions". CoRR abs/1710.01712 (2017) - 2016
- [j7]Holger Dell:
AND-Compression of NP-Complete Problems: Streamlined Proof and Minor Observations. Algorithmica 75(2): 403-423 (2016) - [j6]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): 41:1-41:24 (2016) - [c12]Cornelius Brand, Holger Dell, Marc Roth:
Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. IPEC 2016: 9:1-9:14 - [c11]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: 30:1-30:9 - [i10]Cornelius Brand, Holger Dell, Marc Roth:
Fine-grained dichotomies for the Tutte plane and Boolean #CSP. CoRR abs/1606.06581 (2016) - [i9]Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin:
Finding Detours is Fixed-parameter Tractable. CoRR abs/1607.07737 (2016) - 2015
- [c10]Andreas Björklund, Holger Dell, Thore Husfeldt:
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems. ICALP (1) 2015: 231-242 - [c9]Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. IPEC 2015: 294-306 - [i8]Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. CoRR abs/1511.05546 (2015) - 2014
- [j5]Holger Dell, Dieter van Melkebeek:
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses. J. ACM 61(4): 23:1-23:27 (2014) - [j4]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): 21:1-21:32 (2014) - [c8]Holger Dell:
AND-compression of NP-complete Problems: Streamlined Proof and Minor Observations. IPEC 2014: 184-195 - [i7]Holger Dell:
A simple proof that AND-compression of NP-complete problems is hard. CoRR abs/1405.4472 (2014) - [i6]Holger Dell:
A simple proof that AND-compression of NP-complete problems is hard. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j3]Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe:
Is Valiant-Vazirani's isolation probability improvable? Comput. Complex. 22(2): 345-383 (2013) - 2012
- [j2]Markus Bläser, Holger Dell, Mahmoud Fouz:
Complexity and Approximability of the Cover Polynomial. Comput. Complex. 21(3): 359-419 (2012) - [c7]Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe:
Is Valiant-Vazirani's Isolation Probability Improvable? CCC 2012: 10-20 - [c6]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. CCC 2012: 74-84 - [c5]Holger Dell, Dániel Marx:
Kernelization of packing problems. SODA 2012: 68-81 - [i5]Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen:
Exponential Time Complexity of the Permanent and the Tutte Polynomial. CoRR abs/1206.1775 (2012) - 2011
- [b1]Holger Dell:
Sparse instances of hard problems. Humboldt University of Berlin, 2011 - [i4]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 abs/1112.2275 (2011) - 2010
- [j1]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): 690-706 (2010) - [c4]Holger Dell, Thore Husfeldt, Martin Wahlen:
Exponential Time Complexity of the Permanent and the Tutte Polynomial. ICALP (1) 2010: 426-437 - [c3]Holger Dell, Dieter van Melkebeek:
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. STOC 2010: 251-260 - [i3]Holger Dell, Thore Husfeldt, Martin Wahlen:
Exponential Time Complexity of the Permanent and the Tutte Polynomial. Electron. Colloquium Comput. Complex. TR10 (2010) - [i2]Dieter van Melkebeek, Holger Dell:
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [i1]Holger Dell, Dieter van Melkebeek:
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. Parameterized complexity and approximation algorithms 2009 - 2008
- [c2]Markus Bläser, Holger Dell, Johann A. Makowsky:
Complexity of the Bollobás-Riordan Polynomial. CSR 2008: 86-98 - 2007
- [c1]Markus Bläser, Holger Dell:
Complexity of the Cover Polynomial. ICALP 2007: 801-812
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
