Guido Schäfer

	2008
30		André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer: Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. IPCO 2008: 273-287
29		Janina A. Brenner, Guido Schäfer: Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems. SAGT 2008: 315-326
28		Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer: Approximating connected facility location problems via random facility sampling and core detouring. SODA 2008: 1174-1183
27		Vincenzo Bonifaci, Tobias Harks, Guido Schäfer: Stackelberg Routing in Arbitrary Networks. WINE 2008: 239-250
26		Guido Schäfer: Steiner Forest. Encyclopedia of Algorithms 2008
25		Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam: A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game. SIAM J. Comput. 37(5): 1319-1341 (2008)
24		Janina A. Brenner, Guido Schäfer: Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems. Theor. Comput. Sci. 401(1-3): 96-106 (2008)
	2007
23		Felix G. König, Marco E. Lübbecke, Rolf H. Möhring, Guido Schäfer, Ines Spenke: Solutions to Real-World Instances of PSPACE-Complete Stacking. ESA 2007: 729-740
22		Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer: An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. SODA 2007: 1153-1162
21		Janina A. Brenner, Guido Schäfer: Cost Sharing Methods for Makespan and Completion Time Scheduling. STACS 2007: 670-681
	2006
20		Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer: Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. STOC 2006: 663-670
19		Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld: Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm. Math. Oper. Res. 31(1): 85-108 (2006)
18		Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki: Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst. 39(1): 3-14 (2006)
	2005
17		Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld: Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. Algorithms for Optimization with Incomplete Information 2005
16		Guido Schäfer, Naveen Sivadasan: Topology Matters: Smoothed Competitiveness of Metrical Task Systems. Algorithms for Optimization with Incomplete Information 2005
15		Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam: From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. ICALP 2005: 930-942
14		Jochen Könemann, Stefano Leonardi, Guido Schäfer: A group-strategyproof mechanism for Steiner forests. SODA 2005: 612-619
13		Guido Schäfer, Naveen Sivadasan: Topology matters: Smoothed competitiveness of metrical task systems. Theor. Comput. Sci. 341(1-3): 216-246 (2005)
	2004
12		Stefano Leonardi, Guido Schäfer: Cross-monotonic cost-sharing methods for connected facility location games. ACM Conference on Electronic Commerce 2004: 242-243
11		Guido Schäfer, Naveen Sivadasan: Topology Matters: Smoothed Competitiveness of Metrical Task Systems. STACS 2004: 489-500
10		Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki: Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004: 81-92
9		Stefano Leonardi, Guido Schäfer: Cross-monotonic cost sharing methods for connected facility location games. Theor. Comput. Sci. 326(1-3): 431-442 (2004)
	2003
8		Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld: Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. FOCS 2003: 462-471
7		Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer: Scheduling to Minimize Flow Time Metrics. IPDPS 2003: 223
6		Holger Bast, Kurt Mehlhorn, Guido Schäfer: A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. Algorithmica 36(1): 75-88 (2003)
	2002
5		Kurt Mehlhorn, Guido Schäfer: Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures. ACM Journal of Experimental Algorithmics 7: 4 (2002)
4		Kurt Mehlhorn, Volker Priebe, Guido Schäfer, Naveen Sivadasan: All-pairs shortest-paths computation in the presence of negative cycles. Inf. Process. Lett. 81(6): 341-343 (2002)
	2001
3		Kurt Mehlhorn, Guido Schäfer: A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. ESA 2001: 242-253
	2000
2		Kurt Mehlhorn, Guido Schäfer: Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures. Algorithm Engineering 2000: 23-38
	1998
1		Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, Christos D. Zaroliagis: An Experimental Study of Dynamic Algorithms for Directed Graphs. ESA 1998: 368-380

Coauthor Index

1	Hannah Bast (Holger Bast)	[6] [10] [18]
2	Luca Becchetti	[7] [8] [17] [19]
3	André Berger	[30]
4	Vincenzo Bonifaci	[27] [30]
5	Janina A. Brenner	[21] [24] [29]
6	Friedrich Eisenbrand	[28]
7	Lisa Fleischer	[20]
8	Daniele Frigioni	[1]
9	Fabrizio Grandoni	[28] [30]
10	Anupam Gupta	[22]
11	Tobias Harks	[27]
12	Jochen Könemann	[14] [15] [20] [22] [25]
13	Felix G. König	[23]
14	Stefano Leonardi	[7] [8] [9] [12] [14] [15] [17] [19] [20] [22] [25]
15	Marco E. Lübbecke	[23]
16	Alberto Marchetti-Spaccamela	[7] [8] [17] [19]
17	Kurt Mehlhorn	[2] [3] [4] [5] [6] [10] [18]
18	Tobias Miller	[1]
19	Rolf H. Möhring	[23]
20	Umberto Nanni	[1]
21	Giulio Pasqualone	[1]
22	Volker Priebe	[4]
23	R. Ravi	[22]
24	Thomas Rothvoß	[28]
25	Naveen Sivadasan	[4] [11] [13] [16]
26	Ines Spenke	[23]
27	Hisao Tamaki	[10] [18]
28	Tjark Vredeveld	[8] [17] [19]
29	Christos D. Zaroliagis	[1]
30	Stefan H. M. van Zwam	[15] [25]

Colors in the list of coauthors