|
521 |
How Can Algorithms Help in Protecting Our Privacy (Invited Talk)
Henzinger, Monika. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
522 |
How Did They Design This Game? Swish: Complexity and Unplayable Positions
Dailly, Antoine. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
523 |
How to Covertly and Uniformly Scramble the 15 Puzzle and Rubik’s Cube
Shinagawa, Kazumasa. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
524 |
Hybrid k-Clustering: Blending k-Median and k-Center
Fomin, Fedor V.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
525 |
Hybridizing genetic random forest and self-attention based CNN-LSTM algorithms for landslide susceptibility mapping in Darjiling and Kurseong, India
Moghimi, Armin. - Hannover : Gottfried Wilhelm Leibniz Universität Hannover, 2024
|
|
|
|
526 |
Hypergraph Connectivity Augmentation in Strongly Polynomial Time
Bérczi, Kristóf. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
527 |
Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
Chakrabarti, Amit. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
528 |
Improved Algorithms for the Capacitated Team Orienteering Problem
D'Angelo, Gianlorenzo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
529 |
Improved Approximations for Flexible Network Design
Hyatt-Denesik, Dylan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
530 |
Improved Bounds for Graph Distances in Scale Free Percolation and Related Models
Lakis, Kostas. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
Administration
