Thomas Lücking

27 papers A* 4A 1B 7Journal 11Unranked 3

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Which is the Worst-Case Nash Equilibrium? SIAM J. Discret. Math. Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis, Imrich Vrto
2010	J	`jnl`	Computing Nash Equilibria for Scheduling on Restricted Parallel Links. Theory Comput. Syst. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2008	J	`jnl`	A new model for selfish routing. Theor. Comput. Sci. Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
2008	J	`jnl`	Nash equilibria in discrete routing games with convex latency functions. J. Comput. Syst. Sci. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
2006	J	`jnl`	A 5/4-approximation algorithm for scheduling identical malleable tasks. Theor. Comput. Sci. Thomas Decker, Thomas Lücking, Burkhard Monien
2006	J	`jnl`	The Price of Anarchy for Restricted Parallel Links. Parallel Process. Lett. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2006	J	`jnl`	The price of anarchy for polynomial social cost. Theor. Comput. Sci. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2005	—	`conf`	A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. WINE Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2005	—	`—`	Analyzing models for scheduling and routing. Thomas Lücking
2005	A*	`conf`	Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. ICALP Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann
2005	J	`jnl`	Structure and complexity of extreme Nash equilibria. Theor. Comput. Sci. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
2005	—	`conf`	The Price of Anarchy for Polynomial Social Cost. Computing and Markets Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2004	A	`conf`	A New Model for Selfish Routing. STACS Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
2004	A*	`conf`	Computing Nash equilibria for scheduling on restricted parallel links. STOC Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2004	A*	`conf`	Nash Equilibria in Discrete Routing Games with Convex Latency Functions. ICALP Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
2004	B	`conf`	The Price of Anarchy for Polynomial Social Cost. MFCS Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2003	B	`conf`	A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks. WAOA Thomas Decker, Thomas Lücking, Burkhard Monien
2003	—	`conf`	Extreme Nash Equilibria. ICTCS Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
2003	A*	`conf`	Nashification and the Coordination Ratio for a Selfish Routing Game. ICALP Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
2003	J	`jnl`	On Spectral Bounds for the k-Partitioning of Graphs. Theory Comput. Syst. Robert Elsässer, Thomas Lücking, Burkhard Monien
2003	J	`jnl`	Selfish Routing in Non-Cooperative Networks: A Survey. Bull. EATCS Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
2003	B	`conf`	Selfish Routing in Non-cooperative Networks: A Survey. MFCS Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
2003	J	`jnl`	Subresultants revisited. Theor. Comput. Sci. Joachim von zur Gathen, Thomas Lücking
2003	B	`conf`	Which Is the Worst-Case Nash Equilibrium? MFCS Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto
2002	B	`conf`	On the Problem of Scheduling Flows on Distributed Networks. MFCS Thomas Lücking, Burkhard Monien, Manuel Rode
2001	B	`conf`	New spectral bounds on k-partitioning of graphs. SPAA Robert Elsässer, Thomas Lücking, Burkhard Monien
2000	B	`conf`	Subresultants Revisited. LATIN Joachim von zur Gathen, Thomas Lücking