|
91 |
Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
Eppstein, David. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
92 |
Beating Competitive Ratio 4 for Graphic Matroid Secretary
Banihashem, Kiarash. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
93 |
Beeping Deterministic CONGEST Algorithms in Graphs
Garncarek, Pawel. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
94 |
Benchmarking of Localization and People Detection Algorithms for Mobile Robots in Industrial Environments
Spieß, Florian. - Würzburg : Universität Würzburg, 2025
|
|
|
|
95 |
Benchmarking reinforcement learning algorithms for autonomous mechanical thrombectomy
Moosa, Farhana. - Erlangen : Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), 2025
|
|
|
|
96 |
Better Indexing for Rectangular Pattern Matching
Gawrychowski, Paweł. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
97 |
Beyond performance: evaluating non-functional requirements of machine learning algorithms
Röchner, Philipp. - Mainz, 2025
|
|
|
|
98 |
Beyond zooming
Gedicke, Sven. - München : Verlag der Bayerischen Akademie der Wissenschaften, 2025
|
|
|
|
99 |
Bicriteria Approximation for k-Edge-Connectivity
Nutov, Zeev. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
100 |
Big Data, Data Mining and Data Science
Berlin : De Gruyter, [2025]
|
|
Administration
