|
61 |
Approximation and Parameterized Algorithms for Covering with Disks of Two Types of Radii
Bandyapadhyay, Sayan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
62 |
Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics
Ren, Kinter. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
63 |
Automated layout creation in production planning
Rechkemmer, Dirk. - Dresden : Technische Universität Dresden, 2025
|
|
|
|
64 |
Automated planning and implementation of mode-based control algorithms for building energy systems
Cai, Xiaoye. - Aachen : Universitätsbibliothek der RWTH Aachen, 2025
|
|
|
|
65 |
Automatic generation of coupled cluster algorithms with application to transcorrelated Hamiltonians
Schraivogel, Thomas. - Stuttgart : Universitätsbibliothek der Universität Stuttgart, 2025
|
|
|
|
66 |
Autonomous Driving Control Using Parallel Deep Reinforcement Learning Algorithms in Continuous Spaces
Illges, Sebastian. - Konstanz : HTWG Konstanz, 2025
|
|
|
|
67 |
Average-Tree Phylogenetic Diversity of Networks
van Iersel, Leo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
68 |
Avoiding Range via Turan-Type Bounds
Kuntewar, Neha. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
69 |
B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load
Safavi, Roodabeh. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
70 |
Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
Eppstein, David. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
Administration
