No. Title Author Year
1 Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited Gima, Tatsuya et al. 2022
2 Independent Set Reconfiguration on Directed Graphs Ito, Takehiro et al. 2022
3 Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets Abhinav, Ankit et al. 2022
4 Sorting Balls and Water: Equivalence and Computational Complexity Ito, Takehiro et al. 2022
5 Grundy Distinguishes Treewidth from Pathwidth Belmonte, Rémy et al. 2020
6 Parameterized Complexity of Graph Burning Kobayashi, Yasuaki et al. 2020
7 Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs Izumi, Taisuke et al. 2020
8 Low-Congestion Shortcut and Graph Parameters Kitamura, Naoki et al. 2019
9 Token Sliding on Split Graphs Belmonte, Rémy et al. 2019
10 How Bad is the Freedom to Flood-It? Belmonte, Rémy et al. 2018
11 Parameterized Orientable Deletion Hanaka, Tesshu et al. 2018
12 Reconfiguration of Colorable Sets in Classes of Perfect Graphs Ito, Takehiro et al. 2018
13 Space-Efficient Algorithms for Longest Increasing Subsequence Kiyomi, Masashi et al. 2018
14 Vertex Deletion Problems on Chordal Graphs Cao, Yixin et al. 2018
15 A Faster Parameterized Algorithm for Pseudoforest Deletion Bodlaender, Hans L. et al. 2017
16 A Lower Bound on Opaque Sets Kawamura, Akitoshi et al. 2016
17 Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity Bodlaender, Hans L. et al. 2016
18 On the Classes of Interval Graphs of Limited Nesting and Count of Lengths Klavík, Pavel et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 18


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