Markus L. Schmid

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 55

Top Topics

Shortest Distance

Pattern Matching

Finite Automata

Regular Expressions

Top Venues

Theor. Comput. Sci.

J. Comput. Syst. Sci.

Publications

Markus L. Schmid
The Information Extraction Framework of Document Spanners - A Very Informal Survey. SOFSEM (2024)
Katrin Casel, Tobias Friedrich, Stefan Neubert, Markus L. Schmid
Shortest distances as enumeration problem. Discret. Appl. Math. 342 (2024)
Florin Manea, Jonas Richardsen, Markus L. Schmid
Subsequences With Generalised Gap Constraints: Upper and Lower Complexity Bounds. CoRR (2024)
Cristian Riveros, Markus L. Schmid, Nicole Schweikardt
A framework for extraction and transformation of documents. CoRR (2024)
Markus Lohrey, Markus L. Schmid
Enumeration for MSO-Queries on Compressed Trees. CoRR (2024)
Markus Lohrey, Markus L. Schmid
Enumeration for MSO-Queries on Compressed Trees. Proc. ACM Manag. Data 2 (2) (2024)
Florin Manea, Jonas Richardsen, Markus L. Schmid
Subsequences with Generalised Gap Constraints: Upper and Lower Complexity Bounds. CPM (2024)
Sarah Kleest-Meißner, Rebecca Sattler, Markus L. Schmid, Nicole Schweikardt, Matthias Weidlich
Discovering Multi-Dimensional Subsequence Queries from Traces - From Theory to Practice. BTW (2023)
Katrin Casel, Markus L. Schmid
Fine-Grained Complexity of Regular Path Queries. Log. Methods Comput. Sci. 19 (4) (2023)
Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. Discret. Comput. Geom. 69 (4) (2023)
Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid
Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems. CoRR (2022)
Markus L. Schmid
Extending Shinohara's Algorithm for Computing Descriptive (Angluin-Style) Patterns to Subsequence Patterns. CoRR (2022)
Markus L. Schmid, Nicole Schweikardt
Document Spanners - A Brief Overview of Concepts, Results, and Recent Developments. PODS (2022)
Sarah Kleest-Meißner, Rebecca Sattler, Markus L. Schmid, Nicole Schweikardt, Matthias Weidlich
Discovering Event Queries from Traces: Laying Foundations for Subsequence-Queries with Wildcards and Gap-Size Constraints. ICDT (2022)
Markus L. Schmid
Conjunctive Regular Path Queries with Capture Groups. ACM Trans. Database Syst. 47 (2) (2022)
Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid
Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems. ISAAC (2022)
Markus L. Schmid, Nicole Schweikardt
Query Evaluation over SLP-Represented Document Databases with Complex Document Editing. PODS (2022)
Markus L. Schmid, Nicole Schweikardt
A Purely Regular Approach to Non-Regular Core Spanners. ICDT (2021)
Katrin Casel, Markus L. Schmid
Fine-Grained Complexity of Regular Path Queries. CoRR (2021)
Markus L. Schmid, Nicole Schweikardt
Spanner Evaluation over SLP-Compressed Documents. CoRR (2021)
Markus L. Schmid, Nicole Schweikardt
Spanner Evaluation over SLP-Compressed Documents. PODS (2021)
Katrin Casel, Markus L. Schmid
Fine-Grained Complexity of Regular Path Queries. ICDT (2021)
Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory Comput. Syst. 65 (2) (2021)
Katrin Casel, Jan Dreier, Henning Fernau, Moritz Gobbert, Philipp Kuinke, Fernando Sánchez Villaamil, Markus L. Schmid, Erik Jan van Leeuwen
Complexity of independency and cliquy trees. Discret. Appl. Math. 272 (2020)
Katrin Casel, Tobias Friedrich, Stefan Neubert, Markus L. Schmid
Shortest Distances as Enumeration Problem. CoRR (2020)
Markus L. Schmid
Conjunctive Regular Path Queries with String Variables. PODS (2020)
Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid
Pattern Matching with Variables: Efficient Algorithms and Complexity Results. ACM Trans. Comput. Theory 12 (1) (2020)
Laurent Bulteau, Markus L. Schmid
Consensus Strings with Small Maximum Distance and Small Distance Sum. Algorithmica 82 (5) (2020)
Markus L. Schmid, Nicole Schweikardt
A Purely Regular Approach to Non-Regular Core Spanners. CoRR (2020)
Markus L. Schmid
Conjunctive Regular Path Queries with String Variables. CoRR (2019)
Dominik D. Freydenberger, Markus L. Schmid
Deterministic regular expressions with back-references. J. Comput. Syst. Sci. 105 (2019)
Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. ICALP (2019)
Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. CoRR (2019)
Florin Manea, Markus L. Schmid
Matching Patterns with Variables. WORDS (2019)
Markus L. Schmid
Regular Expressions with Backreferences: Polynomial-Time Matching Techniques. CoRR (2019)
Florin Manea, Markus L. Schmid
Matching Patterns with Variables. CoRR (2019)
Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid
Revisiting Shinohara's algorithm for computing descriptive patterns. Theor. Comput. Sci. 733 (2018)
Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, D. Gnanaraj Thomas
Simple picture processing based on finite automata and regular grammars. J. Comput. Syst. Sci. 95 (2018)
Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka, Markus L. Schmid
On Matching Generalised Repetitive Patterns. DLT (2018)
Dominik D. Freydenberger, Markus L. Schmid
Deterministic Regular Expressions With Back-References. CoRR (2018)
Florin Manea, Dirk Nowotka, Markus L. Schmid
On the Complexity of Solving Restricted Word Equations. Int. J. Found. Comput. Sci. 29 (5) (2018)
Laurent Bulteau, Markus L. Schmid
Consensus Strings with Small Maximum Distance and Small Distance Sum. MFCS (2018)
Markus L. Schmid
Finding Consensus Strings with Small Length Difference between Input and Solution Strings. ACM Trans. Comput. Theory 9 (3) (2017)
Joel D. Day, Daniel Reidenbach, Markus L. Schmid
Closure properties of pattern languages. J. Comput. Syst. Sci. 84 (2017)
Daniel Reidenbach, Markus L. Schmid
A Polynomial Time Match Test for Large Classes of Extended Regular Expressions. CoRR (2017)
Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. CoRR (2017)
Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. MFCS (2017)
Henning Fernau, Markus L. Schmid, K. G. Subramanian
Two-Dimensional Pattern Languages. CoRR (2017)
Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel
Characterization and complexity results on jumping finite automata. Theor. Comput. Sci. 679 (2017)
Dominik D. Freydenberger, Markus L. Schmid
Deterministic Regular Expressions with Back-References. STACS (2017)
Markus L. Schmid
Computing equality-free and repetitive string factorisations. Theor. Comput. Sci. 618 (2016)
Florin Manea, Dirk Nowotka, Markus L. Schmid
On the Solvability Problem for Restricted Classes of Word Equations. DLT (2016)
Henning Fernau, Markus L. Schmid, Yngve Villanger
On the Parameterised Complexity of String Morphism Problems. Theory Comput. Syst. 59 (1) (2016)
Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid
On the Complexity of Grammar-Based Compression over Fixed Alphabets. ICALP (2016)
Markus L. Schmid
Characterising REGEX languages by regular languages equipped with factor-referencing. Inf. Comput. 249 (2016)
Henning Fernau, Markus L. Schmid
Pattern matching with variables: A multivariate complexity analysis. Inf. Comput. 242 (2015)
Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel
Characterization and Complexity Results on Jumping Finite Automata. CoRR (2015)
Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid
Jumping Finite Automata: Characterizations and Complexity. CIAA (2015)
Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, D. Gnanaraj Thomas
Scanning Pictures the Boustrophedon Way. IWCIA (2015)
Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid
Pattern Matching with Variables: Fast Algorithms and New Hardness Results. STACS (2015)
Henning Fernau, Rudolf Freund, Markus L. Schmid, K. G. Subramanian, Petra Wiederhold
Contextual array grammars and array P systems. Ann. Math. Artif. Intell. 75 (1-2) (2015)
Markus L. Schmid
Finding Consensus Strings with Small Length Difference Between Input and Solution Strings. MFCS (2) (2015)
Markus L. Schmid
Computing Equality-Free String Factorisations. CiE (2015)
Joel D. Day, Daniel Reidenbach, Markus L. Schmid
Closure Properties of Pattern Languages. Developments in Language Theory (2014)
Daniel Reidenbach, Markus L. Schmid
Regular and context-free pattern languages over small alphabets. Theor. Comput. Sci. 518 (2014)
Markus L. Schmid
Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing. Developments in Language Theory (2014)
Daniel Reidenbach, Markus L. Schmid
Automata with modulo counters and nondeterministic counter bounds. Kybernetika 50 (1) (2014)
Daniel Reidenbach, Markus L. Schmid
Patterns with bounded treewidth. Inf. Comput. 239 (2014)
Henning Fernau, Markus L. Schmid
Pattern Matching with Variables: A Multivariate Complexity Analysis. CPM (2013)
Daniel Reidenbach, Markus L. Schmid
Finding shuffle words that represent optimal scheduling of shared memory access. Int. J. Comput. Math. 90 (6) (2013)
Henning Fernau, Markus L. Schmid, Yngve Villanger
On the Parameterised Complexity of String Morphism Problems. FSTTCS (2013)
Henning Fernau, Rudolf Freund, Sergiu Ivanov, Markus L. Schmid, K. G. Subramanian
Array Insertion and Deletion P Systems. UCNC (2013)
Markus L. Schmid
Inside the Class of regex Languages. Int. J. Found. Comput. Sci. 24 (7) (2013)
Henning Fernau, Markus L. Schmid, K. G. Subramanian
Two-dimensional pattern languages. NCMA (2013)
Markus L. Schmid
A note on the complexity of matching patterns with variables. Inf. Process. Lett. 113 (19-21) (2013)
Daniel Reidenbach, Markus L. Schmid
Automata with Modulo Counters and Nondeterministic Counter Bounds. CIAA (2012)
Daniel Reidenbach, Markus L. Schmid
Patterns with Bounded Treewidth. LATA (2012)
Markus L. Schmid
Inside the Class of REGEX Languages. Developments in Language Theory (2012)
Daniel Reidenbach, Markus L. Schmid
Regular and Context-Free Pattern Languages over Small Alphabets. Developments in Language Theory (2012)
Daniel Reidenbach, Markus L. Schmid
On multi-head automata with restricted nondeterminism. Inf. Process. Lett. 112 (14-15) (2012)
Daniel Reidenbach, Markus L. Schmid
Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access. LATA (2011)
Daniel Reidenbach, Markus L. Schmid
A Polynomial Time Match Test for Large Classes of Extended Regular Expressions. CIAA (2010)