Berthold Vöcking

143 papers A* 32A 10B 13C 1Journal 54Unranked 21

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	The smoothed number of Pareto-optimal solutions in bicriteria integer optimization. Math. Program. René Beier, Heiko Röglin, Clemens Rösner, Berthold Vöcking
2023	J	`jnl`	Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. CoRR Matthias Englert, Heiko Röglin, Berthold Vöcking
2019	J	`jnl`	A universally-truthful approximation scheme for multi-unit auctions. Games Econ. Behav. Berthold Vöcking
2018	J	`jnl`	Primal Beats Dual on Online Packing LPs in the Random-Order Model. SIAM J. Comput. Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking
2017	J	`jnl`	Truthful mechanism design via correlated tree rounding. Math. Program. Yossi Azar, Martin Hoefer, Idan Maor, Rebecca Reiffenhäuser, Berthold Vöcking
2016	—	`ch.`	Price of Anarchy for Machines Models. Encyclopedia of Algorithms Artur Czumaj, Berthold Vöcking
2016	J	`jnl`	Smoothed Analysis of the 2-Opt Algorithm for the General TSP. ACM Trans. Algorithms Matthias Englert, Heiko Röglin, Berthold Vöcking
2016	J	`jnl`	Truthfulness and Stochastic Dominance with Monetary Transfers. ACM Trans. Economics and Comput. Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
2016	—	`ch.`	Utilitarian Mechanism Design for Single-Minded Agents. Encyclopedia of Algorithms Piotr Krysta, Berthold Vöcking
2015	A*	`conf`	Truthful Mechanism Design via Correlated Tree Rounding. EC Yossi Azar, Martin Hoefer, Idan Maor, Rebecca Reiffenhäuser, Berthold Vöcking
2014	J	`jnl`	Approximation Algorithms for Secondary Spectrum Auctions. ACM Trans. Internet Techn. Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
2014	J	`jnl`	Comparative study of approximation algorithms and heuristics for SINR scheduling with power control. Theor. Comput. Sci. Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking
2014	—	`conf`	Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. ICALP (2) Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vöcking
2014	A	`conf`	Optimized buffer allocation in multicore platforms. DATE Maximilian Odendahl, Andres Goens, Rainer Leupers, Gerd Ascheid, Benjamin Ries, Berthold Vöcking, Tomas Henriksson
2014	A*	`conf`	Primal beats dual on online packing LPs in the random-order model. STOC Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking
2014	—	`conf`	Thorp Shuffling, Butterflies, and Non-Markovian Couplings. ICALP (1) Artur Czumaj, Berthold Vöcking
2014	J	`jnl`	Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Algorithmica Matthias Englert, Heiko Röglin, Berthold Vöcking
2013	B	`ed.`	25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '13, Montreal, QC, Canada - July 23 - 25, 2013 SPAA Guy E. Blelloch, Berthold Vöcking
2013	B	`ed.`	Algorithmic Game Theory - 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013. Proceedings SAGT Berthold Vöcking
2013	A	`conf`	An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions. ESA Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking
2013	J	`jnl`	Economical Caching. ACM Trans. Comput. Theory Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking
2013	J	`jnl`	Electronic Markets and Auctions (Dagstuhl Seminar 13461). Dagstuhl Reports Yishay Mansour, Benny Moldovanu, Noam Nisan, Berthold Vöcking
2013	J	`jnl`	Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. CoRR Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vöcking
2013	J	`jnl`	Online capacity maximization in wireless networks. J. Sched. Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking
2013	J	`jnl`	Primal Beats Dual on Online Packing LPs in the Random-Order Model. CoRR Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking
2013	A*	`conf`	Truthfulness and stochastic dominance with monetary transfers. EC Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
2012	A*	`conf`	A universally-truthful approximation scheme for multi-unit auctions. SODA Berthold Vöcking
2012	C	`conf`	Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control. ALGOSENSORS Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking
2012	J	`jnl`	Computing approximate Nash equilibria in network congestion games. Networks Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking
2012	—	`conf`	Online Mechanism Design (Randomized Rounding on the Fly). ICALP (2) Piotr Krysta, Berthold Vöcking
2012	—	`conf`	Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization. ICALP (2) Marcel Ochel, Klaus Radke, Berthold Vöcking
2012	—	`conf`	Randomized Mechanisms for Multi-unit Auctions - (Extended Abstract). ICALP (2) Berthold Vöcking
2011	—	`book`	Algorithms Unplugged Algorithms Unplugged Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner
2011	J	`jnl`	Approximation Techniques for Utilitarian Mechanism Design. SIAM J. Comput. Patrick Briest, Piotr Krysta, Berthold Vöcking
2011	B	`conf`	Approximation algorithms for secondary spectrum auctions. SPAA Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
2011	A*	`conf`	Considerate Equilibrium. IJCAI Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking
2011	J	`jnl`	Improved algorithms for latency minimization in wireless networks. Theor. Comput. Sci. Alexander Fanghänel, Thomas Kesselheim, Berthold Vöcking
2011	—	`ch.`	Scheduling and Power Assignments in the Physical Model. Theoretical Aspects of Distributed Computing in Sensor Networks Alexander Fanghänel, Berthold Vöcking
2011	—	`ch.`	The Knapsack Problem. Algorithms Unplugged René Beier, Berthold Vöcking
2011	J	`jnl`	Uncoordinated Two-Sided Matching Markets. SIAM J. Comput. Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
2010	—	`conf`	10211 Abstracts Collection - Flexible Network Design. Flexible Network Design Anupam Gupta, Stefano Leonardi, Berthold Vöcking, Roger Wattenhofer
2010	J	`jnl`	Approximation Algorithms for Secondary Spectrum Auctions CoRR Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
2010	J	`jnl`	Berechnung von Nash-Gleichgewichten. Inform. Spektrum Martin Hoefer, Berthold Vöcking
2010	A*	`conf`	Brief announcement: distributed contention resolution in wireless networks. PODC Thomas Kesselheim, Berthold Vöcking
2010	J	`jnl`	Considerate Equilibrium CoRR Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking
2010	A	`conf`	Distributed Contention Resolution in Wireless Networks. DISC Thomas Kesselheim, Berthold Vöcking
2010	J	`jnl`	Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods. SIAM J. Comput. Simon Fischer, Harald Räcke, Berthold Vöcking
2010	—	`ed.`	Flexible Network Design, 24.05. - 28.05.2010 Flexible Network Design Anupam Gupta, Stefano Leonardi, Berthold Vöcking, Roger Wattenhofer
2010	J	`jnl`	Online Capacity Maximization in Wireless Networks. Electron. Colloquium Comput. Complex. Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking
2010	B	`conf`	Online capacity maximization in wireless networks. SPAA Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking
2010	A*	`conf`	Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm. COLT Sascha Geulen, Berthold Vöcking, Melanie Winkler
2010	J	`jnl`	Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm. Electron. Colloquium Comput. Complex. Melanie Winkler, Berthold Vöcking, Sascha Geulen
2010	J	`jnl`	Selfish Traffic Allocation for Server Farms. SIAM J. Comput. Artur Czumaj, Piotr Krysta, Berthold Vöcking
2009	J	`jnl`	Adaptive routing with stale information. Theor. Comput. Sci. Simon Fischer, Berthold Vöcking
2009	A	`conf`	Approximability of OFDMA Scheduling. ESA Marcel Ochel, Berthold Vöcking
2009	—	`conf`	Congestion games: Equilibria, convergence and complexity. GAMENETS Berthold Vöcking
2009	—	`conf`	Economical Caching with Stochastic Prices. SAGA Matthias Englert, Berthold Vöcking, Melanie Winkler
2009	A	`conf`	Economical Caching. STACS Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking
2009	—	`conf`	Improved Algorithms for Latency Minimization in Wireless Networks. ICALP (2) Alexander Fanghänel, Thomas Keßelheim, Berthold Vöcking
2009	—	`conf`	Management of Variable Data Streams in Networks. Algorithmics of Large and Complex Networks Anja Feldmann, Simon Fischer, Nils Kammenhuber, Berthold Vöcking
2009	A*	`conf`	Oblivious interference scheduling. PODC Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, Berthold Vöcking
2009	J	`jnl`	Pure Nash equilibria in player-specific and weighted congestion games. Theor. Comput. Sci. Heiner Ackermann, Heiko Röglin, Berthold Vöcking
2009	J	`jnl`	Uncoordinated two-sided matching markets. SIGecom Exch. Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
2008	J	`jnl`	A Unified Approach to Congestion Games and Two-Sided Markets. Internet Math. Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
2008	J	`jnl`	Approximating Wardrop equilibria with finitely many agents. Distributed Comput. Simon Fischer, Lars Olbrich, Berthold Vöcking
2008	B	`conf`	Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking
2008	—	`ch.`	Das Rucksackproblem. Taschenbuch der Algorithmen René Beier, Berthold Vöcking
2008	A*	`conf`	Inapproximability of pure nash equilibria. STOC Alexander Skopalik, Berthold Vöcking
2008	J	`jnl`	On the impact of combinatorial structure on congestion games. J. ACM Heiner Ackermann, Heiko Röglin, Berthold Vöcking
2008	—	`ch.`	Price of Anarchy for Machines Models. Encyclopedia of Algorithms Artur Czumaj, Berthold Vöcking
2008	—	`book`	Taschenbuch der Algorithmen Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner
2008	A*	`conf`	Uncoordinated two-sided matching markets. EC Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
2008	—	`ch.`	Utilitarian Mechanism Design for Single-Minded Agents. Encyclopedia of Algorithms Piotr Krysta, Berthold Vöcking
2008	J	`jnl`	Who Should Pay for Forwarding Packets? Internet Math. Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking
2007	—	`conf`	07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. Probabilistic Methods in the Design and Analysis of Algorithms Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking
2007	—	`conf`	A Unified Approach to Congestion Games and Two-Sided Markets. WINE Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
2007	A	`conf`	Approximating Wardrop Equilibria with Finitely Many Agents. DISC Simon Fischer, Lars Olbrich, Berthold Vöcking
2007	J	`jnl`	Decision-making based on approximate and smoothed Pareto curves. Theor. Comput. Sci. Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking
2007	—	`conf`	Distributed Load Balancing Algorithm for Adaptive Channel Allocation for Cognitive Radios. CrownCom Simon Fischer, Marina Petrova, Petri Mähönen, Berthold Vöcking
2007	J	`jnl`	On the structure and complexity of worst-case equilibria. Theor. Comput. Sci. Simon Fischer, Berthold Vöcking
2007	—	`ed.`	Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007 Probabilistic Methods in the Design and Analysis of Algorithms Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking
2007	J	`jnl`	Smoothed analysis of integer programming. Math. Program. Heiko Röglin, Berthold Vöcking
2007	B	`conf`	The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. IPCO René Beier, Heiko Röglin, Berthold Vöcking
2007	J	`jnl`	Tight bounds for worst-case equilibria. ACM Trans. Algorithms Artur Czumaj, Berthold Vöcking
2007	—	`conf`	Who Should Pay for Forwarding Packets? WINE Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking
2007	A*	`conf`	Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract. SODA Matthias Englert, Heiko Röglin, Berthold Vöcking
2006	J	`jnl`	An Experimental Study of Random Knapsack Problems. Algorithmica René Beier, Berthold Vöcking
2006	J	`jnl`	Balanced Allocations: The Heavily Loaded Case. SIAM J. Comput. Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking
2006	J	`jnl`	Computing equilibria for a service provider game with (Im)perfect information. ACM Trans. Algorithms René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
2006	—	`conf`	Congestion Games: Optimization in Competition. ACiD Berthold Vöcking
2006	A*	`conf`	Fast convergence to Wardrop equilibria by adaptive sampling methods. STOC Simon Fischer, Harald Räcke, Berthold Vöcking
2006	J	`jnl`	Foreword. Theory Comput. Syst. Peter Sanders, Aravind Srinivasan, Berthold Vöcking
2006	A*	`conf`	On the Impact of Combinatorial Structure on Congestion Games. FOCS Heiner Ackermann, Heiko Röglin, Berthold Vöcking
2006	J	`jnl`	On the Impact of Combinatorial Structure on Congestion Games. Electron. Colloquium Comput. Complex. Heiner Ackermann, Heiko Röglin, Berthold Vöcking
2006	—	`conf`	Pure Nash Equilibria in Player-Specific and Weighted Congestion Games. WINE Heiner Ackermann, Heiko Röglin, Berthold Vöcking
2006	J	`jnl`	Typical Properties of Winners and Losers in Discrete Optimization. SIAM J. Comput. René Beier, Berthold Vöcking
2006	J	`jnl`	Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Electron. Colloquium Comput. Complex. Matthias Englert, Heiko Röglin, Berthold Vöcking
2005	A*	`conf`	Adaptive routing with stale information. PODC Simon Fischer, Berthold Vöcking
2005	A*	`conf`	Approximation techniques for utilitarian mechanism design. STOC Patrick Briest, Piotr Krysta, Berthold Vöcking
2005	B	`conf`	Decision Making Based on Approximate and Smoothed Pareto Curves. ISAAC Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking
2005	—	`conf`	On the Structure and Complexity of Worst-Case Equilibria. WINE Simon Fischer, Berthold Vöcking
2005	B	`conf`	Smoothed Analysis of Integer Programming. IPCO Heiko Röglin, Berthold Vöcking
2004	A	`conf`	An Experimental Study of Random Knapsack Problems. ESA René Beier, Berthold Vöcking
2004	A*	`conf`	Computing equilibria for congestion games with (im)perfect information. SODA René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
2004	J	`jnl`	Foreword. Theory Comput. Syst. Pilar de la Torre, Michael Mitzenmacher, Rajmohan Rajaraman, Berthold Vöcking
2004	A	`conf`	On the Evolution of Selfish Routing. ESA Simon Fischer, Berthold Vöcking
2004	A*	`conf`	Probabilistic analysis of knapsack core algorithms. SODA René Beier, Berthold Vöcking
2004	J	`jnl`	Random knapsack in expected polynomial time. J. Comput. Syst. Sci. René Beier, Berthold Vöcking
2004	A*	`conf`	Typical properties of winners and losers in discrete optimization. STOC René Beier, Berthold Vöcking
2003	—	`conf`	An Experimental Study of Euro-Par Amit Agarwal, Tarun Agarwal, Sumit Chopra, Anja Feldmann, Nils Kammenhuber, Piotr Krysta, Berthold Vöcking
2003	J	`jnl`	How asymmetry helps load balancing. J. ACM Berthold Vöcking
2003	A*	`conf`	Random knapsack in expected polynomial time. STOC René Beier, Berthold Vöcking
2003	J	`jnl`	Randomized Pursuit-Evasion In Graphs. Comb. Probab. Comput. Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking
2003	B	`conf`	Scheduling and Traffic Allocation for Tasks with Bounded Splittability. MFCS Piotr Krysta, Peter Sanders, Berthold Vöcking
2003	J	`jnl`	Tail Bounds And Expectations For Random Arc Allocation And Applications. Comb. Probab. Comput. Peter Sanders, Berthold Vöcking
2002	J	`jnl`	Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. Theory Comput. Syst. Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann
2002	—	`conf`	Random Arc Allocation and Applications. SWAT Peter Sanders, Berthold Vöcking
2002	A*	`conf`	Randomized Pursuit-Evasion in Graphs. ICALP Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking
2002	—	`conf`	Routing and Communication in Interconnection Networks. Euro-Par Michele Flammini, Bruce M. Maggs, Jop F. Sibeyn, Berthold Vöcking
2002	A*	`conf`	Selfish traffic allocation for server farms. STOC Artur Czumaj, Piotr Krysta, Berthold Vöcking
2002	A*	`conf`	Tight bounds for worst-case equilibria. SODA Artur Czumaj, Berthold Vöcking
2001	B	`conf`	A data tracking scheme for general networks. SPAA Rajmohan Rajaraman, Andréa W. Richa, Berthold Vöcking, Gayathri Vuppuluri
2001	A*	`conf`	Almost optimal permutation routing on hypercubes. STOC Berthold Vöcking
2000	A*	`conf`	Balanced allocations: the heavily loaded case. STOC Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking
2000	A*	`conf`	Caching in networks (extended abstract). SODA Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann
2000	J	`jnl`	From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput. Christian Scheideler, Berthold Vöcking
2000	J	`jnl`	Improved Routing and Sorting on Multibutterflies. Algorithmica Bruce M. Maggs, Berthold Vöcking
2000	A*	`conf`	Randomized Rumor Spreading. FOCS Richard M. Karp, Christian Schindelhauer, Scott Shenker, Berthold Vöcking
1999	B	`conf`	Approximating Multicast Congestion. ISAAC Santosh S. Vempala, Berthold Vöcking
1999	B	`conf`	Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. SPAA Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann
1999	A*	`conf`	From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. STOC Christian Scheideler, Berthold Vöcking
1999	A*	`conf`	How Asymmetry Helps Load Balancing. FOCS Berthold Vöcking
1999	A	`conf`	Provably Good and Practical Strategies for Non-Uniform Data Management in Networks. ESA Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann
1999	J	`jnl`	Shortest-Path Routing in Arbitrary Networks. J. Algorithms Friedhelm Meyer auf der Heide, Berthold Vöcking
1998	A*	`conf`	Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. STOC 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
1998	—	`—`	Static and dynamic data Management in networks. Berthold Vöcking
1998	J	`jnl`	Universal Continuous Routing Strategies. Theory Comput. Syst. Christian Scheideler, Berthold Vöcking
1997	A*	`conf`	Exploiting Locality for Data Management in Systems of Limited Bandwidth. FOCS Bruce M. Maggs, Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann
1997	A*	`conf`	Improved Routing and Sorting on Multibutterflies. STOC Bruce M. Maggs, Berthold Vöcking
1997	—	`conf`	Static and Dynamic Data Management in Networks. Euro-Par Friedhelm Meyer auf der Heide, Berthold Vöcking
1996	A*	`conf`	Universal Algorithms for Store-and-Forward and Wormhole Routing. STOC Robert Cypher, Friedhelm Meyer auf der Heide, Christian Scheideler, Berthold Vöcking
1996	B	`conf`	Universal Continuous Routing Strategies. SPAA Christian Scheideler, Berthold Vöcking
1995	A	`conf`	A Packet Routing Protocol for Arbitrary Networks. STACS Friedhelm Meyer auf der Heide, Berthold Vöcking