Holger Dell

Holger Dell is a Lecturer in Theoretical Computer Science and Algorithms at the IT University of Copenhagen. His research focuses on computational complexity, graph theory, and algorithmic efficiency.

• Active in polynomial-time algorithms and oracle-based methods
• Contributions to edge estimation in hypergraphs and fairness in node embeddings
• Key collaborations with BARC (Basic Algorithms Research Copenhagen) project

Research trends show expertise in causal modeling, finite field polynomial solving, and graph embedding techniques. Recent work emphasizes algorithmic fairness and abstract causal relationships.

Participated in a major project funded by the Villum Foundation (2017-2024) as a collaborator.