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 Bisection of Bounded Treewidth Graphs by Convolutions Eiben, Eduard 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 Going Far From Degeneracy Fomin, Fedor V. et al. 2019
7 Path Contraction Faster Than 2^n Agrawal, Akanksha et al. 2019
8 Picking Random Vertices (Invited Talk) Lokshtanov, Daniel 2019
9 The Parameterized Complexity of Finding Point Sets with Hereditary Properties Eppstein, David et al. 2019
10 Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces Carpenter, Timothy et al. 2018
Current Page :
Number of result pages: 5
Number of documents: 46

DROPS-Home | Imprint | Privacy Published by LZI