| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques
|
Fomin, Fedor V.
|
|
2017
|
80 |
4 |
p. 1146-1169
|
artikel
|
| 2 |
An Improved Approximation Algorithm for Knapsack Median Using Sparsification
|
Byrka, Jarosław
|
|
2018
|
80 |
4 |
p. 1093-1114
|
artikel
|
| 3 |
An $$O(\log \mathrm {OPT})$$O(logOPT)-Approximation for Covering and Packing Minor Models of $$\theta _r$$θr
|
Chatzidimitriou, Dimitris
|
|
2017
|
80 |
4 |
p. 1330-1356
|
artikel
|
| 4 |
Approximating the Generalized Minimum Manhattan Network Problem
|
Das, Aparna
|
|
2017
|
80 |
4 |
p. 1170-1190
|
artikel
|
| 5 |
Estimating the Makespan of the Two-Valued Restricted Assignment Problem
|
Jansen, Klaus
|
|
2017
|
80 |
4 |
p. 1357-1382
|
artikel
|
| 6 |
From Discrepancy to Majority
|
Eppstein, David
|
|
2017
|
80 |
4 |
p. 1278-1297
|
artikel
|
| 7 |
Greedy Oriented Flows
|
Faigle, Ulrich
|
|
2017
|
80 |
4 |
p. 1298-1314
|
artikel
|
| 8 |
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
|
Höhn, Wiebke
|
|
2017
|
80 |
4 |
p. 1191-1213
|
artikel
|
| 9 |
On the Efficiency of All-Pay Mechanisms
|
Christodoulou, George
|
|
2017
|
80 |
4 |
p. 1115-1145
|
artikel
|
| 10 |
Optimal Staged Self-Assembly of General Shapes
|
Chalk, Cameron
|
|
2017
|
80 |
4 |
p. 1383-1409
|
artikel
|
| 11 |
Semi-Group Range Sum Revisited: Query-Space Lower Bound Tightened
|
Hu, Xiaocheng
|
|
2017
|
80 |
4 |
p. 1315-1329
|
artikel
|
| 12 |
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices
|
Bläsius, Thomas
|
|
2017
|
80 |
4 |
p. 1214-1277
|
artikel
|
Tijdschrift beschrijving