| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Linear Time Algorithm for L(2,1)-Labeling of Trees
|
Hasunuma, Toru
|
|
2012
|
66 |
3 |
p. 654-681
|
artikel
|
| 2 |
Approximate Guarding of Monotone and Rectilinear Polygons
|
Krohn, Erik A.
|
|
2012
|
66 |
3 |
p. 564-594
|
artikel
|
| 3 |
Approximating Points by a Piecewise Linear Function
|
Chen, Danny Z.
|
|
2012
|
66 |
3 |
p. 682-713
|
artikel
|
| 4 |
Efficient Coordination Mechanisms for Unrelated Machine Scheduling
|
Caragiannis, Ioannis
|
|
2012
|
66 |
3 |
p. 512-540
|
artikel
|
| 5 |
Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets
|
Huber, K. T.
|
|
2012
|
66 |
3 |
p. 714-738
|
artikel
|
| 6 |
How to Use Spanning Trees to Navigate in Graphs
|
Dragan, Feodor F.
|
|
2012
|
66 |
3 |
p. 479-511
|
artikel
|
| 7 |
Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs
|
Lazar, Avivit
|
|
2012
|
66 |
3 |
p. 615-640
|
artikel
|
| 8 |
Median Trajectories
|
Buchin, Kevin
|
|
2012
|
66 |
3 |
p. 595-614
|
artikel
|
| 9 |
On Finding Min-Min Disjoint Paths
|
Guo, Longkun
|
|
2012
|
66 |
3 |
p. 641-653
|
artikel
|
| 10 |
Recognizing d-Interval Graphs and d-Track Interval Graphs
|
Jiang, Minghui
|
|
2012
|
66 |
3 |
p. 541-563
|
artikel
|
Tijdschrift beschrijving