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


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