Holger Dell

1.1k total citations
20 papers, 241 citations indexed

About

Holger Dell is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Holger Dell has authored 20 papers receiving a total of 241 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 7 papers in Computer Networks and Communications and 7 papers in Artificial Intelligence. Recurrent topics in Holger Dell's work include Complexity and Algorithms in Graphs (12 papers), Advanced Graph Theory Research (11 papers) and Markov Chains and Monte Carlo Methods (4 papers). Holger Dell is often cited by papers focused on Complexity and Algorithms in Graphs (12 papers), Advanced Graph Theory Research (11 papers) and Markov Chains and Monte Carlo Methods (4 papers). Holger Dell collaborates with scholars based in Germany, Denmark and United States. Holger Dell's co-authors include Dieter van Melkebeek, Christian Komusiewicz, Dániel Marx, Thore Husfeldt, Nimrod Talmon, Mathias Weller, Ramamohan Paturi, Yoshio Okamoto, Saket Saurabh and Magnus Wahlström and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Algorithmica.

In The Last Decade

Holger Dell

20 papers receiving 226 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Holger Dell Germany	7	206	64	62	31	19	20	241
Jakub Onufry Wojtaszczyk Poland	8	187 0.9×	82 1.3×	29 0.5×	28 0.9×	20 1.1×	16	218
Arnab Bhattacharyya United States	9	160 0.8×	56 0.9×	130 2.1×	25 0.8×	15 0.8×	34	220
Somnath Sikdar Germany	11	238 1.2×	77 1.2×	36 0.6×	42 1.4×	31 1.6×	23	264
Kevin Matulef United States	6	146 0.7×	48 0.8×	122 2.0×	13 0.4×	15 0.8×	11	196
Isolde Adler Germany	8	190 0.9×	87 1.4×	53 0.9×	36 1.2×	7 0.4×	21	231
Jesper Nederlof Netherlands	9	337 1.6×	132 2.1×	71 1.1×	45 1.5×	48 2.5×	35	373
Ishay Haviv Israel	7	99 0.5×	60 0.9×	76 1.2×	17 0.5×	24 1.3×	33	167
Hervé Daudé France	9	98 0.5×	106 1.7×	48 0.8×	13 0.4×	21 1.1×	13	172
Mathieu Liedloff France	11	217 1.1×	110 1.7×	20 0.3×	39 1.3×	31 1.6×	36	276
David A. Grable Germany	10	169 0.8×	114 1.8×	51 0.8×	71 2.3×	46 2.4×	22	254

Countries citing papers authored by Holger Dell

Since Specialization

Citations

This map shows the geographic impact of Holger Dell's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Holger Dell with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Holger Dell more than expected).

Fields of papers citing papers by Holger Dell

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Holger Dell. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Holger Dell. The network helps show where Holger Dell may publish in the future.

Co-authorship network of co-authors of Holger Dell

This figure shows the co-authorship network connecting the top 25 collaborators of Holger Dell. A scholar is included among the top collaborators of Holger Dell based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Holger Dell. Holger Dell is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Dell, Holger, et al.. (2022). Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle. SIAM Journal on Computing. 51(4). 849–899. 4 indexed citations

Dell, Holger, et al.. (2021). Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Dell, Holger, et al.. (2021). Fine-Grained Reductions from Approximate Counting to Decision. IT University Of Copenhagen (IT University of Copenhagen). 13(2). 1–24. 4 indexed citations

Dell, Holger, et al.. (2019). Counting Answers to Existential Questions. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15. 3 indexed citations

Dell, Holger, et al.. (2018). Lovász Meets Weisfeiler and Leman. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 7 indexed citations

Dell, Holger, et al.. (2018). Extensor-coding. IT University Of Copenhagen (IT University of Copenhagen). 151–164. 2 indexed citations

Dell, Holger, Christian Komusiewicz, Nimrod Talmon, & Mathias Weller. (2018). The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 21 indexed citations

Dell, Holger, Thore Husfeldt, Bart M. P. Jansen, et al.. (2017). The First Parameterized Algorithms and Computational Experiments Challenge. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 63. 1–9. 10 indexed citations

Dell, Holger, et al.. (2017). Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica. 79(1). 230–250. 2 indexed citations

10.

Cygan, Marek, Holger Dell, Daniel Lokshtanov, et al.. (2016). On Problems as Hard as CNF-SAT. ACM Transactions on Algorithms. 12(3). 1–24. 30 indexed citations

11.

Dell, Holger. (2014). A simple proof that AND-compression of NP-complete problems is hard. arXiv (Cornell University). 3 indexed citations

12.

Dell, Holger, et al.. (2014). Exponential Time Complexity of the Permanent and the Tutte Polynomial. ACM Transactions on Algorithms. 10(4). 1–32. 16 indexed citations

13.

Dell, Holger & Dieter van Melkebeek. (2014). Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses. Journal of the ACM. 61(4). 1–27. 60 indexed citations

14.

Dell, Holger, Valentine Kabanets, Dieter van Melkebeek, & Osamu Watanabe. (2013). Is Valiant–Vazirani’s isolation probability improvable?. Computational Complexity. 22(2). 345–383. 4 indexed citations

15.

Dell, Holger, Valentine Kabanets, Dieter van Melkebeek, & Osamu Watanabe. (2012). Is Valiant-Vazirani's Isolation Probability Improvable?. 44. 10–20. 3 indexed citations

16.

Bläser, Markus, Holger Dell, & Mahmoud Fouz. (2011). Complexity and Approximability of the Cover Polynomial. Computational Complexity. 21(3). 359–419. 3 indexed citations

17.

Dell, Holger & Dieter van Melkebeek. (2010). Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. 251–260. 62 indexed citations

18.

Melkebeek, Dieter van & Holger Dell. (2010). Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses.. Electronic colloquium on computational complexity. 17. 38. 1 indexed citations

19.

Dell, Holger & Dieter van Melkebeek. (2010). Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 0. 1 indexed citations

20.

Bläser, Markus, Holger Dell, & Johann A. Makowsky. (2009). Complexity of the Bollobás–Riordan Polynomial. Exceptional Points and Uniform Reductions. Theory of Computing Systems. 46(4). 690–706. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact