| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Completeness Theory for Polynomial (Turing) Kernelization
|
Hermelin, Danny
|
|
2014
|
71 |
3 |
p. 702-730
|
artikel
|
| 2 |
Guest Editorial: Special Issue on Parameterized and Exact Computation
|
Gutin, Gregory Z.
|
|
2014
|
71 |
3 |
p. 539-540
|
artikel
|
| 3 |
Incompressibility of $$H$$H-Free Edge Modification Problems
|
Cai, Leizhen
|
|
2014
|
71 |
3 |
p. 731-757
|
artikel
|
| 4 |
Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization
|
Bonnet, Édouard
|
|
2014
|
71 |
3 |
p. 566-580
|
artikel
|
| 5 |
Obtaining Matrices with the Consecutive Ones Property by Row Deletions
|
Narayanaswamy, N. S.
|
|
2014
|
71 |
3 |
p. 758-773
|
artikel
|
| 6 |
On Sparsification for Computing Treewidth
|
Jansen, Bart M. P.
|
|
2014
|
71 |
3 |
p. 605-635
|
artikel
|
| 7 |
On Subexponential and FPT-Time Inapproximability
|
Bonnet, Edouard
|
|
2014
|
71 |
3 |
p. 541-565
|
artikel
|
| 8 |
On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness
|
Elberfeld, Michael
|
|
2014
|
71 |
3 |
p. 661-701
|
artikel
|
| 9 |
Pure Nash Equilibria in Graphical Games and Treewidth
|
Thomas, Antonis
|
|
2014
|
71 |
3 |
p. 581-604
|
artikel
|
| 10 |
Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions
|
Fafianie, Stefan
|
|
2014
|
71 |
3 |
p. 636-660
|
artikel
|
Tijdschrift beschrijving