| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A polynomial double reversal minimization algorithm for deterministic finite automata
|
Vázquez de Parga, Manuel
|
|
2013
|
487 |
C |
p. 17-22
6 p.
|
artikel
|
| 2 |
Approximate membership for regular languages modulo the edit distance
|
Ndione, Antoine
|
|
2013
|
487 |
C |
p. 37-49
13 p.
|
artikel
|
| 3 |
Backbone colouring: Tree backbones with small diameter in planar graphs
|
Campos, Victor
|
|
2013
|
487 |
C |
p. 50-64
15 p.
|
artikel
|
| 4 |
Complexity of Canadian traveler problem variants
|
Fried, Dror
|
|
2013
|
487 |
C |
p. 1-16
16 p.
|
artikel
|
| 5 |
Corrigendum to “Cycle transversals in perfect graphs and cographs” [Theoret. Comput. Sci. 469 (2013) 15–23]
|
Brandstädt, Andreas
|
|
2013
|
487 |
C |
p. 103-105
3 p.
|
artikel
|
| 6 |
Editorial Board
|
|
|
2013
|
487 |
C |
p. iii-viii
nvt p.
|
artikel
|
| 7 |
Enumerative encoding of correlation-immune Boolean functions
|
Carrasco, Nicolás
|
|
2013
|
487 |
C |
p. 23-36
14 p.
|
artikel
|
| 8 |
L ( 2 , 1 ) -labelings on the modular product of two graphs
|
Shao, Zhendong
|
|
2013
|
487 |
C |
p. 74-81
8 p.
|
artikel
|
| 9 |
Minimal dominating sets in graph classes: Combinatorial bounds and enumeration
|
Couturier, Jean-François
|
|
2013
|
487 |
C |
p. 82-94
13 p.
|
artikel
|
| 10 |
Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
|
Yu, Sheng
|
|
2013
|
487 |
C |
p. 95-102
8 p.
|
artikel
|
| 11 |
Running time of the Treapsort algorithm
|
Early, D.
|
|
2013
|
487 |
C |
p. 65-73
9 p.
|
artikel
|
Tijdschrift beschrijving