A Packet Routing Protocol for Arbitrary Networks. - Friedhelm Meyer auf der Heide; Berthold Vöcking (STACS, 1995)

Universal Algorithms for Store-and-Forward and Wormhole Routing. - Robert Cypher; Friedhelm Meyer auf der Heide; Christian Scheideler; Berthold Vöcking (STOC, 1996)

Static and Dynamic Data Management in Networks. - Friedhelm Meyer auf der Heide; Berthold Vöcking (Euro-Par, 1997)

Exploiting Locality for Data Management in Systems of Limited Bandwidth. - Bruce M. Maggs; Friedhelm Meyer auf der Heide; Berthold Vöcking; Matthias Westermann (FOCS, 1997)

Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. - Richard Cole 001; Bruce M. Maggs; Friedhelm Meyer auf der Heide; Michael Mitzenmacher; Andréa W. Richa; Klaus Schröder; Ramesh K. Sitaraman; Berthold Vöcking (STOC, 1998)

Universal Continuous Routing Strategies. - Christian Scheideler; Berthold Vöcking (Theory Comput. Syst., 1998)

Static and dynamic data Management in networks. - Berthold Vöcking (1998)

Provably Good and Practical Strategies for Non-Uniform Data Management in Networks. - Friedhelm Meyer auf der Heide; Berthold Vöcking; Matthias Westermann (ESA, 1999)

Approximating Multicast Congestion. - Santosh S. Vempala; Berthold Vöcking (ISAAC, 1999)

Shortest-Path Routing in Arbitrary Networks. - Friedhelm Meyer auf der Heide; Berthold Vöcking (J. Algorithms, 1999)

Randomized Rumor Spreading. - Richard M. Karp; Christian Schindelhauer; Scott Shenker; Berthold Vöcking (FOCS, 2000)

Caching in networks (extended abstract). - Friedhelm Meyer auf der Heide; Berthold Vöcking; Matthias Westermann (SODA, 2000)

Improved Routing and Sorting on Multibutterflies. - Bruce M. Maggs; Berthold Vöcking (Algorithmica, 2000)

From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. - Christian Scheideler; Berthold Vöcking (SIAM J. Comput., 2000)

A data tracking scheme for general networks. - Rajmohan Rajaraman; Andréa W. Richa; Berthold Vöcking; Gayathri Vuppuluri (SPAA, 2001)

Almost optimal permutation routing on hypercubes. - Berthold Vöcking (STOC, 2001)

Routing and Communication in Interconnection Networks. - Michele Flammini; Bruce M. Maggs; Jop F. Sibeyn; Berthold Vöcking (Euro-Par, 2002)

Random Arc Allocation and Applications. - Peter Sanders 001; Berthold Vöcking (SWAT, 2002)

Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. - Christof Krick; Friedhelm Meyer auf der Heide; Harald Räcke; Berthold Vöcking; Matthias Westermann (Theory Comput. Syst., 2002)

An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation. - Amit Agarwal; Tarun Agarwal; Sumit Chopra; Anja Feldmann; Nils Kammenhuber; Piotr Krysta; Berthold Vöcking (Euro-Par, 2003)

Scheduling and Traffic Allocation for Tasks with Bounded Splittability. - Piotr Krysta; Peter Sanders 001; Berthold Vöcking (MFCS, 2003)

Randomized Pursuit-Evasion In Graphs. - Micah Adler; Harald Räcke; Naveen Sivadasan; Christian Sohler; Berthold Vöcking (Comb. Probab. Comput., 2003)

Tail Bounds And Expectations For Random Arc Allocation And Applications. - Peter Sanders 001; Berthold Vöcking (Comb. Probab. Comput., 2003)

How asymmetry helps load balancing. - Berthold Vöcking (J. ACM, 2003)

On the Evolution of Selfish Routing. - Simon Fischer 001; Berthold Vöcking (ESA, 2004)

Computing equilibria for congestion games with (im)perfect information. - René Beier; Artur Czumaj; Piotr Krysta; Berthold Vöcking (SODA, 2004)

Probabilistic analysis of knapsack core algorithms. - René Beier; Berthold Vöcking (SODA, 2004)

Random knapsack in expected polynomial time. - René Beier; Berthold Vöcking (J. Comput. Syst. Sci., 2004)

Foreword. - Pilar de la Torre; Michael Mitzenmacher; Rajmohan Rajaraman; Berthold Vöcking (Theory Comput. Syst., 2004)

Congestion Games: Optimization in Competition. - Berthold Vöcking (ACiD, 2006)

An Experimental Study of Random Knapsack Problems. - René Beier; Berthold Vöcking (Algorithmica, 2006)

On the Impact of Combinatorial Structure on Congestion Games. - Heiner Ackermann; Heiko Röglin; Berthold Vöcking (Electron. Colloquium Comput. Complex., 2006)

Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. - Matthias Englert; Heiko Röglin; Berthold Vöcking (Electron. Colloquium Comput. Complex., 2006)

