| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A non-ambiguous decomposition of regular languages and factorizing codes
|
Anselmo, Marcella
|
|
2003
|
126 |
2-3 |
p. 129-165
37 p.
|
artikel
|
| 2 |
A note on greedy algorithms for the maximum weighted independent set problem
|
Sakai, Shuichi
|
|
2003
|
126 |
2-3 |
p. 313-322
10 p.
|
artikel
|
| 3 |
A primal–dual approximation algorithm for the survivable network design problem in hypergraphs
|
Zhao, Liang
|
|
2003
|
126 |
2-3 |
p. 275-289
15 p.
|
artikel
|
| 4 |
Author index
|
|
|
2003
|
126 |
2-3 |
p. I-II
nvt p.
|
artikel
|
| 5 |
Contents
|
|
|
2003
|
126 |
2-3 |
p. iv-
1 p.
|
artikel
|
| 6 |
Determination of the star valency of a graph
|
Dong, Jinquan
|
|
2003
|
126 |
2-3 |
p. 291-296
6 p.
|
artikel
|
| 7 |
Edge colorings of the complete graph K 149 and the lower bounds of three Ramsey numbers
|
Guiqing, Li
|
|
2003
|
126 |
2-3 |
p. 167-179
13 p.
|
artikel
|
| 8 |
Edge dominating set and colorings on graphs with fixed clique-width
|
Kobler, Daniel
|
|
2003
|
126 |
2-3 |
p. 197-221
25 p.
|
artikel
|
| 9 |
Efficient dualization of O(log n)-term monotone disjunctive normal forms
|
Makino, Kazuhisa
|
|
2003
|
126 |
2-3 |
p. 305-312
8 p.
|
artikel
|
| 10 |
Finding paths in graphs avoiding forbidden transitions
|
Szeider, Stefan
|
|
2003
|
126 |
2-3 |
p. 261-273
13 p.
|
artikel
|
| 11 |
Gridline graphs: a review in two dimensions and an extension to higher dimensions
|
Peterson, Dale
|
|
2003
|
126 |
2-3 |
p. 223-239
17 p.
|
artikel
|
| 12 |
Periodicity vectors for labelled trees
|
Restivo, Antonio
|
|
2003
|
126 |
2-3 |
p. 241-260
20 p.
|
artikel
|
| 13 |
Recognizing clique graphs of directed edge path graphs
|
Gutierrez, Marisa
|
|
2003
|
126 |
2-3 |
p. 297-304
8 p.
|
artikel
|
| 14 |
Subgraphs decomposable into two trees and k-edge-connected subgraphs
|
Hassin, Refael
|
|
2003
|
126 |
2-3 |
p. 181-195
15 p.
|
artikel
|
Tijdschrift beschrijving