|
51 |
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
|
|
|
|
52 |
An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
Brewer, Bruce W.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
53 |
Application of back propagation neural networks and random forest algorithms in material research of hydrogels
Wang, Yawen. - Dresden : Technische Universität Dresden, 2025
|
|
|
|
54 |
Application of machine learning algorithms for functional outcome prediction after aneurysmal subarachnoid hemorrhage: a single-center retrospective study
Wang, Han. - Berlin : Medizinische Fakultät Charité - Universitätsmedizin Berlin, 2025
|
|
|
|
55 |
Applications of Panel Data and Machine Learning Algorithms for Data-Driven Decision-Making
Berlin : Humboldt-Universität zu Berlin, 2025
|
|
|
|
56 |
Approximability of Longest Run Subsequence and Complementary Minimization Problems
Asahiro, Yuichi. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
57 |
Approximating Maximum Cut on Interval Graphs and Split Graphs Beyond Goemans-Williamson
Ahn, Jungho. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
58 |
Approximation Algorithms for Integer Programming with Resource Augmentation
Brinkop, Hauke. - Kiel : Universitätsbibliothek Kiel, 2025
|
|
|
|
59 |
Approximation Algorithms for Optimal Hopsets
Dinitz, Michael. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
60 |
Approximation Algorithms for the Generalized Point-To-Point Problem
Friggstad, Zachary. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
Administration
