nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A cop and robber game on edge-periodic temporal graphs
|
Erlebach, Thomas |
|
|
144 |
C |
p. |
artikel |
2 |
A new temporal interpretation of cluster editing
|
Bocci, Cristiano |
|
|
144 |
C |
p. |
artikel |
3 |
Backdoor DNFs
|
Ordyniak, Sebastian |
|
|
144 |
C |
p. |
artikel |
4 |
Decentralized deadlock-free enforcement of message orderings in message-based systems
|
Samadi, Mahboubeh |
|
|
144 |
C |
p. |
artikel |
5 |
Editorial Board
|
|
|
|
144 |
C |
p. |
artikel |
6 |
Labeled sample compression schemes for complexes of oriented matroids
|
Chepoi, Victor |
|
|
144 |
C |
p. |
artikel |
7 |
On computing large temporal (unilateral) connected components
|
Costa, Isnard Lopes |
|
|
144 |
C |
p. |
artikel |
8 |
On kernels for d-path vertex cover
|
Červený, Radovan |
|
|
144 |
C |
p. |
artikel |
9 |
Online computation with untrusted advice
|
Angelopoulos, Spyros |
|
|
144 |
C |
p. |
artikel |
10 |
On minimum vertex bisection of random d-regular graphs
|
Díaz, Josep |
|
|
144 |
C |
p. |
artikel |
11 |
On the parameterized complexity of interval scheduling with eligible machine sets
|
Hermelin, Danny |
|
|
144 |
C |
p. |
artikel |
12 |
Preprocessing to reduce the search space: Antler structures for feedback vertex set
|
Donkers, Huib |
|
|
144 |
C |
p. |
artikel |
13 |
Temporal reachability minimization: Delaying vs. deleting
|
Molter, Hendrik |
|
|
144 |
C |
p. |
artikel |
14 |
The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings
|
Bulteau, Laurent |
|
|
144 |
C |
p. |
artikel |