Haunted Europe offers the first comprehensive account of the British and Irish fascination with a Gothic vision of continental Europe, tracing its effect on British intellectual life from the birth of the Gothic novel, to the eve of Brexit, and the symbolic recalibration of the UK's relationship to mainland Europe. By focusing on the development of the relationship between Britain and Ireland and continental Europe over more than two-hundred years, this collection marks an important departure from standard literary critical narratives, which have tended to focus on a narrow time-period and have missed continuities and discontinuities in our ongoing relationship with the mainland.

Haunted Europe offers the first comprehensive account of the British and Irish fascination with a Gothic vision of continental Europe, tracing its effect on British intellectual life from the birth of the Gothic novel, to the eve of Brexit, and the symbolic recalibration of the UK's relationship to mainland Europe. By focusing on the development of the relationship between Britain and Ireland and continental Europe over more than two-hundred years, this collection marks an important departure from standard literary critical narratives, which have tended to focus on a narrow time-period and have missed continuities and discontinuities in our ongoing relationship with the mainland.

This volume contains the invited and contributed papers selected for presen- tion at SOFSEM 2010, the 36th Conference on Current Trends in Theory and Practiceof Computer Science, held January23-29,2010 in the Hotel Bed? richov, ? Spindler? uv Mlyn, ' of the Krkono? se Mountains of the Czech Republic. SOFSEM(originally:SOFtwareSEMinar)isdevotedtoleadingresearch,and fosters the cooperation among researchers and professionals from academia and industry in all areas of computer science. As a well-established and fully int- national conference, SOFSEM maintains the best of its original Winter School aspects,suchasa highnumber of invitedtalksandanin-depth coverageofnovel research results in selected areas within computer science. SOFSEM 2010 was organized around the following four tracks: - Foundations of Computer Science (Chairs: David Peleg, Anca Muscholl) - Principles of Software Construction (Chair: Bernhard Rumpe) - Data, Knowledge, and Intelligent Systems (Chair: Jaroslav Pokorn' y) - Web Science (Chair: Jan van Leeuwen) With these tracks, SOFSEM 2010 covered the latest advances in research, both theoretical and applied, in leading areas of computer science. The SOFSEM 2010 Program Committee consisted of 78 international experts from 20 di?erent countries, representing the track areas with outstanding expertise. An integral part of SOFSEM 2010 was the traditional Student Research - rum (SRF, Chair: Ma 'ria Bielikov' a), organized with the aim to present student projects in the theory and practice of computer science and to give students feedback on both the originality of their scienti?c results and on their work in progress.

This book constitutes the refereed proceedings of the 33rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007, held in Harrachov, Czech Republic in January 2007.

The 69 revised full papers, presented together with 11 invited contributions were carefully reviewed and selected from 283 submissions. The papers were organized in four topical tracks on foundations of computer science, multi-agent systems, emerging Web technologies, as well as dependable software and systems.

This book constitutes the refereed proceedings of the 28th International Colloquium on Automata, Languages and Programming, ICALP 2001, held in Crete, Greece in July 2001.
The 80 revised papers presented together with two keynote contributions and four invited papers were carefully reviewed and selected from a total of 208 submissions. The papers are organized in topical sections on algebraic and circuit complexity, algorithm analysis, approximation and optimization, complexity, concurrency, efficient data structures, graph algorithms, language theory, codes and automata, model checking and protocol analysis, networks and routing, reasoning and verification, scheduling, secure computation, specification and deduction, and structural complexity.

