| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing
|
Das, Aparna
|
|
2014
|
73 |
1 |
p. 115-142
|
artikel
|
| 2 |
Computing Tree-Depth Faster Than $$2^{n}$$2n
|
Fomin, Fedor V.
|
|
2014
|
73 |
1 |
p. 202-216
|
artikel
|
| 3 |
Fast Algorithm for Partial Covers in Words
|
Kociumaka, Tomasz
|
|
2014
|
73 |
1 |
p. 217-233
|
artikel
|
| 4 |
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
|
Farach-Colton, MartÃn
|
|
2014
|
73 |
1 |
p. 87-114
|
artikel
|
| 5 |
Maximum Metric Spanning Tree Made Byzantine Tolerant
|
Dubois, Swan
|
|
2014
|
73 |
1 |
p. 166-201
|
artikel
|
| 6 |
On Feedback Vertex Set: New Measure and New Structures
|
Cao, Yixin
|
|
2014
|
73 |
1 |
p. 63-86
|
artikel
|
| 7 |
On Minimum Sum of Radii and Diameters Clustering
|
Behsaz, Babak
|
|
2014
|
73 |
1 |
p. 143-165
|
artikel
|
| 8 |
Performance Analysis of the (1+1) Evolutionary Algorithm for the Multiprocessor Scheduling Problem
|
Zhou, Yuren
|
|
2014
|
73 |
1 |
p. 21-41
|
artikel
|
| 9 |
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
|
Bringmann, Karl
|
|
2014
|
73 |
1 |
p. 42-62
|
artikel
|
| 10 |
Testing Outerplanarity of Bounded Degree Graphs
|
Yoshida, Yuichi
|
|
2014
|
73 |
1 |
p. 1-20
|
artikel
|
Tijdschrift beschrijving