Ausgewählte Veröffentlichungen

Drahtlose Netzwerken

• Johannes Dams, Martin Hoefer, Thomas Kesselheim: Convergence time of power-control dynamics. ICALP 2011: 637-649.
• Thomas Kesselheim: A constant-factor approximation for wireless capacity maximization with power control in the SINR model. SODA 2011: 1549-1559.
• Thomas Kesselheim, Berthold Vöcking: Distributed contention resolution in wireless networks. DISC 2010: 149-163
• Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking: Online capacity maximization in wireless networks. SPAA 2010
• Alexander Fanghänel, Thomas Kesselheim, Berthold Vöcking: Improved algorithms for latency minimization in wireless networks. ICALP (2) 2009: 447-458. (Best Paper Award, Track C)
• Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, Berthold Vöcking: Oblivious interference scheduling. PODC 2009: 220-229.

Algorithmische Spieltheorie

• Berthold Vöcking: A universally-truthful approximation scheme for multi-unit auctions.SODA 2013
• Piotr Krysta, Berthold Vöcking: Online Mechanism Design (Randomized Rounding on the Fly).ICALP (2) 2012: 636-647
• Martin Hoefer: Local Matching Dynamics in Social Networks.ICALP 2011.(Best Paper Award, Track C)
• Alexander Skopalik, Berthold Vöcking: Inapproximability of pure Nash equilibria.STOC 2008: 355-364.
• Heiner Ackermann, Heiko Röglin, Berthold Vöcking: On the impact of combinatorial structure on congestion games.J. ACM 55(6): (2008).
• Artur Czumaj, Berthold Vöcking: Tight bounds for worst-case equilibria.ACM Transactions on Algorithms 3(1): (2007).
• Simon Fischer, Harald Räcke, Berthold Vöcking: Fast convergence to Wardrop equilibria by adaptive sampling methods.STOC 2006: 653-662.
• Patrick Briest, Piotr Krysta, Berthold Vöcking: Approximation techniques for utilitarian mechanism design.STOC 2005: 39-48.

Approximations- und Online-Algorithmen

• Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden and Berthold Vöcking: Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. ICALP2014
• Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking: Primal beats dual on online packing LPs in the random-order model. STOC 2014: 303-312.
• Sascha Geulen, Berthold Vöcking, Melanie Winkler: Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm COLT 2010: 132-143.
• Marcel Ochel, Berthold Vöcking: Approximability of OFDMA scheduling. ESA 2009: 385-396.
• Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking: Economical Caching. STACS 2009: 385-396.
Matthias Englert, Berthold Vöcking, Melanie Winkler: Economical Caching with Stochastic Prices. SAGA 2009: 179-190.*/ ?>
• Sebastian Seibert, Walter Unger: A 1.5-Approximation of the Minimal Manhattan Network Problem. ISAAC 2005: 246-255
• Walter Unger: The Complexity of the Approximation of the Bandwidth Problem. FOCS 1998: 82-91