nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A perspective on certain polynomial-time solvable classes of satisfiability
|
Franco, John |
|
2003 |
125 |
2-3 |
p. 177-214 38 p. |
artikel |
2 |
Approximating minimum size {1,2}-connected networks
|
Krysta, Piotr |
|
2003 |
125 |
2-3 |
p. 267-288 22 p. |
artikel |
3 |
Author Index
|
|
|
2003 |
125 |
2-3 |
p. 319- 1 p. |
artikel |
4 |
Connectivity of iterated line graphs
|
Knor, Martin |
|
2003 |
125 |
2-3 |
p. 255-266 12 p. |
artikel |
5 |
On the stable set problem in special P 5-free graphs
|
Gerber, Michael U |
|
2003 |
125 |
2-3 |
p. 215-224 10 p. |
artikel |
6 |
Opacity of a finite automaton, method of calculation and the Ising chain
|
Yao, Jia-Yan |
|
2003 |
125 |
2-3 |
p. 289-318 30 p. |
artikel |
7 |
Superdominance order and distance of trees with bounded maximum degree
|
Jelen, F. |
|
2003 |
125 |
2-3 |
p. 225-233 9 p. |
artikel |
8 |
The complexity of compressing subsegments of images described by finite automata
|
Karhumäki, Juhani |
|
2003 |
125 |
2-3 |
p. 235-254 20 p. |
artikel |