Florín Manea

1.3k total citations
73 papers, 331 citations indexed

About

Florín Manea is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Florín Manea has authored 73 papers receiving a total of 331 indexed citations (citations by other indexed papers that have themselves been cited), including 51 papers in Computational Theory and Mathematics, 48 papers in Artificial Intelligence and 43 papers in Molecular Biology. Recurrent topics in Florín Manea's work include DNA and Biological Computing (43 papers), semigroups and automata theory (39 papers) and Algorithms and Data Compression (37 papers). Florín Manea is often cited by papers focused on DNA and Biological Computing (43 papers), semigroups and automata theory (39 papers) and Algorithms and Data Compression (37 papers). Florín Manea collaborates with scholars based in Germany, Romania and Spain. Florín Manea's co-authors include Víctor Mitrana, Carlos Martı́n-Vide, Robert Mercaş, Liviu P. Dinu, Jürgen Dassow, Dirk Nowotka, Paweł Gawrychowski, Takashi Yokomori, Maurice Margenstern and Mario J. Pérez-Jímenez and has published in prestigious journals such as SHILAP Revista de lepidopterología, Information Sciences and Theoretical Computer Science.

In The Last Decade

Florín Manea

63 papers receiving 317 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Florín Manea Germany	10	235	182	176	61	39	73	331
Jetty Kleijn Netherlands	9	102 0.4×	135 0.7×	73 0.4×	40 0.7×	7 0.2×	56	264
Francesca Levi Italy	9	132 0.6×	102 0.6×	132 0.8×	30 0.5×	7 0.2×	26	302
Thomas Helmuth United States	13	186 0.8×	45 0.2×	529 3.0×	8 0.1×	61 1.6×	44	569
Gheorghe Ştefănescu Romania	9	35 0.1×	82 0.5×	100 0.6×	13 0.2×	41 1.1×	30	214
Viliam Geffert Slovakia	11	173 0.7×	298 1.6×	251 1.4×	13 0.2×	7 0.2×	46	350
Anna Labella Italy	8	71 0.3×	88 0.5×	85 0.5×	31 0.5×	2 0.1×	36	177
Alexander Meduna Czechia	11	364 1.5×	386 2.1×	360 2.0×	19 0.3×		101	456
Simone Tini Italy	10	68 0.3×	193 1.1×	162 0.9×	24 0.4×	1 0.0×	54	275
Rani Siromoney France	14	466 2.0×	373 2.0×	269 1.5×	237 3.9×	4 0.1×	50	661
Dora Giammarresi Italy	10	197 0.8×	206 1.1×	177 1.0×	16 0.3×		27	290

Countries citing papers authored by Florín Manea

Since Specialization

Citations

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

Fields of papers citing papers by Florín Manea

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Florín Manea. 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 Florín Manea. The network helps show where Florín Manea may publish in the future.

Co-authorship network of co-authors of Florín Manea

This figure shows the co-authorship network connecting the top 25 collaborators of Florín Manea. A scholar is included among the top collaborators of Florín Manea 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 Florín Manea. Florín Manea 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

Manea, Florín, et al.. (2021). The Edit Distance to k-Subsequence Universality. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 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

Currie, James D., et al.. (2018). Unary patterns under permutations. Theoretical Computer Science. 743. 72–82.

Gawrychowski, Paweł, et al.. (2017). Longest Gapped Repeats and Palindromes. Discrete Mathematics & Theoretical Computer Science. Vol. 19 no. 4, FCT '15(special issue FCT'15). 3 indexed citations

Manea, Florín, et al.. (2017). Longest Gapped Repeats and Palindromes. Discrete Mathematics & Theoretical Computer Science. 19. 2 indexed citations

Petre, Ion, et al.. (2017). Unveiling Dynamics and Complexity. Lecture notes in computer science. 5 indexed citations

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

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

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

10.

Manea, Florín, et al.. (2014). Prefix–suffix duplication. Journal of Computer and System Sciences. 80(7). 1254–1265. 3 indexed citations

11.

Dassow, Jürgen, et al.. (2012). On external contextual grammars with subregular selection languages. Theoretical Computer Science. 449. 64–73. 5 indexed citations

12.

Manea, Florín, et al.. (2012). The hardness of counting full words compatible with partial words. Journal of Computer and System Sciences. 79(1). 7–22. 1 indexed citations

13.

Manea, Florín. (2012). Complexity results for deciding Networks of Evolutionary Processors. Theoretical Computer Science. 456. 65–79. 3 indexed citations

14.

Turaev, Sherzod, Jürgen Dassow, Florín Manea, & Mohd Hasan Selamat. (2012). Language classes generated by tree controlled grammars with bounded nonterminal complexity. Theoretical Computer Science. 449. 134–144. 1 indexed citations

15.

Manea, Florín. (2010). A series of algorithmic results related to the iterated hairpin completion. Theoretical Computer Science. 411(48). 4162–4178. 2 indexed citations

16.

Manea, Florín, Víctor Mitrana, & Takashi Yokomori. (2008). Two complementary operations inspired by the DNA hairpin formation: Completion and reduction. Theoretical Computer Science. 410(4-5). 417–425. 15 indexed citations

17.

Manea, Florín, Carlos Martı́n-Vide, & Víctor Mitrana. (2008). On some algorithmic problems regarding the hairpin completion. Discrete Applied Mathematics. 157(9). 2143–2152. 16 indexed citations

18.

Manea, Florín, et al.. (2006). Synchronized Shuffle on Backbones. Fundamenta Informaticae. 73(1). 191–202. 1 indexed citations

19.

Manea, Florín, Carlos Martı́n-Vide, & Víctor Mitrana. (2006). Accepting networks of splicing processors: Complexity results. Theoretical Computer Science. 371(1-2). 72–82. 18 indexed citations

20.

Dinu, Liviu P. & Florín Manea. (2006). An efficient approach for the rank aggregation problem. Theoretical Computer Science. 359(1-3). 455–461. 24 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