nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Comparison of Performance Measures for Online Algorithms
|
Boyar, Joan |
|
2014 |
72 |
4 |
p. 969-994 |
artikel |
2 |
A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP
|
Edwards, Keith |
|
2014 |
72 |
4 |
p. 940-968 |
artikel |
3 |
A Linear-Time Algorithm for Testing Outer-1-Planarity
|
Hong, Seok-Hee |
|
2014 |
72 |
4 |
p. 1033-1054 |
artikel |
4 |
Augmenting Graphs to Minimize the Diameter
|
Frati, Fabrizio |
|
2014 |
72 |
4 |
p. 995-1010 |
artikel |
5 |
Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks
|
D’Angelo, Gianlorenzo |
|
2014 |
72 |
4 |
p. 1055-1096 |
artikel |
6 |
Linear-Space Data Structures for Range Minority Query in Arrays
|
Chan, Timothy M. |
|
2014 |
72 |
4 |
p. 901-913 |
artikel |
7 |
Register Loading via Linear Programming
|
Calinescu, Gruia |
|
2014 |
72 |
4 |
p. 1011-1032 |
artikel |
8 |
Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective
|
Bonizzoni, Paola |
|
2014 |
72 |
4 |
p. 914-939 |
artikel |
9 |
Space–Time Trade-offs for Stack-Based Algorithms
|
Barba, Luis |
|
2014 |
72 |
4 |
p. 1097-1129 |
artikel |
10 |
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
|
Epstein, Leah |
|
2014 |
72 |
4 |
p. 1130-1171 |
artikel |