No. Title Author Year
1 Sorting Balls and Water: Equivalence and Computational Complexity Ito, Takehiro et al. 2022
2 Grundy Distinguishes Treewidth from Pathwidth Belmonte, Rémy et al. 2020
3 Parameterized Complexity of Graph Burning Kobayashi, Yasuaki et al. 2020
4 Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs Izumi, Taisuke et al. 2020
5 Low-Congestion Shortcut and Graph Parameters Kitamura, Naoki et al. 2019
6 Token Sliding on Split Graphs Belmonte, Rémy et al. 2019
7 How Bad is the Freedom to Flood-It? Belmonte, Rémy et al. 2018
8 Parameterized Orientable Deletion Hanaka, Tesshu et al. 2018
9 Reconfiguration of Colorable Sets in Classes of Perfect Graphs Ito, Takehiro et al. 2018
10 Space-Efficient Algorithms for Longest Increasing Subsequence Kiyomi, Masashi et al. 2018
11 Vertex Deletion Problems on Chordal Graphs Cao, Yixin et al. 2018
12 A Faster Parameterized Algorithm for Pseudoforest Deletion Bodlaender, Hans L. et al. 2017
13 A Lower Bound on Opaque Sets Kawamura, Akitoshi et al. 2016
14 Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity Bodlaender, Hans L. et al. 2016
15 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: 15


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