Bonifaci, V., T. Harks and G. Schäfer: Stackelberg routing in arbitrary networks. In: Mathematics of Operations Research 35, 2, 330-346 (2010).
doi: 10.1287/moor.1100.0442v1
url: http://dx.doi.org/10.1287/moor.1100.0442
localid: C1256428004B93B8-9CA118DFF9513FF6C12577FF006056B0-Bonifaci:2009:a
Bast, H., K. Mehlhorn, G. Schäfer and H. Tamaki: Matching Algorithms are Fast in Sparse Random Graphs. In: Theory of Computing Systems 39, 3-14 (2006).
localid: C1256428004B93B8-257B5C3871441CAAC1256FC0004404AB-BMST05
Schäfer, G.: Worst case instances are fragile: average case and smoothed competitive analysis of algorithms. Doktorarbeit, Universität des Saarlandes, Saarbrücken (2005-02-02).
localid: C1256428004B93B8-16D055C6351F1DBCC1256F9C0032A4EE-Schäfer04
Schäfer, G.: Worst case instances are fragile: average case and smoothed competitive analysis of algorithms. Doktorarbeit, Universität des Saarlandes, Saarbrücken (2004).
localid: C1256428004B93B8-16D055C6351F1DBCC1256F9C0032A4EE-Schäfer04
Bast, H., K. Mehlhorn, G. Schäfer and H. Tamaki: Matching Algorithms Are Fast in Sparse Random Graphs. In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04) Lecture Notes in Computer Science. Springer, Berlin, Germany (2004) 81-92.
localid: C1256428004B93B8-1F79D167AE1C3869C1256F9500480213-bast04stacs
Leonardi, S. and G. Schäfer: Cross-monotonic cost sharing methods for connected facility location games. In: EC'04 : proceedings of the 5th ACM Conference on Electronic Commerce ; New York, New York, USA, May 17-20, 2004 ACM, New York, USA (2004) 242-243.
localid: C1256428004B93B8-E8EE6CF75A1BD350C1256F9C003133C1-Leonardi04EC
Leonardi, S. and G. Schäfer: Cross-monotonic cost sharing methods for connected facility location games. In: Theoretical Computer Science 326, 431-442 (2004).
localid: C1256428004B93B8-D66B5541CE645003C1256F9C00323C8B-Leonardi04
Schäfer, G. and N. Sivadasan: Topology matters: Smoothed competitiveness of metrical task systems. In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04) Lecture Notes in Computer Science. Springer, Berlin, Germany (2004) 489-500.
localid: C1256428004B93B8-7F33404549ADEA5DC1256F560048EE68-Sivadasan2004
Leonardi, S. and G. Schäfer: Cross-monotonic cost sharing methods for connected facility location games. In: Theoretical Computer Science 326, 431-442 (2004).
localid: C1256428004B93B8-D66B5541CE645003C1256F9C00323C8B-Leonardi04
Leonardi, S. and G. Schäfer: Cross-monotonic cost sharing methods for connected facility location games. In: EC'04 : proceedings of the 5th ACM Conference on Electronic Commerce ; New York, New York, USA, May 17-20, 2004 ACM, New York, USA (2004) 242-243.
localid: C1256428004B93B8-E8EE6CF75A1BD350C1256F9C003133C1-Leonardi04EC
http://edoc.mpg.de
The Max Planck Society does not take any responsibility for the content of this export.