nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An optimal algorithm for the maximum-density path in a tree
|
Wu, Bang Ye |
|
2009 |
109 |
17 |
p. 975-979 5 p. |
artikel |
2 |
Approximating the Minimum Chain Completion problem
|
Feder, Tomás |
|
2009 |
109 |
17 |
p. 980-985 6 p. |
artikel |
3 |
A sufficient condition for pancyclic graphs
|
Zhao, Kewen |
|
2009 |
109 |
17 |
p. 991-996 6 p. |
artikel |
4 |
Bounded cost algorithms for multivalued consensus using binary consensus instances
|
Zhang, Jialin |
|
2009 |
109 |
17 |
p. 1005-1009 5 p. |
artikel |
5 |
Editorial Board
|
|
|
2009 |
109 |
17 |
p. IFC- 1 p. |
artikel |
6 |
Graphical models of separation logic
|
Wehrman, Ian |
|
2009 |
109 |
17 |
p. 1001-1004 4 p. |
artikel |
7 |
Improved upper bounds on synchronizing nondeterministic automata
|
Gazdag, Zsolt |
|
2009 |
109 |
17 |
p. 986-990 5 p. |
artikel |
8 |
Optimal extraction of motif patterns in 2D
|
Rombo, Simona E. |
|
2009 |
109 |
17 |
p. 1015-1020 6 p. |
artikel |
9 |
The bondage number in complete t-partite digraphs
|
Zhang, Xindong |
|
2009 |
109 |
17 |
p. 997-1000 4 p. |
artikel |
10 |
Unary finite automata vs. arithmetic progressions
|
To, Anthony Widjaja |
|
2009 |
109 |
17 |
p. 1010-1014 5 p. |
artikel |