Proc. 20th Symp. Theoretical Aspects of Computer Science (STACS 2003)
- Approximating geometric bottleneck shortest paths, BosMahNar-STACS-03
- Colouring random graphs in expected polynomial time, CojTar-STACS-03
- On the difficulty of some shortest path problems, HerSurBho-STACS-03
- Optimization in arrangements, LanSte-STACS-03
- Algorithms for transposition invariant string matching, MakNavUkk-STACS-03
