| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
|
Kanté, Mamadou Moustapha
|
|
2016
|
79 |
1 |
p. 66-95
|
artikel
|
| 2 |
A Polynomial Kernel for Block Graph Deletion
|
Kim, Eun Jung
|
|
2017
|
79 |
1 |
p. 251-270
|
artikel
|
| 3 |
Complexity and Approximability of Parameterized MAX-CSPs
|
Dell, Holger
|
|
2017
|
79 |
1 |
p. 230-250
|
artikel
|
| 4 |
Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices
|
Suchý, Ondřej
|
|
2016
|
79 |
1 |
p. 189-210
|
artikel
|
| 5 |
Fixed-Parameter Tractable Distances to Sparse Graph Classes
|
Bulian, Jannis
|
|
2016
|
79 |
1 |
p. 139-158
|
artikel
|
| 6 |
Guest Editorial: Special Issue on Parameterized and Exact Computation
|
Husfeldt, Thore
|
|
2017
|
79 |
1 |
p. 1-2
|
artikel
|
| 7 |
Linear Kernels for Outbranching Problems in Sparse Digraphs
|
Bonamy, Marthe
|
|
2016
|
79 |
1 |
p. 159-188
|
artikel
|
| 8 |
On Kernelization and Approximation for the Vector Connectivity Problem
|
Kratsch, Stefan
|
|
2016
|
79 |
1 |
p. 96-138
|
artikel
|
| 9 |
Parameterized and Approximation Algorithms for the Load Coloring Problem
|
Barbero, F.
|
|
2016
|
79 |
1 |
p. 211-229
|
artikel
|
| 10 |
Parameterized Complexity of Sparse Linear Complementarity Problems
|
Sumita, Hanna
|
|
2016
|
79 |
1 |
p. 42-65
|
artikel
|
| 11 |
Quick but Odd Growth of Cacti
|
Kolay, Sudeshna
|
|
2017
|
79 |
1 |
p. 271-290
|
artikel
|
| 12 |
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
|
Jansen, Bart M. P.
|
|
2016
|
79 |
1 |
p. 3-28
|
artikel
|
| 13 |
Strong ETH and Resolution via Games and the Multiplicity of Strategies
|
Bonacina, Ilario
|
|
2016
|
79 |
1 |
p. 29-41
|
artikel
|
Tijdschrift beschrijving