| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Analysis of Surrogate-Assisted Information-Geometric Optimization Algorithms
|
Akimoto, Youhei
|
|
|
86 |
1 |
p. 33-63
|
artikel
|
| 2 |
An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics
|
Bambury, Henry
|
|
|
86 |
1 |
p. 1-32
|
artikel
|
| 3 |
A Semi Brute-Force Search Approach for (Balanced) Clustering
|
Xu, Yicheng
|
|
|
86 |
1 |
p. 130-146
|
artikel
|
| 4 |
Computing and Listing Avoidable Vertices and Paths
|
Papadopoulos, Charis
|
|
|
86 |
1 |
p. 281-306
|
artikel
|
| 5 |
Computing Generalized Convolutions Faster Than Brute Force
|
Esmer, Barış Can
|
|
|
86 |
1 |
p. 334-366
|
artikel
|
| 6 |
Extended MSO Model Checking via Small Vertex Integrity
|
Gima, Tatsuya
|
|
|
86 |
1 |
p. 147-170
|
artikel
|
| 7 |
Fully Dynamic k-Center Clustering with Outliers
|
Chan, T.-H. Hubert
|
|
|
86 |
1 |
p. 171-193
|
artikel
|
| 8 |
On Parameterized Complexity of Binary Networked Public Goods Game
|
Maiti, Arnab
|
|
|
86 |
1 |
p. 307-333
|
artikel
|
| 9 |
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs
|
Punzi, Giulia
|
|
|
86 |
1 |
p. 194-217
|
artikel
|
| 10 |
Runtime Analysis for Permutation-based Evolutionary Algorithms
|
Doerr, Benjamin
|
|
|
86 |
1 |
p. 90-129
|
artikel
|
| 11 |
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem
|
Doerr, Benjamin
|
|
|
86 |
1 |
p. 64-89
|
artikel
|
| 12 |
The Need for Seed (in the Abstract Tile Assembly Model)
|
Alseth, Andrew
|
|
|
86 |
1 |
p. 218-280
|
artikel
|
Tijdschrift beschrijving