This volume constitutes the refereed proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.

This book constitutes the refereed proceedings of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2007. The nine revised full papers and five invited papers presented were carefully selected for inclusion in the book. The contributed papers included in this volume cover both theoretical as well as applied aspects of stochastic computations with a special focus on investigating the power of randomization in algorithmics.

This book constitutes the refereed proceedings of the 29th International Colloquium on Automata, Languages and Programming, ICALP 2002, held in Malaga, Spain, in July 2002.The 83 revised full papers presented together with 7 invited papers were carefully reviewed and selected from a total of 269 submissions. All current aspects of theoretical computer science are addressed and major new results are presented.

This tutorial survey brings together two lines of research and development whose interaction promises to have significant practical impact on the area of spatial information processing in the near future: geographic information systems (GIS) and geometric computation or, more particularly, geometric algorithms and spatial data structures. In nine uniformly structured and coherent chapters, the authors present a unique survey ranging from the history and basic characteristics to current issues of precision and robustness of geometric computing. This textbook is ideally suited for advanced courses on GIS and applied geometric algorithms. Research and design professionals active in the area will find it valuable as a state-of-the-art survey.

The 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'99) celebrated the anniversaryof the workshop series at the Centro Stefano Franscini on Monte Verit'a, Ascona, Switzerland, from June 17 to 19, 1999. It was organized byETH Zurich, sponsored byETH, the Centro Stefano Franscini, the Swiss National Science Foundation, and Swissphone. The workshop looks back on a remarkable tradition of a quarter century, with predecessors organized at various places in Europe. WG'99 has been an insp- ing mix of questions from theoryand practice, and of 74 young scientists and established researchers from all over the world, including Bangladesh, Belgium, Canada, the Czech Republic, France, Germany, Israel, Italy, Japan, Korea, the Netherlands, Russia, the Slovak Republic, Spain, Sweden, Switzerland, the UK, and the USA. Four invited lectures re?ect the history, theory, practice and this year's s- ting. Hartmut Noltemeier as the onlyone of four founding members of the WG series who served on the program committee throughout the entire historyof WG talked about past achievements and future challenges of WG and of the ?eld. Susanne Albers lectured on the theoryof online algorithms. Thomas Lengauer presented practical packing problems from the textile and car manufacturing industries, as well as their solutions. A workshop held at the Centro Stefano Franscini traditionallyo?ers a talk that is open to the general (Italian speaking) public - Nicola Santoro delivered this Stefano Franscini talk byreporting on computer science, school, and community, as seen from the eye of the storm.

This volume constitutes the proceedings of the International Workshop on Advanced Research in Geographic Information Systems, IGIS '94, held in Ascona, Switzerland in February/March 1994.
The 28 carefully refereed and revised papers address all current aspects of GIS research and their advanced applications to spatial and environmental data engineering. Among the topics covered are GIS theory, spatial databases, spatial data structures, environmental modelling and control, data modelling, object-orientation, pattern recognition, and optimization. In addition, software and non-commercial as well as commercial GIS are analysed.

This book constitutes the refereed conference proceedings of the 9th International Conference on Algorithms and Complexity, CIAC 2015, held in Paris, France, in May 2015. The 30 revised full papers presented were carefully reviewed and selected from 93 submissions and are presented together with 2 invited papers. The papers present original research in the theory and applications of algorithms and computational complexity.

This book constitutes the refereed proceedings of the 7th International Conference, FUN 2014, held in July 2014 in Lipari Island, Sicily, Italy.

The 29 revised full papers were carefully reviewed and selected from 49 submissions. They feature a large variety of topics in the field of the use, design and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area. In particular, algorithmic questions rooted in biology, cryptography, game theory, graphs, the internet, robotics and mobility, combinatorics, geometry, stringology, as well as space-conscious, randomized, parallel, distributed algorithms and their visualization are addressed.

This book constitutes the refereed proceedings of the 7th International Conference on Combinatorial Optimization and Applications, COCOA 2013, held in Chengdu, China, in December 2013. The 36 full papers presented were carefully reviewed and selected from 72 submissions. The papers feature original research in the areas of combinatorial optimization and its applications. In addition to theoretical results there are reports on experimental and applied research of general algorithmic interest.