Foreword. - Peter Sanders 001; Aravind Srinivasan; Berthold Vöcking (Theory Comput. Syst., 2006)

Typical Properties of Winners and Losers in Discrete Optimization. - René Beier; Berthold Vöcking (SIAM J. Comput., 2006)

Balanced Allocations: The Heavily Loaded Case. - Petra Berenbrink; Artur Czumaj; Angelika Steger; Berthold Vöcking (SIAM J. Comput., 2006)

Computing equilibria for a service provider game with (Im)perfect information. - René Beier; Artur Czumaj; Piotr Krysta; Berthold Vöcking (ACM Trans. Algorithms, 2006)

Distributed Load Balancing Algorithm for Adaptive Channel Allocation for Cognitive Radios. - Simon Fischer 001; Marina Petrova; Petri Mähönen; Berthold Vöcking (CrownCom, 2007)

07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. - Martin Dietzfelbinger; Shang-Hua Teng; Eli Upfal; Berthold Vöcking (Probabilistic Methods in the Design and Analysis of Algorithms, 2007)

The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. - René Beier; Heiko Röglin; Berthold Vöcking (IPCO, 2007)

Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract. - Matthias Englert; Heiko Röglin; Berthold Vöcking (SODA, 2007)

Smoothed analysis of integer programming. - Heiko Röglin; Berthold Vöcking (Math. Program., 2007)

Tight bounds for worst-case equilibria. - Artur Czumaj; Berthold Vöcking (ACM Trans. Algorithms, 2007)

Decision-making based on approximate and smoothed Pareto curves. - Heiner Ackermann; Alantha Newman; Heiko Röglin; Berthold Vöcking (Theor. Comput. Sci., 2007)

On the structure and complexity of worst-case equilibria. - Simon Fischer 001; Berthold Vöcking (Theor. Comput. Sci., 2007)

Inapproximability of pure nash equilibria. - Alexander Skopalik; Berthold Vöcking (STOC, 2008)

Approximating Wardrop equilibria with finitely many agents. - Simon Fischer 001; Lars Olbrich; Berthold Vöcking (Distributed Comput., 2008)

Who Should Pay for Forwarding Packets? - Heiner Ackermann; Patrick Briest; Alexander Fanghänel; Berthold Vöcking (Internet Math., 2008)

A Unified Approach to Congestion Games and Two-Sided Markets. - Heiner Ackermann; Paul W. Goldberg; Vahab S. Mirrokni; Heiko Röglin; Berthold Vöcking (Internet Math., 2008)

Das Rucksackproblem. - René Beier; Berthold Vöcking (Taschenbuch der Algorithmen, 2008)

Price of Anarchy for Machines Models. - Artur Czumaj; Berthold Vöcking (Encyclopedia of Algorithms, 2008)

Utilitarian Mechanism Design for Single-Minded Agents. - Piotr Krysta; Berthold Vöcking (Encyclopedia of Algorithms, 2008)

Management of Variable Data Streams in Networks. - Anja Feldmann; Simon Fischer 001; Nils Kammenhuber; Berthold Vöcking (Algorithmics of Large and Complex Networks, 2009)

Approximability of OFDMA Scheduling. - Marcel Ochel; Berthold Vöcking (ESA, 2009)

Congestion games: Equilibria, convergence and complexity. - Berthold Vöcking (GAMENETS, 2009)

Oblivious interference scheduling. - Alexander Fanghänel; Thomas Kesselheim; Harald Räcke; Berthold Vöcking (PODC, 2009)

Economical Caching with Stochastic Prices. - Matthias Englert; Berthold Vöcking; Melanie Winkler (SAGA, 2009)

Pure Nash equilibria in player-specific and weighted congestion games. - Heiner Ackermann; Heiko Röglin; Berthold Vöcking (Theor. Comput. Sci., 2009)

Adaptive routing with stale information. - Simon Fischer 001; Berthold Vöcking (Theor. Comput. Sci., 2009)

10211 Abstracts Collection - Flexible Network Design. - Anupam Gupta 001; Stefano Leonardi 001; Berthold Vöcking; Roger Wattenhofer (Flexible Network Design, 2010)

Brief announcement: distributed contention resolution in wireless networks. - Thomas Kesselheim; Berthold Vöcking (PODC, 2010)

Distributed Contention Resolution in Wireless Networks. - Thomas Kesselheim; Berthold Vöcking (DISC, 2010)

Online Capacity Maximization in Wireless Networks. - Alexander Fanghänel; Sascha Geulen; Martin Hoefer 001; Berthold Vöcking (Electron. Colloquium Comput. Complex., 2010)

Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm. - Melanie Winkler; Berthold Vöcking; Sascha Geulen (Electron. Colloquium Comput. Complex., 2010)

