nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem
|
Genova, Kyle |
|
2017 |
78 |
4 |
p. 1109-1130 |
artikel |
2 |
Explicit Expanding Expanders
|
Dinitz, Michael |
|
2016 |
78 |
4 |
p. 1225-1245 |
artikel |
3 |
Guest Editors’ Foreword
|
Bansal, Nikhil |
|
2017 |
78 |
4 |
p. 1107-1108 |
artikel |
4 |
How to Sort by Walking and Swapping on Paths and Trees
|
Graf, Daniel |
|
2017 |
78 |
4 |
p. 1151-1181 |
artikel |
5 |
Improved Analysis of Complete-Linkage Clustering
|
Großwendt, Anna |
|
2017 |
78 |
4 |
p. 1131-1150 |
artikel |
6 |
I/O-Efficient Similarity Join
|
Pagh, Rasmus |
|
2017 |
78 |
4 |
p. 1263-1283 |
artikel |
7 |
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
|
Colin de Verdière, Éric |
|
2016 |
78 |
4 |
p. 1206-1224 |
artikel |
8 |
On the Approximability of Digraph Ordering
|
Kenkre, Sreyash |
|
2016 |
78 |
4 |
p. 1182-1205 |
artikel |
9 |
Scheduling with Deadlines and Buffer Management with Processing Requirements
|
Azar, Yossi |
|
2016 |
78 |
4 |
p. 1246-1262 |
artikel |