Find Academic Supervisors

Kim Skak LarsenView profile

Professor

• Online Algorithms
• Algorithmics
• Data Structures
• +6 more

Kim Skak Larsen is a Professor in the Department of Mathematics and Computer Science at the University of Southern Denmark, Faculty of Science. He serves as Head of Section and is affiliated with the Algorithms VIP group and the Digital Democracy Centre, reflecting his dual focus on theoretical algorithmics and societal applications of computing. His research lies in online algorithms, data structures, database systems, and algorithmics , with a strong emphasis on competitive analysis and performance measures. Key research themes include competitive ratio optimization, online matching, knapsack problems, and the integration of predictions into algorithmic frameworks. His recent work explores algorithmic trade-offs under uncertainty and misinformation on social media. His recent publications (2023–2024) reveal a consistent focus on online algorithms with predictions , spanning scheduling, matching, and knapsack problems. These works analyze competitive ratios and performance under prediction errors, contributing to the growing field of learning-augmented algorithms. His interdisciplinary engagement includes contributions to public discourse on digital trust and news authenticity. Project: Trade-Offs for Algorithms Facing Uncertainty (2025–2027) Project: Online Algorithms with Predictions - DIREC (2022–2025) Project: Algorithmic Challenges (2014–2017) Project: Trust and News Authenticity (ongoing) He has supervised PhD students and contributed to academic service as a peer reviewer, conference participant, and series editor. He teaches courses such as Formal Languages, Advanced Data Structures, and Geometric Algorithms, and has been active in public outreach through media contributions on combating scam articles online.

Rolf FagerbergView profile

Professor

• Algorithms
• Data Structures
• Computational Biology
• +7 more

Rolf Fagerberg is a Professor in the Department of Mathematics and Computer Science at the University of Southern Denmark (SDU). His research centers on algorithms, data structures, and their applications in computational biology and cheminformatics. His research interests include: Algorithms and data structures, particularly dynamic and geometric data structures Graph theory with emphasis on subgraphs, Yao graphs, and hypergraphs Algorithmic cheminformatics and modeling of chemical reaction networks Computational biology, including metabolic pathway analysis Theoretical computer science and discrete mathematics Recent publications highlight a strong trend toward interdisciplinary research combining computer science with chemistry and biology, particularly in modeling chemical reaction networks using hypergraphs and mixed-integer linear programming. His work also includes algorithmic solutions for palindromic subsequence problems and efficient extraction of reaction rules from large databases, reflecting a blend of theoretical and applied algorithm design. Rolf Fagerberg has served as senior coordinator on multiple research projects, including 'Algorithmic Cheminformatics' and 'Fundamental Data Structures', funded by the Danish Ministry of Higher Education and Research. He has also contributed to peer review and editorial work for major conferences such as the ACM Symposium on Parallelism in Algorithms and Architectures and the International Symposium on Experimental Algorithms. He has supervised PhD students and is actively involved in academic service, including membership in assessment committees at Aarhus University and IT University of Copenhagen. His research has received media attention, including coverage of a 'mathematical breakthrough' and applications in understanding intestinal systems in obesity.

Gerth Stølting BrodalView profile

Professor

• Algorithms
• Data Structures
• Computational Geometry
• +6 more

Gerth Stølting Brodal is a Professor in the Department of Computer Science at Aarhus University, Denmark, holding this position since January 2016. Previously, he served as an Associate Professor (tenured) at the same department from 2004 to 2015. His career includes a PostDoc at the Max-Planck-Institute for Computer Science in Saarbrücken, Germany (1997-1998) and long-term affiliations with research centers BRICS (1998-2005) and MADALGO (2007-2017). Education: PhD in Computer Science, Aarhus University (1997). Thesis: "Worst Case Efficient Data Structures". Research Focus: Brodal specializes in the design and analysis of algorithms and data structures. His work spans fundamental data structures (dictionaries, priority queues, persistent structures), computational geometry, graph/string algorithms, I/O-efficient and cache-oblivious methods, algorithm engineering, and computational biology. He is renowned for worst-case efficient solutions and external memory algorithm contributions, with a fingerprint emphasizing data structures (100%), worst-case analysis (42%), and I/O efficiency (27%). Recent Publication Trends: His 2024-2025 output reveals sustained innovation in advanced data structures—dynamic convex hulls, binary search trees with finger search capabilities, strict Fibonacci heaps, and cache-oblivious selection algorithms—demonstrating theoretical rigor with practical engineering applications in massive data processing. Academic Leadership: Brodal has supervised PhD students (evidenced by one thesis in his output) and contributed to major collaborative initiatives. His 141 research outputs include journal articles, conference papers, and book chapters, reflecting deep engagement with algorithmic theory and its real-world implementations.