|
1 |
Binary Search Trees of Permuton Samples
Corsini, Benoît. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
2 |
Depth-First Search Performance in Random Digraphs
Jacquet, Philippe. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
3 |
On the Number of Distinct Fringe Subtrees in Binary Search Trees
Wagner, Stephan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
4 |
On the Smoothed Complexity of Combinatorial Local Search
Giannakopoulos, Yiannis. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
5 |
Multi-neighborhood search for combinatorial optimization
Enthalten in 4OR 24.8.2024: 1-2
|
|
|
|
6 |
Cooperation in combinatorial search
Enthalten in Optimization letters 3.5.2024: 1-17
|
|
|
|
7 |
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem
Komusiewicz, Christian. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
8 |
Specification Search as a Combinatorial Optimization Problem: A Simulation
Siemund, Karik, 2023
|
|
|
|
9 |
The (Im)possibility of Simple Search-To-Decision Reductions for Approximation Problems
Golovnev, Alexander. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
10 |
Depth-First Search Performance in a Random Digraph with Geometric Degree Distribution
Jacquet, Philippe. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
Administration
