| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A linear algorithm for string reconstruction in the reverse complement equivalence model
|
Cicalese, Ferdinando
|
|
2012
|
14 |
C |
p. 37-54
18 p.
|
artikel
|
| 2 |
Approximation complexity of Metric Dimension problem
|
Hauptmann, Mathias
|
|
2012
|
14 |
C |
p. 214-222
9 p.
|
artikel
|
| 3 |
A tight upper bound on the ( 2 , 1 )-total labeling number of outerplanar graphs
|
Hasunuma, Toru
|
|
2012
|
14 |
C |
p. 189-206
18 p.
|
artikel
|
| 4 |
Chains-into-bins processes
|
Batu, Tuğkan
|
|
2012
|
14 |
C |
p. 21-28
8 p.
|
artikel
|
| 5 |
Computing role assignments of proper interval graphs in polynomial time
|
Heggernes, Pinar
|
|
2012
|
14 |
C |
p. 173-188
16 p.
|
artikel
|
| 6 |
Dictionary-symbolwise flexible parsing
|
Crochemore, Maxime
|
|
2012
|
14 |
C |
p. 74-90
17 p.
|
artikel
|
| 7 |
Distributed colorings for collision-free routing in sink-centric sensor networks
|
Navarra, Alfredo
|
|
2012
|
14 |
C |
p. 232-247
16 p.
|
artikel
|
| 8 |
Editorial Board
|
|
|
2012
|
14 |
C |
p. iii-iv
nvt p.
|
artikel
|
| 9 |
Efficient chaining of seeds in ordered trees
|
Allali, Julien
|
|
2012
|
14 |
C |
p. 107-118
12 p.
|
artikel
|
| 10 |
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
|
Kaneta, Yusaku
|
|
2012
|
14 |
C |
p. 119-135
17 p.
|
artikel
|
| 11 |
[No title]
|
Iliopoulos, Costas S.
|
|
2012
|
14 |
C |
p. 1-
1 p.
|
artikel
|
| 12 |
Number of holes in unavoidable sets of partial words I
|
Blanchet-Sadri, F.
|
|
2012
|
14 |
C |
p. 55-64
10 p.
|
artikel
|
| 13 |
Number of holes in unavoidable sets of partial words II
|
Blanchet-Sadri, F.
|
|
2012
|
14 |
C |
p. 65-73
9 p.
|
artikel
|
| 14 |
On the maximal sum of exponents of runs in a string
|
Crochemore, Maxime
|
|
2012
|
14 |
C |
p. 29-36
8 p.
|
artikel
|
| 15 |
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
|
Dabrowski, Konrad
|
|
2012
|
14 |
C |
p. 207-213
7 p.
|
artikel
|
| 16 |
Path-based supports for hypergraphs
|
Brandes, Ulrik
|
|
2012
|
14 |
C |
p. 248-261
14 p.
|
artikel
|
| 17 |
Skip lift: A probabilistic alternative to red–black trees
|
Bose, Prosenjit
|
|
2012
|
14 |
C |
p. 13-20
8 p.
|
artikel
|
| 18 |
Testing connectivity of faulty networks in sublinear time
|
Dvořák, Tomáš
|
|
2012
|
14 |
C |
p. 223-231
9 p.
|
artikel
|
| 19 |
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
|
Angelini, Patrizio
|
|
2012
|
14 |
C |
p. 150-172
23 p.
|
artikel
|
| 20 |
The complexity of finding uniform sparsest cuts in various graph classes
|
Bonsma, Paul
|
|
2012
|
14 |
C |
p. 136-149
14 p.
|
artikel
|
| 21 |
Upper and lower I/O bounds for pebbling r-pyramids
|
Ranjan, Desh
|
|
2012
|
14 |
C |
p. 2-12
11 p.
|
artikel
|
| 22 |
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
|
Belazzougui, Djamal
|
|
2012
|
14 |
C |
p. 91-106
16 p.
|
artikel
|
Tijdschrift beschrijving