


Rolf Fagerberg
Professor MSO Ph.D.


Research Interests
I am in general interested in problems within algorithmics. Specific
topics so far include algorithms and data structures for external
memory, in particular of the cacheoblivious kind, algorithms for
problems in bioinformatics, and fundamental data structures such as
search trees, priority queue structures, and graph
representations. Recently also algorithmic, combinatorical, and
complexity related questions from cheminformatics.
Publications
A list of my publications.
Program Committees
Teaching
Present
Past

DM534 Introduction
to Computer Science, fall 2017.

DM842 Computer
Game Programming, fall 2017. Cotaught with Christian Kudahl.

DM507 Algorithms and
Data Structures, spring 2017.

DM823 String Algorithms
, fall 2016.

DM534 Introduction
to Computer Science, fall 2016.

DM507 Algorithms and
Data Structures, spring 2016.

DM207 I/OEfficient
Algorithms and Data Structures, fall 2015.

DM507 Algorithms and
Data Structures, spring 2015.

DM534
Introduction to Computer Science, fall 2014. Cotaught with Joan Boyar.

DM842 Computer
Game Programming, fall 2014. Cotaught with Marco Chiarandini.

DM507 Algorithms and
Data Structures, spring 2014.

DM823 String Algorithms
, fall 2013, 2nd quarter.

DM507 Algorithms and
Data Structures, spring 2013, 3rd and 4th quarter.

DM815 Computer Game
Programming III: Physics, spring 2013, 4th quarter.

DM534 Introduction
to Computer Science, fall 2012, 1st and 2nd quarter,
spring 2013, 3rd quarter.

DM809 Computer Game
Programming I: Graphics, fall 2012, 1st quarter.

DM507 Algorithms and
Data Structures, spring 2012, 3rd and 4th quarter.

DM207 I/OEfficient
Algorithms and Data Structures, fall 2011, 1st and 2nd
quarter.

DM809 Computer Game
Programming I: Graphics, fall 2010, 1st quarter (August).

DM823 String Algorithms
, fall 2010, 1st quarter.

DM815 Computer Game
Programming III: Physics, fall 2010, 2nd quarter.

DM507 Algorithms and
Data Structures, spring 2010, 3rd and 4th quarter.

DM207 I/OEfficient
Algorithms and Data Structures, fall 2009, 1st and 2nd
quarter.

DM816 Computer Game
Programming IV: Project, spring 2009, 4th quarter.

DM815 Computer Game
Programming III: Physics, spring 2009, 3rd quarter.

DM810 Computer Game
Programming II: AI, fall 2008, 2nd quarter.

DM809 Computer Game
Programming I: Graphics, fall 2008, 1st quarter.

DM808 I/OEfficient
Algorithms and Data Structures, spring 2008.

DM79 Algorithms for
Web Indexing and Searching, fall 2007.

DM22 Programming
Languages, spring 2007.
 DM505
Databases, spring 2007.

DM26 Database
Systems, fall 2006.

DM509 Programming
Languages, fall 2006.

DM22 Programming
Languages, spring 2006.
 DM505
Databases, spring 2006.

DM26 Database
Systems, fall 2005.

DM80 Computer Game
Programming, fall 2005.

DM22 Programming
Languages, spring 2005.

DM26 Database
Systems, fall 2004.

DM79 Algorithms for
Web Indexing and Searching, fall 2004.

Algorithms and Data
Structures (dADS), (Open University), spring 2004.

External Memory
Algorithms and Data Structures,
fall 2003.

Perspektiverende kursus i
datalogi (Perspectives on Computer Science), fall 2003.

Database Systems,
spring 2003.

Algorithms
for Web Indexing and Searching, fall 2002

Algorithms and Data
Structures (dADS), special edition for MatØk students,
fall 2002.

Brics Ph.D Course on
Algorithms, spring 2002.

External Memory
Algorithms and Data Structures,
fall 2001.

Algorithms and Data Structures (dADS), (Open University),
spring 2001.

External Memory
Algorithms and Data Structures, fall 2000.

Algorithms and Data Structures (dADS), (Open University),
spring 2000.

Brics Ph.D
Course on Algorithms, fall 1999.

External Memory
Algorithms and Data Structures, fall 1999.

Approximation Algorithms,
fall 1998.

Programming in Java (Open University), fall 1998.

Advanced Data Structures, spring 1998.

