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
11 Balanced Judicious Bipartition is Fixed-Parameter Tractable Lokshtanov, Daniel et al. 2018
12 Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS Lokshtanov, Daniel et al. 2018
13 Erdös-Pósa Property of Obstructions to Interval Graphs Agrawal, Akanksha et al. 2018
14 Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems Agrawal, Akanksha et al. 2018
15 Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity Lokshtanov, Daniel et al. 2018
16 Reducing CMSO Model Checking to Highly Connected Graphs Lokshtanov, Daniel et al. 2018
17 Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number Misra, Pranabendu et al. 2018
18 Exact Algorithms for Terrain Guarding Ashok, Pradeesha et al. 2017
19 Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs Fomin, Fedor V. et al. 2017
20 Matrix Rigidity from the Viewpoint of Parameterized Complexity Fomin, Fedor V. et al. 2017
21 Packing Cycles Faster Than Erdos-Posa Lokshtanov, Daniel et al. 2017
22 Parameterized Algorithms and Kernels for Rainbow Matching Gupta, Sushmita et al. 2017
23 Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping Komusiewicz, Christian et al. 2017
24 Split Contraction: The Untold Story Agrawal, Akanksha et al. 2017
25 A Linear-Time Algorithm for the Copy Number Transformation Problem Shamir, Ron et al. 2016
26 Kernels for Deletion to Classes of Acyclic Digraphs Agrawal, Akanksha et al. 2016
27 Parameterized Algorithms for List K-Cycle Panolan, Fahad et al. 2016
28 Simultaneous Feedback Edge Set: A Parameterized Perspective Agrawal, Akanksha et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 28


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