Karsten Tiemann

According to our database, Karsten Tiemann authored at least 12 papers between 2005 and 2011.

Collaborative distances:

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

2011

Routing (un-) splittable flow in games with player-specific affine latency functions.

Martin Gairing, Burkhard Monien, Karsten Tiemann

ACM Trans. Algorithms, 2011

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

Selfish Routing with Incomplete Information.

Martin Gairing, Burkhard Monien, Karsten Tiemann

Theory Comput. Syst., 2008

2007

Selfish routing with incomplete information.

Karsten Tiemann

PhD thesis, 2007

Routing and Scheduling with Incomplete Information.

Burkhard Monien, Karsten Tiemann

Proceedings of the Distributed Computing, 21st International Symposium, 2007

Congestion Games with Player-Specific Constants.

Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

The Power of Two Prices: Beyond Cross-Monotonicity.

Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

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

Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic.

Vladimir V. Mazalov, Burkhard Monien, Florian Schoppmann, Karsten Tiemann

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

Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions.

Martin Gairing, Burkhard Monien, Karsten Tiemann

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

An Improved Branch-and-Bound Algorithm for the Test Cover Problem.

Torsten Fahle, Karsten Tiemann

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture.

Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005