Berthold Vöcking

6.5k total citations · 1 hit paper
91 papers, 3.1k citations indexed

About

Berthold Vöcking is a scholar working on Computer Networks and Communications, Management Science and Operations Research and Economics and Econometrics. According to data from OpenAlex, Berthold Vöcking has authored 91 papers receiving a total of 3.1k indexed citations (citations by other indexed papers that have themselves been cited), including 52 papers in Computer Networks and Communications, 46 papers in Management Science and Operations Research and 23 papers in Economics and Econometrics. Recurrent topics in Berthold Vöcking's work include Auction Theory and Applications (29 papers), Optimization and Search Problems (28 papers) and Game Theory and Applications (26 papers). Berthold Vöcking is often cited by papers focused on Auction Theory and Applications (29 papers), Optimization and Search Problems (28 papers) and Game Theory and Applications (26 papers). Berthold Vöcking collaborates with scholars based in Germany, United States and United Kingdom. Berthold Vöcking's co-authors include Noam Nisan, Artur Czumaj, Éva Tardos, Tim Roughgarden, Christos H. Papadimitriou, Simon Fischer, Piotr Krysta, James Schummer, Kamal Jain and Yevgeniy Dodis and has published in prestigious journals such as Journal of the ACM, Mathematical Programming and SIAM Journal on Computing.

In The Last Decade

Berthold Vöcking

87 papers receiving 3.0k citations

Hit Papers

Algorithmic Game Theory 2007 2026 2013 2019 2007 400 800 1.2k
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Algorithmic Game Theory
    2007 1.4k citations Noam Nisan, Noam Nisan et al. Cambridge University Press eBooks profile →

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Berthold Vöcking 1.4k 1.4k 627 532 450 91 3.1k
Bruno Codenotti 906 0.6× 780 0.6× 420 0.7× 526 1.0× 299 0.7× 71 2.4k
Nicole Immorlica 1.1k 0.8× 989 0.7× 423 0.7× 866 1.6× 173 0.4× 99 3.9k
Bernhard von Stengel 1.4k 1.0× 627 0.4× 701 1.1× 592 1.1× 236 0.5× 44 2.4k
Ramesh Johari 1.7k 1.2× 2.2k 1.6× 704 1.1× 486 0.9× 940 2.1× 118 5.4k
Vahab Mirrokni 1.8k 1.3× 2.1k 1.5× 508 0.8× 1.5k 2.8× 377 0.8× 220 6.2k
Rakesh Vohra 2.2k 1.5× 943 0.7× 938 1.5× 433 0.8× 227 0.5× 130 3.9k
Jason D. Hartline 3.0k 2.1× 1.3k 0.9× 804 1.3× 600 1.1× 254 0.6× 88 4.2k
Yevgeniy Dodis 953 0.7× 977 0.7× 414 0.7× 1.5k 2.9× 619 1.4× 70 3.8k
Ηλίας Κουτσουπιάς 956 0.7× 972 0.7× 414 0.7× 219 0.4× 93 0.2× 71 1.9k
Nikhil R. Devanur 1.2k 0.8× 1.1k 0.8× 371 0.6× 483 0.9× 308 0.7× 78 2.3k

Countries citing papers authored by Berthold Vöcking

Since Specialization
Citations

This map shows the geographic impact of Berthold Vöcking's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Berthold Vöcking with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Berthold Vöcking more than expected).

Fields of papers citing papers by Berthold Vöcking

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Berthold Vöcking. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Berthold Vöcking. The network helps show where Berthold Vöcking may publish in the future.

Co-authorship network of co-authors of Berthold Vöcking

