Karsten Tiemann

13 papers A* 1A 1B 3Journal 3Unranked 4
YearRankTypeTitle / Venue / Authors
2011 J jnl
Routing (un-) splittable flow in games with player-specific affine latency functions.
ACM Trans. Algorithms
Martin Gairing, Burkhard Monien, Karsten Tiemann
2009 — conf
MultiProcessor Scheduling is PLS-Complete.
HICSS
Dominic Dumrauf, Burkhard Monien, Karsten Tiemann
2008 J jnl
Selfish Routing with Incomplete Information.
Theory Comput. Syst.
Martin Gairing, Burkhard Monien, Karsten Tiemann
2007 B conf
Congestion Games with Player-Specific Constants.
MFCS
Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann
2007 A conf
Routing and Scheduling with Incomplete Information.
DISC
Burkhard Monien, Karsten Tiemann
2007 — —
Selfish routing with incomplete information.
Karsten Tiemann
2007 B conf
The Power of Two Prices: Beyond Cross-Monotonicity.
MFCS
Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann
2006 J jnl
A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques.
ACM J. Exp. Algorithmics
Torsten Fahle, Karsten Tiemann
2006 — conf
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions.
ICALP (1)
Martin Gairing, Burkhard Monien, Karsten Tiemann
2006 — conf
Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic.
WINE
Vladimir V. Mazalov, Burkhard Monien, Florian Schoppmann, Karsten Tiemann
2005 — conf
An Improved Branch-and-Bound Algorithm for the Test Cover Problem.
WEA
Torsten Fahle, Karsten Tiemann
2005 A* conf
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture.
ICALP
Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann
2005 B conf
Selfish routing with incomplete information.
SPAA
Martin Gairing, Burkhard Monien, Karsten Tiemann