No. Title Author Year
1 Domination and Cut Problems on Chordal Graphs with Bounded Leafage Galby, Esther et al. 2022
2 Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search Esmer, Barış Can et al. 2022
3 Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters Galby, Esther et al. 2022
4 Fault Tolerant Subgraphs with Applications in Kernelization Lochet, William et al. 2020
5 On the Parameterized Complexity of Deletion to ℋ-Free Strong Components Neogi, Rian et al. 2020
6 Parameterized Complexity of Directed Spanner Problems Fomin, Fedor V. et al. 2020
7 Quick Separation in Chordal and Split Graphs Misra, Pranabendu et al. 2020
8 A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs Madathil, Jayakrishnan et al. 2019
9 Exact and Approximate Digraph Bandwidth Jain, Pallavi et al. 2019
10 Balanced Judicious Bipartition is Fixed-Parameter Tractable Lokshtanov, Daniel et al. 2018
11 Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS Lokshtanov, Daniel et al. 2018
12 Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number Misra, Pranabendu et al. 2018
13 Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set Agrawal, Akanksha et al. 2017
14 Kernels for Deletion to Classes of Acyclic Digraphs Agrawal, Akanksha et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 14

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