|
31 |
Algorithm Engineering of SSSP with Negative Edge Weights
Cassis, Alejandro. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
32 |
Algorithmic Contiguity from Low-Degree Conjecture and Applications in Correlated Random Graphs
Li, Zhangsong. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
33 |
Algorithms for Computing Very Large BWTs: a Short Survey
Díaz-Domínguez, Diego. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
34 |
Algorithms for Consistent Dynamic Labeling of Maps With a Time-Slider Interface
Bonerath, Annika. - Bonn : Universitäts- und Landesbibliothek Bonn, 2025
|
|
|
|
35 |
Algorithms for Distance Problems in Continuous Graphs
Cabello, Sergio. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
36 |
Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments
Austrin, Per. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
37 |
Almost-Linear Time Algorithms for Partially Dynamic Graphs (Invited Talk)
Kyng, Rasmus. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
38 |
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
|
|
|
|
39 |
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
|
|
|
|
40 |
An Improved Bound for Plane Covering Paths
A. Akitaya, Hugo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
Administration
