Foreign Students
We offer a Master in Computer Science with ample space for elective courses so you can choose advanced topics in algorithms but also combine with other professional interests you may have.SDU Students
 Algorithms and Data Structures,
 Algorithms and Probability
 Complexity and Computability
On the MS program, the following list of elective courses highlight different aspects of algorithms, listing the courses very roughly from the more theoretical (prooforiented) to the more applied (implementationoriented):
 Cryptology (Joan Boyar)
 Combinatorial Optimization (Jørgen BangJensen)
 Online Algorithms (Lene Favrholdt)
 String Algorithms (Rolf Fagerberg)
 Advanced Data Structures (Kim S. Larsen)
 Approximation Algorithms (Lene Favrholdt) [or Heuristics and Approximation Algorithms]
 Computational Geometry (Kim S. Larsen)
 Network Programming (Jørgen BangJensen)
 Algorithms in Cheminformatics (Daniel Merkle)
VisuAlgo visualizes many of the structures we work with in the area of algorithms.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
Introduction to Algorithms, 4th ed.
The MIT Press, 2022.
You can of course also talk to faculty members and Ph.D. students, working on topics you are particularly interested in.
You can also attend colloquia and research seminars. It varies a lot over the year how many are scheduled, and you should be warned that most of these are talks from researcher to researchers, so they are hard to follow, but it is fine to try to show up. They usually last 4560 minutes.
A few surveys have been written by group members, giving overviews of a particular area. You should be warned that this is not popular science communication, but research communicated to other researchers, so it can be difficult to read.
 Online Algorithms with Advice: A Survey.
 Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, and Jesper W. Mikkelsen.
ACM Computing Surveys, 50(2):134, 2017. Article No. 19
 Relative WorstOrder Analysis: A Survey.
 Joan Boyar, Lene M. Favrholdt, Kim S. Larsen.
