No. Title Author Year
1 Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large Jacob, Ashwin et al. 2023
2 Kernelization for Spreading Points Fomin, Fedor V. et al. 2023
3 Lossy Kernelization for (Implicit) Hitting Set Problems Fomin, Fedor V. et al. 2023
4 On Computing Homological Hitting Sets Bauer, Ulrich et al. 2023
5 Parameterized Analysis of the Cops and Robber Game Gahlawat, Harmender et al. 2023
6 (Re)packing Equal Disks into Rectangle Fomin, Fedor V. et al. 2022
7 A Finite Algorithm for the Realizabilty of a Delaunay Triangulation Agrawal, Akanksha et al. 2022
8 New Algorithms for Structure Informed Genome Rearrangement Ozery, Eden et al. 2022
9 Exploiting Dense Structures in Parameterized Complexity Lochet, William et al. 2021
10 Front Matter, Table of Contents, Preface, Conference Organization Golovach, Petr A. et al. 2021
11 Grid Recognition: Classical and Parameterized Computational Perspectives Gupta, Siddharth et al. 2021
12 LIPIcs, Volume 214, IPEC 2021, Complete Volume Golovach, Petr A. et al. 2021
13 Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293) Ganian, Robert et al. 2021
14 Approximate Search for Known Gene Clusters in New Genomes Using PQ-Trees Zimerman, Galia R. et al. 2020
15 Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds Fomin, Fedor V. et al. 2020
16 ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs Fomin, Fedor V. et al. 2020
17 Fault Tolerant Subgraphs with Applications in Kernelization Lochet, William et al. 2020
18 On the (Parameterized) Complexity of Almost Stable Marriage Gupta, Sushmita et al. 2020
19 Parameter Analysis for Guarding Terrains Agrawal, Akanksha et al. 2020
20 Parameterization Above a Multiplicative Guarantee Fomin, Fedor V. et al. 2020
21 Parameterized Study of Steiner Tree on Unit Disk Graphs Bhore, Sujoy et al. 2020
22 The Parameterized Complexity of Guarding Almost Convex Polygons Agrawal, Akanksha et al. 2020
23 A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation Zoller, Roni et al. 2019
24 A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs Madathil, Jayakrishnan et al. 2019
25 Approximate Counting of k-Paths: Deterministic and in Polynomial Space Björklund, Andreas et al. 2019
26 Connecting the Dots (with Minimum Crossings) Agrawal, Akanksha et al. 2019
27 Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals Fomin, Fedor V. et al. 2019
28 Decomposition of Map Graphs with Applications Fomin, Fedor V. et al. 2019
29 Going Far From Degeneracy Fomin, Fedor V. et al. 2019
30 New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) Fomin, Fedor V. et al. 2019
31 Packing Arc-Disjoint Cycles in Tournaments Bessy, Stéphane et al. 2019
32 Parameterized Complexity of Multi-Node Hubs Saurabh, Saket et al. 2019
33 Balanced Judicious Bipartition is Fixed-Parameter Tractable Lokshtanov, Daniel et al. 2018
34 Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS Lokshtanov, Daniel et al. 2018
35 Erdös-Pósa Property of Obstructions to Interval Graphs Agrawal, Akanksha et al. 2018
36 Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems Agrawal, Akanksha et al. 2018
37 Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity Lokshtanov, Daniel et al. 2018
38 Reducing CMSO Model Checking to Highly Connected Graphs Lokshtanov, Daniel et al. 2018
39 Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number Misra, Pranabendu et al. 2018
40 Exact Algorithms for Terrain Guarding Ashok, Pradeesha et al. 2017
41 Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs Fomin, Fedor V. et al. 2017
42 Matrix Rigidity from the Viewpoint of Parameterized Complexity Fomin, Fedor V. et al. 2017
43 Packing Cycles Faster Than Erdos-Posa Lokshtanov, Daniel et al. 2017
44 Parameterized Algorithms and Kernels for Rainbow Matching Gupta, Sushmita et al. 2017
45 Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping Komusiewicz, Christian et al. 2017
46 Split Contraction: The Untold Story Agrawal, Akanksha et al. 2017
47 A Linear-Time Algorithm for the Copy Number Transformation Problem Shamir, Ron et al. 2016
48 Kernels for Deletion to Classes of Acyclic Digraphs Agrawal, Akanksha et al. 2016
49 Parameterized Algorithms for List K-Cycle Panolan, Fahad et al. 2016
50 Simultaneous Feedback Edge Set: A Parameterized Perspective Agrawal, Akanksha et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 50

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