default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Lücking 0001
Person information
- affiliation: SAP AG, Walldorf, Germany
- affiliation (PhD 2005): University of Paderborn, Department of Computer Science, Paderborn, Germany
Other persons with the same name
- Thomas Lücking 0002 — Sony Computer Entertainment Europe, London, UK (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis, Imrich Vrto:
Which is the Worst-Case Nash Equilibrium? SIAM J. Discret. Math. 38(2): 1701-1732 (2024)
2010 – 2019
- 2010
- [j10]Martin Gairing, Thomas Lücking, Marios Mavronicolas
, Burkhard Monien:
Computing Nash Equilibria for Scheduling on Restricted Parallel Links. Theory Comput. Syst. 47(2): 405-432 (2010)
2000 – 2009
- 2008
- [j9]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode:
Nash equilibria in discrete routing games with convex latency functions. J. Comput. Syst. Sci. 74(7): 1199-1225 (2008) - [j8]Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode:
A new model for selfish routing. Theor. Comput. Sci. 406(3): 187-206 (2008) - 2006
- [j7]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The Price of Anarchy for Restricted Parallel Links. Parallel Process. Lett. 16(1): 117-132 (2006) - [j6]Thomas Decker, Thomas Lücking, Burkhard Monien:
A 5/4-approximation algorithm for scheduling identical malleable tasks. Theor. Comput. Sci. 361(2-3): 226-240 (2006) - [j5]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The price of anarchy for polynomial social cost. Theor. Comput. Sci. 369(1-3): 116-135 (2006) - 2005
- [b1]Thomas Lücking:
Analyzing models for scheduling and routing. University of Paderborn, Germany, 2005, pp. 1-217 - [j4]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis:
Structure and complexity of extreme Nash equilibria. Theor. Comput. Sci. 343(1-2): 133-157 (2005) - [c14]Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann:
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. ICALP 2005: 51-65 - [c13]Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. WINE 2005: 195-209 - [i1]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The Price of Anarchy for Polynomial Social Cost. Computing and Markets 2005 - 2004
- [c12]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode:
Nash Equilibria in Discrete Routing Games with Convex Latency Functions. ICALP 2004: 645-657 - [c11]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The Price of Anarchy for Polynomial Social Cost. MFCS 2004: 574-585 - [c10]Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode:
A New Model for Selfish Routing. STACS 2004: 547-558 - [c9]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
Computing Nash equilibria for scheduling on restricted parallel links. STOC 2004: 613-622 - 2003
- [j3]Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode:
Selfish Routing in Non-Cooperative Networks: A Survey. Bull. EATCS 81: 137-164 (2003) - [j2]Robert Elsässer, Thomas Lücking, Burkhard Monien:
On Spectral Bounds for the k-Partitioning of Graphs. Theory Comput. Syst. 36(5): 461-478 (2003) - [j1]Joachim von zur Gathen, Thomas Lücking:
Subresultants revisited. Theor. Comput. Sci. 297(1-3): 199-239 (2003) - [c8]Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode:
Nashification and the Coordination Ratio for a Selfish Routing Game. ICALP 2003: 514-526 - [c7]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis:
Extreme Nash Equilibria. ICTCS 2003: 1-20 - [c6]Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode:
Selfish Routing in Non-cooperative Networks: A Survey. MFCS 2003: 21-45 - [c5]Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto:
Which Is the Worst-Case Nash Equilibrium? MFCS 2003: 551-561 - [c4]Thomas Decker, Thomas Lücking, Burkhard Monien:
A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks. WAOA 2003: 95-108 - 2002
- [c3]Thomas Lücking, Burkhard Monien, Manuel Rode:
On the Problem of Scheduling Flows on Distributed Networks. MFCS 2002: 495-505 - 2001
- [c2]Robert Elsässer, Thomas Lücking, Burkhard Monien:
New spectral bounds on k-partitioning of graphs. SPAA 2001: 255-262 - 2000
- [c1]Joachim von zur Gathen, Thomas Lücking:
Subresultants Revisited. LATIN 2000: 318-342
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
