ENGLISH

Algorithms - ESA’ 99: 7th Annual European Symposium Prague, Czech Republic, July 16–18, 1999 Proceedings

By Jaroslav Nešetřil (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1999
ISBN
3540662510, 9783540662518
DOI
10.1007/3-540-48481-7
Open Library ID
OL18133934M
Language
english
Format
PDF
Filesize
3 MB (3058012 bytes)
Series
Lecture Notes in Computer Science 1643
Edition
1
Pages
559\563
Library
Kolxo3
Time added
2009-12-04 00:34:26
Algorithm Analysis and Problem Complexity; Discret

Description

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.

Similar books