nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology
|
Burton, Benjamin A. |
|
2012 |
65 |
4 |
p. 772-801 |
artikel |
2 |
Fast Polynomial-Space Algorithms Using Inclusion-Exclusion
|
Nederlof, Jesper |
|
2012 |
65 |
4 |
p. 868-884 |
artikel |
3 |
Finding and Counting Vertex-Colored Subtrees
|
Guillemot, Sylvain |
|
2011 |
65 |
4 |
p. 828-844 |
artikel |
4 |
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
|
Kratsch, Stefan |
|
2012 |
65 |
4 |
p. 754-771 |
artikel |
5 |
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II
|
Raman, Venkatesh |
|
2013 |
65 |
4 |
p. 711-712 |
artikel |
6 |
On the Exact Complexity of Evaluating Quantified k-CNF
|
Calabro, Chris |
|
2012 |
65 |
4 |
p. 817-827 |
artikel |
7 |
On the Grundy and b-Chromatic Numbers of a Graph
|
Havet, Frédéric |
|
2011 |
65 |
4 |
p. 885-899 |
artikel |
8 |
On the (Non-)Existence of Polynomial Kernels for Pl-Free Edge Modification Problems
|
Guillemot, Sylvain |
|
2012 |
65 |
4 |
p. 900-926 |
artikel |
9 |
Parameterized Two-Player Nash Equilibrium
|
Hermelin, Danny |
|
2012 |
65 |
4 |
p. 802-816 |
artikel |
10 |
Proper Interval Vertex Deletion
|
Hof, Pim van ’t |
|
2012 |
65 |
4 |
p. 845-867 |
artikel |
11 |
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier
|
Praveen, M. |
|
2012 |
65 |
4 |
p. 713-753 |
artikel |