Max Planck Society - eDoc Server

http://edoc.mpg.de



Stackelberg routing in arbitrary networks
Authors: Bonifaci, Vincenzo; Harks, Tobias; Schäfer, Guido
Date of Publication (YYYY-MM-DD): 2010
Title of Journal: Mathematics of Operations Research
Volume: 35
Issue / Number: 2
Start Page: 330
End Page: 346
Document Type: Article
ID: 536757.0


Matching Algorithms are Fast in Sparse Random Graphs
Authors: Bast, Holger; Mehlhorn, Kurt; Schäfer, Guido; Tamaki, Hisao
Date of Publication (YYYY-MM-DD): 2006
Title of Journal: Theory of Computing Systems
Volume: 39
Start Page: 3
End Page: 14
Document Type: Article
ID: 314609.0


Worst case instances are fragile: average case and smoothed competitive analysis of algorithms
Authors: Schäfer, Guido
Name of University: Universität des Saarlandes
Place of University: Saarbrücken
Document Type: PhD-Thesis
ID: 231238.0


Worst case instances are fragile: average case and smoothed competitive analysis of algorithms
Authors: Schäfer, Guido
Name of University: Universität des Saarlandes
Place of University: Saarbrücken
Date of Approval (YYYY-MM-DD): 2004-04-30
Document Type: PhD-Thesis
ID: 232064.0


Matching Algorithms Are Fast in Sparse Random Graphs
Editors: Diekert, Volker; Habib, Michel
Authors: Bast, Holger; Mehlhorn, Kurt; Schäfer, Guido; Tamaki, Hisao
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2004
Title of Proceedings: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04)
Start Page: 81
End Page: 92
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 231169.0


Cross-monotonic cost sharing methods for connected facility location games
Authors: Leonardi, Stefano; Schäfer, Guido
Place of Publication: New York, USA
Publisher: ACM
Date of Publication (YYYY-MM-DD): 2004
Title of Proceedings: EC'04 : proceedings of the 5th ACM Conference on Electronic Commerce ; New York, New York, USA, May 17-20, 2004
Start Page: 242
End Page: 243
Document Type: Conference-Paper
ID: 231215.0


Cross-monotonic cost sharing methods for connected facility location games
Authors: Leonardi, Stefano; Schäfer, Guido
Date of Publication (YYYY-MM-DD): 2004
Title of Journal: Theoretical Computer Science
Volume: 326
Start Page: 431
End Page: 442
Document Type: Article
ID: 231216.0


Topology matters: Smoothed competitiveness of metrical task systems
Editors: Diekert, Volker; Habib, Michel
Authors: Schäfer, Guido; Sivadasan, Naveen
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2004
Title of Proceedings: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04)
Start Page: 489
End Page: 500
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 231226.0


Cross-monotonic cost sharing methods for connected facility location games
Authors: Leonardi, Stefano; Schäfer, Guido
Date of Publication (YYYY-MM-DD): 2004
Title of Journal: Theoretical Computer Science
Volume: 326
Start Page: 431
End Page: 442
Document Type: Article
ID: 231943.0


Cross-monotonic cost sharing methods for connected facility location games
Authors: Leonardi, Stefano; Schäfer, Guido
Place of Publication: New York, USA
Publisher: ACM
Date of Publication (YYYY-MM-DD): 2004
Title of Proceedings: EC'04 : proceedings of the 5th ACM Conference on Electronic Commerce ; New York, New York, USA, May 17-20, 2004
Start Page: 242
End Page: 243
Document Type: Conference-Paper
ID: 231939.0