|
41 |
Algorithms and certificates for exact Mixed Integer Programming
Eifler, Leon. - Berlin : Technische Universität Berlin, 2025
|
|
|
|
42 |
Algorithms for Computing Very Large BWTs: a Short Survey
Díaz-Domínguez, Diego. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
43 |
Algorithms for Consistent Dynamic Labeling of Maps With a Time-Slider Interface
Bonerath, Annika. - Bonn : Universitäts- und Landesbibliothek Bonn, 2025
|
|
|
|
44 |
Algorithms for Distance Problems in Continuous Graphs
Cabello, Sergio. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
45 |
Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments
Austrin, Per. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
46 |
Almost-Linear Time Algorithms for Partially Dynamic Graphs (Invited Talk)
Kyng, Rasmus. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
47 |
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
|
|
|
|
48 |
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
|
|
|
|
49 |
An Improved Bound for Plane Covering Paths
A. Akitaya, Hugo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
50 |
An Improved Guillotine Cut for Squares
Chalermsook, Parinya. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
Administration
