No. Title Author Year
1 A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation Zoller, Roni et al. 2019
2 A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs Madathil, Jayakrishnan et al. 2019
3 Approximate Counting of k-Paths: Deterministic and in Polynomial Space Bj÷rklund, Andreas et al. 2019
4 Connecting the Dots (with Minimum Crossings) Agrawal, Akanksha et al. 2019
5 Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals Fomin, Fedor V. et al. 2019
6 Decomposition of Map Graphs with Applications Fomin, Fedor V. et al. 2019
7 Going Far From Degeneracy Fomin, Fedor V. et al. 2019
8 New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) Fomin, Fedor V. et al. 2019
9 Packing Arc-Disjoint Cycles in Tournaments Bessy, StÚphane et al. 2019
10 Parameterized Complexity of Multi-Node Hubs Saurabh, Saket et al. 2019
Current Page :
Number of result pages: 3
Number of documents: 28


DROPS-Home | Imprint | Privacy Published by LZI