No. Title Author Year
1 Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds Fomin, Fedor V. et al. 2020
2 ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs Fomin, Fedor V. et al. 2020
3 Fault Tolerant Subgraphs with Applications in Kernelization Lochet, William et al. 2020
4 Parameter Analysis for Guarding Terrains Agrawal, Akanksha et al. 2020
5 Parameterization Above a Multiplicative Guarantee Fomin, Fedor V. et al. 2020
6 Parameterized Study of Steiner Tree on Unit Disk Graphs Bhore, Sujoy et al. 2020
7 The Parameterized Complexity of Guarding Almost Convex Polygons Agrawal, Akanksha et al. 2020
8 A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation Zoller, Roni et al. 2019
9 A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs Madathil, Jayakrishnan et al. 2019
10 Approximate Counting of k-Paths: Deterministic and in Polynomial Space Björklund, Andreas et al. 2019
11 Connecting the Dots (with Minimum Crossings) Agrawal, Akanksha et al. 2019
12 Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals Fomin, Fedor V. et al. 2019
13 Decomposition of Map Graphs with Applications Fomin, Fedor V. et al. 2019
14 Going Far From Degeneracy Fomin, Fedor V. et al. 2019
15 New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) Fomin, Fedor V. et al. 2019
16 Packing Arc-Disjoint Cycles in Tournaments Bessy, Stéphane et al. 2019
17 Parameterized Complexity of Multi-Node Hubs Saurabh, Saket et al. 2019
18 Balanced Judicious Bipartition is Fixed-Parameter Tractable Lokshtanov, Daniel et al. 2018
19 Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS Lokshtanov, Daniel et al. 2018
20 Erdös-Pósa Property of Obstructions to Interval Graphs Agrawal, Akanksha et al. 2018
21 Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems Agrawal, Akanksha et al. 2018
22 Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity Lokshtanov, Daniel et al. 2018
23 Reducing CMSO Model Checking to Highly Connected Graphs Lokshtanov, Daniel et al. 2018
24 Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number Misra, Pranabendu et al. 2018
25 Exact Algorithms for Terrain Guarding Ashok, Pradeesha et al. 2017
26 Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs Fomin, Fedor V. et al. 2017
27 Matrix Rigidity from the Viewpoint of Parameterized Complexity Fomin, Fedor V. et al. 2017
28 Packing Cycles Faster Than Erdos-Posa Lokshtanov, Daniel et al. 2017
29 Parameterized Algorithms and Kernels for Rainbow Matching Gupta, Sushmita et al. 2017
30 Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping Komusiewicz, Christian et al. 2017
Current Page :
Number of result pages: 2
Number of documents: 35


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