Issue
Dagstuhl Reports, Volume 15, Issue 5
-
Part of:
Volume:
Dagstuhl Reports, Volume 15
Journal: Dagstuhl Reports (DagRep)
Event
- Dagstuhl Seminars 25191, 25192, 25201, 25202, 25211, 25212
Publication Details
- published at: 2025-12-19
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Access Numbers
- Detailed Access Statistics available here
-
Total Accesses (updated on a weekly basis)
0Documents
Documents
No documents found matching your filter selection.
Document
Complete Issue
Dagstuhl Reports, Volume 15, Issue 5, May 2025, Complete Issue
Abstract
Dagstuhl Reports, Volume 15, Issue 5, May 2025, Complete Issue
Cite as
Dagstuhl Reports, Volume 15, Issue 5, pp. 1-159, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{DagRep.15.5,
title = {{Dagstuhl Reports, Volume 15, Issue 5, May 2025, Complete Issue}},
pages = {1--159},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {15},
number = {5},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.5},
URN = {urn:nbn:de:0030-drops-252813},
doi = {10.4230/DagRep.15.5},
annote = {Keywords: Dagstuhl Reports, Volume 15, Issue 5, May 2025, Complete Issue}
}
Document
Front Matter
Dagstuhl Reports, Table of Contents, Volume 15, Issue 5, 2025
Abstract
Dagstuhl Reports, Table of Contents, Volume 15, Issue 5, 2025
Cite as
Dagstuhl Reports, Volume 15, Issue 5, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{DagRep.15.5.i,
title = {{Dagstuhl Reports, Table of Contents, Volume 15, Issue 5, 2025}},
pages = {i--ii},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {15},
number = {5},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.5.i},
URN = {urn:nbn:de:0030-drops-252741},
doi = {10.4230/DagRep.15.5.i},
annote = {Keywords: Table of Contents, Frontmatter}
}
Document
Adaptive and Scalable Data Structures (Dagstuhl Seminar 25191)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 25191 "Adaptive and Scalable Data Structures". Data structures govern the organization and manipulation of data in computing systems across a broad range of applications. The efficiency and scalability of data structures has profound implications, motivating continued research on the entire spectrum from theoretical to practical. As the size and complexity of data sets increases and as the underlying computing infrastructure changes, data structures need to be continually redesigned with scalability in mind. Classical data structures also need reevaluation to better fit the requirements of modern applications. Adaptivity offers a way to design data structures that automatically take advantage of features of the underlying hardware, specific structure and biases in their usage, or side-information, and the limits of data structure adaptivity pose deep research questions. The goal of this seminar was to reflect on these complementary aspects of data structure research and to identify promising research questions. The program provides a snapshot of the current state of research and establishes possible future directions for the field.
Cite as
Michael A. Bender, John Iacono, László Kozma, Eva Rotenberg, and Justin Dallant. Adaptive and Scalable Data Structures (Dagstuhl Seminar 25191). In Dagstuhl Reports, Volume 15, Issue 5, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{bender_et_al:DagRep.15.5.1,
author = {Bender, Michael A. and Iacono, John and Kozma, L\'{a}szl\'{o} and Rotenberg, Eva and Dallant, Justin},
title = {{Adaptive and Scalable Data Structures (Dagstuhl Seminar 25191)}},
pages = {1--20},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {15},
number = {5},
editor = {Bender, Michael A. and Iacono, John and Kozma, L\'{a}szl\'{o} and Rotenberg, Eva and Dallant, Justin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.5.1},
URN = {urn:nbn:de:0030-drops-252802},
doi = {10.4230/DagRep.15.5.1},
annote = {Keywords: Data structures, Algorithms, Big data, Computational models}
}
Document
AUTOBIZ: Pushing the Boundaries of AI-Driven Process Execution and Adaptation (Dagstuhl Seminar 25192)
Abstract
Advances in AI are enabling the shift toward Autonomous Business Processes (ABPs), where systems not only suggest actions but also take proactive steps within defined constraints. This concept was introduced in the AI-Augmented Business Process Management Systems (ABPMSs) manifesto, which outlines their lifecycle, features, and research challenges. The "AutoBiz" 25192 Dagstuhl Seminar brought together experts from AI and BPM to collaborate on advancing this vision. The seminar’s main goal was to define a research agenda for the realization of ABP systems.
Cite as
Giuseppe De Giacomo, Marlon Dumas, Fabiana Fournier, Timotheus Kampik, and Lior Limonad. AUTOBIZ: Pushing the Boundaries of AI-Driven Process Execution and Adaptation (Dagstuhl Seminar 25192). In Dagstuhl Reports, Volume 15, Issue 5, pp. 21-63, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{degiacomo_et_al:DagRep.15.5.21,
author = {De Giacomo, Giuseppe and Dumas, Marlon and Fournier, Fabiana and Kampik, Timotheus and Limonad, Lior},
title = {{AUTOBIZ: Pushing the Boundaries of AI-Driven Process Execution and Adaptation (Dagstuhl Seminar 25192)}},
pages = {21--63},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {15},
number = {5},
editor = {De Giacomo, Giuseppe and Dumas, Marlon and Fournier, Fabiana and Kampik, Timotheus and Limonad, Lior},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.5.21},
URN = {urn:nbn:de:0030-drops-252799},
doi = {10.4230/DagRep.15.5.21},
annote = {Keywords: AutoBiz, Artificial Intelligence, Business Process Management, Autonomous Business Processes, Dagstuhl Seminar}
}
Document
Computational Geometry (Dagstuhl Seminar 25201)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 25201 "Computational Geometry". The seminar program spanned the days from 11th May to 16th May 2025, and 39 participants from various countries were on site. Recent advances in computational geometry were presented and discussed, and new challenges were identified, in particular in relation to the two themes "parameterized complexity" and "the interplay between theory and implementation". This report collects the abstracts of the talks and the open problems presented at the seminar, an excerpt from the panel discussion, and partial progress from the active working groups.
Cite as
Maarten Löffler, Eunjin Oh, Jeff M. Phillips, and Alexandra Weinberger. Computational Geometry (Dagstuhl Seminar 25201). In Dagstuhl Reports, Volume 15, Issue 5, pp. 64-95, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{loffler_et_al:DagRep.15.5.64,
author = {L\"{o}ffler, Maarten and Oh, Eunjin and Phillips, Jeff M. and Weinberger, Alexandra},
title = {{Computational Geometry (Dagstuhl Seminar 25201)}},
pages = {64--95},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {15},
number = {5},
editor = {L\"{o}ffler, Maarten and Oh, Eunjin and Phillips, Jeff M. and Weinberger, Alexandra},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.5.64},
URN = {urn:nbn:de:0030-drops-252780},
doi = {10.4230/DagRep.15.5.64},
annote = {Keywords: algorithms, combinatorics, complexity, geometric computing, implementation}
}
Document
Generative Models for 3D Vision (Dagstuhl Seminar 25202)
Abstract
Generative models that allow synthesis of realistic 3D models have been of interest in computer vision and graphics for over 2 decades. While traditional methods use morphable models for this task, more recent works have adopted powerful tools from the 2D image domain such as generative adversarial networks, neural fields and diffusion models, and have achieved impressive results. The question of which tools are most suitable for applications such as reconstructing 3D geometry from partial data, and creating digital 3D content remains open. This report documents the program and outcomes of Dagstuhl Seminar 25202 titled "Generative Models for 3D Vision". This meeting of 25 researchers covered a variety of topics such as generative models and priors for 2D tasks, medical applications, and digital representations of humans, including how to evaluate and benchmark different methods. We summarise the discussions, presentations, and results of this seminar.
Cite as
Laura Neschen, Bernhard Egger, Adam Kortylewski, William Smith, and Stefanie Wuhrer. Generative Models for 3D Vision (Dagstuhl Seminar 25202). In Dagstuhl Reports, Volume 15, Issue 5, pp. 96-113, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{neschen_et_al:DagRep.15.5.96,
author = {Neschen, Laura and Egger, Bernhard and Kortylewski, Adam and Smith, William and Wuhrer, Stefanie},
title = {{Generative Models for 3D Vision (Dagstuhl Seminar 25202)}},
pages = {96--113},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {15},
number = {5},
editor = {Neschen, Laura and Egger, Bernhard and Kortylewski, Adam and Smith, William and Wuhrer, Stefanie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.5.96},
URN = {urn:nbn:de:0030-drops-252774},
doi = {10.4230/DagRep.15.5.96},
annote = {Keywords: 3D Computer Vision, Computer Graphics, Generative Models, Implicit Representations, Neural Rendering, Statistical Modelling}
}
Document
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 25211)
Abstract
Constraint satisfaction has always played a central role in computational complexity theory; appropriate versions of CSPs are classical complete problems for most standard complexity classes. CSPs constitute a very rich and yet sufficiently manageable class of problems to give a good perspective on general computational phenomena. For instance, they help to understand which mathematical properties make a computational problem tractable (in a wide sense, e.g., polynomial-time solvable, non-trivially approximable, etc.). One of the most striking features of this research direction is the variety of different branches of mathematics (including algebra and logic, combinatorics and graph theory, probability theory and mathematical programming, and most recently topology) that are used to achieve deep insights in the study of the CSP, and this seminar will contribute towards further synergy in the area. In the last 20 years, research activity in this area has significantly intensified and hugely impressive progress was made. The Dagstuhl Seminar 25211 "The Constraint Satisfaction Problem: Complexity and Approximability" was aimed at bringing together researchers using all the different techniques in the study of the CSP so that they can share their insights obtained during the past four years. This report documents the material presented during the course of the seminar.
Cite as
Manuel Bodirsky, Venkatesan Guruswami, Dániel Marx, Stanislav Živný, and Žaneta Semanišinová. The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 25211). In Dagstuhl Reports, Volume 15, Issue 5, pp. 114-133, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{bodirsky_et_al:DagRep.15.5.114,
author = {Bodirsky, Manuel and Guruswami, Venkatesan and Marx, D\'{a}niel and \v{Z}ivn\'{y}, Stanislav and Semani\v{s}inov\'{a}, \v{Z}aneta},
title = {{The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 25211)}},
pages = {114--133},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {15},
number = {5},
editor = {Bodirsky, Manuel and Guruswami, Venkatesan and Marx, D\'{a}niel and \v{Z}ivn\'{y}, Stanislav and Semani\v{s}inov\'{a}, \v{Z}aneta},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.5.114},
URN = {urn:nbn:de:0030-drops-252762},
doi = {10.4230/DagRep.15.5.114},
annote = {Keywords: computational complexity, constraint satisfaction problem, hardness of approximation, parameterized complexity, semidefinite programming}
}
Document
Metric Sketching and Dynamic Algorithms for Geometric and Topological Graphs (Dagstuhl Seminar 25212)
Abstract
Sketching is a basic technique to handle big data: Compress a big input dataset into a small dataset, called a sketch, that (approximately) preserves the important information in the input dataset. A metric space is often given as a distance matrix with Ω(n²) entries, and metric sketching techniques aim to reduce the space to linear. One goal of this Dagstuhl Seminar was to understand different sketching techniques and metric spaces that admit small sketches. Another common approach to handling big datasets is dynamic algorithms. Typically, large datasets do not arrive in a single batch; instead, they are updated over time in small increments. The objective of dynamic algorithms is to respond to data updates quickly, ideally with an update time that is polylogarithmic in the size of the whole dataset.
In this Dagstuhl Seminar "Metric Sketching and Dynamic Algorithms for Geometric and Topological Graphs" (25212), we considered sketching and dynamic algorithms in the context of geometric intersection graphs and topological graphs. Geometric intersection graphs have been used to model many real-world massive graphs, such as wireless networks. Topological graphs, including planar graphs, have been used in applications such as geographic information systems and motion planning. While geometric intersection graphs and topological graphs are seemingly different, they have common structural properties that allow the transfer of algorithmic techniques between the two domains, which was the motivation of this seminar: Uncovering deeper connections between metric sketching, dynamic algorithms, geometric intersection graphs, and topological graphs. More concretely, we studied: (1) the construction of sketching structures, such as spanners, tree covers, distance oracles, and emulators with optimal parameters for various metrics and graphs, including geometric and topological graphs; (2) dynamic problems in geometric intersections graphs, including connectivity, spanners, shortest paths; and (3) dynamic maintenance of metric sketching structures in topological graphs.
Cite as
Sujoy Bhore, Jie Gao, Hung Le, Csaba D. Tóth, and Lazar Milenković. Metric Sketching and Dynamic Algorithms for Geometric and Topological Graphs (Dagstuhl Seminar 25212). In Dagstuhl Reports, Volume 15, Issue 5, pp. 134-157, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{bhore_et_al:DagRep.15.5.134,
author = {Bhore, Sujoy and Gao, Jie and Le, Hung and T\'{o}th, Csaba D. and Milenkovi\'{c}, Lazar},
title = {{Metric Sketching and Dynamic Algorithms for Geometric and Topological Graphs (Dagstuhl Seminar 25212)}},
pages = {134--157},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {15},
number = {5},
editor = {Bhore, Sujoy and Gao, Jie and Le, Hung and T\'{o}th, Csaba D. and Milenkovi\'{c}, Lazar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.5.134},
URN = {urn:nbn:de:0030-drops-252753},
doi = {10.4230/DagRep.15.5.134},
annote = {Keywords: geometric spanners, geometric intersection graphs, planar metrics, metric covering, computational geometry}
}