| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A New Algorithm for the KDMDGP Subclass of Distance Geometry Problems with Exact Distances
|
Gonçalves, Douglas S.
|
|
|
83 |
8 |
p. 2400-2426
|
artikel
|
| 2 |
Beating Treewidth for Average-Case Subgraph Isomorphism
|
Rosenthal, Gregory
|
|
|
83 |
8 |
p. 2521-2551
|
artikel
|
| 3 |
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
|
Da Lozzo, Giordano
|
|
|
83 |
8 |
p. 2471-2502
|
artikel
|
| 4 |
Faster algorithms for counting subgraphs in sparse graphs
|
Bressan, Marco
|
|
|
83 |
8 |
p. 2578-2605
|
artikel
|
| 5 |
Finding and Counting Permutations via CSPs
|
Berendsohn, Benjamin Aram
|
|
|
83 |
8 |
p. 2552-2577
|
artikel
|
| 6 |
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set
|
Iwata, Yoichi
|
|
|
83 |
8 |
p. 2503-2520
|
artikel
|
| 7 |
Metric Dimension Parameterized By Treewidth
|
Bonnet, Édouard
|
|
|
83 |
8 |
p. 2606-2633
|
artikel
|
| 8 |
Online Multistage Subset Maximization Problems
|
Bampis, Evripidis
|
|
|
83 |
8 |
p. 2374-2399
|
artikel
|
| 9 |
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings
|
Belmonte, Rémy
|
|
|
83 |
8 |
p. 2351-2373
|
artikel
|
| 10 |
Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation
|
Jansen, Bart M. P.
|
|
|
83 |
8 |
p. 2469-2470
|
artikel
|
| 11 |
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs
|
Novotná, Jana
|
|
|
83 |
8 |
p. 2634-2650
|
artikel
|
| 12 |
The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects
|
Hörsch, Florian
|
|
|
83 |
8 |
p. 2333-2350
|
artikel
|
| 13 |
The Maximum Binary Tree Problem
|
Chandrasekaran, Karthekeyan
|
|
|
83 |
8 |
p. 2427-2468
|
artikel
|
Tijdschrift beschrijving