| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Approximating Long Cycle Above Dirac’s Guarantee
|
Fomin, Fedor V.
|
|
|
86 |
8 |
p. 2676-2713
|
artikel
|
| 2 |
Approximation Algorithms for Covering Vertices by Long Paths
|
Gong, Mingyang
|
|
|
86 |
8 |
p. 2625-2651
|
artikel
|
| 3 |
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus
|
Doerr, Benjamin
|
|
|
86 |
8 |
p. 2479-2518
|
artikel
|
| 4 |
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions
|
Bansal, Ishan
|
|
|
86 |
8 |
p. 2575-2604
|
artikel
|
| 5 |
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data
|
Chen, Jianer
|
|
|
86 |
8 |
p. 2448-2478
|
artikel
|
| 6 |
New Algorithms for Steiner Tree Reoptimization
|
Bilò, Davide
|
|
|
86 |
8 |
p. 2652-2675
|
artikel
|
| 7 |
Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants
|
Bandyapadhyay, Sayan
|
|
|
86 |
8 |
p. 2557-2574
|
artikel
|
| 8 |
Parity Permutation Pattern Matching
|
Martínez, Virginia Ardévol
|
|
|
86 |
8 |
p. 2605-2624
|
artikel
|
| 9 |
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees
|
Chaplick, Steven
|
|
|
86 |
8 |
p. 2413-2447
|
artikel
|
| 10 |
Sample-Based Distance-Approximation for Subsequence-Freeness
|
Cohen Sidon, Omer
|
|
|
86 |
8 |
p. 2519-2556
|
artikel
|
| 11 |
Slim Tree-Cut Width
|
Ganian, Robert
|
|
|
86 |
8 |
p. 2714-2738
|
artikel
|
Tijdschrift beschrijving