| No. |
Title |
Author |
Year |
| 1 |
A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem |
Lokshtanov, Daniel et al. |
2019 |
| 2 |
Approximate Counting of k-Paths: Deterministic and in Polynomial Space |
Björklund, Andreas et al. |
2019 |
| 3 |
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals |
Fomin, Fedor V. et al. |
2019 |
| 4 |
Decomposition of Map Graphs with Applications |
Fomin, Fedor V. et al. |
2019 |
| 5 |
Path Contraction Faster Than 2^n |
Agrawal, Akanksha et al. |
2019 |
| 6 |
Picking Random Vertices (Invited Talk) |
Lokshtanov, Daniel |
2019 |
| 7 |
The Parameterized Complexity of Finding Point Sets with Hereditary Properties |
Eppstein, David et al. |
2019 |
| 8 |
Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces |
Carpenter, Timothy et al. |
2018 |
| 9 |
Balanced Judicious Bipartition is Fixed-Parameter Tractable |
Lokshtanov, Daniel et al. |
2018 |
| 10 |
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS |
Lokshtanov, Daniel et al. |
2018 |
