Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Sch{\"a}fer, Guido"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing optimal tolls with arc restrictions and heterogeneous players
Tomas Jelinek
,
Marcus Klaas
,
Guido Schäfer
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 433-444
Inefficiency of standard multi-unit auctions
Bart de Keijzer
,
Evangelos Markakis
,
Guido Schäfer
,
Orestis Telelis
Lecture Notes in Computer Science
8125
, 2013, pp. 385-396
Finding social optima in congestion games with positive externalities
Bart de Keijzer
,
Guido Schäfer
Lecture Notes in Computer Science
7501
, 2012, pp. 395-406
Online cooperative cost sharing
Janina Brenner
,
Guido Schäfer
Lecture Notes in Computer Science
6078
, 2010, pp. 252-263
Connected facility location via random facility sampling and core detouring
Friedrich Eisenbrand
,
Fabrizio Grandoni
,
Thomas Rothvoß
,
Guido Schäfer
Journal of Computer and System Sciences
76
(8), 2010, pp. 709-726
Strict cost sharing schemes for Steiner forest
Lisa Fleischer
,
Jochen Könemann
,
Stefano Leonardi
,
Guido Schäfer
SIAM Journal on Computing
39
(8), 2010, pp. 3616-3632
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
André Berger
,
Vincenzo Bonifaci
,
Fabrizio Grandoni
,
Guido Schäfer
Lecture Notes in Computer Science
5035
, 2008, pp. 273-287
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
Janina Brenner
,
Guido Schäfer
Theoretical Computer Science
401
(1-3), 2008, pp. 96-106
A group-strategyproof cost sharing mechanism for the Steiner forest game
Jochen Könemann
,
Stefano Leonardi
,
Guido Schäfer
,
Stefan H.M. van Zwam
SIAM Journal on Computing
37
(5), 2008, pp. 1319-1341
Cost sharing methods for makespan and completion time scheduling
Janina Brenner
,
Guido Schäfer
Lecture Notes in Computer Science
4393
, 2007, pp. 670-681
Solutions to real-world instances of PSPACE-complete stacking
Felix G. König
,
Macro Lübbecke
,
Rolf Möhring
,
Guido Schäfer
,
Ines Spenke
Lecture Notes in Computer Science
4698
, 2007, pp. 729-740
Matching algorithms are fast in sparse random graphs
Holger Bast
,
Kurt Mehlhorn
,
Guido Schäfer
,
Hisao Tamaki
Theory of Computing Systems
39
(1), 2006, pp. 3-14
From primal-dual to cost shares and back: A stronger
LP
relaxation for the Steiner forest problem
Jochen Könemann
,
Stefano Leonardi
,
Guido Schäfer
,
Stefan van Zwam
Lecture Notes in Computer Science
3580
, 2005, pp. 930-942
Topology matters: Smoothed competitiveness of metrical task systems
Guido Schäfer
,
Naveen Sivadasan
Theoretical Computer Science
341
(1-3), 2005, pp. 216-246
Matching algorithms are fast in sparse random graphs
Holger Bast
,
Kurt Mehlhorn
,
Guido Schäfer
,
Hisao Tamaki
Lecture Notes in Computer Science
2996
, 2004, pp. 81-92
Cross-monotonic cost sharing methods for connected facility location games
Stefano Leonardi
,
Guido Schäfer
Theoretical Computer Science
326
(1-3), 2004, pp. 431-442
Topology matters: Smoothed competitiveness of metrical task systems
Guido Schäfer
,
Naveen Sivadasan
Lecture Notes in Computer Science
2996
, 2004, pp. 489-500
A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms
Holger Bast
,
Kurt Mehlhorn
,
Guido Schäfer
,
Hisao Tamaki
Algorithmica
36
(1), 2003, pp. 75-88
All-pairs shortest-paths computation in the presence of negative cycles
Kurt Mehlhorn
,
Volker Priebe
,
Guido Schäfer
,
Naveen Sivadasan
Information Processing Letters
81
(6), 2002, pp. 341-343
A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms
Kurt Mehlhorn
,
Guido Schäfer
Lecture Notes in Computer Science
2161
, 2001, pp. 242-253