- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i4 |      | Bart de Keijzer, Evangelos Markakis, Guido Schäfer, Orestis Telelis: On the Inefficiency of Standard Multi-Unit Auctions. CoRR abs/1303.1646 (2013) |
| 2012 | ||
| c27 | | Bart de Keijzer, Guido Schäfer: Finding Social Optima in Congestion Games with Positive Externalities. ESA 2012: 395-406 |
| c26 | | |
| 2011 | ||
| j13 | | André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer: Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Math. Program. 128(1-2): 355-372 (2011) |
| c25 | | Luciana S. Buriol, Marcus Ritt, Felix Rodrigues, Guido Schäfer: On the Smoothed Price of Anarchy of the Traffic Assignment Problem. ATMOS 2011: 122-133 |
| c24 | | Vincenzo Bonifaci, Mahyar Salek, Guido Schäfer: Efficiency of Restricted Tolls in Non-atomic Network Routing Games. SAGT 2011: 302-313 |
| c23 | | Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer: The Robust Price of Anarchy of Altruistic Games. WINE 2011: 383-390 |
| i3 | | |
| i2 | | Riccardo Colini-Baldeschi, Stefano Leonardi, Guido Schäfer: Multi-Unit Auction with Diminishing Marginal Valuations and Capacities. CoRR abs/1108.6033 (2011) |
| i1 | | Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer: The Robust Price of Anarchy of Altruistic Games. CoRR abs/1112.3680 (2011) |
| 2010 | ||
| j12 | | Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer: Connected facility location via random facility sampling and core detouring. J. Comput. Syst. Sci. 76(8): 709-726 (2010) |
| j11 | | Vincenzo Bonifaci, Tobias Harks, Guido Schäfer: Stackelberg Routing in Arbitrary Networks. Math. Oper. Res. 35(2): 330-346 (2010) |
| j10 | | Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer: Strict Cost Sharing Schemes for Steiner Forest. SIAM J. Comput. 39(8): 3616-3632 (2010) |
| c22 | | |
| c21 | | Bart de Keijzer, Guido Schäfer, Orestis Telelis: On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games. SAGT 2010: 335-346 |
| 2008 | ||
| j9 | | 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) |
| j8 | | 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) |
| c20 | | André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer: Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. IPCO 2008: 273-287 |
| c19 | | Janina A. Brenner, Guido Schäfer: Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems. SAGT 2008: 315-326 |
| c18 | | 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 |
| c17 | | Vincenzo Bonifaci, Tobias Harks, Guido Schäfer: Stackelberg Routing in Arbitrary Networks. WINE 2008: 239-250 |
| r1 | | |
| 2007 | ||
| c16 | | 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 |
| c15 | | 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 |
| c14 | | Janina A. Brenner, Guido Schäfer: Cost Sharing Methods for Makespan and Completion Time Scheduling. STACS 2007: 670-681 |
| 2006 | ||
| j7 | | 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) |
| j6 | | 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) |
| c13 | | 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 |
| 2005 | ||
| j5 | | Guido Schäfer, Naveen Sivadasan: Topology matters: Smoothed competitiveness of metrical task systems. Theor. Comput. Sci. 341(1-3): 216-246 (2005) |
| c12 | | 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 |
| c11 | | Guido Schäfer, Naveen Sivadasan: Topology Matters: Smoothed Competitiveness of Metrical Task Systems. Algorithms for Optimization with Incomplete Information 2005 |
| c10 | | 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 |
| c9 | | Jochen Könemann, Stefano Leonardi, Guido Schäfer: A group-strategyproof mechanism for Steiner forests. SODA 2005: 612-619 |
| 2004 | ||
| b1 | | Guido Schäfer: Worst case instances are fragile: average case and smoothed competitive analysis of algorithms. Saarland University 2004, pp. 1-115 |
| j4 | | Stefano Leonardi, Guido Schäfer: Cross-monotonic cost sharing methods for connected facility location games. Theor. Comput. Sci. 326(1-3): 431-442 (2004) |
| c8 | | Stefano Leonardi, Guido Schäfer: Cross-monotonic cost-sharing methods for connected facility location games. ACM Conference on Electronic Commerce 2004: 242-243 |
| c7 | | Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki: Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004: 81-92 |
| c6 | | Guido Schäfer, Naveen Sivadasan: Topology Matters: Smoothed Competitiveness of Metrical Task Systems. STACS 2004: 489-500 |
| 2003 | ||
| j3 | | 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) |
| c5 | | 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 |
| c4 | | Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer: Scheduling to Minimize Flow Time Metrics. IPDPS 2003: 223 |
| 2002 | ||
| j2 | | 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) |
| j1 | | 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) |
| 2001 | ||
| c3 | | 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 | ||
| c2 | | 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 | ||
| c1 | | 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 |
Data released under the ODC-BY 1.0 license — See also our legal information page