|
31 |
Improved Approximation Algorithms for Three-Dimensional Knapsack
Jansen, Klaus. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
32 |
Learning-Augmented Streaming Algorithms for Approximating MAX-CUT
Dong, Yinhao. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
33 |
Machine learning based algorithm selection and genetic algorithms for serial-batch scheduling
Uzunoglu, Aykut. - Augsburg : Universität Augsburg, 2025
|
|
|
|
34 |
MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal
Gaikwad, Ajinkya. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
35 |
Measuring preferences for algorithms — How willing are people to cede control to algorithms?
Ivanova-Stenzel, Radosveta. - Berlin : Technische Universität Berlin, 2025
|
|
|
|
36 |
Modular Counting CSP: Reductions and Algorithms
Kazeminia, Amirhossein. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
37 |
O(1)-Round MPC Algorithms for Multi-Dimensional Grid Graph Connectivity, Euclidean MST and DBSCAN
Gan, Junhao. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
38 |
Optimal Oblivious Algorithms for Multi-Way Joins
Hu, Xiao. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
39 |
P-Time Algorithms for Typical #EO Problems
Meng, Boning. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
40 |
Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns
Lassota, Alexandra. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
Administration
