Berthold Vöcking

Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking: Online capacity maximization in wireless networks. J. Scheduling 16(1): 81-91 (2013)

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

Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking: Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control. ALGOSENSORS 2012: 30-41

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

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

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

Berthold Vöcking: A universally-truthful approximation scheme for multi-unit auctions. SODA 2012: 846-855

Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (Eds.): Algorithms Unplugged. Springer 2011, isbn 978-3-642-15327-3

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

Patrick Briest, Piotr Krysta, Berthold Vöcking: Approximation Techniques for Utilitarian Mechanism Design. SIAM J. Comput. 40(6): 1587-1622 (2011)

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

René Beier, Berthold Vöcking: The Knapsack Problem. Algorithms Unplugged 2011: 375-381

Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking: Considerate Equilibrium. IJCAI 2011: 234-239

Martin Hoefer, Thomas Kesselheim, Berthold Vöcking: Approximation algorithms for secondary spectrum auctions. SPAA 2011: 177-186

Martin Hoefer, Berthold Vöcking: Berechnung von Nash-Gleichgewichten. Informatik Spektrum 33(5): 462-467 (2010)

Artur Czumaj, Piotr Krysta, Berthold Vöcking: Selfish Traffic Allocation for Server Farms. SIAM J. Comput. 39(5): 1957-1987 (2010)

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

Sascha Geulen, Berthold Vöcking, Melanie Winkler: Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm. COLT 2010: 132-143

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

Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking: Online capacity maximization in wireless networks. SPAA 2010: 92-99

Thomas Kesselheim, Berthold Vöcking: Distributed Contention Resolution in Wireless Networks. DISC 2010: 163-178

Martin Hoefer, Thomas Kesselheim, Berthold Vöcking: Approximation Algorithms for Secondary Spectrum Auctions. CoRR abs/1007.5032 (2010)

Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking: Considerate Equilibrium. CoRR abs/1012.1547 (2010)

Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking: Online Capacity Maximization in Wireless Networks. Electronic Colloquium on Computational Complexity (ECCC) 17: 16 (2010)

Melanie Winkler, Berthold Vöcking, Sascha Geulen: Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm. Electronic Colloquium on Computational Complexity (ECCC) 17: 52 (2010)

Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: Uncoordinated two-sided matching markets. SIGecom Exchanges 8(1) (2009)

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

Simon Fischer, Berthold Vöcking: Adaptive routing with stale information. Theor. Comput. Sci. 410(36): 3357-3371 (2009)

Anja Feldmann, Simon Fischer, Nils Kammenhuber, Berthold Vöcking: Management of Variable Data Streams in Networks. Algorithmics of Large and Complex Networks 2009: 266-291

Marcel Ochel, Berthold Vöcking: Approximability of OFDMA Scheduling. ESA 2009: 385-396

Alexander Fanghänel, Thomas Keßelheim, Berthold Vöcking: Improved Algorithms for Latency Minimization in Wireless Networks. ICALP (2) 2009: 447-458

Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, Berthold Vöcking: Oblivious interference scheduling. PODC 2009: 220-229

Matthias Englert, Berthold Vöcking, Melanie Winkler: Economical Caching with Stochastic Prices. SAGA 2009: 179-190

Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking: Economical Caching. STACS 2009: 385-396

Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (Eds.): Taschenbuch der Algorithmen. eXamen.press, Springer 2008, isbn 978-3-540-76393-2

Simon Fischer, Lars Olbrich, Berthold Vöcking: Approximating Wardrop equilibria with finitely many agents. Distributed Computing 21(2): 129-139 (2008)

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

Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking: Who Should Pay for Forwarding Packets? Internet Mathematics 5(4): 459-475 (2008)

Heiner Ackermann, Heiko Röglin, Berthold Vöcking: On the impact of combinatorial structure on congestion games. J. ACM 55(6) (2008)

Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: Uncoordinated two-sided matching markets. ACM Conference on Electronic Commerce 2008: 256-263

Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking: Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO 2008: 209-220

Alexander Skopalik, Berthold Vöcking: Inapproximability of pure nash equilibria. STOC 2008: 355-364

René Beier, Berthold Vöcking: Das Rucksackproblem. Taschenbuch der Algorithmen 2008: 405-411

Artur Czumaj, Berthold Vöcking: Price of Anarchy for Machines Models. Encyclopedia of Algorithms 2008

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

Heiko Röglin, Berthold Vöcking: Smoothed analysis of integer programming. Math. Program. 110(1): 21-56 (2007)

Artur Czumaj, Berthold Vöcking: Tight bounds for worst-case equilibria. ACM Transactions on Algorithms 3(1) (2007)

Simon Fischer, Berthold Vöcking: On the structure and complexity of worst-case equilibria. Theor. Comput. Sci. 378(2): 165-174 (2007)

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

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

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

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

Simon Fischer, Lars Olbrich, Berthold Vöcking: Approximating Wardrop Equilibria with Finitely Many Agents. DISC 2007: 238-252

Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: A Unified Approach to Congestion Games and Two-Sided Markets. WINE 2007: 30-41

Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking: Who Should Pay for Forwarding Packets? WINE 2007: 208-219

Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking (Eds.): Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007. Dagstuhl Seminar Proceedings 07391, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007

René Beier, Berthold Vöcking: An Experimental Study of Random Knapsack Problems. Algorithmica 45(1): 121-136 (2006)

