(SDU Logo) Institut for Matematik og Datalogi
Syddansk Universitet Dept. of Mathematics and Computer Science
   
 

Jesper With Mikkelsen

Ph.D. student (since January 2014) at IMADA
Advisors: Lene Monrad Favrholdt and Joan Boyar
Participant in the project On-Line Algorithms and Advice


Map to office
Address information

Research

My main research area is On-Line algorithms. The working title of my PhD project is "On-Line Problems with and without Advice". I have a general interest in algorithmics and complexity theory. Do not hesitate to drop me an e-mail if you have any questions or comments regarding my work.
  • Weighted online problems with advice (arXiv)
    Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
    IWOCA 2016.
    Invited to special issue of Theory of Computing Systems (ToCS).
  • Randomization can be as helpful as a glimpse of the future in online computation (arXiv)
    Jesper W. Mikkelsen
    ICALP (Track A) 2016.
  • Optimal online edge coloring of planar graphs with advice (arXiv)
    Jesper W. Mikkelsen
    CIAC 2015.
  • Advice complexity for a class of online problems (arXiv)
    Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
    STACS 2015.
    Accepted to special issue of Theory of Computing Systems (ToCS).
  • Online dual edge coloring of paths and trees (arXiv)
    Lene M. Favrholdt and Jesper W. Mikkelsen
    WAOA 2014.
    Accepted to Acta Informatica.
A recent survey on advice complexity:
  • Online Algorithms with Advice: A Survey (PDF)
    Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
    Accepted to ACM Computing Surveys.
    A preliminary version appeared in ACM SIGACT News, September 2016.

Teaching

Currently: MM537 - Introduction to Mathematical Methods.
Resources for past courses can be found here.

Services

Reviewer for: Journal of Scheduling, COCOON, FCT, SODA.