|
41 |
P-Time Algorithms for Typical #EO Problems
Meng, Boning. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
42 |
Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns
Lassota, Alexandra. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
43 |
Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems
Biniaz, Ahmad. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
44 |
Randomized algorithms to generate hypergraphs with given degree sequences
Ascolese, Michela. - Hamburg : Technische Universität Hamburg. Universitätsbibliothek, 2025
|
|
|
|
45 |
Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
Can Esmer, Barış. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
46 |
Semantic composition of robotic solver algorithms on graph structures
Schneider, Sven. - Sankt Augustin : Hochschule Bonn-Rhein-Sieg, 2025
|
|
|
|
47 |
Soft tissue tumor imaging in adults: whole-body staging in sarcoma, non-malignant entities requiring special algorithms, pitfalls and special imaging aspects - guidelines 2024 from the European Society of Musculoskeletal Radiology (ESSR)
Noebauer-Huhmann, Iris-Melanie. - Augsburg : Universität Augsburg, 2025
|
|
|
|
48 |
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
Bergougnoux, Benjamin. - Hamburg : Technische Universität Hamburg. Universitätsbibliothek, 2025
|
|
|
|
49 |
Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game
Chen, Antares. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
50 |
The Quest for Faster Join Algorithms (Invited Talk)
Koutris, Paraschos. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
Administration
