|
61 |
Algorithms for Consistent Dynamic Labeling of Maps With a Time-Slider Interface
Bonerath, Annika. - Bonn : Universitäts- und Landesbibliothek Bonn, 2025
|
|
|
|
62 |
Algorithms for Distance Problems in Continuous Graphs
Cabello, Sergio. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
63 |
Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments
Austrin, Per. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
64 |
Algorithms for the Dynamic Balanced Graph Partitioning Problem
Zabrodin, Ruslan Andreevic. - München : Universitätsbibliothek der TU München, 2025
|
|
|
|
65 |
Algovolution
Thill, Klaus-Dieter. - Berlin : neobooks, 2025
|
|
|
|
66 |
Almost-Linear Time Algorithms for Partially Dynamic Graphs (Invited Talk)
Kyng, Rasmus. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
67 |
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
|
|
|
|
68 |
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
|
|
|
|
69 |
An Improved Bound for Plane Covering Paths
A. Akitaya, Hugo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
70 |
An Improved Guillotine Cut for Squares
Chalermsook, Parinya. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
Administration
