No. Title Author Year
1 Approximate Counting of k-Paths: Deterministic and in Polynomial Space Björklund, Andreas et al. 2019
2 Connecting the Dots (with Minimum Crossings) Agrawal, Akanksha 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 New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) Fomin, Fedor V. et al. 2019
6 Parameterized Complexity of Multi-Node Hubs Saurabh, Saket et al. 2019
7 Balanced Judicious Bipartition is Fixed-Parameter Tractable Lokshtanov, Daniel et al. 2018
8 Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS Lokshtanov, Daniel et al. 2018
9 Erdös-Pósa Property of Obstructions to Interval Graphs Agrawal, Akanksha et al. 2018
10 Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems Agrawal, Akanksha et al. 2018
Current Page :
Number of result pages: 3
Number of documents: 24


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI