The design and analysis of algorithms is a fundamental area in computer science. This also involves the development of suitable methods for structuring the data to be manipulated by these algorithms. Hence, algorithms and data structures form a unit, and the right choice of algorithms and data structures is a crucial step in the solution of many problems. For this reason, the design, analysis and implementation of data structures form a classical field of computer science, both in research and teaching. There are still many challenging open problems in classical data structuring.
New problems arise, for instance, in distributed computing or in the management of large data sets.
There is also some shift of interest away from theory, e.g., the classical analysis of asymptotic behavior of algorithms, to more practical issues, such as implementation problems and the usefulness of algorithms in practical applications. One can observe that more and more researchers in computer science also want to make their results available in form of programs or software packages. This trend is also reflected in important international conferences. This seminar welcomes contributions from all areas within the field of data structures, including all theoretical and practical aspects. Reports of the previous Seminar on Data Structures are still available at Dagstuhl office or via the Dagstuhl webserver.