| Pattern matching with variables: A multivariate complexity analysis H Fernau, ML Schmid Information and Computation 242, 287-305, 2015 | 36 | 2015 |
| Pattern matching with variables: Fast algorithms and new hardness results H Fernau, F Manea, R Mercas, ML Schmid 32nd International Symposium on Theoretical Aspects of Computer Science …, 2015 | 31 | 2015 |
| On the parameterised complexity of string morphism problems H Fernau, ML Schmid, Y Villanger Theory of Computing Systems 59 (1), 24-51, 2016 | 27 | 2016 |
| Patterns with bounded treewidth D Reidenbach, ML Schmid Information and Computation 239, 87-99, 2014 | 27 | 2014 |
| Characterization and complexity results on jumping finite automata H Fernau, M Paramasivan, ML Schmid, V Vorel Theoretical Computer Science 679, 31-52, 2017 | 25 | 2017 |
| A polynomial time match test for large classes of extended regular expressions D Reidenbach, ML Schmid International Conference on Implementation and Application of Automata, 241-250, 2010 | 22 | 2010 |
| Contextual array grammars and array P systems H Fernau, R Freund, ML Schmid, KG Subramanian, P Wiederhold Annals of Mathematics and Artificial Intelligence 75 (1-2), 5-26, 2015 | 21 | 2015 |
| On the complexity of grammar-based compression over fixed alphabets K Casel, H Fernau, S Gaspers, B Gras, ML Schmid 43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016 | 17 | 2016 |
| Characterising REGEX languages by regular languages equipped with factor-referencing ML Schmid Information and Computation 249, 1-17, 2016 | 16 | 2016 |
| Jumping finite automata: characterizations and complexity H Fernau, M Paramasivan, ML Schmid International Conference on Implementation and Application of Automata, 89-101, 2015 | 16 | 2015 |
| Simple picture processing based on finite automata and regular grammars H Fernau, M Paramasivan, ML Schmid Journal of Computer and System Sciences 95, 232-258, 2018 | 13 | 2018 |
| Deterministic regular expressions with back-references DD Freydenberger, ML Schmid Journal of Computer and System Sciences 105, 1-39, 2019 | 11 | 2019 |
| Scanning pictures the boustrophedon way H Fernau, M Paramasivan, ML Schmid, DG Thomas International Workshop on Combinatorial Image Analysis, 202-216, 2015 | 11 | 2015 |
| Revisiting Shinohara's algorithm for computing descriptive patterns H Fernau, F Manea, R Mercaş, ML Schmid Theoretical Computer Science 733, 44-54, 2018 | 8 | 2018 |
| Computing equality-free and repetitive string factorisations ML Schmid Theoretical Computer Science 618, 42-51, 2016 | 8 | 2016 |
| Regular and context-free pattern languages over small alphabets D Reidenbach, ML Schmid Theoretical Computer Science 518, 80-95, 2014 | 8 | 2014 |
| On the solvability problem for restricted classes of word equations F Manea, D Nowotka, ML Schmid International Conference on Developments in Language Theory, 306-318, 2016 | 7 | 2016 |
| A note on the complexity of matching patterns with variables ML Schmid Information Processing Letters 113 (19-21), 729-733, 2013 | 6 | 2013 |
| Patterns with bounded treewidth D Reidenbach, ML Schmid International Conference on Language and Automata Theory and Applications …, 2012 | 6 | 2012 |
| On matching generalised repetitive patterns JD Day, P Fleischmann, F Manea, D Nowotka, ML Schmid International Conference on Developments in Language Theory, 269-281, 2018 | 5 | 2018 |
