New spectral bounds on k-partitioning of graphs. - Robert Elsässer; Thomas Lücking 001; Burkhard Monien (SPAA, 2001)

On the Problem of Scheduling Flows on Distributed Networks. - Thomas Lücking 001; Burkhard Monien; Manuel Rode (MFCS, 2002)

Nashification and the Coordination Ratio for a Selfish Routing Game. - Rainer Feldmann; Martin Gairing; Thomas Lücking 001; Burkhard Monien; Manuel Rode (ICALP, 2003)

Extreme Nash Equilibria. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Paul G. Spirakis (ICTCS, 2003)

Which Is the Worst-Case Nash Equilibrium? - Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Manuel Rode; Paul G. Spirakis; Imrich Vrto (MFCS, 2003)

Selfish Routing in Non-Cooperative Networks: A Survey. - Rainer Feldmann; Martin Gairing; Thomas Lücking 001; Burkhard Monien; Manuel Rode (Bull. EATCS, 2003)

On Spectral Bounds for the k-Partitioning of Graphs. - Robert Elsässer; Thomas Lücking 001; Burkhard Monien (Theory Comput. Syst., 2003)

Subresultants revisited. - Joachim von zur Gathen; Thomas Lücking 001 (Theor. Comput. Sci., 2003)

Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. - Martin Gairing; Thomas Lücking 001; Burkhard Monien; Karsten Tiemann (ICALP, 2005)

A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. - Robert Elsässer; Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien (WINE, 2005)

Structure and complexity of extreme Nash equilibria. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Paul G. Spirakis (Theor. Comput. Sci., 2005)

Analyzing models for scheduling and routing. - Thomas Lücking 001 (2005)

The Price of Anarchy for Restricted Parallel Links. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien (Parallel Process. Lett., 2006)

A 5/4-approximation algorithm for scheduling identical malleable tasks. - Thomas Decker 001; Thomas Lücking 001; Burkhard Monien (Theor. Comput. Sci., 2006)

The price of anarchy for polynomial social cost. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien (Theor. Comput. Sci., 2006)

Nash equilibria in discrete routing games with convex latency functions. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Manuel Rode (J. Comput. Syst. Sci., 2008)

A new model for selfish routing. - Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Manuel Rode (Theor. Comput. Sci., 2008)

Computing Nash Equilibria for Scheduling on Restricted Parallel Links. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien (Theory Comput. Syst., 2010)

Which is the Worst-Case Nash Equilibrium? - Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Paul G. Spirakis; Imrich Vrto (SIAM J. Discret. Math., 2024)