 Aerial view of Dagstuhl Castle. | |
| Founder | Reinhard Wilhelm |
|---|---|
| Established | 1990 |
| Website | https://www.dagstuhl.de/ |
Dagstuhl is a computer science research center in Germany, located in and named after a district of the town of Wadern, Merzig-Wadern, Saarland.
Following the model of the mathematical center at Oberwolfach, the center is installed in a very remote and relaxed location in the countryside. The Leibniz Center is located in a historic country house, Schloss Dagstuhl (Dagstuhl Castle), together with modern purpose-built buildings connected by an enclosed footbridge. [1]
The ruins of the 13th-century fortress Dagstuhl Castle are nearby, a short walk up a hill from the Schloss.
Construction of the historic country house was started in 1760 on the orders of Count Joseph Anton Damian Albert von Oettingen-Baldern and Soetern, its chapel was built in 1763. [2] A year after Count Joseph's death in 1778, his second wife, Maria Antonia von Walburg zu Zeil and Wurzach, married Prince Hermann Maria Friedrich Otto von Hohenzollern-Hechingen, [3] but she had to flee Schloss Dagstuhl in the face of advancing french revolutionary troops in 1792. [2]
After 1801's Treaty of Lunéville, Schloss Dagstuhl was nationalized but eventually acquired by the iron foundry in Rémilly, which greatly deforested Dagstuhl for timber. [2]
In 1806, Schloss Dagstuhl was bought by Baron Guillaume Albert de Lasalle de Louisenthal who moved there with his family the following year. In 1815, Schoss Dagstuhl earned the right to be called a manor. From 1839 to 1880, Octavie Elisabeth Maria de Lasalle von Louisenthal, dubbed the Painter Countess, worked on painting the chapel. She also cultivated contacts with the nuns of the Franciscan order in Waldbreitbach. The de Lasalle von Louisenthal family made additions to the manor in 1905 and 1906, partly remodelling it in the neo-gothic style and adding the tower. While the remodelled castle grounds now house a stone lion that had adorned the old cattle market fountain in Trier as part of a quartet until 1898, the remodelling of the burial vault allows it to nowadays host Octavie's Stations of the Cross. [2]
The last de Lasalle von Louisenthal to own the manor, Theodor Stephan Josef Heinrich de Lasalle von Louisenthal, died in a mental hospital in 1959 without leaving a legitimate heir, having been sterilized on account of the Nazi's Sterilisation Law as he suffered from depression and confusion after he was shot down with his fighter plane during the First World War. [4]
Schloss Dagstuhl was acquired in 1957 by an order of Franciscan nuns, who converted many rooms to living quarters, installed central heating, wires for electricity, new bathroom facilities, and pipes for water. The conversion into a home for the elderly was finished in 1961. In 1976, work on an addition with 3 stories was started. The ownership of Schloss Dagstuhl was transferred to the Franciscan order in Waldbreitbach in 1981. During the renovations, which also took into account that the bishop of Trier had chosen Schloss Dagstuhl as one of his vacation locations, the old wooden staircase was replaced by today's marble one. [2]
The state government of Saarland bought Schloss Dagstuhl in 1989, and when the nuns moved out to run a new home for the elderly in 1990, the computer science center was founded and the first Dagstuhl Seminar already took place the same year. In 1993, construction on the modern new complex with the library, lecture halls, and additional guests rooms started. [2] With the help of several of Octavie's paintings, parts of the baroque gardens of Dagstuhl Manor were reconstructed in 2001 on the opposite side of the Konrad-Zuse street as part of the Gärten ohne Grenzen project. [5] The latest addition to the ensemble of buildings was the guest house in 2012, which houses a meeting room and 7 guest rooms.
The Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH (LZI, Leibniz Center for Informatics) was established at Dagstuhl in 1990. The center is managed as a non-profit organization, and financed by national funds. It receives scientific support by a variety of German and foreign research institutions. Until April 2008 the name of the center was: International Conference and Research Center for Computer Science (German: Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI)). The center was founded by Reinhard Wilhelm, who continued as its director until May 2014, when Raimund Seidel became the director. [6] The list of shareholders includes:
Since 1 January 2005, the LZI is a member of the Leibniz Association.
Dagstuhl's computer science library has over 50,000 books and other media, among them a full set of Springer-Verlag's Lecture Notes in Computer Science (LNCS) series and electronic access to many computer science journals. [7] Many of the books are signed by their authors, as Schloss Dagstuhl asks seminar participants to sign their books. [8]
Dagstuhl supports computer science by organizing high ranked seminars on hot topics in informatics. Dagstuhl Seminars, which are established after review and approval by the Scientific Directorate, bring together personally invited scientists from academia and industry from all over the world to discuss their newest ideas and problems. [9] [10] Apart from the Dagstuhl seminars, the center also hosts summer schools, group retreats, and other scientific events, all discussing informatics. Every year about 3,500 scientists stay in Dagstuhl for about 100 seminars, workshops and other scientific events. The number of participants is limited to enable discussion and by the available housing capacity. The stay is full-board; participants are accommodated in the original house or in the modern annex, and have all their meals at the center. Seminars are usually held for a weekly period: participants arrive on Sunday evening and depart on Friday evening or Saturday morning. One or sometimes two seminars are held simultaneously with other small meetings.
Dagstuhl Publishing maintains various open access publication activities that include conference proceedings, reports, and journals. [11]
As well as publishing proceedings from its own seminars, the Leibniz Center publishes the Leibniz International Proceedings in Informatics (LIPIcs), [12] a series of open access conference proceedings from computer science conferences worldwide. Conferences published in this series include the Symposium on Theoretical Aspects of Computer Science (STACS), held annually in Germany and France, the conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), held annually in south Asia, the Computational Complexity Conference (CCC), held at a different international venue each year, the Symposium on Computational Geometry (SoCG), the International Colloquium on Automata, Languages and Programming (ICALP), the International Symposium on Mathematical Foundations of Computer Science (MFCS), the International Conference on Concurrency Theory (CONCUR), and the Conference on Database Theory. [13]
As of 2024, the Leibnitz Center publishes two academic journals. The Leibniz Transactions on Embedded Systems (LITES), established in 2014, focus on all aspects of embedded systems. [14] The Transactions on Graph Data and Knowledge (TGDK), established in 2023, focuses on knowledge graphs, graph-based data management and modelling, and related methods. [15]
DBLP is a computer science bibliography website. Starting in 1993 at Universität Trier in Germany, it grew from a small collection of HTML files and became an organization hosting a database and logic programming bibliography site. Since November 2018, DBLP is a branch of Schloss Dagstuhl – Leibniz-Zentrum für Informatik (LZI). DBLP listed more than 5.4 million journal articles, conference papers, and other publications on computer science in December 2020, up from about 14,000 in 1995 and 3.66 million in July 2016. All important journals on computer science are tracked. Proceedings papers of many conferences are also tracked. It is mirrored at three sites across the Internet.
The Max Planck Institute for Informatics is a research institute in computer science with a focus on algorithms and their applications in a broad sense. It hosts fundamental research as well a research for various application domains.
Jan Hajek is a Czech scientist and mathematician, living in the Netherlands. He participated in the creation of the TCP/IP protocol. He also created 'Approver', "which was probably the first tool for the automated verification of concurrent systems".
Wadern is a municipality in the federal state Saarland, which is situated in the southwest of Germany. It is part of the district Merzig-Wadern. Wadern consists of 13 urban districts with approximately 16.000 inhabitants. With 143 inhabitants per km2 it is sparsely populated, but, with an area of 111 km2, Wadern is the third largest municipality in Saarland after Saarbrücken and St. Wendel. The town is divided into 14 urban districts and altogether 24 villages belong to the commune. The town is part of the Moselle Franconian language area.
Saarland University is a public research university located in Saarbrücken, the capital of the German state of Saarland. It was founded in 1948 in Homburg in co-operation with France and is organized in six faculties that cover all major fields of science. In 2007, the university was recognized as an excellence center for computer science in Germany.
Dagstuhl Castle is a ruined castle on the top of a hill near the town of Wadern, kreis Merzig-Wadern, in Saarland, Germany. It overlooks the newer Schloss Dagstuhl in the valley below, which is historic, but has been converted for use as a meeting centre for computer science.
In computational geometry, a bitonic tour of a set of point sites in the Euclidean plane is a closed polygonal chain that has each site as one of its vertices, such that any vertical line crosses the chain at most twice.
The Symposium on Theoretical Aspects of Computer Science (STACS) is an academic conference in the field of computer science. It is held each year, alternately in Germany and France, since 1984. Typical themes of the conference include algorithms, computational and structural complexity, automata, formal languages and logic.
The European Symposium on Algorithms (ESA) is an international conference covering the field of algorithms. It has been held annually since 1993, typically in early Autumn in a different European location each year. Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in Springer Lecture Notes in Computer Science. Acceptance rate of ESA is 24% in 2012 in both Design and Analysis and Engineering and Applications tracks.
Susanne Boll is a Professor for Media Informatics and Multimedia Systems in the Department of Computing Science at the University of Oldenburg, Germany. and is a member of the board at the research institute OFFIS. She is a member of SIGMM and SIGCHI of the ACM as well as the German Informatics Society GI. She founded and directs the HCI Lab at the University of Oldenburg and OFFIS.
Raimund G. Seidel is a German and Austrian theoretical computer scientist and an expert in computational geometry.
Reinhard Wilhelm is a German computer scientist.
The German Informatics Society (GI) is a German professional society for computer science, with around 20,000 personal and 250 corporate members. It is the biggest organized representation of its kind in the German-speaking world.
Thomas Lengauer is a German computer scientist and computational biologist.
The International Conference on Concurrency Theory (CONCUR) is an academic conference in the field of computer science, with focus on the theory of concurrency and its applications. It is the flagship conference for concurrency theory according to the International Federation for Information Processing Working Group on Concurrency Theory. The conference is organised annually since 1988. Since 2015, papers presented at CONCUR are published in the LIPIcs–Leibniz International Proceedings in Informatics, a "series of high-quality conference proceedings across all fields in informatics established in cooperation with Schloss Dagstuhl –Leibniz Center for Informatics". Before, CONCUR papers were published in the series Lecture Notes in Computer Science.
Multitier programming is a programming paradigm for distributed software, which typically follows a multitier architecture, physically separating different functional aspects of the software into different tiers. Multitier programming allows functionalities that span multiple of such tiers to be developed in a single compilation unit using a single programming language. Without multitier programming, tiers are developed using different languages, e.g., JavaScript for the Web client, PHP for the Web server and SQL for the database. Multitier programming is often integrated into general-purpose languages by extending them with support for distribution.
AofA, the International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms is an academic meeting that has been held regularly since 1993 in the field of computer science, focusing on mathematical methods from analytic combinatorics and probability for the study of properties of algorithms and large combinatorial structures. In early years, different formal names were used, but the meeting and associated community of researchers has always been known as AofA.
In computer science, choreographic programming is a programming paradigm where programs are compositions of interactions among multiple concurrent participants.
The twin-width of an undirected graph is a natural number associated with the graph, used to study the parameterized complexity of graph algorithms. Intuitively, it measures how similar the graph is to a cograph, a type of graph that can be reduced to a single vertex by repeatedly merging together twins, vertices that have the same neighbors. The twin-width is defined from a sequence of repeated mergers where the vertices are not required to be twins, but have nearly equal sets of neighbors.
A parameterized approximation algorithm is a type of algorithm that aims to find approximate solutions to NP-hard optimization problems in polynomial time in the input size and a function of a specific parameter. These algorithms are designed to combine the best aspects of both traditional approximation algorithms and fixed-parameter tractability.
{{cite book}}: CS1 maint: multiple names: translators list (link)… Dagstuhl owns a comprehensive Informatics specialized library, which organizes a special book exhibition, showing all books of participants available in the library, during all Dagstuhl Seminars and Dagstuhl Perspectives Workshops. Schloss Dagstuhl kindly requests the authors to sign their books …
49°31′49″N6°53′57″E / 49.53028°N 6.89917°E
| International | |
|---|---|
| National | |
