|
241 |
Geometric algorithms for the visual exploration of spatiotemporal data
Bonerath, Annika. - München : Verlag der Bayerischen Akademie der Wissenschaften, 2025
|
|
|
|
242 |
Geometric Bipartite Matching Based Exact Algorithms for Server Problems
Raghvendra, Sharath. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
243 |
Geometric Convergence of Gradient Play Algorithms for Distributed Nash Equilibrium Seeking
Tatarenko, Tatiana. - Darmstadt : Universitäts- und Landesbibliothek, 2025
|
|
|
|
244 |
Going Beyond Surfaces in Diameter Approximation
Włodarczyk, Michał. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
245 |
Grandchildren-Weight-Balanced Binary Search Trees
Jugé, Vincent. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
246 |
Graph-based Clustering Algorithms for Corpora Exploration
Hloch, Mark Christian. - Hagen : FernUniversität in Hagen, 2025
|
|
|
|
247 |
Graph Decompositions and Length-Constrained Expanders (Invited Talk)
Haeupler, Bernhard. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
248 |
Graph Modification of Bounded Size to Minor-Closed Classes as Fast as Vertex Deletion
Morelle, Laure. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
249 |
Greedy-kernel algorithms for data mapping in multiphysics simulations
Tucciarone, Fabio. - Stuttgart : Universitätsbibliothek der Universität Stuttgart, 2025
|
|
|
|
250 |
GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
Gopal, Shivaram. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
Administration
