Research Interests

My research interests are manifold and lie in the intersection of algorithms, game theory and computational complexity.
I'm especially interested in:

• Algorithmic Game Theory, in particular the impact of selfish behavior in optimization problems
• Modeling and analyzing network creation by selfish agents
• Network Design and algorithmic problems on graphs in general

News

• In the upcoming summer semester I'll teach (Advanced) Competitive Programming (with Tobias Friedrich), Graph Algorithms (with Thomas Bläsius) and I'll organize a seminar on Algorithmic Game Theory. Feel free to join!
• I'm looking forward to attending the 4th Day on Computational Game Theory at ETH Zurich. I'll give a talk on "Efficient Best-Response Computation for Strategic Network Formation under Attack".
• The preprint of our Master Project paper is on arXiv!
• Currently I'm teaching Algorithmix and (Advanced) Algoritmic Problem Solving (together with Timo Kötzing). Feel free to join if you are interested in algorithms and/or algorithmic puzzles!
• Our paper On Selfish Creation of Robust Networks (with Ankit Chauhan, Anna Melnichenko and Martin Münn) was accepted at SAGT'16. The paper was presented as a poster at EC'16.
• I served on the Program Committee for the Symposium on Algorithmic Game Theory (SAGT'16).

Publications

Working papers

• Efficient Best-Response Computation for Strategic Network Formation under Attack
  (with Tobias Friedrich, Sven Ihde, Christoph Keßler, Stefan Neubert and David Schumann)
  preprint: [arXiv]

Papers in refereed journals

• On Approximate Nash Equilibria in Network Design
  (with Susanne Albers)
  Internet Mathematics 9(4): 384-405, 2013 (online version)

Papers in refereed conferences

• On Selfish Creation of Robust Networks
  (with Ankit Chauhan, Anna Melnichenko and Martin Münn)
  9th International Symposium on Algorithmic Game Theory (SAGT) 2016
  full version: [arXiv], conference version: [springerlink]
  
• Network Creation Games: Think Global - Act Local
  (with Andreas Cord-Landwehr)
  40th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2015
  full version: [arXiv] (the original publication can be found at www.springerlink.com)
  Presented at
  • 69. Theorietag at TU Ilmenau, 2015
  • Algorithm Engineering Unplugged seminar at HPI Potsdam, 2015
  • 2nd German Day on Computational Game Theory at TU Berlin, 2015

• On Dynamics in Selfish Network Creation
  (with Bernd Kawald)
  25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013
  conference version:[PDF], full version: [arXiv], slides: [PDF]
  
  • Presented at 1st German Day on Computational Game Theory at Heinz Nixdorf Institute, Paderborn, 2014

• Greedy Selfish Network Creation
  8th Workshop on Internet & Network Economics (WINE), 2012
  full version: [PDF], [arXiv], slides: [PDF]
  Presented at
  • Methods for Discrete Structures Seminar, Berlin, 2013
  • 65. Theorietag at Heinz Nixdorf Institute, Paderborn, 2013
  • 2nd Dutch AMI Day on Computational Game Theory at University of Twente, Enschede, 2012
  • Oberseminar of Prof. Scheideler's Group at University of Paderborn, 2012

  (the original publication can be found at www.springerlink.com)

• On Dynamics in Basic Network Creation Games
  4th Symposium on Algorithmic Game Theory (SAGT), 2011
  full version: [PDF], slides: [PDF]
  (the original publication can be found at www.springerlink.com)

• Balanced Interval Coloring
  (with Antonios Antoniadis, Falk Hüffner, Carsten Moldenhauer and Alexander Souza)
  28th International Symposium on Theoretical Aspects of Computer Science (STACS), 2011
  conference version: [PDF], [arXiv]
  • Accepted for a plenary presentation at 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2011

• On Approximate Nash Equilibria in Network Design
  (with Susanne Albers)
  6th Workshop on Internet & Network Economics (WINE), 2010
  (the original publication can be found at www.springerlink.com)

Thesis

• On Selfish Network Creation
  Dissertation, Humboldt-University Berlin, 2014
  Abstract: [edoc], pdf version: [PDF]

Teaching

• Seminar on Algorithmic Game Theory, Master-Course, Summer 2017
• (Advanced) Competitive Progamming, Bachelor/Master-Course, Summer 2017
• Graph Algorithms, Master-Course, Summer 2017
• Algorithmix, Master-Course, Winter 16/17
• (Advanced) Algorithmic Problem Solving, Bachelor/Master-Course, Winter 16/17
• Master Project "Strategic Network Formation under Attack", Summer 2016
• (Advanced) Competitive Programming, Bachelor/Master-Course, Summer 2016
• Graph Algorithms, Master-Course, Summer 2016
• Introduction to Algorithms, Bachelor-Course, Winter 2015/16
• Algorithmic Foundations, Bachelor-Course, Summer 2015, FSU Jena
• Discrete Modeling, Bachelor-Course, Winter 2014/15, FSU Jena

Teaching (as TA)

• Algorithms & Data Structures, Summer 2014, HU Berlin
• Introduction to Theoretical Computer Science, Winter 2013/14, HU Berlin
• Algorithms & Data Structures, Summer 2013, HU Berlin
• Introduction to Theoretical Computer Science, Winter 2012/13, HU Berlin
• Algorithms & Data Structures, Summer 2012, HU Berlin
• Seminar on Algorithmic Game Theory, Winter 2011/12, HU Berlin
• Algorithms & Data Structures, Summer 2011, HU Berlin
• Seminar on Algorithmic Game Theory, Winter 2010/11, HU Berlin
• Seminar: Perlen der theoretischen Informatik, Summer 2010, HU Berlin
• Seminar on Energy Efficient Algorithms, Summer 2010, HU Berlin
• Introduction to Theoretical Computer Science, Winter 2009/10, HU Berlin
• Theoretical Computer Science, Winter 2008/09, ETH Zürich
• Discrete Mathematics & Logic I, Winter 2006/07, FSU Jena
• Discrete Mathematics & Logic II, Summer 2006, FSU Jena
• Discrete Mathematics & Logic I, Winter 2005/06, FSU Jena

Short CV

Education:  

08/2014: PhD degree (Dr. rer. nat.) in computer science from Humboldt-University Berlin, Germany

07/2009: Diploma degree in computer science (Dipl.-Inf.) from Friedrich-Schiller-University Jena, Germany

09/2007 - 07/2009: Studies in theoretical computer science at ETH Zürich, Switzerland

10/2003 - 08/2007: Studies in computer science at Friedrich-Schiller-University Jena, Germany 

Positions:

Starting 10/2015: Researcher in the Algorithm Engineering Group at Hasso-Plattner-Institute Potsdam, Germany

10/2014 - 09/2015: Researcher in the Complexity and the Theoretical Computer Science I groups at Friedrich-Schiller-University Jena, Germany

08/2014 - 09/2014: Researcher in the Algorithms & Complexity Group at Humboldt-University Berlin, Germany

10/2009 -07/2014: PhD Student and Researcher in the Algorithms & Complexity Group at Humboldt-University Berlin, Germany