| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Adaptive search over sorted sets
|
Bonasera, Biagio
|
|
2015
|
30 |
C |
p. 128-133
6 p.
|
artikel
|
| 2 |
Bottleneck Steiner tree with bounded number of Steiner vertices
|
Abu-Affash, A. Karim
|
|
2015
|
30 |
C |
p. 96-100
5 p.
|
artikel
|
| 3 |
Computing upward topological book embeddings of upward planar digraphs
|
Giordano, F.
|
|
2015
|
30 |
C |
p. 45-69
25 p.
|
artikel
|
| 4 |
Constructing non-cyclic pandiagonal Latin squares of prime orders
|
Dabbaghian, Vahid
|
|
2015
|
30 |
C |
p. 70-77
8 p.
|
artikel
|
| 5 |
Editorial Board
|
|
|
2015
|
30 |
C |
p. iii-
1 p.
|
artikel
|
| 6 |
On the complexity of determining the irregular chromatic index of a graph
|
Baudon, Olivier
|
|
2015
|
30 |
C |
p. 113-127
15 p.
|
artikel
|
| 7 |
On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
|
Kloks, Ton
|
|
2015
|
30 |
C |
p. 21-28
8 p.
|
artikel
|
| 8 |
Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem
|
Jordán, Tibor
|
|
2015
|
30 |
C |
p. 29-44
16 p.
|
artikel
|
| 9 |
Range search on tuples of points
|
Agrawal, Akash
|
|
2015
|
30 |
C |
p. 1-12
12 p.
|
artikel
|
| 10 |
Reporting and counting maximal points in a query orthogonal rectangle
|
Das, Ananda Swarup
|
|
2015
|
30 |
C |
p. 78-95
18 p.
|
artikel
|
| 11 |
Small k-pyramids and the complexity of determining k
|
Schauerte, Boris
|
|
2015
|
30 |
C |
p. 13-20
8 p.
|
artikel
|
| 12 |
Universal point sets for planar three-trees
|
Fulek, Radoslav
|
|
2015
|
30 |
C |
p. 101-112
12 p.
|
artikel
|
Tijdschrift beschrijving