|
331 |
Multicut Problems in Almost-Planar Graphs: the Dependency of Complexity on the Demand Pattern
Hörsch, Florian. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
332 |
Multipass Linear Sketches for Geometric LP-Type Problems
Çekirge, N. Efe. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
333 |
Multistatic Uniform Diffraction Tomography and Time-Reversal Algorithms for Microwave Imaging of Multilayered Media
Omrani Hamzekalaei, Adel. - Karlsruhe : KIT Scientific Publishing, 2025
|
|
|
|
334 |
(Multivariate) k-SUM as Barrier to Succinct Computation
Gokaj, Geri. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
335 |
Mutational Signature Refitting on Sparse Pan-Cancer Data
Gilad, Gal. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
336 |
Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
Dhulipala, Laxman. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
337 |
Near-Optimal List-Recovery of Linear Code Families
Li, Ray. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
338 |
Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity
Bhanja, Koustav. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
339 |
ε-Net Algorithm Implementation on Hyperbolic Surfaces
Despré, Vincent. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
340 |
Neural Algorithms for Vehicle Routing
Falkner, Jonas. - Hildesheim : Universitätsbibliothek Hildesheim, 2025
|
|
Administration
