| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
AND-Compression of NP-Complete Problems: Streamlined Proof and Minor Observations
|
Dell, Holger
|
|
2016
|
75 |
2 |
p. 403-423
|
artikel
|
| 2 |
Erratum to: Foreword: Special Issue on IPEC 2014
|
Cygan, Marek
|
|
2016
|
75 |
2 |
p. 257
|
artikel
|
| 3 |
Finding Shortest Paths Between Graph Colourings
|
Johnson, Matthew
|
|
2015
|
75 |
2 |
p. 295-321
|
artikel
|
| 4 |
Foreword: Special Issue on IPEC 2014
|
Cygan, Marek
|
|
2016
|
75 |
2 |
p. 255-256
|
artikel
|
| 5 |
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
|
Bulian, Jannis
|
|
2015
|
75 |
2 |
p. 363-382
|
artikel
|
| 6 |
On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth
|
Razgon, Igor
|
|
2015
|
75 |
2 |
p. 277-294
|
artikel
|
| 7 |
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem
|
Gutin, Gregory
|
|
2015
|
75 |
2 |
p. 383-402
|
artikel
|
| 8 |
Solving Linear Equations Parameterized by Hamming Weight
|
Arvind, V.
|
|
2015
|
75 |
2 |
p. 322-338
|
artikel
|
| 9 |
The Parameterized Complexity of Geometric Graph Isomorphism
|
Arvind, V.
|
|
2015
|
75 |
2 |
p. 258-276
|
artikel
|
| 10 |
The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments
|
Traxler, Patrick
|
|
2016
|
75 |
2 |
p. 339-362
|
artikel
|
Tijdschrift beschrijving