Average-case and smoothed competitive analysis of the multilevel feedback algorithm L Becchetti, S Leonardi, A Marchetti-Spaccamela, G Schäfer, T Vredeveld Mathematics of Operations Research 31 (1), 85-108, 2006 | 97 | 2006 |

Altruism and its impact on the price of anarchy PA Chen, BD Keijzer, D Kempe, G Schäfer ACM Transactions on Economics and Computation 2 (4), 17, 2014 | 84* | 2014 |

Budgeted matching and budgeted matroid intersection via the gasoline puzzle A Berger, V Bonifaci, F Grandoni, G Schäfer Mathematical Programming 128 (1-2), 355-372, 2011 | 77 | 2011 |

A group-strategyproof mechanism for Steiner forests J Könemann, S Leonardi, G Schäfer SODA 5, 612-619, 2005 | 74 | 2005 |

Cross-monotonic cost sharing methods for connected facility location games S Leonardi, G Schäfer Theoretical Computer Science 326 (1-3), 431-442, 2004 | 68 | 2004 |

Approximating connected facility location problems via random facility sampling and core detouring F Eisenbrand, F Grandoni, T Rothvoß, G Schäfer Proceeding of Nineteenth annual ACM-SIAM Symposium (SODA'08), 1174-1183, 2008 | 60 | 2008 |

Stackelberg routing in arbitrary networks V Bonifaci, T Harks, G Schäfer Mathematics of Operations Research 35 (2), 330-346, 2010 | 57* | 2010 |

Implementation of O (nm log n) weighted matchings in general graphs: the power of data structures K Mehlhorn, G Schäfer Journal of Experimental Algorithmics (JEA) 7, 4, 2002 | 56 | 2002 |

Connected facility location via random facility sampling and core detouring F Eisenbrand, F Grandoni, T Rothvoß, G Schäfer Journal of Computer and System Sciences 76 (8), 709-726, 2010 | 52 | 2010 |

Strict cost sharing schemes for Steiner forest L Fleischer, J Könemann, S Leonardi, G Schäfer SIAM Journal on Computing 39 (8), 3616-3632, 2010 | 52* | 2010 |

Efficiency of restricted tolls in non-atomic network routing games V Bonifaci, M Salek, G Schäfer International Symposium on Algorithmic Game Theory, 302-313, 2011 | 48 | 2011 |

An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem A Gupta, J Könemann, S Leonardi, R Ravi, G Schäfer Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007 | 46 | 2007 |

Solutions to real-world instances of PSPACE-complete stacking FG König, M Lübbecke, R Möhring, G Schäfer, I Spenke European Symposium on Algorithms, 729-740, 2007 | 44 | 2007 |

Inefficiency of standard multi-unit auctions B de Keijzer, E Markakis, G Schäfer, O Telelis European Symposium on Algorithms, 385-396, 2013 | 43 | 2013 |

From primal-dual to cost shares and back: a stronger LP relaxation for the Steiner forest problem J Könemann, S Leonardi, G Schäfer, S van Zwam International Colloquium on Automata, Languages, and Programming, 930-942, 2005 | 41 | 2005 |

Matching algorithms are fast in sparse random graphs H Bast, K Mehlhorn, G Schafer, H Tamaki Theory of Computing Systems 39 (1), 3-14, 2006 | 40 | 2006 |

Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems J Brenner, G Schäfer Theoretical computer science 401 (1-3), 96-106, 2008 | 38* | 2008 |

Coordination games on graphs KR Apt, M Rahn, G Schäfer, S Simon International Conference on Web and Internet Economics, 441-446, 2014 | 36 | 2014 |

A group-strategyproof cost sharing mechanism for the Steiner forest game J Könemann, S Leonardi, G Schäfer, SHM van Zwam SIAM Journal on Computing 37 (5), 1319-1341, 2008 | 35 | 2008 |

Topology matters: Smoothed competitiveness of metrical task systems G Schäfer, N Sivadasan Theoretical Computer Science 341 (1-3), 216-246, 2005 | 35 | 2005 |