1. Double digest revisited: complexity and approximability in the presence of noisy data

Cieliebak, Mark, Eidenbenz, Stephan and Woeginger, Gerhard J. (2002)

Reports

2. Equal sum subsets: complexity of variations

Cieliebak, Mark, Eidenbenz, Stephan, Pagourtzis, Aris and Schlude, Konrad (2002)

Reports

3. (In-)Approximability of visibility problems on polygons and terrains

Eidenbenz, Stephan (2000)

Doctoral and Habilitation Theses

4. Noisy data make the partial digest problem NP-hard

Cieliebak, Mark, Eidenbenz, Stephan and Penna, Paolo (2002)

Reports

5. Online dominating set and variations on restricted graph classes

Eidenbenz, Stephan (2002)

Reports

6. Train routing algorithms

Anderegg, Luzi, Eidenbenz, Stephan, Gantenbein, Martin, Stamm, Christoph, Taylor, David Scot, Weber, Birgitta and Widmayer, Peter (2002)

Reports