| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
|
Turau, Volker
|
|
2009
|
109 |
14 |
p. 763-767
5 p.
|
artikel
|
| 2 |
Comments on “Distributed symmetric key management for mobile ad hoc networks”
|
Wu, J.
|
|
2009
|
109 |
14 |
p. 822-824
3 p.
|
artikel
|
| 3 |
2-Covered paths by a set of antennas with minimum power transmission range
|
Abellanas, M.
|
|
2009
|
109 |
14 |
p. 768-773
6 p.
|
artikel
|
| 4 |
Distributed approximation for maximum weight matching on bounded degree bounded integer weight graphs
|
Banerjee, Satyajit
|
|
2009
|
109 |
14 |
p. 790-794
5 p.
|
artikel
|
| 5 |
Editorial Board
|
|
|
2009
|
109 |
14 |
p. IFC-
1 p.
|
artikel
|
| 6 |
Incorporating cardinality constraints and synonym rules into conditional functional dependencies
|
Chen, Wenguang
|
|
2009
|
109 |
14 |
p. 783-789
7 p.
|
artikel
|
| 7 |
More restrictive Gray codes for some classes of pattern avoiding permutations
|
Baril, Jean-Luc
|
|
2009
|
109 |
14 |
p. 799-804
6 p.
|
artikel
|
| 8 |
On fractional ( f , n ) -critical graphs
|
Zhou, Sizhong
|
|
2009
|
109 |
14 |
p. 811-815
5 p.
|
artikel
|
| 9 |
On packing shortest cycles in graphs
|
Rautenbach, Dieter
|
|
2009
|
109 |
14 |
p. 816-821
6 p.
|
artikel
|
| 10 |
On the graph turnpike problem
|
Feder, Tomás
|
|
2009
|
109 |
14 |
p. 774-776
3 p.
|
artikel
|
| 11 |
On the reachability of a version of graph-rewriting system
|
Tomita, Kohji
|
|
2009
|
109 |
14 |
p. 777-782
6 p.
|
artikel
|
| 12 |
Sort and Search: Exact algorithms for generalized domination
|
Fomin, Fedor V.
|
|
2009
|
109 |
14 |
p. 795-798
4 p.
|
artikel
|
| 13 |
( 2 , 1 )-Total number of trees with maximum degree three
|
Wang, Weifan
|
|
2009
|
109 |
14 |
p. 805-810
6 p.
|
artikel
|
Tijdschrift beschrijving