nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A note on the complexity of minimum dominating set
|
Grandoni, Fabrizio |
|
2006 |
4 |
2 |
p. 209-214 6 p. |
artikel |
2 |
CHECKCOL: Improved local search for graph coloring
|
Caramia, Massimiliano |
|
2006 |
4 |
2 |
p. 277-298 22 p. |
artikel |
3 |
Completely connected clustered graphs
|
Cornelsen, Sabine |
|
2006 |
4 |
2 |
p. 313-323 11 p. |
artikel |
4 |
Crossing-constrained hierarchical drawings
|
Finocchi, Irene |
|
2006 |
4 |
2 |
p. 299-312 14 p. |
artikel |
5 |
Editorial Board
|
|
|
2006 |
4 |
2 |
p. iii-iv nvt p. |
artikel |
6 |
Online competitive algorithms for maximizing weighted throughput of unit jobs
|
Chin, Francis Y.L. |
|
2006 |
4 |
2 |
p. 255-276 22 p. |
artikel |
7 |
On the mean number of encryptions for tree-based broadcast encryption schemes
|
Park, E.C. |
|
2006 |
4 |
2 |
p. 215-238 24 p. |
artikel |
8 |
Polynomial recognition of equal unions in hypergraphs with few vertices of large degree
|
Jacobs, David P. |
|
2006 |
4 |
2 |
p. 201-208 8 p. |
artikel |
9 |
Testing set proportionality and the Ádám isomorphism of circulant graphs
|
Coppersmith, Don |
|
2006 |
4 |
2 |
p. 324-335 12 p. |
artikel |
10 |
The complexity of minimum difference cover
|
Mereghetti, Carlo |
|
2006 |
4 |
2 |
p. 239-254 16 p. |
artikel |