No. Title Author Year
1 Algorithmic Enumeration: Output-sensitive, Input-Sensitive, Parameterized, Approximative (Dagstuhl Seminar 18421) Fernau, Henning et al. 2019
2 Computational Complexity of Synchronization under Regular Constraints Fernau, Henning et al. 2019
3 Combinatorial Properties and Recognition of Unit Square Visibility Graphs Casel, Katrin et al. 2017
4 Building Clusters with Lower-Bounded Sizes Abu-Khzam, Faisal et al. 2016
5 On the Complexity of Grammar-Based Compression over Fixed Alphabets Casel, Katrin et al. 2016
6 Pattern Matching with Variables: Fast Algorithms and New Hardness Results Fernau, Henning et al. 2015
7 On the Parameterised Complexity of String Morphism Problems Fernau, Henning et al. 2013
8 Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves Fernau, Henning et al. 2009
9 An Optimal Construction of Finite Automata from Regular Expressions Gulan, Stefan et al. 2008
10 Exact Elimination of Cycles in Graphs Raible, Daniel et al. 2007
Current Page :
Number of result pages: 1
Number of documents: 10


DROPS-Home | Imprint | Privacy Published by LZI