|
41 |
An Improved Guillotine Cut for Squares
Chalermsook, Parinya. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
42 |
An O(nlog n) Algorithm for Single-Source Shortest Paths in Disk Graphs
de Berg, Mark. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
43 |
An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
Brewer, Bruce W.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
44 |
Application of back propagation neural networks and random forest algorithms in material research of hydrogels
Wang, Yawen. - Dresden : Technische Universität Dresden, 2025
|
|
|
|
45 |
Approximability of Longest Run Subsequence and Complementary Minimization Problems
Asahiro, Yuichi. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
46 |
Approximating Maximum Cut on Interval Graphs and Split Graphs Beyond Goemans-Williamson
Ahn, Jungho. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
47 |
Approximation Algorithms for Optimal Hopsets
Dinitz, Michael. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
48 |
Approximation Algorithms for the Generalized Point-To-Point Problem
Friggstad, Zachary. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
49 |
Approximation and Parameterized Algorithms for Covering with Disks of Two Types of Radii
Bandyapadhyay, Sayan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
50 |
Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics
Ren, Kinter. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
Administration
