Dipl.-Math. Dipl.-Inform. Thomas Lücking

On the Problem of Scheduling Flows on Distributed Networks
27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002)
August 27, 2002, Warzaw, Poland
[Postscript]
Which Is the Worst-case Nash Equilibrium?
28th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003)
August 26, 2003, Bratislava, Slovak Republic
[Postscript]
A 5/4-approximation algorithm for scheduling identical malleable tasks
1st Workshop on Approximation and Online Algorithms (WAOA 2003)
September 16, 2003, Budapest, Hungary
[Postscript]
The Price of Anarchy for Polynomial Social Cost
29th International Symposium on Mathematical Foundations of Computer Science (MFCS 2004)
August 26, 2004, Prague, Czech Republic
[Postscript]