| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Algorithmic Meta-theorems for Restrictions of Treewidth
|
Lampis, Michael
|
|
2011
|
64 |
1 |
p. 19-37
|
artikel
|
| 2 |
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications
|
Crowston, Robert
|
|
2011
|
64 |
1 |
p. 56-68
|
artikel
|
| 3 |
An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion
|
Cygan, Marek
|
|
2011
|
64 |
1 |
p. 170-188
|
artikel
|
| 4 |
Cluster Editing: Kernelization Based on Edge Cuts
|
Cao, Yixin
|
|
2011
|
64 |
1 |
p. 152-169
|
artikel
|
| 5 |
Fast Minor Testing in Planar Graphs
|
Adler, Isolde
|
|
2011
|
64 |
1 |
p. 69-84
|
artikel
|
| 6 |
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I
|
Raman, Venkatesh
|
|
2011
|
64 |
1 |
p. 1-2
|
artikel
|
| 7 |
Multivariate Complexity Analysis of Swap Bribery
|
Dorn, Britta
|
|
2011
|
64 |
1 |
p. 126-151
|
artikel
|
| 8 |
Parameterized Complexity of the Spanning Tree Congestion Problem
|
Bodlaender, Hans L.
|
|
2011
|
64 |
1 |
p. 85-111
|
artikel
|
| 9 |
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
|
Gutin, Gregory
|
|
2011
|
64 |
1 |
p. 112-125
|
artikel
|
| 10 |
Parameterized Measure & Conquer for Problems with No Small Kernels
|
Binkele-Raible, Daniel
|
|
2011
|
64 |
1 |
p. 189-212
|
artikel
|
| 11 |
Parameterized Modal Satisfiability
|
Achilleos, Antonis
|
|
2011
|
64 |
1 |
p. 38-55
|
artikel
|
| 12 |
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
|
Fellows, Michael R.
|
|
2011
|
64 |
1 |
p. 3-18
|
artikel
|
Tijdschrift beschrijving