Holger Dell - RankMe

73 papers A* 14A 4B 9Misc 1Journal 41Unranked 3

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