Berechnung von Nash-Gleichgewichten. - Martin Hoefer 001; Berthold Vöcking (Inform. Spektrum, 2010)

Selfish Traffic Allocation for Server Farms. - Artur Czumaj; Piotr Krysta; Berthold Vöcking (SIAM J. Comput., 2010)

Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods. - Simon Fischer 001; Harald Räcke; Berthold Vöcking (SIAM J. Comput., 2010)

The Knapsack Problem. - René Beier; Berthold Vöcking (Algorithms Unplugged, 2011)

Considerate Equilibrium. - Martin Hoefer 001; Michal Penn; Maria Polukarov; Alexander Skopalik; Berthold Vöcking (IJCAI, 2011)

Uncoordinated Two-Sided Matching Markets. - Heiner Ackermann; Paul W. Goldberg; Vahab S. Mirrokni; Heiko Röglin; Berthold Vöcking (SIAM J. Comput., 2011)

Approximation Techniques for Utilitarian Mechanism Design. - Patrick Briest; Piotr Krysta; Berthold Vöcking (SIAM J. Comput., 2011)

Improved algorithms for latency minimization in wireless networks. - Alexander Fanghänel; Thomas Kesselheim; Berthold Vöcking (Theor. Comput. Sci., 2011)

Scheduling and Power Assignments in the Physical Model. - Alexander Fanghänel; Berthold Vöcking (Theoretical Aspects of Distributed Computing in Sensor Networks, 2011)

Online Mechanism Design (Randomized Rounding on the Fly). - Piotr Krysta; Berthold Vöcking (ICALP (2), 2012)

Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization. - Marcel Ochel; Klaus Radke; Berthold Vöcking (ICALP (2), 2012)

Randomized Mechanisms for Multi-unit Auctions - (Extended Abstract). - Berthold Vöcking (ICALP (2), 2012)

Computing approximate Nash equilibria in network congestion games. - Andreas Emil Feldmann; Heiko Röglin; Berthold Vöcking (Networks, 2012)

An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions. - Thomas Kesselheim; Klaus Radke; Andreas Tönnis; Berthold Vöcking (ESA, 2013)

Electronic Markets and Auctions (Dagstuhl Seminar 13461). - Yishay Mansour; Benny Moldovanu; Noam Nisan; Berthold Vöcking (Dagstuhl Reports, 2013)

Economical Caching. - Matthias Englert; Heiko Röglin; Jacob Spönemann; Berthold Vöcking (ACM Trans. Comput. Theory, 2013)

Optimized buffer allocation in multicore platforms. - Maximilian Odendahl; Andres Goens; Rainer Leupers; Gerd Ascheid; Benjamin Ries; Berthold Vöcking; Tomas Henriksson (DATE, 2014)

Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. - Oliver Göbel 002; Martin Hoefer 001; Thomas Kesselheim; Thomas Schleiden; Berthold Vöcking (ICALP (2), 2014)

Thorp Shuffling, Butterflies, and Non-Markovian Couplings. - Artur Czumaj; Berthold Vöcking (ICALP (1), 2014)

Comparative study of approximation algorithms and heuristics for SINR scheduling with power control. - Lukas Belke; Thomas Kesselheim; Arie M. C. A. Koster; Berthold Vöcking (Theor. Comput. Sci., 2014)

Approximation Algorithms for Secondary Spectrum Auctions. - Martin Hoefer 001; Thomas Kesselheim; Berthold Vöcking (ACM Trans. Internet Techn., 2014)

Smoothed Analysis of the 2-Opt Algorithm for the General TSP. - Matthias Englert; Heiko Röglin; Berthold Vöcking (ACM Trans. Algorithms, 2016)

Truthfulness and Stochastic Dominance with Monetary Transfers. - Martin Hoefer 001; Thomas Kesselheim; Berthold Vöcking (ACM Trans. Economics and Comput., 2016)

Price of Anarchy for Machines Models. - Artur Czumaj; Berthold Vöcking (Encyclopedia of Algorithms, 2016)

Utilitarian Mechanism Design for Single-Minded Agents. - Piotr Krysta; Berthold Vöcking (Encyclopedia of Algorithms, 2016)

Truthful mechanism design via correlated tree rounding. - Yossi Azar; Martin Hoefer 001; Idan Maor; Rebecca Reiffenhäuser; Berthold Vöcking (Math. Program., 2017)

Primal Beats Dual on Online Packing LPs in the Random-Order Model. - Thomas Kesselheim; Klaus Radke; Andreas Tönnis; Berthold Vöcking (SIAM J. Comput., 2018)

A universally-truthful approximation scheme for multi-unit auctions. - Berthold Vöcking (Games Econ. Behav., 2019)

The smoothed number of Pareto-optimal solutions in bicriteria integer optimization. - René Beier; Heiko Röglin; Clemens Rösner; Berthold Vöcking (Math. Program., 2023)