Special issue devoted to the 29th International Colloquium on Automata, Languages and Programming (ICALP 2002)
Stephan Eidenbenz, Matthew Hennessy, Rafael Morales , Francisco Triguero, Peter Widmayer, Ricardo Conejo (Guest editors)
Theoretical Computer Science, 2003 (to appear)
Proceedings ofthe 29th International Colloquium on Automata, Languages and Programing (ICALP 2002)
Peter Widmayer, Francisco Triguero, Rafael Morales, Matthew Hennessy, Stephan Eidenbenz, Ricardo Conejo (Eds.)
Lecture Notes in Computer Science 2380, 2002
© Springer-Verlag
Special issue 25th International Workshop on Graph-theoretic Concepts in Computer Science
Stephan Eidenbenz, Gabriele Neyer, Peter Widmayer (Guest editors)
Discrete Applied Mathematics, Vol. 113, No. 1, pp. 1- 128, North Holland, 30 September 2001
Part 1 (Selected papers from WG99)
Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz (Guest editors)
International Journal of Foundations of Computer Science, Vol. 11, No. 3, September 2000
Graph Theoretic Concepts in Computer Science, WG'99
Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz (Eds.)
Lecture Notes in Computer Science 1665, 1999
© Springer-Verlag
Misc
(In-)Approximability of Visibility Problems on Polygons and Terrains
S. Eidenbenz
PhD thesis, Diss. ETH No. 13683, 2000
[ [ gzip-file (305 KB) ] [ [ ps-file (1.1 MB) ]
Worldview: A Virtual Reality Framework for the Design, Optimization and Management of Mobile Telematics Infrastructure
M. Beck, S. Eidenbenz, C. Stamm, P. Stucki, P. Widmayer
SI Informatik/Informatique, Nr. 3, 1999
[ [ pdf-file ]
RA3DIO - Wellenausbreitung in 3D
S. Eidenbenz, C. Stamm, P. Widmayer
Computerworld Schweiz, 1999
[ [ pdf-file ]
Technical Reports
Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data
M. Cieliebak, S. Eidenbenz, G. Woeginger
Technical Report, No. 382, ETH Zürich, Dept. of Computer Science, 2002
[ [ pdf-file ]
Online Dominating Set and Variations on Restricted Graph Classes
S. Eidenbenz
Technical Report, No. 380, ETH Zürich, Dept. of Computer Science, 2002
[ [ pdf-file ]
Train Routing Algorithms: Concepts, Design Choices, and Practical Considerations
L. Anderegg, S. Eidenbenz, M. Gantenbein, C. Stamm, D.S. Taylor, B. Weber, P. Widmayer
Technical Report, No. 384, ETH Zürich, Dept. of Computer Science, 2002
[ [ pdf-file ]
Noisy Data Make the Partial Digest Problem NP-hard
M. Cieliebak, S. Eidenbenz, P. Penna
Technical Report, No. 381, ETH Zürich, Dept. of Computer Science, 2002
[ [ pdf-file ]
Equal Sum Subsets: Complexity of Variations
M. Cieliebak, S. Eidenbenz, A. Pagourtzis, and K. Schlude
Technical Report, No. 370, ETH Zürich, Dept. of Computer Science, 2002
[ [ pdf-file ]
|
|
|
|
|
|
|
|
|
|
|
