No. Title Author Year
1 Wordle Is NP-Hard Lokshtanov, Daniel et al. 2022
2 An ETH-Tight Algorithm for Multi-Team Formation Lokshtanov, Daniel et al. 2021
3 b-Coloring Parameterized by Clique-Width Jaffke, Lars et al. 2021
4 Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable Lokshtanov, Daniel et al. 2021
5 Efficient Algorithms for Least Square Piecewise Polynomial Regression Lokshtanov, Daniel et al. 2021
6 Exploiting Dense Structures in Parameterized Complexity Lochet, William et al. 2021
7 A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion Lokshtanov, Daniel et al. 2020
8 Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds Fomin, Fedor V. et al. 2020
9 ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs Fomin, Fedor V. et al. 2020
10 Fault Tolerant Subgraphs with Applications in Kernelization Lochet, William et al. 2020
11 On the Parameterized Approximability of Contraction to Classes of Chordal Graphs Gunda, Spoorthy et al. 2020
12 On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets Lokshtanov, Daniel et al. 2020
13 Parameterization Above a Multiplicative Guarantee Fomin, Fedor V. et al. 2020
14 Parameterized Complexity of Feedback Vertex Sets on Hypergraphs Choudhary, Pratibha et al. 2020
15 Removing Connected Obstacles in the Plane Is FPT Eiben, Eduard et al. 2020
16 The Parameterized Complexity of Guarding Almost Convex Polygons Agrawal, Akanksha et al. 2020
17 A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem Lokshtanov, Daniel et al. 2019
18 Approximate Counting of k-Paths: Deterministic and in Polynomial Space Björklund, Andreas et al. 2019
19 Bisection of Bounded Treewidth Graphs by Convolutions Eiben, Eduard et al. 2019
20 Computing the Largest Bond of a Graph Duarte, Gabriel L. et al. 2019
21 Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals Fomin, Fedor V. et al. 2019
22 Decomposition of Map Graphs with Applications Fomin, Fedor V. et al. 2019
23 Going Far From Degeneracy Fomin, Fedor V. et al. 2019
24 Path Contraction Faster Than 2^n Agrawal, Akanksha et al. 2019
25 Picking Random Vertices (Invited Talk) Lokshtanov, Daniel 2019
26 The Parameterized Complexity of Finding Point Sets with Hereditary Properties Eppstein, David et al. 2019
27 Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces Carpenter, Timothy et al. 2018
28 Balanced Judicious Bipartition is Fixed-Parameter Tractable Lokshtanov, Daniel et al. 2018
29 Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS Lokshtanov, Daniel et al. 2018
30 Conflict Free Feedback Vertex Set: A Parameterized Dichotomy Agrawal, Akanksha et al. 2018
Current Page :
Number of result pages: 3
Number of documents: 63

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