no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A note on the decoding complexity of error-correcting codes
|
Gronemeier, André |
|
2006 |
100 |
3 |
p. 116-119 4 p. |
article |
2 |
A relation between edit distance for ordered trees and edit distance for Euler strings
|
Akutsu, Tatsuya |
|
2006 |
100 |
3 |
p. 105-109 5 p. |
article |
3 |
Editorial Board
|
|
|
2006 |
100 |
3 |
p. CO2- 1 p. |
article |
4 |
Efficient parameterized string matching
|
Fredriksson, Kimmo |
|
2006 |
100 |
3 |
p. 91-96 6 p. |
article |
5 |
Flow equivalent trees in undirected node-edge-capacitated planar graphs
|
Zhang, Xianchao |
|
2006 |
100 |
3 |
p. 110-115 6 p. |
article |
6 |
On the All-Farthest-Segments problem for a planar set of points
|
Mukhopadhyay, Asish |
|
2006 |
100 |
3 |
p. 120-123 4 p. |
article |
7 |
Oriented vertex and arc colorings of outerplanar graphs
|
Pinlou, Alexandre |
|
2006 |
100 |
3 |
p. 97-104 8 p. |
article |
8 |
P systems without multiplicities of symbol-objects
|
Alhazov, Artiom |
|
2006 |
100 |
3 |
p. 124-129 6 p. |
article |