No. Title Author Year
1 A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs Madathil, Jayakrishnan 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 New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) Fomin, Fedor V. et al. 2019
7 Packing Arc-Disjoint Cycles in Tournaments Bessy, StÚphane et al. 2019
8 Parameterized Complexity of Multi-Node Hubs Saurabh, Saket et al. 2019
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
Current Page :
Number of result pages: 3
Number of documents: 26

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