Peter Sanders, Aravind Srinivasan, Berthold Vöcking: Foreword. Theory Comput. Syst. 39(6): 785 (2006)

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

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

René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking: Computing equilibria for a service provider game with (Im)perfect information. ACM Transactions on Algorithms 2(4): 679-706 (2006)

Berthold Vöcking: Congestion Games: Optimization in Competition. ACiD 2006: 9-20

Heiner Ackermann, Heiko Röglin, Berthold Vöcking: On the Impact of Combinatorial Structure on Congestion Games. FOCS 2006: 613-622

Simon Fischer, Harald Räcke, Berthold Vöcking: Fast convergence to Wardrop equilibria by adaptive sampling methods. STOC 2006: 653-662

Heiner Ackermann, Heiko Röglin, Berthold Vöcking: Pure Nash Equilibria in Player-Specific and Weighted Congestion Games. WINE 2006: 50-61

Heiner Ackermann, Heiko Röglin, Berthold Vöcking: On the Impact of Combinatorial Structure on Congestion Games. Electronic Colloquium on Computational Complexity (ECCC) 13(067) (2006)

Matthias Englert, Heiko Röglin, Berthold Vöcking: Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Electronic Colloquium on Computational Complexity (ECCC) 13(092) (2006)

Heiko Röglin, Berthold Vöcking: Smoothed Analysis of Integer Programming. IPCO 2005: 276-290

Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking: Decision Making Based on Approximate and Smoothed Pareto Curves. ISAAC 2005: 675-684

Simon Fischer, Berthold Vöcking: Adaptive routing with stale information. PODC 2005: 276-283

Patrick Briest, Piotr Krysta, Berthold Vöcking: Approximation techniques for utilitarian mechanism design. STOC 2005: 39-48

Simon Fischer, Berthold Vöcking: On the Structure and Complexity of Worst-Case Equilibria. WINE 2005: 151-160

René Beier, Berthold Vöcking: Random knapsack in expected polynomial time. J. Comput. Syst. Sci. 69(3): 306-329 (2004)

Simon Fischer, Berthold Vöcking: On the Evolution of Selfish Routing. ESA 2004: 323-334

René Beier, Berthold Vöcking: An Experimental Study of Random Knapsack Problems. ESA 2004: 616-627

René Beier, Berthold Vöcking: Probabilistic analysis of knapsack core algorithms. SODA 2004: 468-477

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

René Beier, Berthold Vöcking: Typical properties of winners and losers in discrete optimization. STOC 2004: 343-352

Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking: Randomized Pursuit-Evasion In Graphs. Combinatorics, Probability & Computing 12(3): 225-244 (2003)

Peter Sanders, Berthold Vöcking: Tail Bounds And Expectations For Random Arc Allocation And Applications. Combinatorics, Probability & Computing 12(3): 301-318 (2003)

Berthold Vöcking: How asymmetry helps load balancing. J. ACM 50(4): 568-589 (2003)

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

Piotr Krysta, Peter Sanders, Berthold Vöcking: Scheduling and Traffic Allocation for Tasks with Bounded Splittability. MFCS 2003: 500-510

René Beier, Berthold Vöcking: Random knapsack in expected polynomial time. STOC 2003: 232-241

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

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

Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking: Randomized Pursuit-Evasion in Graphs. ICALP 2002: 901-912

Artur Czumaj, Berthold Vöcking: Tight bounds for worst-case equilibria. SODA 2002: 413-420

Artur Czumaj, Piotr Krysta, Berthold Vöcking: Selfish traffic allocation for server farms. STOC 2002: 287-296

Peter Sanders, Berthold Vöcking: Random Arc Allocation and Applications. SWAT 2002: 121-130

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

Berthold Vöcking: Almost optimal permutation routing on hypercubes. STOC 2001: 530-539

Bruce M. Maggs, Berthold Vöcking: Improved Routing and Sorting on Multibutterflies. Algorithmica 28(4): 438-437 (2000)

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

Richard M. Karp, Christian Schindelhauer, Scott Shenker, Berthold Vöcking: Randomized Rumor Spreading. FOCS 2000: 565-574

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

Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking: Balanced allocations: the heavily loaded case. STOC 2000: 745-754

Friedhelm Meyer auf der Heide, Berthold Vöcking: Shortest-Path Routing in Arbitrary Networks. J. Algorithms 31(1): 105-131 (1999)

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

Berthold Vöcking: How Asymmetry Helps Load Balancing. FOCS 1999: 131-141

Santosh Vempala, Berthold Vöcking: Approximating Multicast Congestion. ISAAC 1999: 367-372

Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann: Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. SPAA 1999: 165-174

Christian Scheideler, Berthold Vöcking: From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. STOC 1999: 215-224

Christian Scheideler, Berthold Vöcking: Universal Continuous Routing Strategies. Theory Comput. Syst. 31(4): 425-449 (1998)

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

Friedhelm Meyer auf der Heide, Berthold Vöcking: Static and Dynamic Data Management in Networks. Euro-Par 1997: 46-56

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

Bruce M. Maggs, Berthold Vöcking: Improved Routing and Sorting on Multibutterflies. STOC 1997: 517-530

Christian Scheideler, Berthold Vöcking: Universal Continuous Routing Strategies. SPAA 1996: 141-151

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

Friedhelm Meyer auf der Heide, Berthold Vöcking: A Packet Routing Protocol for Arbitrary Networks. STACS 1995: 291-302