To obtain an electronic copy that cannot be downloaded from this
page, please send an email to widmayer@inf.ethz.ch, or to one
of the authors who is member of our group.
Papers in refereed journals
- E. Ihler, G. Reich, P. Widmayer: Class Steiner trees and VLSI
design. Discrete Applied Mathematics 90, 173-194, 1999.
- C. Gold, P. Remmele, T. Roos: Fully dynamic and kinematic
Voronoi diagrams in GIS, Algorithmica (Special Issue on Cartography
and GIS), 1999.
- U. Brandes, G. Neyer, W. Schlickenrieder, D. Wagner, K. Weihe:
PlaNet - A Software Package of Algorithms and Heuristics on Planar
Networks, Discrete Applied Mathematics 92, pp 91-110, 1999.
- Schlude, K.: Bemerkungen zu beschränkt homogenen Funktionen,
Elemente der Mathematik, Vol. 53, 1-2, 1999.
Refereed conference papers
- J. Van den Bercken, B. Seeger, P. Widmayer: The Bulk Index Join: A
Generic Approach to Processing Non-Equijoins. In: Proc. IEEE
International Conf. on Data Engineering, 257, 1999.
- E. Nardelli, G. Proietti, P. Widmayer: How to swap a failing edge
of a single source shortest paths tree. In: Proc. 5th Annual
International Computing and Combinatorics Conference (COCOON 99),
Tokyo, Japan, Lecture Notes in Computer Science, Vol. 1627, Springer,
144--153, 1999.
- E. Soisalon-Soininen, P. Widmayer: Concurrency and Recovery in
Full-Text Indexing. In: Proc. String Processing and Information
Retrieval Symposium (SPIRE'99), Cancun, Mexico, IEEE Computer Society,
Los Alamos, California, 192-198, 1999.
- P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer: Hard tasks for
weak robots: The role of common knowledge in pattern formation by
autonomous mobile robots. In: Proc. 10th Intl. Symposium on Algorithms
and Computation (ISAAC 99), Chennai, India, Lecture Notes in Computer
Science, Vol. 1741, Springer, 93-102, 1999.
- S. Eidenbenz: How Many People Can Hide in a Terrain, In:
Proc. 10th Intl. Symposium on Algorithms and Computation (ISAAC 99),
Chennai, India, Lecture Notes in Computer Science, Vol. 1741,
Springer, pp. 184-194, 1999.
- G. Neyer: Line Simplification with Restricted Orientations
Algorithms and Data Structures. Proc. of the 6th International
Workshop on Algorithms and Data Structures (WADS'99), Vancouver,
Canada. LNCS 1663, pp 13-24, 1999.
- R. Ulber: On the Number of Star-Shaped Polygons and Polyhedra,
11th Canadian Conf. On Computational Geometry, Vancouver, Canada,
1999.
- R. Wattenhofer, P. Widmayer: A unified analysis of distributed
counting with queueing theory. In: Distributed Data and Structures
(WDAS), eds. N. Santoro and P. Widmayer, Proceedings in Informatics 2,
Carleton Scientific, 84-97, 1999.
Books and contributions in books
- N. Santoro, P. Widmayer (eds): Distributed Data and Structures,
Carleton Scientific, Ottawa, Canada, Proceedings in Informatics 2,
1999.
- I. Munro, S. Näher, P. Widmayer (eds.): The Fourth Dagstuhl
Seminar on Data Structures, Dagstuhl-Seminar-Report 202, Schloss
Dagstuhl, 1999.
- P. Widmayer: Die Konkurrenz selbstsüchtiger Computer: Ein
ökonomisches Problem? In G. Lausen, A. Oberweis, G. Schlageter
(Eds.): Angewandte Informatik und Formale Beschreibungsverfahren,
Festschrift zum 60. Geburtstag von Wolffried Stucky, Teubner-Texte zur
Informatik, Vol. 29, Teubner-Verlag, Stuttgart, 287-298, 1999.
- Y. Breitbart, S. Das, N. Santoro, P. Widmayer (eds): Distributed
Data and Structures 2, Carleton Scientific, Ottawa, Canada,
Proceedings in Informatics 6, 1999.
- P. Widmayer, G. Neyer, S. Eidenbenz (eds.): Graph Theoretic
Concepts in Computer Science. Proceedings of the 25th International
Workshop, WG '99, Ascona, Switzerland, Lecture Notes in Computer
Science, Vol. 1665, Springer-Verlag, Berlin, 1999.
|
