nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An exact algorithm for connected red–blue dominating set
|
Abu-Khzam, Faisal N. |
|
2011 |
9 |
3 |
p. 252-262 11 p. |
artikel |
2 |
Breaking the 2 n -barrier for Irredundance: Two lines of attack
|
Binkele-Raible, Daniel |
|
2011 |
9 |
3 |
p. 214-230 17 p. |
artikel |
3 |
Contracting planar graphs to contractions of triangulations
|
Kamiński, Marcin |
|
2011 |
9 |
3 |
p. 299-306 8 p. |
artikel |
4 |
Editorial Board
|
|
|
2011 |
9 |
3 |
p. iii-iv nvt p. |
artikel |
5 |
Finding the maximum suffix with fewer comparisons
|
Franceschini, Gianni |
|
2011 |
9 |
3 |
p. 279-286 8 p. |
artikel |
6 |
Graph unique-maximum and conflict-free colorings
|
Cheilaris, Panagiotis |
|
2011 |
9 |
3 |
p. 241-251 11 p. |
artikel |
7 |
[No title]
|
Calamoneri, Tiziana |
|
2011 |
9 |
3 |
p. 213- 1 p. |
artikel |
8 |
On strategy improvement algorithms for simple stochastic games
|
Tripathi, Rahul |
|
2011 |
9 |
3 |
p. 263-278 16 p. |
artikel |
9 |
On the expected longest length probe sequence for hashing with separate chaining
|
Reviriego, Pedro |
|
2011 |
9 |
3 |
p. 307-312 6 p. |
artikel |
10 |
Parameterized complexity of even/odd subgraph problems
|
Cai, Leizhen |
|
2011 |
9 |
3 |
p. 231-240 10 p. |
artikel |
11 |
Spanners of additively weighted point sets
|
Bose, Prosenjit |
|
2011 |
9 |
3 |
p. 287-298 12 p. |
artikel |