| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A faster cryptographer's Conspiracy Santa
|
Bultel, Xavier
|
|
|
839 |
C |
p. 122-134
|
artikel
|
| 2 |
A tight lower bound for the capture time of the Cops and Robbers game
|
Brandt, Sebastian
|
|
|
839 |
C |
p. 143-163
|
artikel
|
| 3 |
Cooperating in video games? Impossible! Undecidability of Team Multiplayer Games
|
Coulombe, Michael J.
|
|
|
839 |
C |
p. 30-40
|
artikel
|
| 4 |
Cops and robbers on graphs with a set of forbidden induced subgraphs
|
Masjoody, Masood
|
|
|
839 |
C |
p. 186-194
|
artikel
|
| 5 |
Edge degeneracy: Algorithmic and structural results
|
Limnios, Stratis
|
|
|
839 |
C |
p. 164-175
|
artikel
|
| 6 |
Editorial Board
|
|
|
|
839 |
C |
p. ii
|
artikel
|
| 7 |
Efficient card-based zero-knowledge proof for Sudoku
|
Sasaki, Tatsuya
|
|
|
839 |
C |
p. 135-142
|
artikel
|
| 8 |
Online graph exploration on a restricted graph class: Optimal solutions for tadpole graphs
|
Brandt, Sebastian
|
|
|
839 |
C |
p. 176-185
|
artikel
|
| 9 |
On the exact complexity of polyomino packing
|
Bodlaender, Hans L.
|
|
|
839 |
C |
p. 13-20
|
artikel
|
| 10 |
Simple strategies versus optimal schedules in multi-agent patrolling
|
Kawamura, Akitoshi
|
|
|
839 |
C |
p. 195-206
|
artikel
|
| 11 |
The power of one evil secret agent
|
Tamir, Tami
|
|
|
839 |
C |
p. 1-12
|
artikel
|
| 12 |
Tracks from hell — When finding a proof may be easier than checking it
|
Almanza, Matteo
|
|
|
839 |
C |
p. 21-29
|
artikel
|
| 13 |
Uniform distribution for Pachinko
|
Kitamura, Naoki
|
|
|
839 |
C |
p. 103-121
|
artikel
|
| 14 |
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
|
Abel, Zachary
|
|
|
839 |
C |
p. 41-102
|
artikel
|
Tijdschrift beschrijving