Robert Mercaş

475 total citations
32 papers, 127 citations indexed

About

Robert Mercaş is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Molecular Biology. According to data from OpenAlex, Robert Mercaş has authored 32 papers receiving a total of 127 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Artificial Intelligence, 28 papers in Computational Theory and Mathematics and 21 papers in Molecular Biology. Recurrent topics in Robert Mercaş's work include semigroups and automata theory (28 papers), Algorithms and Data Compression (25 papers) and DNA and Biological Computing (19 papers). Robert Mercaş is often cited by papers focused on semigroups and automata theory (28 papers), Algorithms and Data Compression (25 papers) and DNA and Biological Computing (19 papers). Robert Mercaş collaborates with scholars based in Germany, United States and United Kingdom. Robert Mercaş's co-authors include Florín Manea, F. Blanchet-Sadri, Solon P. Pissis, Dirk Nowotka, Markus L. Schmid, Roberto Grossi, Henning Fernau, Costas S. Iliopoulos, Nadia Pisanti and Maxime Crochemore and has published in prestigious journals such as Information Sciences, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Robert Mercaş

26 papers receiving 123 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Robert Mercaş Germany	7	96	95	81	7	3	32	127
Rogério Reis Portugal	7	109 1.1×	129 1.4×	72 0.9×	7 1.0×	8 2.7×	55	167
Shinnosuke Seki Japan	8	82 0.9×	100 1.1×	102 1.3×	5 0.7×	8 2.7×	43	155
Marcella Anselmo Italy	8	81 0.8×	94 1.0×	93 1.1×	2 0.3×	2 0.7×	28	123
Nicoletta Cocco Italy	7	100 1.0×	98 1.0×	63 0.8×	7 1.0×	10 3.3×	18	183
Cezar Câmpeanu Canada	8	172 1.8×	175 1.8×	93 1.1×	16 2.3×	8 2.7×	28	211
Paola Quaglia Italy	7	47 0.5×	60 0.6×	80 1.0×	10 1.4×	14 4.7×	18	136
Radu Mardare Denmark	8	137 1.4×	139 1.5×	30 0.4×	6 0.9×	12 4.0×	56	195
Martin Plátek Czechia	8	124 1.3×	86 0.9×	82 1.0×	2 0.3×	7 2.3×	40	163
Fatima Zohra Smaili Saudi Arabia	4	85 0.9×	22 0.2×	130 1.6×	14 2.0×	5 1.7×	4	192
Dieter Hofbauer Germany	6	122 1.3×	109 1.1×	26 0.3×	5 0.7×	5 1.7×	16	136

Countries citing papers authored by Robert Mercaş

Since Specialization

Citations

This map shows the geographic impact of Robert Mercaş'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 Robert Mercaş with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert Mercaş more than expected).

Fields of papers citing papers by Robert Mercaş

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Robert Mercaş. 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 Robert Mercaş. The network helps show where Robert Mercaş may publish in the future.

Co-authorship network of co-authors of Robert Mercaş

This figure shows the co-authorship network connecting the top 25 collaborators of Robert Mercaş. A scholar is included among the top collaborators of Robert Mercaş 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 Robert Mercaş. Robert Mercaş 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

Mercaş, Robert, et al.. (2024). Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications. Electronic Proceedings in Theoretical Computer Science. 407. 1–4.

Mercaş, Robert, et al.. (2021). Reducing the ambiguity of Parikh matrices. Theoretical Computer Science. 860. 23–40. 2 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

Gawrychowski, Paweł, Florín Manea, Robert Mercaş, & Dirk Nowotka. (2018). Hide and seek with repetitions. Journal of Computer and System Sciences. 101. 42–67.

Mercaş, Robert. (2016). On the aperiodic avoidability of binary patterns with variables and reversals. Theoretical Computer Science. 682. 180–189. 1 indexed citations

Crochemore, Maxime, et al.. (2016). Counting maximal-exponent factors in words. Theoretical Computer Science. 658. 27–35.

Crochemore, Maxime & Robert Mercaş. (2016). On the density of Lyndon roots in factors. Theoretical Computer Science. 656. 234–240. 1 indexed citations

Manea, Florín, et al.. (2015). k-Abelian pattern matching. Journal of Discrete Algorithms. 34. 37–48. 3 indexed citations

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

10.

Manea, Florín, et al.. (2014). An algorithmic toolbox for periodic partial words. Discrete Applied Mathematics. 179. 174–192. 1 indexed citations

11.

Manea, Florín, et al.. (2014). The pseudopalindromic completion of regular languages. Information and Computation. 239. 222–236. 1 indexed citations

12.

Blanchet-Sadri, F., et al.. (2012). Periodicity algorithms and a conjecture on overlaps in partial words. Theoretical Computer Science. 443. 35–45. 2 indexed citations

13.

Blanchet-Sadri, F. & Robert Mercaş. (2012). The three-squares lemma for partial words with one hole. Theoretical Computer Science. 428. 1–9. 1 indexed citations

14.

Blanchet-Sadri, F., et al.. (2011). Avoiding abelian squares in partial words. Journal of Combinatorial Theory Series A. 119(1). 257–270. 6 indexed citations

15.

Blanchet-Sadri, F., et al.. (2010). Avoidable binary patterns in partial words. Acta Informatica. 48(1). 25–41. 5 indexed citations

16.

Bel-Enguix, Gemma, et al.. (2009). Networks of Evolutionary Processors as Natural Parsers.. 619–625.

17.

Blanchet-Sadri, F., et al.. (2008). Counting Distinct Squares in Partial Words.. 13(1). 122–133. 6 indexed citations

18.

Blanchet-Sadri, F., et al.. (2008). A generalization of Thue freeness for partial words. Theoretical Computer Science. 410(8-10). 793–800. 10 indexed citations

19.

Blanchet-Sadri, F., et al.. (2008). Unbordered partial words. Discrete Applied Mathematics. 157(5). 890–900. 3 indexed citations

20.

Manea, Florín & Robert Mercaş. (2007). Freeness of partial words. Theoretical Computer Science. 389(1-2). 265–277. 15 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