In Adventures Between Lower Bounds and Higher Altitudes  Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, volume 11011 of Lecture Notes in Computer Science, pages 216230. Springer, 2018.
You can also consider this list of fairly recent MS dissertation titles (and advisors), which displays quite a variety in topics, as well as in direction with regards to theory or practice.
 2023

 Exact Algorithms for the Bounded Degree Vertex Cover Problem (Joan Boyar)
 Pathway Models in Chemical Reaction Networks (Jakob Lykke Andersen)
 Combinatorial Aspects of Routing Problems (Jørgen BangJensen)
 Combinatorial Methods for Scheduling (Jørgen BangJensen)
 Structurel and Algorithmic Aspects of QuasiTransitive Digraphs (Jørgen BangJensen)
 Exact Algorithms for the Bounded Degree Vertex Cover Problem
 2022

 Bin Covering with Limited Item Sizes (Lene Favrholdt, Kim Skak Larsen)
 Online MultiColoring of Trees and Interval Graphs (Lene Favrholdt, Kim Skak Larsen)
 Exact Algorithms for Maximum Independent Set in Graphs of Bounded Degree (Joan Boyar)
 Comparing Efficient Primality Pests (Joan Boyar)
 Automated Rule Inference for Systems Chemistry (Daniel Merkle, Jakob Lykke Andersen)
 Causality and Concurrency for Analysing Chemical and Biological Systems (Daniel Merkle, Jakob Lykke Andersen, Rolf Fagerberg)
 Coloring of Graphs (Anders Yeo)
 Domination and Total Domination in Graphs (Anders Yeo)
 Mathematical Programming Approaches for the Salt Spreading Problem with Side Constraints (Anders Yeo, Marco Chiarandini)
 Connectivity Properties of Semicomplete Digraphs (Jørgen BangJensen, Anders Yeo)
 Minimum Spanning Tree (Rolf Fagerberg)
 Bin Covering with Limited Item Sizes
 2021

 Domination and Total Domination in Graphs (Anders Yeo)
 Colouring in Graphs and Digraphs(Anders Yeo, Jørgen BangJensen)
 Structural Properties of Decomposable Digraphs(Jørgen BangJensen)
 How Feasible is a Unikernel OS for Robots?(Daniel Merkle, Jakob Lykke Andersen)
 Generic Implementation of Algorithms for Graph Morphism Enumeration(Jakob Lykke Andersen, Daniel Merkle)
 Algorithmic Cheminformatics, Quantum Chemistry, and Stochastic Simulations(Daniel Merkle, Jakob Lykke Andersen)
 Data Driven Game Design for VR(Rolf Fagerberg, Peter SchneiderKamp)
 A Password Capability Based System with Integrated Capability based Cryptographic File System(Daniel Merkle, Joan Boyar)
 Algorithmic Cheminformatics and Data Science for Water Treatment(Daniel Merkle, Jakob Lykke Andersen)
 Choosing Intermediate Representations for a Compiler for an Operating Systems Language(Kim Skak Larsen)
 Aspects of Efficiency in Functional Programming Languages(Kim Skak Larsen)
 Oblivious Transfer in Quantum Cryptography(Joan Boyar)
 Linear Objective Functions for Online Problems(Kim Skak Larsen)
 Domination and Total Domination in Graphs
 2020

 Container Orchestration Optimization Modeled by Online Bin Packing (Joan Boyar)
 Ferry Route Optimization (Marco Chiarandini, Kim Skak Larsen, Mads Bruun Larsen, Marie Lützen)
 Generation of Safe and Efficient Aircraft Departure Procedures (Marco Chiarandini, Kim Skak Larsen, Anders Knudsen)
 Graph Theory and FPT (Anders Yeo, Jørgen BangJensen)
 Machine Learning for Graph Grammar Rule Prediction (Daniel Merkle, Arthur Zimek)
 Network Optimization with Practical Applications (Jørgen BangJensen)
 Provably and Experimentally Efficient MultiWay Trees with Relaxed Balance (Kim Skak Larsen)
 Table Reservations in Restaurants and Related Problems (Kim Skak Larsen, Marco Chiarandini, Arthur Zimek, Morten Frank)
 Container Orchestration Optimization Modeled by Online Bin Packing
 2019

 Analytic Combinatorics and Boltzmann Sampling in Chemistry (Daniel Merkle, Markus Nebel)
 Connectivity in Graphs with Relation to the European Electrical Grid (Anders Yeo, Marco Chiarandini)
 Decomposition and Evaluation of Graph Transformation Rules  Exploring and Evaluating Reaction Mechanisms (Daniel Merkle, Jakob Lykke Andersen)
 Definition and Evaluation of Pressure in the Sport Soccer (Rolf Fagerberg, Mikkel Keldmann)
 GillespieSimulations for GraphGrammar Models (Daniel Merkle, Jakob Lykke Andersen)
 Graph Canonicalization and Algorithmic Engineering (Daniel Merkle, Jakob Lykke Andersen)
 Optimization of the Total Fuel Price by Combinations of Flight Legs Performed by the Same Airplane (Jørgen BangJensen)
 Theoretical and Experimental Analysis of Involved Paging Algorithms (Kim Skak Larsen)
 Analytic Combinatorics and Boltzmann Sampling in Chemistry
 2018

 Algorithmic Synthesis Planning (Daniel Merkle)
 Computational Synthesis Planning Using Big Data (Daniel Merkle)
 Generic Approaches for Group Contribution Methods (Daniel Merkle, Marc Hellmuth)
 Graph Transformation, Atom Tracing, and Isotope Labelling (Daniel Merkle)
 Online Problems with Orthogonal Resource Constraints (Kim Skak Larsen)
 Algorithmic Synthesis Planning
 2017

 Artificial Intelligence in Action RealTime Strategy Games (Rolf Fagerberg, Marco Chiarandini)
 Contributions to Flight Route Optimization (Marco Chiarandini, Kim Skak Larsen)
 Designing Data Structures with Relaxed Balance (Kim Skak Larsen)
 Dynamic Simulation on Hypergraphs (Daniel Merkle)
 Fixed Parameter Tractable Problems for Digraphs (Jørgen BangJensen)
 Graph Interdiction Problems (Jørgen BangJensen)
 Network Interdiction (Jørgen BangJensen)
 Query Complexity for Variations of Geometric Problems (Kim Skak Larsen)
 Symbolic Methods for Counting Molecules (Daniel Merkle)
 The Entropy Compression Method (Jørgen BangJensen)
 Artificial Intelligence in Action RealTime Strategy Games
 2016

 A Permutation Group Approach to Creation of SelfAssembling Polyhedra from SingleChain Polypeptides (Daniel Merkle, Wojciech Szymanski)
 Carbon Tracing in Chemical Reaction Networks (Daniel Merkle)
 Query Competitiveness for Problems with Uncertainty (Kim Skak Larsen)
 A Permutation Group Approach to Creation of SelfAssembling Polyhedra from SingleChain Polypeptides
 2015

 Computational Complexity and Cheminformatics (Daniel Merkle, Rolf Fagerberg)
 DNATemplated Computing (Kim Skak Larsen, Daniel Merkle)
 LatticeBased Cryptography (Joan Boyar)
 Online Problems with Buffering (Kim Skak Larsen)
 Parallelization of Search Tree Based Algorithms (Daniel Merkle)
 Threshold Implementations of Small SBoxes (Joan Boyar)
 Vertex Labellings with Unique Labels and Their Use in Graph Algorithms (Jørgen BangJensen)
 Computational Complexity and Cheminformatics
 2014

 A Computational and Mathematical Approach to Synthesis Planning (Daniel Merkle)
 European Football Placement Problems  Complexities and Exact Solutions (Kim Skak Larsen)
 Graph Rewriting for DNA Computing (Daniel Merkle)
 RealTime Fluid Simulation and Rendering in Games (Rolf Fagerberg)
 A Computational and Mathematical Approach to Synthesis Planning