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


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