Algorithms - ESA’ 99

7th Annual European Symposium Prague, Czech Republic, July 16–18, 1999 Proceedings

  • Jaroslav Nešetřil
Conference proceedings ESA 1999

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1643)

Table of contents

  1. Front Matter
    Pages I-XII
  2. Pages 1-3
  3. Yair Frankel, Philip MacKenzie, Moti Yung
    Pages 4-27
  4. Bernhard Korte
    Pages 28-28
  5. Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    Pages 41-52
  6. Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi
    Pages 65-76
  7. Amotz Bar-Noy, Ari Freund, Joseph (Seffi) Naor
    Pages 77-88
  8. Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann
    Pages 89-100
  9. Steven J. Phillips, Jeffery R. Westbrook
    Pages 101-115
  10. Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz
    Pages 139-150
  11. Yossi Azar, Oded Regev
    Pages 163-171
  12. Stefan Bischof, Thomas Schickinger, Angelika Steger
    Pages 172-183
  13. Pierre Nicodème, Bruno Salvy, Philippe Flajolet
    Pages 194-211

About these proceedings

Introduction

The 7th Annual European Symposium on Algorithms (ESA ’99) is held in Prague, Czech Republic, July 16-18, 1999. This continued the tradition of the meetings which were held in – 1993 Bad Honnef (Germany) – 1994 Utrecht (Netherlands) – 1995 Corfu (Greece) – 1996 Barcelona (Spain) – 1997 Graz (Austria) – 1998 Venice (Italy) (The proceedingsof previousESA meetings were publishedas Springer LNCS v- umes 726, 855, 979, 1136, 1284, 1461.) In the short time of its history ESA (like its sister meeting SODA) has become a popular and respected meeting. The call for papers stated that the “Symposium covers research in the use, design, and analysis of ef?cient algorithms and data structures as it is carried out in c- puter science, discrete applied mathematics and mathematical programming. Papers are solicited describing original results in all areas of algorithmic research, including but not limited to: Approximation Algorithms; Combinatorial Optimization; Compu- tional Biology; Computational Geometry; Databases and Information Retrieval; Graph and Network Algorithms; Machine Learning; Number Theory and Computer Algebra; On-line Algorithms; Pattern Matching and Data Compression; Symbolic Computation.

Keywords

Approximization Computational Mathematics Discrete Mathematics Efficient Algorithms algorithms combinatorial optimization data compression database databases optimization

Editors and affiliations

  • Jaroslav Nešetřil
    • 1
  1. 1.Department of Applied Mathematics and DIMATIA CentreCharles UniversityPrague 1Czech Republic

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-48481-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 1999
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-66251-8
  • Online ISBN 978-3-540-48481-3
  • Series Print ISSN 0302-9743
  • About this book