Advanced Data Structures, spring 1997.
Students
Present
Past
 Nicolaj Bjørn Øbro, B.Sc. Jan 2018 (coadvised with Christer
S. Ejsing and Daniel
Merkle).
 Janine Weber, M.Sc. Jan 2017 (coadvised with Marco Chiarandini).
 Henrik Schulz, B.Sc. August 2015 (coadvised with Vitus
Vestergaard).
 Rojin Kianian, M.Sc. March 2015 (coadvised with Daniel Merkle).
 Troels Nielsen, M.Sc. October 2014.
 Martin Villumsen, B.Sc. September 2014.
 Thomas Nørbo Jensen, M.Sc. January 2014.
 Philipp Peters, Ph.D. October 2013 (coadvised with Daniel Merkle).
 Thomas Palludan Hargreaves, M.Sc. September 2013.
 Stoyan Ivanov Kamburoy, M.Sc. December 2012.
 Jakob Lund, M.Sc. April 2011.
 Bjarke Benjamin Berg, M.Sc. November 2010.
 Michael Vejlegård Kristensen, M.Sc. October 2010.
 Nikolaj Blytsø, M.Sc. May 2010.
 Rasmus Færing Larsen, B.Sc. July 2009.
 Jeppe Schmidt, B.Sc. July 2009.
 Torsten Bonde Christiansen, M.Sc. June 2008.
 Thomas Brinck, M.Sc. June 2007.
 Jacob Allerelli, M.Sc. Juli 2006.
 Kim Fastrup Larsen, M.Sc. March 2006.
 Frederik Juul Christiani, M.Sc. October 2005.
 Niels Hvidberg Kjeldsen, B.Sc. October 2005.
 Karsten Strandgaard Jørgensen, M.Sc. June 2004.
 Jesper Hedegaard, M.Sc. June 2004.
 Jens Ebbesen, M.Sc. June 2004.
 Martin Møller Johansen, M.Sc. June 2004.
 Kristoffer Vinther, M.Sc. June 2003 (coadvisor with Gerth Stølting Brodal).
MultipleChoice Tests in Blackboard Directly from Latex Sources
I wrote a script LatexMCGenerator for easy generation of Multiple Choice
tests in Blackboard directly from a Latex source document (based on
previous work by Marcus Bannerman). The Latex format is
straightforward, and the conversion to a Blackboard test consists of a
few clicks.
All usual Latex contents (text, formulas, included graphics, inline
generated graphics) can be used in both questions and answers. The
contents of questions and answers are cut out and made into pictures,
which are then imported as the contents of questions and answers in
Blackboard. Hence, the resulting Blackboard test will quite accurately
correspond to the Latex contents.
As an example, this Latex based
document will end up as a Blackboard test looking like this: screenshot
1, screenshot
2. The Latex source looks like this.
More details, as well as all steps from a Latex file to the deployment
of test in Blackboard, are described in the documentation. To get the
script, download this
file. Please report any problems back to me.
Imada Email Addresses
The emails addresses of Imada personnel are organized into groups using
mail aliases in the SDU mail system. Hence, you can send to all VIPs in
math, all Ph.D.students in C.S., etc., as well as to aliases being the
union of such base aliases, e.g. all Imada employees.
Sometimes, however, you may want to reach other subsets of Imada
employees. One recurring situation is soliciting monetary contributions
for a gift to a specific person celebrating some special occasion, where
you want all employees minus one.
For such situations, I have made a script extracting the email addresses
from the Imada
web page listing employees, which is kept uptodate by the department
secretariat. You may then copyandpaste the list to your email program,
and edit the list to suit your specific needs.
To run the script and get the current list of email addresses, just
follow this link (may take
quite some seconds due to the latency of www.sdu.dk).
ALCOMFT
At some point in time, a nontrivial fraction of my time was dedicated to
administration of the ALCOMFT
project, a joint effort between eleven of the
leading groups in algorithms research in Europe, funded by the European
Commision.
My Favourite Fortunes
The best of the fortune
program. Collected in my spare time, of course.
Address Information
 Work
 Department of Mathematics and Computer Science
 University of Southern Denmark
 Campusvej 55
 DK5230 Odense M
 Denmark
 Phone: +45 65 50 23 82
 Fax: +45 65 50 23 25
 Email: rolf # imada. sdu. dk
 Office: Campus
Ø14603a2
 Private
 Kaalundsvej 50
 DK5230 Odense M
 Denmark
 Phone: (+45) 28 21 17 77

