| 2025 | BTW | Embracing Change: Incremental Updates of Discovered Event Queries. | Rebecca Sattler, Sarah Kleest-Meiner, Steven Lange, Markus L. Schmid, Nicole Schweikardt, Matthias Weidlich |
| 2025 | DLT | A General Information Extraction Framework Based on Formal Languages. | Markus L. Schmid |
| 2025 | ICDT | A Framework for Extraction and Transformation of Documents. | Cristian Riveros, Markus L. Schmid, Nicole Schweikardt |
| 2025 | MFCS | Linear Time Subsequence and Supersequence Regex Matching. | Antoine Amarilli, Florin Manea, Tina Ringleb, Markus L. Schmid |
| 2025 | MFCS | FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree. | Markus Lohrey, Sebastian Maneth, Markus L. Schmid |
| 2024 | CPM | Subsequences with Generalised Gap Constraints: Upper and Lower Complexity Bounds. | Florin Manea, Jonas Richardsen, Markus L. Schmid |
| 2024 | SOFSEM | The Information Extraction Framework of Document Spanners - A Very Informal Survey. | Markus L. Schmid |
| 2023 | BTW | Discovering Multi-Dimensional Subsequence Queries from Traces - From Theory to Practice. | Sarah Kleest-Meiner, Rebecca Sattler, Markus L. Schmid, Nicole Schweikardt, Matthias Weidlich |
| 2022 | ICDT | Discovering Event Queries from Traces: Laying Foundations for Subsequence-Queries with Wildcards and Gap-Size Constraints. | Sarah Kleest-Meiner, Rebecca Sattler, Markus L. Schmid, Nicole Schweikardt, Matthias Weidlich |
| 2022 | ISAAC | Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems. | Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid |
| 2022 | PODS | Query Evaluation over SLP-Represented Document Databases with Complex Document Editing. | Markus L. Schmid, Nicole Schweikardt |
| 2022 | PODS | Document Spanners - A Brief Overview of Concepts, Results, and Recent Developments. | Markus L. Schmid, Nicole Schweikardt |
| 2021 | ICDT | Fine-Grained Complexity of Regular Path Queries. | Katrin Casel, Markus L. Schmid |
| 2021 | ICDT | A Purely Regular Approach to Non-Regular Core Spanners. | Markus L. Schmid, Nicole Schweikardt |
| 2021 | PODS | Spanner Evaluation over SLP-Compressed Documents. | Markus L. Schmid, Nicole Schweikardt |
| 2020 | PODS | Conjunctive Regular Path Queries with String Variables. | Markus L. Schmid |
| 2019 | ICALP | Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. | Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid |
| 2018 | DLT | On Matching Generalised Repetitive Patterns. | Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka, Markus L. Schmid |
| 2018 | MFCS | Consensus Strings with Small Maximum Distance and Small Distance Sum. | Laurent Bulteau, Markus L. Schmid |
| 2017 | MFCS | Combinatorial Properties and Recognition of Unit Square Visibility Graphs. | Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides |
| 2017 | STACS | Deterministic Regular Expressions with Back-References. | Dominik D. Freydenberger, Markus L. Schmid |
| 2016 | DLT | On the Solvability Problem for Restricted Classes of Word Equations. | Florin Manea, Dirk Nowotka, Markus L. Schmid |
| 2016 | ICALP | On the Complexity of Grammar-Based Compression over Fixed Alphabets. | Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid |
| 2015 | CiE | Computing Equality-Free String Factorisations. | Markus L. Schmid |
| 2015 | IWCIA | Scanning Pictures the Boustrophedon Way. | Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, D. Gnanaraj Thomas |
| 2015 | MFCS | Finding Consensus Strings with Small Length Difference Between Input and Solution Strings. | Markus L. Schmid |
| 2015 | STACS | Pattern Matching with Variables: Fast Algorithms and New Hardness Results. | Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid |
| 2014 | DLT | Closure Properties of Pattern Languages. | Joel D. Day, Daniel Reidenbach, Markus L. Schmid |
| 2014 | DLT | Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing. | Markus L. Schmid |
| 2013 | CPM | Pattern Matching with Variables: A Multivariate Complexity Analysis. | Henning Fernau, Markus L. Schmid |
| 2013 | UC | Array Insertion and Deletion P Systems. | Henning Fernau, Rudolf Freund, Sergiu Ivanov, Markus L. Schmid, K. G. Subramanian |
| 2012 | DLT | Regular and Context-Free Pattern Languages over Small Alphabets. | Daniel Reidenbach, Markus L. Schmid |
| 2012 | DLT | Inside the Class of REGEX Languages. | Markus L. Schmid |
| 2012 | LATA | Patterns with Bounded Treewidth. | Daniel Reidenbach, Markus L. Schmid |
| 2011 | LATA | Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access. | Daniel Reidenbach, Markus L. Schmid |