Thomas Lücking

730 total citations
13 papers, 169 citations indexed

About

Thomas Lücking is a scholar working on Management Science and Operations Research, Computer Networks and Communications and Economics and Econometrics. According to data from OpenAlex, Thomas Lücking has authored 13 papers receiving a total of 169 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Management Science and Operations Research, 5 papers in Computer Networks and Communications and 5 papers in Economics and Econometrics. Recurrent topics in Thomas Lücking's work include Game Theory and Applications (8 papers), Game Theory and Voting Systems (5 papers) and Opinion Dynamics and Social Influence (4 papers). Thomas Lücking is often cited by papers focused on Game Theory and Applications (8 papers), Game Theory and Voting Systems (5 papers) and Opinion Dynamics and Social Influence (4 papers). Thomas Lücking collaborates with scholars based in Germany, Cyprus and Greece. Thomas Lücking's co-authors include Burkhard Monien, Marios Mavronicolas, Martin Gairing, Paul G. Spirakis, Robert Elsässer⋆, Thomas Decker, Joachim von zur Gathen and Imrich Vrt’o and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and SIAM Journal on Discrete Mathematics.

In The Last Decade

Thomas Lücking

12 papers receiving 156 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Thomas Lücking Germany 7 129 89 58 22 19 13 169
Alexander Skopalik Germany 9 199 1.5× 145 1.6× 37 0.6× 15 0.7× 9 0.5× 26 227
Nir Andelman Israel 6 127 1.0× 72 0.8× 135 2.3× 10 0.5× 16 0.8× 6 218
Shao Chin Sung Japan 9 141 1.1× 162 1.8× 32 0.6× 10 0.5× 45 2.4× 21 240
Umang Bhaskar United States 7 98 0.8× 72 0.8× 27 0.5× 16 0.7× 5 0.3× 16 126
Gianpiero Monaco Italy 11 168 1.3× 154 1.7× 89 1.5× 10 0.5× 42 2.2× 35 300
Neil Olver Netherlands 9 83 0.6× 38 0.4× 60 1.0× 7 0.3× 34 1.8× 24 195
Kshipra Bhawalkar United States 5 72 0.6× 30 0.3× 51 0.9× 83 3.8× 4 0.2× 6 165
Saeed Seddighin United States 7 108 0.8× 106 1.2× 32 0.6× 13 0.6× 4 0.2× 29 187
Ruta Mehta United States 9 111 0.9× 96 1.1× 20 0.3× 4 0.2× 2 0.1× 32 167
Davide Bilò Italy 8 40 0.3× 25 0.3× 68 1.2× 22 1.0× 10 0.5× 43 167

Countries citing papers authored by Thomas Lücking

Since Specialization
Citations

This map shows the geographic impact of Thomas Lü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 Thomas Lücking with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Lücking more than expected).

Fields of papers citing papers by Thomas Lücking

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Thomas Lü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 Thomas Lücking. The network helps show where Thomas Lücking may publish in the future.

Co-authorship network of co-authors of Thomas Lücking

This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Lücking. A scholar is included among the top collaborators of Thomas Lü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 Thomas Lücking. Thomas Lücking is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

13 of 13 papers shown
1.
Lücking, Thomas, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis, & Imrich Vrt’o. (2024). Which is the Worst-Case Nash Equilibrium?. SIAM Journal on Discrete Mathematics. 38(2). 1701–1732.
3.
Gairing, Martin, Thomas Lücking, Marios Mavronicolas, & Burkhard Monien. (2009). Computing Nash Equilibria for Scheduling on Restricted Parallel Links. Theory of Computing Systems. 47(2). 405–432. 16 indexed citations
4.
Lücking, Thomas, et al.. (2008). A new model for selfish routing. Theoretical Computer Science. 406(3). 187–206. 28 indexed citations
5.
Gairing, Martin, et al.. (2008). Nash equilibria in discrete routing games with convex latency functions. Journal of Computer and System Sciences. 74(7). 1199–1225. 18 indexed citations
6.
Decker, Thomas, Thomas Lücking, & Burkhard Monien. (2006). A 54-approximation algorithm for scheduling identical malleable tasks. Theoretical Computer Science. 361(2-3). 226–240. 7 indexed citations
7.
Gairing, Martin, Thomas Lücking, Marios Mavronicolas, & Burkhard Monien. (2006). The price of anarchy for polynomial social cost. Theoretical Computer Science. 369(1-3). 116–135. 1 indexed citations
8.
Gairing, Martin, Thomas Lücking, Marios Mavronicolas, & Burkhard Monien. (2006). THE PRICE OF ANARCHY FOR RESTRICTED PARALLEL LINKS. Parallel Processing Letters. 16(1). 117–131. 17 indexed citations
9.
Gairing, Martin, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, & Paul G. Spirakis. (2005). Structure and complexity of extreme Nash equilibria. Theoretical Computer Science. 343(1-2). 133–157. 21 indexed citations
10.
Gairing, Martin, Thomas Lücking, Marios Mavronicolas, & Burkhard Monien. (2004). Computing Nash equilibria for scheduling on restricted parallel links. 613–622. 51 indexed citations
11.
Elsässer⋆, Robert, Thomas Lücking, & Burkhard Monien. (2003). On Spectral Bounds for the k-Partitioning of Graphs. Theory of Computing Systems. 36(5). 461–478. 1 indexed citations
12.
Lücking, Thomas, Burkhard Monien, & Robert Elsässer⋆. (2001). New spectral bounds on k-partitioning of graphs. 255–262. 5 indexed citations
13.
Gathen, Joachim von zur & Thomas Lücking. (2000). Subresultants Revisited. Theoretical Computer Science. 297(1-3). 199–239. 3 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

Rankless by CCL
2026