Thomas Lücking

Affiliations:
  • SAP AG, Walldorf, Germany
  • University of Paderborn, Department of Computer Science, Paderborn, Germany (PhD 2005)


According to our database1, Thomas Lücking authored at least 19 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Which is the Worst-Case Nash Equilibrium?
SIAM J. Discret. Math., 2024

2010
Computing Nash Equilibria for Scheduling on Restricted Parallel Links.
Theory Comput. Syst., 2010

2008
A new model for selfish routing.
Theor. Comput. Sci., 2008

Nash equilibria in discrete routing games with convex latency functions.
J. Comput. Syst. Sci., 2008

2006
The price of anarchy for polynomial social cost.
Theor. Comput. Sci., 2006

A 5/4-approximation algorithm for scheduling identical malleable tasks.
Theor. Comput. Sci., 2006

The Price of Anarchy for Restricted Parallel Links.
Parallel Process. Lett., 2006

2005
Analyzing models for scheduling and routing.
PhD thesis, 2005

Structure and complexity of extreme Nash equilibria.
Theor. Comput. Sci., 2005

A Simple Graph-Theoretic Model for Selfish Restricted Scheduling.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2003
Subresultants revisited.
Theor. Comput. Sci., 2003

On Spectral Bounds for the k-Partitioning of Graphs.
Theory Comput. Syst., 2003

Selfish Routing in Non-Cooperative Networks: A Survey.
Bull. EATCS, 2003

Which Is the Worst-Case Nash Equilibrium?
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Extreme Nash Equilibria.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Nashification and the Coordination Ratio for a Selfish Routing Game.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
On the Problem of Scheduling Flows on Distributed Networks.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001
New spectral bounds on k-partitioning of graphs.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001


  Loading...