No. Title Author Year
1 How Bad is the Freedom to Flood-It? Belmonte, Rémy et al. 2018
2 Parameterized Orientable Deletion Hanaka, Tesshu et al. 2018
3 Reconfiguration of Colorable Sets in Classes of Perfect Graphs Ito, Takehiro et al. 2018
4 Space-Efficient Algorithms for Longest Increasing Subsequence Kiyomi, Masashi et al. 2018
5 Vertex Deletion Problems on Chordal Graphs Cao, Yixin et al. 2018
6 A Faster Parameterized Algorithm for Pseudoforest Deletion Bodlaender, Hans L. et al. 2017
7 A Lower Bound on Opaque Sets Kawamura, Akitoshi et al. 2016
8 Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity Bodlaender, Hans L. et al. 2016
9 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: 9


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