Price of Anarchy for Polynomial Wardrop Games. - Dominic Dumrauf; Martin Gairing (WINE, 2006)

On the Road to -Completeness: 8 Agents in a Singleton Congestion Game. - Dominic Dumrauf; Burkhard Monien (WINE, 2008)

MultiProcessor Scheduling is PLS-Complete. - Dominic Dumrauf; Burkhard Monien; Karsten Tiemann (HICSS, 2009)

On the Complexity of Local Search for Weighted Standard Set Problems. - Dominic Dumrauf; Tim Süß (CiE, 2010)

Local Search: Simple, Successful, But Sometimes Sluggish. - Burkhard Monien; Dominic Dumrauf; Tobias Tscheuschner (ICALP (1), 2010)

Exact Price of Anarchy for Polynomial Congestion Games. - Sebastian Aland; Dominic Dumrauf; Martin Gairing; Burkhard Monien; Florian Schoppmann (SIAM J. Comput., 2011)

On the hardness of computing local optima (Über die Schwierigkeit der Berechnung Lokaler Optima) - Dominic Dumrauf (2011)

Computing Nash Equilibria for Two-Player Restricted Network Congestion Games is -Complete. - Dominic Dumrauf; Burkhard Monien (Parallel Process. Lett., 2012)

On the PLS-complexity of maximum constraint assignment. - Dominic Dumrauf; Burkhard Monien (Theor. Comput. Sci., 2013)