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


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