Dominic Dumrauf

According to our database, Dominic Dumrauf authored at least 9 papers between 2006 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

On the <i>PLS</i>-complexity of maximum constraint assignment.

Dominic Dumrauf, Burkhard Monien

Theor. Comput. Sci., 2013

2012

Computing Nash Equilibria for Two-Player Restricted Network Congestion Games is -Complete.

Dominic Dumrauf, Burkhard Monien

Parallel Process. Lett., 2012

2011

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

Dominic Dumrauf

PhD thesis, 2011

Exact Price of Anarchy for Polynomial Congestion Games.

Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann

SIAM J. Comput., 2011

2010

Local Search: Simple, Successful, But Sometimes Sluggish.

Burkhard Monien, Dominic Dumrauf, Tobias Tscheuschner

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

On the Complexity of Local Search for Weighted Standard Set Problems.

Dominic Dumrauf, Tim Süß

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009

MultiProcessor Scheduling is PLS-Complete.

Dominic Dumrauf, Burkhard Monien, Karsten Tiemann

Proceedings of the 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), 2009

2008

On the Road to -Completeness: 8 Agents in a Singleton Congestion Game.

Dominic Dumrauf, Burkhard Monien

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

2006

Price of Anarchy for Polynomial Wardrop Games.

Dominic Dumrauf, Martin Gairing

Proceedings of the Internet and Network Economics, Second International Workshop, 2006