| 2026 | AAAI | Breaking Barriers, Finding Boundaries: Not Obviously Manipulable Budget-Feasible Mechanism Design. | Bart de Keijzer, Guido Schfer, Artem Tsikiridis, Carmine Ventre |
| 2026 | ESA | Online Flow Time Minimization with Gradually Revealed Jobs. | Alexander Lindermayr, Guido Schfer, Jens Schlter, Leen Stougie |
| 2026 | SODA | Optimal Type-Dependent Liquid Welfare Guarantees for Autobidding Agents with Budgets. | Riccardo Colini-Baldeschi, Sophie Klumper, Twan Kroll, Stefano Leonardi, Guido Schfer, Artem Tsikiridis |
| 2025 | SAGT | Online Budget-Feasible Mechanism Design with Predictions. | Georgios Amanatidis, Evangelos Markakis, Christodoulos Santorinaios, Guido Schfer, Panagiotis Tsamopoulos, Artem Tsikiridis |
| 2022 | SAGT | Greater Flexibility in Mechanism Design Through Altruism. | Ruben Brokkelkamp, Sjir Hoeijmakers, Guido Schfer |
| 2022 | SAGT | Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents. | Sophie Klumper, Guido Schfer |
| 2021 | WAOA | The Traveling k-Median Problem: Approximating Optimal Network Coverage. | Dylan Huizing, Guido Schfer |
| 2020 | WAOA | Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique. | Guido Schfer, Bernard G. Zweers |
| 2019 | EC | Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online. | Georgios Amanatidis, Pieter Kleer, Guido Schfer |
| 2019 | ESA | Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond. | Georgios Birmpas, Evangelos Markakis, Guido Schfer |
| 2019 | ISAAC | Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node. | Ruben Brokkelkamp, Sven C. Polak, Guido Schfer, Yllka Velaj |
| 2017 | CIAC | Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games. | Pieter Kleer, Guido Schfer |
| 2017 | SAGT | Path Deviations Outperform Approximate Stability in Heterogeneous Congestion Games. | Pieter Kleer, Guido Schfer |
| 2016 | MFCS | The Ground-Set-Cost Budgeted Maximum Coverage Problem. | Irving van Heuven van Staereling, Bart de Keijzer, Guido Schfer |
| 2016 | SAGT | The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games. | Pieter Kleer, Guido Schfer |
| 2015 | MFCS | Efficient Equilibria in Polymatrix Coordination Games. | Mona Rahn, Guido Schfer |
| 2014 | STACS | Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players. | Tomas Jelinek, Marcus Klaas, Guido Schfer |
| 2014 | SAGT | Mechanisms for Hiring a Matroid Base without Money. | Emmanouil Pountourakis, Guido Schfer |
| 2013 | ESA | Inefficiency of Standard Multi-unit Auctions. | Bart de Keijzer, Evangelos Markakis, Guido Schfer, Orestis Telelis |
| 2013 | SAGT | Inefficiency of Games with Social Context. | Aris Anagnostopoulos, Luca Becchetti, Bart de Keijzer, Guido Schfer |
| 2012 | ESA | Finding Social Optima in Congestion Games with Positive Externalities. | Bart de Keijzer, Guido Schfer |
| 2012 | SAGT | Selfishness Level of Strategic Games. | Krzysztof R. Apt, Guido Schfer |
| 2011 | ATMOS | On the Smoothed Price of Anarchy of the Traffic Assignment Problem. | Luciana S. Buriol, Marcus Ritt, Flix Carvalho Rodrigues, Guido Schfer |
| 2011 | SAGT | Efficiency of Restricted Tolls in Non-atomic Network Routing Games. | Vincenzo Bonifaci, Mahyar Salek, Guido Schfer |
| 2010 | CIAC | Online Cooperative Cost Sharing. | Janina A. Brenner, Guido Schfer |
| 2010 | SAGT | On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games. | Bart de Keijzer, Guido Schfer, Orestis Telelis |
| 2008 | IPCO | Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. | Andr Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schfer |
| 2008 | SODA | Approximating connected facility location problems via random facility sampling and core detouring. | Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvo, Guido Schfer |
| 2008 | SAGT | Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems. | Janina A. Brenner, Guido Schfer |
| 2007 | ESA | Solutions to Real-World Instances of PSPACE-Complete Stacking. | Felix G. Knig, Marco E. Lbbecke, Rolf H. Mhring, Guido Schfer, Ines Spenke |
| 2007 | SODA | An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. | Anupam Gupta, Jochen Knemann, Stefano Leonardi, R. Ravi, Guido Schfer |
| 2007 | STACS | Cost Sharing Methods for Makespan and Completion Time Scheduling. | Janina A. Brenner, Guido Schfer |
| 2006 | STOC | Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. | Lisa Fleischer, Jochen Knemann, Stefano Leonardi, Guido Schfer |
| 2005 | ICALP | From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. | Jochen Knemann, Stefano Leonardi, Guido Schfer, Stefan H. M. van Zwam |
| 2005 | SODA | A group-strategyproof mechanism for Steiner forests. | Jochen Knemann, Stefano Leonardi, Guido Schfer |
| 2004 | STACS | Matching Algorithms Are Fast in Sparse Random Graphs. | Hannah Bast, Kurt Mehlhorn, Guido Schfer, Hisao Tamaki |
| 2004 | STACS | Topology Matters: Smoothed Competitiveness of Metrical Task Systems. | Guido Schfer, Naveen Sivadasan |
| 2003 | FOCS | Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. | Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schfer, Tjark Vredeveld |
| 2001 | ESA | A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. | Kurt Mehlhorn, Guido Schfer |
| 1998 | ESA | An Experimental Study of Dynamic Algorithms for Directed Graphs. | Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schfer, Christos D. Zaroliagis |