|
531 |
How Did They Design This Game? Swish: Complexity and Unplayable Positions
Dailly, Antoine. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
532 |
How to Covertly and Uniformly Scramble the 15 Puzzle and Rubik’s Cube
Shinagawa, Kazumasa. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
533 |
Hybrid k-Clustering: Blending k-Median and k-Center
Fomin, Fedor V.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
534 |
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
|
|
|
|
535 |
Hypergraph Connectivity Augmentation in Strongly Polynomial Time
Bérczi, Kristóf. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
536 |
Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
Chakrabarti, Amit. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
537 |
Improved Algorithms for the Capacitated Team Orienteering Problem
D'Angelo, Gianlorenzo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
538 |
Improved Approximations for Flexible Network Design
Hyatt-Denesik, Dylan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
539 |
Improved Bounds for Graph Distances in Scale Free Percolation and Related Models
Lakis, Kostas. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
540 |
Improved Bounds for High-Dimensional Equivalence and Product Testing Using Subcube Queries
Adar, Tomer. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
Administration