In 1996 the International Federation for Information Processing (IFIP) establ- hed its rst Technical Committee on foundations of computer science, TC1. The aim of IFIP TC1 is to support the development of theoretical computer science as a fundamental science and to promote the exploration of fundamental c- cepts, models, theories, and formal systems in order to understand laws, limits, and possibilities of information processing. This volume constitutes the proceedings of the rst IFIP International C- ference on Theoretical Computer Science (IFIP TCS 2000) { Exploring New Frontiers of Theoretical Informatics { organized by IFIP TC1, held at Tohoku University, Sendai, Japan in August 2000. The IFIP TCS 2000 technical program consists of invited talks, contributed talks, and a panel discussion. In conjunction with this program there are two special open lectures by Professors Jan van Leeuwen and Peter D. Mosses. The decision to hold this conference was made by IFIP TC1 in August 1998, and since then IFIP TCS 2000 has bene ted from the e orts of many people; in particular, the TC1 members and the members of the Steering Committee, the Program Committee, and the Organizing Committee of the conference. Our special thanks go to the Program Committee Co-chairs: Track (1): Jan van Leeuwen (U. Utrecht), Osamu Watanabe (Tokyo Inst. Tech.) Track (2): Masami Hagiya (U. Tokyo), Peter D. Mosses (U. Aarhus).

This specially commissioned volume presents a unique collection of expository papers on major topics that are representative for computer science today. The 38 contributions, written by internationally leading experts in the computer science area on personal invitation, demonstrate the scope and stature of the field today and give an impression of the chief motivations and challenges for tomorrow's computer science and information technology.
This anthology marks a truly extraordinary and festive moment: it is the 1000th volume published in the Lecture Notes in Computer Science series. It addresses all computer scientists and anybody interested in a representative overview of the field.

This volume presents the proceedings of the Second Annual European Symposium on Algorithms (ESA '94), held near Utrecht, The Netherlands in September 1994. ESA is the premier European conference on algorithms.
The 42 papers presented were selected from a total of 159 submissions and reflect many of the current directions in algorithm research. The volume is organized into chapters on automatic graph drawing and rendering, spanners and Steiner trees, efficient data structures and complexity analysis, graph algorithms, distributed algorithms, computational geometry and its applications, operations research and combinatorial optimization, parallel computation and interconnection networks, complexity theory, and text processing

This volume contains the proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG '93, held near Utrecht, The Netherlands, in 1993.
The papers are grouped into parts on: hard problems on classes of graphs, structural graph theory, dynamic graph algorithms, structure-oriented graph algorithms, graph coloring, AT-free and chordal graphs, circuits and nets, graphs and interconnection networks, routing and shortest paths, and graph embedding and layout.
The 35 revised papers were chosen from 92 submissions after a careful refereeing process.

This volume contains the proceedings of the 4th International Workshop on Distributed Algorithms, held near Bari, Italy, September 24-26, 1990. The workshop was a forum for researchers, students and other interested persons to discuss recent results and trends in the design and analysis of distributed algorithms for communication networks and decentralized systems. The volume includes all 28 papers presented at the workshop, covering current research in such aspects of distributed algorithm design as distributed combinatorial algorithms, distributed algorithms on graphs, distributed algorithms for new types of decentralized systems, distributed data structures, synchronization and load-balancing, distributed algorithms for control and communication, design and verification of network protocols, routing algorithms, fail-safe and fault-tolerant distributed algorithms, distributed database techniques, algorithms for transaction management and replica control, and other related topics.

The innovative progress in the development of large- and small-scale parallel computing systems and their increasing availability have caused a sharp rise in interest in the scientific principles that underlie parallel computation and parallel programming. The biannual Parallel Architectures and Languages Europe (PARLE) conferences aim at presenting current research on all aspects of the theory, design and application of parallel computing systems and parallel processing. PARLE '91, the third conference in the series, again offers a wealth of high-quality research material for the benefit of the scientific community. Compared to its predecessors, the scope of PARLE '91 has been broadened so as to cover the area of parallel algorithms and complexity, in addition to the central themes of parallel architectures and languages. The two-volume proceedings of the PARLE '91 conference contain the text of all contributed papers that were selected for the programme and of the invited papers by leading experts in the field.

This volume presents the proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '88), held from June 15 to 17, 1988 in Amsterdam, The Netherlands. It contains 31 papers on new or current developments in the area of graph-based algorithms. The topics covered include e.g. structural graph theory, parallel graph algorithms, graph-based modeling (in database theory and VLSI), computational geometry and applied graph theory. The book contains the revised versions of all the papers presented at the workshop. The revisions are based on comments and suggestions received by the authors during and after the workshop.

This volume presents the proceedings of the 2nd International Workshop on Distributed Algorithms, held July 8-10, 1987, in Amsterdam, The Netherlands. It contains 29 papers on new developments in the area of the design and analysis of distributed algorithms. The topics covered include, e.g. algorithms for distributed consensus and agreement in networks, connection management and topology update schemes, election and termination detection protocols, and other issues in distributed network control.

This open-access textbook's significant contribution is the unified derivation of data-assimilation techniques from a common fundamental and optimal starting point, namely Bayes' theorem. Unique for this book is the "top-down" derivation of the assimilation methods. It starts from Bayes theorem and gradually introduces the assumptions and approximations needed to arrive at today's popular data-assimilation methods. This strategy is the opposite of most textbooks and reviews on data assimilation that typically take a bottom-up approach to derive a particular assimilation method. E.g., the derivation of the Kalman Filter from control theory and the derivation of the ensemble Kalman Filter as a low-rank approximation of the standard Kalman Filter. The bottom-up approach derives the assimilation methods from different mathematical principles, making it difficult to compare them. Thus, it is unclear which assumptions are made to derive an assimilation method and sometimes even which problem it aspires to solve. The book's top-down approach allows categorizing data-assimilation methods based on the approximations used. This approach enables the user to choose the most suitable method for a particular problem or application. Have you ever wondered about the difference between the ensemble 4DVar and the "ensemble randomized likelihood" (EnRML) methods? Do you know the differences between the ensemble smoother and the ensemble-Kalman smoother? Would you like to understand how a particle flow is related to a particle filter? In this book, we will provide clear answers to several such questions. The book provides the basis for an advanced course in data assimilation. It focuses on the unified derivation of the methods and illustrates their properties on multiple examples. It is suitable for graduate students, post-docs, scientists, and practitioners working in data assimilation.

This Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Jan van Leeuwen. Chapter "Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.