Markus L. Schmid

493 total citations
34 papers, 98 citations indexed

About

Markus L. Schmid is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Markus L. Schmid has authored 34 papers receiving a total of 98 indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computational Theory and Mathematics, 23 papers in Artificial Intelligence and 13 papers in Molecular Biology. Recurrent topics in Markus L. Schmid's work include semigroups and automata theory (22 papers), Algorithms and Data Compression (20 papers) and DNA and Biological Computing (13 papers). Markus L. Schmid is often cited by papers focused on semigroups and automata theory (22 papers), Algorithms and Data Compression (20 papers) and DNA and Biological Computing (13 papers). Markus L. Schmid collaborates with scholars based in Germany, United Kingdom and France. Markus L. Schmid's co-authors include Henning Fernau, Daniel Reidenbach, Yngve Villanger, Florín Manea, Robert Mercaş, Nicole Schweikardt, K. G. Subramanian, Rudolf Freund, Serge Gaspers and Laurent Bulteau and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and ACM Transactions on Database Systems.

In The Last Decade

Markus L. Schmid

26 papers receiving 90 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Markus L. Schmid Germany	6	72	61	25	10	9	34	98
Rogério Reis Portugal	7	109 1.5×	129 2.1×	72 2.9×	8 0.8×	7 0.8×	55	167
S. Yu Canada	6	90 1.3×	139 2.3×	58 2.3×	12 1.2×	6 0.7×	15	183
Takayoshi Shoudai Japan	6	69 1.0×	41 0.7×	10 0.4×	10 1.0×	9 1.0×	32	91
Jean-Marc Talbot France	6	58 0.8×	44 0.7×	6 0.2×	37 3.7×	7 0.8×	17	83
Alexandru Popa Romania	7	30 0.4×	65 1.1×	23 0.9×	53 5.3×	7 0.8×	37	151
Rudi Pendavingh Netherlands	7	24 0.3×	89 1.5×	14 0.6×	19 1.9×	4 0.4×	26	138
Noa Lewenstein Israel	7	132 1.8×	72 1.2×	83 3.3×	8 0.8×	3 0.3×	14	152
Konstantin Korovin United Kingdom	6	94 1.3×	65 1.1×	13 0.5×	16 1.6×		18	118
Jean-Philippe Bossuat Switzerland	5	114 1.6×	20 0.3×	13 0.5×	13 1.3×	13 1.4×	7	131
Avivit Levy Israel	7	110 1.5×	49 0.8×	60 2.4×	8 0.8×	12 1.3×	32	125

Countries citing papers authored by Markus L. Schmid

Since Specialization

Citations

This map shows the geographic impact of Markus L. Schmid's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Markus L. Schmid with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Markus L. Schmid more than expected).

Fields of papers citing papers by Markus L. Schmid

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Markus L. Schmid. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Markus L. Schmid. The network helps show where Markus L. Schmid may publish in the future.

Co-authorship network of co-authors of Markus L. Schmid

This figure shows the co-authorship network connecting the top 25 collaborators of Markus L. Schmid. A scholar is included among the top collaborators of Markus L. Schmid based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Markus L. Schmid. Markus L. Schmid is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Friedrich, Tobias, et al.. (2023). Shortest distances as enumeration problem. Discrete Applied Mathematics. 342. 89–103. 1 indexed citations

Fernau, Henning, et al.. (2023). Combinatorial Properties and Recognition of Unit Square Visibility Graphs. Discrete & Computational Geometry. 69(4). 937–980.

Schmid, Markus L., et al.. (2023). Fine-Grained Complexity of Regular Path Queries. Logical Methods in Computer Science. Volume 19, Issue 4.

Schmid, Markus L., et al.. (2021). Fine-Grained Complexity of Regular Path Queries. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 5 indexed citations

Kociumaka, Tomasz, et al.. (2019). Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number (Track B: Automata, Logic, Semantics, and Theory of Programming). DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Fernau, Henning, et al.. (2018). Simple picture processing based on finite automata and regular grammars. Journal of Computer and System Sciences. 95. 232–258. 3 indexed citations

Fernau, Henning, et al.. (2018). Complexity of independency and cliquy trees. Discrete Applied Mathematics. 272. 2–15. 3 indexed citations

Fernau, Henning, Florín Manea, Robert Mercaş, & Markus L. Schmid. (2018). Revisiting Shinohara's algorithm for computing descriptive patterns. Theoretical Computer Science. 733. 44–54. 1 indexed citations

Bulteau, Laurent & Markus L. Schmid. (2018). Consensus Strings with Small Maximum Distance and Small Distance Sum. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

10.

Manea, Florín, Dirk Nowotka, & Markus L. Schmid. (2018). On the Complexity of Solving Restricted Word Equations. International Journal of Foundations of Computer Science. 29(5). 893–909.

11.

Schmid, Markus L.. (2017). Finding Consensus Strings with Small Length Difference between Input and Solution Strings. 9(3). 1–18. 3 indexed citations

12.

Schmid, Markus L.. (2016). Characterising REGEX languages by regular languages equipped with factor-referencing. Information and Computation. 249. 1–17. 12 indexed citations

13.

Reidenbach, Daniel, et al.. (2016). Closure properties of pattern languages. Journal of Computer and System Sciences. 84. 11–31.

14.

Schmid, Markus L.. (2016). Computing equality-free and repetitive string factorisations. Theoretical Computer Science. 618. 42–51. 2 indexed citations

15.

Fernau, Henning & Markus L. Schmid. (2015). Pattern matching with variables: A multivariate complexity analysis. Information and Computation. 242. 287–305. 8 indexed citations

16.

Fernau, Henning, Markus L. Schmid, & Yngve Villanger. (2015). On the Parameterised Complexity of String Morphism Problems. Theory of Computing Systems. 59(1). 24–51. 9 indexed citations

17.

Fernau, Henning, Florín Manea, Robert Mercaş, & Markus L. Schmid. (2015). Pattern Matching with Variables: Fast Algorithms and New Hardness Results. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 6 indexed citations

18.

Reidenbach, Daniel & Markus L. Schmid. (2014). Patterns with bounded treewidth. Information and Computation. 239. 87–99. 8 indexed citations

19.

Fernau, Henning, Markus L. Schmid, & K. G. Subramanian. (2013). Two-dimensional pattern languages.. arXiv (Cornell University). 117–132.

20.

Reidenbach, Daniel & Markus L. Schmid. (2013). Regular and context-free pattern languages over small alphabets. Theoretical Computer Science. 518. 80–95. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact