Markus L. Schmid

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