Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. - Martin Gairing; Thomas Lücking 001; Burkhard Monien; Karsten Tiemann (ICALP, 2005)

An Improved Branch-and-Bound Algorithm for the Test Cover Problem. - Torsten Fahle; Karsten Tiemann (WEA, 2005)

Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. - Martin Gairing; Burkhard Monien; Karsten Tiemann (ICALP (1), 2006)

Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic. - Vladimir V. Mazalov; Burkhard Monien; Florian Schoppmann; Karsten Tiemann (WINE, 2006)

A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques. - Torsten Fahle; Karsten Tiemann (ACM J. Exp. Algorithmics, 2006)

The Power of Two Prices: Beyond Cross-Monotonicity. - Yvonne Bleischwitz; Burkhard Monien; Florian Schoppmann; Karsten Tiemann (MFCS, 2007)

Congestion Games with Player-Specific Constants. - Marios Mavronicolas; Igal Milchtaich; Burkhard Monien; Karsten Tiemann (MFCS, 2007)

Routing and Scheduling with Incomplete Information. - Burkhard Monien; Karsten Tiemann (DISC, 2007)

Selfish routing with incomplete information. - Karsten Tiemann (2007)

Selfish Routing with Incomplete Information. - Martin Gairing; Burkhard Monien; Karsten Tiemann (Theory Comput. Syst., 2008)

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

Routing (un-) splittable flow in games with player-specific affine latency functions. - Martin Gairing; Burkhard Monien; Karsten Tiemann (ACM Trans. Algorithms, 2011)