|
61 |
Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments
Austrin, Per. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
62 |
Algovolution
Thill, Klaus-Dieter. - Berlin : neobooks, 2025
|
|
|
|
63 |
Almost-Linear Time Algorithms for Partially Dynamic Graphs (Invited Talk)
Kyng, Rasmus. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
64 |
An Efficient Data Structure and Algorithm for Long-Match Query in Run-Length Compressed BWT
Sanaullah, Ahsan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
65 |
An Efficient Polynomial Time Approximation Scheme for Minimizing the Total Weighted Completion Time on Uniformly Related Machines
Epstein, Leah. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
66 |
An Improved Bound for Plane Covering Paths
A. Akitaya, Hugo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
67 |
An Improved Guillotine Cut for Squares
Chalermsook, Parinya. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
68 |
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
|
|
|
|
69 |
An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
Brewer, Bruce W.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
70 |
Application of back propagation neural networks and random forest algorithms in material research of hydrogels
Wang, Yawen. - Dresden : Technische Universität Dresden, 2025
|
|
Administration
