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 |
Connecting the Dots (with Minimum Crossings) |
Agrawal, Akanksha et al. |
2019 |

4 |
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals |
Fomin, Fedor V. et al. |
2019 |

5 |
Decomposition of Map Graphs with Applications |
Fomin, Fedor V. et al. |
2019 |

6 |
Exploring the Kernelization Borders for Hitting Cycles |
Agrawal, Akanksha et al. |
2019 |

7 |
New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) |
Fomin, Fedor V. et al. |
2019 |

8 |
Parameterized Complexity of Multi-Node Hubs |
Saurabh, Saket et al. |
2019 |

9 |
Path Contraction Faster Than 2^n |
Agrawal, Akanksha et al. |
2019 |

10 |
Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces |
Carpenter, Timothy et al. |
2018 |