Search the dblp DataBase

Publications of Author

1. Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann
   Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. [Citation Graph (0, 0)][DBLP]
   ICALP, 2005, pp:51-65 [Conf]
   
2. Martin Gairing, Burkhard Monien, Karsten Tiemann
   Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. [Citation Graph (0, 0)][DBLP]
   ICALP (1), 2006, pp:501-512 [Conf]
   
3. Martin Gairing, Burkhard Monien, Karsten Tiemann
   Selfish routing with incomplete information. [Citation Graph (0, 0)][DBLP]
   SPAA, 2005, pp:203-212 [Conf]
   
4. Torsten Fahle, Karsten Tiemann
   An Improved Branch-and-Bound Algorithm for the Test Cover Problem. [Citation Graph (0, 0)][DBLP]
   WEA, 2005, pp:89-100 [Conf]
   
5. Vladimir Mazalov, Burkhard Monien, Florian Schoppmann, Karsten Tiemann
   Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic. [Citation Graph (0, 0)][DBLP]
   WINE, 2006, pp:331-342 [Conf]
   
6. Torsten Fahle, Karsten Tiemann
   A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal]
   
7. Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann
   The Power of Two Prices: Beyond Cross-Monotonicity. [Citation Graph (0, 0)][DBLP]
   MFCS, 2007, pp:657-668 [Conf]
   
8. Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann
   Congestion Games with Player-Specific Constants. [Citation Graph (0, 0)][DBLP]
   MFCS, 2007, pp:633-644 [Conf]
   
9. Burkhard Monien, Karsten Tiemann
   Routing and Scheduling with Incomplete Information. [Citation Graph (0, 0)][DBLP]
   DISC, 2007, pp:1-2 [Conf]
   
10. 
    MultiProcessor Scheduling is PLS-Complete. [Citation Graph (, )][DBLP]