1m vorliegenden Beitrag wurden die besonderen Eigenschaften eines offenen Dienstemarktes dargestellt und die Vorteile der dortigen Autonomie gegenUber der organisationsintemen Konfiguration verteilter Anwendungen motiviert. Der Dienstreprlisentation - allgemein eingesetzt als generischer Trager beliebiger Information, jedoch in diesem Beitrag speziell als Instrument der Dienstbeschreibung - kommt hierbei eine besondere Bedeutung zu. Die Integration der dargestellten Einsatzbereiche der Benutzeruntersttitzung bei der Dienstnutzung, der Benutzerkoordination, der Steuerung verteilter Agentensysteme oder des dynamischen Transaktionsmanagements kann nur aufgrund der Flexibilitlit der Dienstreprlisentation erreicht werden. Hierbei spielt insbesondere die bewuBte Trennung von generischen Standards der Repriisentation und spezialisierenden Standards for Inhalte eine grundlegende Rolle. GegenUber sprachbasierten Ansatzen (HTML, Telescript), welche nur bei globaler Gtiltigkeit neue Versionen einftihren konnen, bietet der vorgestellte Ansatz die Moglichkeit, fUr spezialisierte Einsatzbereiche dezentralisiert und autonom Erweiterungen an der Struktur von Dienstreprlisentationen und darauf spezialisierter Anwendungen vorzunehmen. Wenn auch die Projekte COSM und TRADE hierbei nicht rur sich in Anspruch nehmen konnen, empirisch den Nachweis rur die Angemessenheit der vorgestellten Architektur zur UnterstUtzung offener Dienstemarkte erbracht zu haben, so scheint doch auch aufgrund lihnlicher Entwicklungen (WWW bzw. Telescript-Technik) und deren Erfolgsfaktoren der prinzipielle Ansatz besonders vielversprechend, Koordinationsmechanismen realer Markte auch fUr die Realisierung verteilter Anwendungen zu nutzen. SchlieBlich erbringt der Mechanismus des Marktes taglich den Nachweis einer dezentralisierten, effizienten und hinreichend reagiblen Koordinationsform rur den GUtertausch realer Anbieter und Nachfrager.

In den mehr als 10 Jahren, die seit dem Entwurf und der ersten Implementierung der Sprache Pascal vergangen sind, ist eine kaum noch zu Ubersehende FUlle von Pascal-EinfUhrungs- und lehrbOchern verCSffentlicht worden. NatUrlich werden die Eigenschaften und Maglichkeiten der Sprache stets an einigen Beispielen erllutert. Dennoch wird mancher leser - wie wir - die Erfahrung gemacht haben, da8 der Fundus der Beispiele unzureichend oder zu weit verstreut ist, um die Sprache richtig zu lehren, zu lemen, und die Technik des ProbiemlCSsens mit Hilfe von Pascal systematisch einUben zu konnen. Wir hotfen, mit dieser Sammlung von Beispielen dazu beizutragen, diesem Mangel abzuhelfen. Den Kern der vorliegenden Sammlung bilden Probleme, die fUr die Programmierausbildung kUnftiger Diplom-Wirtschaftsingenieure an der Universitat Karlsruhe verwendet werden. Man kann das insbesondere an einigen Beispielen zu grundlegenden DV-Algorithmen und Optimierungsaufgaben unschwer ablesen. Dennoch haben wir stets darauf geachtet, beim leser keine Spezialkenntnisse vorauszusetzen. Mathematische Kenntnisse und Fertigkeiten, wie sie etwa bis zum Abschlu6 der Mittelstufe des Gymnasiums vermittelt werden, ein waches Auge fUr die (kleinen) Probleme des Alltags und - last but not least - ein lehr- oder Handbuch fUr die Sprache Pascal sollten zum Verstlndnis slmtlicher Programmbeispiele ausreichen. Aile Programme sind in UCSD-Pascal geschrieben. Das ist eine spezielle, vor allem auf Mikrorechnern sehr verbreitete Erweiterung der Sprache Pascal.