Holger Dell
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
- semigroups and automata theory
-
- Limits and Structures in Graph Theory
Papers in
-
- Complexity and Algorithms in Graphs 12
- Advanced Graph Theory Research 11
- Formal Methods in Verification 3
-
- Optimization and Search Problems 3
- Advanced Database Systems and Queries 2
- Co-authors
- Dieter van Melkebeek (6 shared papers)Dániel Marx (2 shared papers)Christian Komusiewicz (2 shared papers)Thore Husfeldt (4 shared papers)Mathias Weller (1 shared paper)Nimrod Talmon (1 shared paper)Marek Cygan (1 shared paper)Magnus Wahlström (1 shared paper)
- Journals
- Computational Complexity (2 papers)ACM Transactions on Algorithms (2 papers)Theory of Computing Systems (1 paper)Journal of the ACM (1 paper)Algorithmica (1 paper)
- Partner nations
- GermanyDenmarkUnited States
In The Last Decade
Holger Dell
20 papers receiving 236 citations
Peers
Comparison fields: 5 of 33
- Computational Theory and Mathematics 213
- Discrete Mathematics and Combinatorics 35
- Computational Mathematics 5
- Computer Graphics and Computer-Aided Design 11
- Computer Networks and Communications 66
Countries citing papers authored by Holger Dell
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
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-authors
The 25 scholars most cited alongside Holger Dell, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2010 | 65 | |
| 2 | 2014 | 60 | |
| 3 | 2016 | 34 | |
| 4 | 2018 | 21 | |
| 5 | 2014 | 17 | |
| 6 | 2017 | 10 | |
| 7 | 2018 | 7 | |
| 8 | 2021 | 5 | |
| 9 | 2022 | 5 | |
| 10 | 2013 | 4 | |
| 11 | 2009 | 4 | |
| 12 | 2019 | 3 | |
| 13 | A simple proof that AND-compression of NP-complete problems is hard | 2014 | 3 |
| 14 | 2011 | 3 | |
| 15 | 2012 | 3 | |
| 16 | 2017 | 2 | |
| 17 | 2018 | 2 | |
| 18 | 2021 | 1 | |
| 19 | Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. | 2010 | 1 |
| 20 | 2010 | 1 |
About Holger Dell
Holger Dell is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Statistics and Probability and Discrete Mathematics and Combinatorics, having authored 20 papers that have together received 251 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (12 papers), Advanced Graph Theory Research (11 papers), Markov Chains and Monte Carlo Methods (4 papers), Optimization and Search Problems (3 papers), Machine Learning and Algorithms (3 papers), Formal Methods in Verification (3 papers), Advanced Database Systems and Queries (2 papers) and Data Management and Algorithms (2 papers). The work is most often cited by research in Computational Theory and Mathematics (213 citations), Discrete Mathematics and Combinatorics (35 citations), Computational Mathematics (5 citations), Computer Graphics and Computer-Aided Design (11 citations) and Computer Networks and Communications (66 citations). Holger Dell has collaborated with scholars based in Germany, Denmark and United States. Frequent co-authors include Dieter van Melkebeek, Dániel Marx, Christian Komusiewicz, Thore Husfeldt, Mathias Weller, Nimrod Talmon, Marek Cygan, Magnus Wahlström, Ramamohan Paturi and Daniel Lokshtanov. Their work appears in journals such as Computational Complexity, ACM Transactions on Algorithms, Theory of Computing Systems, Journal of the ACM and Algorithmica.
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.