| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
|
Kangas, Kustaa
|
|
|
82 |
8 |
p. 2156-2173
|
artikel
|
| 2 |
Best-Case and Worst-Case Sparsifiability of Boolean CSPs
|
Chen, Hubie
|
|
|
82 |
8 |
p. 2200-2242
|
artikel
|
| 3 |
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness
|
Roth, Marc
|
|
|
82 |
8 |
p. 2267-2291
|
artikel
|
| 4 |
Dual Parameterization of Weighted Coloring
|
Araújo, Júlio
|
|
|
82 |
8 |
p. 2316-2336
|
artikel
|
| 5 |
Multi-budgeted Directed Cuts
|
Kratsch, Stefan
|
|
|
82 |
8 |
p. 2135-2155
|
artikel
|
| 6 |
Multivariate Analysis of Orthogonal Range Searching and Graph Distances
|
Bringmann, Karl
|
|
|
82 |
8 |
p. 2292-2315
|
artikel
|
| 7 |
On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs
|
Barbero, Florian
|
|
|
82 |
8 |
p. 2243-2266
|
artikel
|
| 8 |
Parameterized Complexity of Independent Set in H-Free Graphs
|
Bonnet, Édouard
|
|
|
82 |
8 |
p. 2360-2394
|
artikel
|
| 9 |
Parameterized Leaf Power Recognition via Embedding into Graph Products
|
Eppstein, David
|
|
|
82 |
8 |
p. 2337-2359
|
artikel
|
| 10 |
Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation
|
Paul, Christophe
|
|
|
82 |
8 |
p. 2133-2134
|
artikel
|
| 11 |
The Parameterised Complexity of Computing the Maximum Modularity of a Graph
|
Meeks, Kitty
|
|
|
82 |
8 |
p. 2174-2199
|
artikel
|
Tijdschrift beschrijving