This figure shows the co-authorship network connecting the top 25 collaborators of Berthold Vöcking. A scholar is included among the top collaborators of Berthold Vöcking based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Berthold Vöcking. Berthold Vöcking is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Keßelheim, Thomas, et al.. (2014). Comparative study of approximation algorithms and heuristics for SINR scheduling with power control. Theoretical Computer Science. 553. 64–73. 2 indexed citations
2.
Blelloch, Guy E. & Berthold Vöcking. (2012). Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures. 1 indexed citations
3.
Vöcking, Berthold. (2012). A universally-truthful approximation scheme for multi-unit auctions. Symposium on Discrete Algorithms. 846–855. 12 indexed citations
4.
Keßelheim, Thomas & Berthold Vöcking. (2012). Approximation algorithms for spectrum allocation and power control in wireless networks. RWTH Publications (RWTH Aachen). 2 indexed citations
5.
Hoefer, Martin, Michal Penn, Maria Polukarov, Alexander Skopalik, & Berthold Vöcking. (2011). Considerate equilibrium. International Joint Conference on Artificial Intelligence. 234–239. 5 indexed citations
6.
Vöcking, Berthold, et al.. (2010). Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm.. RWTH Publications (RWTH Aachen). 132–143. 18 indexed citations
7.
Keßelheim, Thomas, et al.. (2010). Improved algorithms for latency minimization in wireless networks. Theoretical Computer Science. 412(24). 2657–2667. 27 indexed citations
8.
Röglin, Heiko, et al.. (2008). Pure Nash equilibria in player-specific and weighted congestion games. Theoretical Computer Science. 410(17). 1552–1563. 3 indexed citations
9.
Fischer, Simon & Berthold Vöcking. (2008). Adaptive routing with stale information. Theoretical Computer Science. 410(36). 3357–3371. 21 indexed citations
10.
Englert, Matthias, Heiko Röglin, & Berthold Vöcking. (2007). Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract. Symposium on Discrete Algorithms. 1295–1304. 19 indexed citations
11.
Nisan, Noam, Noam Nisan, Christos H. Papadimitriou, et al.. (2007). Algorithmic Game Theory. Cambridge University Press eBooks. 1422 indexed citations breakdown →
12.
Newman, Alantha, et al.. (2007). Decision-making based on approximate and smoothed Pareto curves. Theoretical Computer Science. 378(3). 253–270. 16 indexed citations
13.
Czumaj, Artur, et al.. (2004). Computing Equilibria for Congestion Games with (Im)perfect Information. Max Planck Institute for Plasma Physics. 739–748. 8 indexed citations
14.
Vöcking, Berthold, et al.. (2004). Probabilistic Analysis of Knapsack Core Algorithms. Max Planck Institute for Plasma Physics. 461–470. 2 indexed citations
15.
Vöcking, Berthold, et al.. (2004). Random knapsack in expected polynomial time. Journal of Computer and System Sciences. 69(3). 306–329. 25 indexed citations
16.
Czumaj, Artur & Berthold Vöcking. (2002). Tight bounds for worst-case equilibria. Symposium on Discrete Algorithms. 413–420. 101 indexed citations
17.
Sanders, Peter, Berthold Vöcking, Martti Penttonen, & Erik M. Schmidt. (2002). Random Arc Allocation and Applications to Disks, Drums and DRAMs. Max Planck Institute for Plasma Physics. 121–130. 1 indexed citations
18.
Karp, Richard M., Christian Schindelhauer, Scott Shenker, & Berthold Vöcking. (2002). Randomized rumor spreading. Max Planck Institute for Plasma Physics. 565–574. 21 indexed citations
19.
Vöcking, Berthold. (2001). Symmetric vs. Asymmetric Multiple-Choice Algorithms. Max Planck Institute for Plasma Physics. 1–10. 8 indexed citations
20.
Heide, Friedhelm Meyer auf der, Berthold Vöcking, & Matthias Westermann. (2000). Caching in networks (extended abstract). Symposium on Discrete Algorithms. 430–439. 7 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Bruno Codenotti Breakdown of academic impact, for papers by Nicole Immorlica Breakdown of academic impact, for papers by Bernhard von Stengel Breakdown of academic impact, for papers by Ramesh Johari Breakdown of academic impact, for papers by Vahab Mirrokni Breakdown of academic impact, for papers by Rakesh Vohra Breakdown of academic impact, for papers by Jason D. Hartline Breakdown of academic impact, for papers by Yevgeniy Dodis Breakdown of academic impact, for papers by Ηλίας Κουτσουπιάς Breakdown of academic impact, for papers by Nikhil R. Devanur
Rankless by CCL
2026