nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A simple proof of QBF hardness
|
Beyersdorff, Olaf |
|
|
168 |
C |
p. |
artikel |
2 |
Editorial Board
|
|
|
|
168 |
C |
p. |
artikel |
3 |
Extending de Bruijn sequences to larger alphabets
|
Becher, VerĂ³nica |
|
|
168 |
C |
p. |
artikel |
4 |
Faster parameterized algorithm for Bicluster Editing
|
Tsur, Dekel |
|
|
168 |
C |
p. |
artikel |
5 |
Longest common subsequence in sublinear space
|
Kiyomi, Masashi |
|
|
168 |
C |
p. |
artikel |
6 |
Longest previous overlapping factor array
|
Bannai, Hideo |
|
|
168 |
C |
p. |
artikel |
7 |
On computing Pareto optimal paths in weighted time-dependent networks
|
Brunelli, Filippo |
|
|
168 |
C |
p. |
artikel |
8 |
Online graph exploration on trees, unicyclic graphs and cactus graphs
|
Fritsch, Robin |
|
|
168 |
C |
p. |
artikel |
9 |
Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph
|
Konstantinova, Elena V. |
|
|
168 |
C |
p. |
artikel |
10 |
Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game
|
Chen, Xujin |
|
|
168 |
C |
p. |
artikel |