| 2011 |
|---|
| 19 | On the Smoothed Price of Anarchy of the Traffic Assignment Problem. Luciana S. Buriol, Marcus Ritt, Felix Rodrigues, Guido Schäfer. ATMOS 2011, 122-133. Web SearchBibTeXDownload |
| 18 | Multi-Unit Auction with Diminishing Marginal Valuations and Capacities. Riccardo Colini Baldeschi, Stefano Leonardi, Guido Schäfer. CoRR (abs/1108.6033) (2011). Web SearchBibTeXDownload |
| 17 | The Robust Price of Anarchy of Altruistic Games. Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer. WINE 2011, 383-390. Web SearchBibTeXDownload |
| 2010 |
|---|
| 16 | Strict Cost Sharing Schemes for Steiner Forest. Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer. SIAM J. Comput. (39): 3616-3632 (2010). Web SearchBibTeXDownload |
| 2008 |
|---|
| 15 | 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 J. Comput. (37): 1319-1341 (2008). Web SearchBibTeXDownload |
| 2007 |
|---|
| 14 | An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer. SODA 2007, 1153-1162. Web SearchBibTeXDownload |
| 2006 |
|---|
| 13 | Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld. Math. Oper. Res. (31): 85-108 (2006). Web SearchBibTeXDownload |
| 12 | Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer. STOC 2006, 663-670. Web SearchBibTeXDownload |
| 11 | Matching Algorithms Are Fast in Sparse Random Graphs. Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki. Theory Comput. Syst. (39): 3-14 (2006). Web SearchBibTeXDownload |
| 2005 |
|---|
| 10 | Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld. Algorithms for Optimization with Incomplete Information 2005. Web SearchBibTeXDownload |
| 9 | 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 H. M. van Zwam. ICALP 2005, 930-942. Web SearchBibTeXDownload |
| 8 | A group-strategyproof mechanism for Steiner forests. Jochen Könemann, Stefano Leonardi, Guido Schäfer. SODA 2005, 612-619. Web SearchBibTeXDownload |
| 2004 |
|---|
| 7 | Cross-monotonic cost-sharing methods for connected facility location games. Stefano Leonardi, Guido Schäfer. ACM Conference on Electronic Commerce 2004, 242-243. Web SearchBibTeXDownload |
| 6 | Matching Algorithms Are Fast in Sparse Random Graphs. Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki. STACS 2004, 81-92. Web SearchBibTeXDownload |
| 5 | Cross-monotonic cost sharing methods for connected facility location games. Stefano Leonardi, Guido Schäfer. Theor. Comput. Sci. (326): 431-442 (2004). Web SearchBibTeXDownload |
| 2003 |
|---|
| 4 | A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. Kurt Mehlhorn, Kurt Mehlhorn, Guido Schäfer. Algorithmica (36): 75-88 (2003). Web SearchBibTeXDownload |
| 3 | Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld. FOCS 2003, 462-471. Web SearchBibTeXDownload |
| 2 | Scheduling to Minimize Flow Time Metrics. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer. IPDPS 2003, 223. Web SearchBibTeXDownload |
| 2001 |
|---|
| 1 | A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. Kurt Mehlhorn, Kurt Mehlhorn, Guido Schäfer. ESA 2001, 242-253. Web SearchBibTeXDownload |
