No. Title Author Year
1 On Computing Homological Hitting Sets Bauer, Ulrich et al. 2023
2 (Re)packing Equal Disks into Rectangle Fomin, Fedor V. et al. 2022
3 A Finite Algorithm for the Realizabilty of a Delaunay Triangulation Agrawal, Akanksha et al. 2022
4 New Algorithms for Structure Informed Genome Rearrangement Ozery, Eden et al. 2022
5 Exploiting Dense Structures in Parameterized Complexity Lochet, William et al. 2021
6 Front Matter, Table of Contents, Preface, Conference Organization Golovach, Petr A. et al. 2021
7 Grid Recognition: Classical and Parameterized Computational Perspectives Gupta, Siddharth et al. 2021
8 LIPIcs, Volume 214, IPEC 2021, Complete Volume Golovach, Petr A. et al. 2021
9 Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293) Ganian, Robert et al. 2021
10 Approximate Search for Known Gene Clusters in New Genomes Using PQ-Trees Zimerman, Galia R. et al. 2020
11 Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds Fomin, Fedor V. et al. 2020
12 ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs Fomin, Fedor V. et al. 2020
13 Fault Tolerant Subgraphs with Applications in Kernelization Lochet, William et al. 2020
14 On the (Parameterized) Complexity of Almost Stable Marriage Gupta, Sushmita et al. 2020
15 Parameter Analysis for Guarding Terrains Agrawal, Akanksha et al. 2020
16 Parameterization Above a Multiplicative Guarantee Fomin, Fedor V. et al. 2020
17 Parameterized Study of Steiner Tree on Unit Disk Graphs Bhore, Sujoy et al. 2020
18 The Parameterized Complexity of Guarding Almost Convex Polygons Agrawal, Akanksha et al. 2020
19 A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation Zoller, Roni et al. 2019
20 A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs Madathil, Jayakrishnan et al. 2019
21 Approximate Counting of k-Paths: Deterministic and in Polynomial Space Björklund, Andreas et al. 2019
22 Connecting the Dots (with Minimum Crossings) Agrawal, Akanksha et al. 2019
23 Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals Fomin, Fedor V. et al. 2019
24 Decomposition of Map Graphs with Applications Fomin, Fedor V. et al. 2019
25 Going Far From Degeneracy Fomin, Fedor V. et al. 2019
26 New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) Fomin, Fedor V. et al. 2019
27 Packing Arc-Disjoint Cycles in Tournaments Bessy, Stéphane et al. 2019
28 Parameterized Complexity of Multi-Node Hubs Saurabh, Saket et al. 2019
29 Balanced Judicious Bipartition is Fixed-Parameter Tractable Lokshtanov, Daniel et al. 2018
30 Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS Lokshtanov, Daniel et al. 2018
Current Page :
Number of result pages: 2
Number of documents: 46

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