J. D. Day, P. Fleischmann, F. Manea, D. Nowotka (2020): Equations Enforcing
Repetitions under Permutations, Discrete Applied Mathematics, vol. 285, pg. 61-78, Elsevier.
H. Fernau, F. Manea, R. Mercas, M.Schmid (2020): Pattern Matching with Variables: Efficient Algorithms and Complexity Results, ACM Transactions on Computation Theory, vol. 12 (1), pg. 1-37, ACM.
T. Biedl, A. Biniaz, R. Cummings, A. Lubiw, F. Manea, D. Nowotka, J. Shallit (2019): Rollercoasters: Long Sequences without Short Runs, SIAM Journal on Discrete Mathematics, vol. 33 (2), pg. 845-861, SIAM.
P. Gawrychowski, F. Manea, R. Mercas, D. Nowotka (2019): Hide and seek with repetitions, Journal of Computer and System Sciences, vol. 101, pg.42-67, Elsevier.
F. Manea, D. Nowotka, M. L. Schmid (2018): On the Complexity of Solving Restricted Word Equations, International Journal of Foundations of Computer Science, vol. 29, no. 5, pg. 893-909, World Scientific.
J. Currie, F. Manea, D. Nowotka, K. Reshadi (2018): Unary patterns under permutations, Theoretical Computer Science, vol. 743, pg. 72-82, Elsevier.
H. Fernau, F. Manea, R. Mercas, M. L. Schmid (2018): Revisiting Shinohara’s Algorithm for Computing Descriptive Patterns, Theoretical Computer Science, vol. 733, pg. 44–54, Elsevier.
P. Gawrychowski, T. I, S. Inenaga, D. Köppl, F. Manea (2018): Tighter Bounds and Optimal Algorithms for all Maximal α-gapped Repeats and Palindromes, Theory of Computing Systems, vol. 62(1), pg. 162–191, Springer.
M. Dumitran, P. Gawrychowski, F. Manea (2017): Longest Gapped Repeats and Palindromes, Discrete Mathematics & Theoretical Computer Science, vol. 19(4), pg. 1–32.
F. Manea, M. Müller, D. Nowotka, S. Seki (2017): The extended equation of Lyndon and Schützenberger, Journal of Computer and System Sciences, vol. 85, pg. 132–167, Elsevier.
F. Manea, M. Müller, D. Nowotka (2015): Cubic Patterns with Permutations, Journal of Computer and System Sciences, vol. 81, pg. 1298–1310, Elsevier.
F. Manea, C. Martin-Vide, V. Mitrana (2015): Hairpin Lengthening: Language Theoretic and Algorithmic Results, Journal of Logic and Computation, vol. 25(4), pg. 987-1009, Oxford University Press.
T. Ehlers, F. Manea, R. Mercas, D. Nowotka (2015): k-Abelian Pattern Matching, Journal of Discrete Algorithms, vol. 34, pg. 37–48, Elsevier.
M. Dumitran, J. Gil, F. Manea, V. Mitrana (2015): Bounded Duplication Languages: Language Theoretic and Algorithmic Results, International Journal of Foundations of Computer Science, vol. 26, no. 7, pg. 933–952, World Scientific.
J. Dassow, F. Manea, B. Truthe (2015): On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters, Fundamenta Informaticae, vol. 136, no. 1–2, pg. 1–35, IOS Press.
F. Manea, R. Mercas, C. Tiseanu (2014): An Algorithmic Toolbox for Periodic Partial Words, Discrete Applied Mathematics, vol. 179, pg. 174–192, Elsevier.
S. Fazekas, F. Manea, R. Mercas, K. Shikishima-Tsuji (2014): The Pseudopalindromic Completion of Regular Languages, Information and Computation, vol. 239, pg. 222–236, Elsevier.
J Dassow, F. Manea, M. Müller, R. Mercas (2014): Inner Palindromic Closure, International Journal of Foundations of Computer Science, vol. 25, no. 8, pg. 1049–1064, World Scientific.
J. Dassow, F. Manea, R. Mercas (2014): Regular Languages of Partial Words, Information Sciences, vol. 268, pg. 290–304, Elsevier.
F. Manea, B. Truthe (2014): Accepting Networks of Evolutionary Processors with Subregular Filters, Theory of Computing Systems, vol. 55, no. 1, pg. 84–109, Springer.
J. Garcia-Lopez, F. Manea, V. Mitrana (2014): Prefix-Suffix Duplication, Journal of Computer and System Sciences, vol. 80, no. 7, pg. 1254–1265, Elsevier.
L.P. Dinu, R. Gramatovici, F. Manea (2014): Syllabic languages and go-through automata, Fundamenta Informaticae, vol. 131, no. 3-4, pg. 409–424, IOS Press.
J. Dassow, F. Manea, B. Truthe (2013): Networks of evolutionary processors - The power of subregular filters, Acta Informatica, vol. 50, no. 1, pg. 41 – 75, Springer.
F. Manea, C. Tiseanu (2013): The Hardness of Counting Full Words Compatible with Partial Words, Journal of Computer and System Sciences, vol. 79, pg. 7–22, Elsevier.
J. Dassow, F. Manea, B. Truthe (2012): On Subregular Selection Languages in Internal Contextual Grammars, Journal of Automata, Languages and Combinatorics, vol. 17, no. 2–4, pg. 145–164 , Otto-von-Guericke Universitaet Magdeburg.
J. Dassow, F. Manea, B. Truthe (2012): Networks of Evolutionary Processors: Computationally Complete Normal Forms, Natural Computing, vol. 11, no. 4, pg. 595–607, Springer.
J. Dassow, F. Manea, B. Truthe (2012): Generating networks of splicing processors, RAIRO - Theoretical Informatics and Applications, vol. 46, no. 4, pg. 547–572, Cambridge University Press.
F. Manea (2012): Complexity Results for Deciding Networks of Evolutionary Processors, Theoretical Computer Science, vol. 456, pg. 65–79, Elsevier.
J. Dassow, F. Manea, B. Truthe (2012): On Contextual Grammars with Subregular Selection Languages, Theoretical Computer Science,vol. 449, pg. 64–73, Elsevier.
S. Turaev, J. Dassow, F. Manea, M.H. Selamat (2012): Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity, Theoretical Computer Science, vol. 449, pg. 134–144, Elsevier.
M. Ito, P. Leupold, F. Manea, V. Mitrana (2011): Bounded Hairpin Completion, Information and Computation, vol. 209, no. 3, pg. 471–485, Elsevier.
P. Bottoni, A. Labella, F. Manea, V. Mitrana, I. Petre, J. M. Sempere (2011): Complexity-Preserving Simulations Among Three Variants of Accepting Networks of Evolutionary Processors, Natural Computing, vol. 10, no. 1, pg. 429–445, Springer.
R. Loos, F. Manea, V. Mitrana (2010): Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections, Journal of Automata, Languages and Combinatorics, vol. 15, no. 1–2, pg. 155–174, Otto-von-Guericke Universitaet Magdeburg.
F. Manea (2010): A Series of Algorithmic Results Related to the Iterated Hairpin Completion, Theoretical Computer Science, vol. 411, no. 48, pg. 4162-4178, Elsevier.
F. Manea, V. Mitrana, T. Yokomori (2010): Some Remarks on the Hairpin Completion, International Journal of Foundations of Computer Science, vol. 21, no. 5, pg. 859–872, World Scientific.
F. Manea, M. Margenstern, V. Mitrana, M.J. Perez-Jimenez (2010): A New Characterization of NP, P, and PSPACE With Accepting Hybrid Networks of Evolutionary Processors, Theory of Computing Systems, vol. 46, no. 2, pg. 174–192, Springer.
R. Loos, F. Manea, V. Mitrana (2010): Small Universal Accepting Networks of Evolutionary Processors, Acta Informatica, vol. 47, no. 2, pg. 133–146, Springer.
F. Manea, V. Mitrana, T. Yokomori (2009): Two complementary Operations Inspired by the DNA Hairpin Formation: Completion and Reduction, Theoretical Computer Science, vol. 410, no. 4-5, pg. 417-425, Elsevier.
R. Loos, F. Manea, V. Mitrana (2009) On Small, Reduced and Fast Accepting Networks of Splicing Processors, Theoretical Computer Science, vol. 410, no. 4-5, pg. 406-416, Elsevier.
P. Leupold, R. Loos, F. Manea (2009): Complexity Aspects of the Recognition of Regular and Context-Free Languages by Accepting Hybrid Networks of Evolutionary Processors, Romanian Journal of Information Science and Technology, Vol. 12, no. 2, pg. 219–233, Romanian Academy Publishing House.
F. Manea, C. Martin-Vide, V. Mitrana (2009): On Some Algorithmic Problems Regarding the Hairpin Completion, Discrete Applied Mathematics, vol. 157, no. 9, pg. 2143-2152, Elsevier.
C. Dragoi, F. Manea (2008) On the Descriptional Complexity of Accepting Networks of Evolutionary Processors With Filtered Connections, International Journal of Foundations of Computer Science, vol. 19, no. 5, pg. 1113–1132, World Scientific.
C. Dragoi, F. Manea, V. Mitrana (2007): Accepting Networks of Evolutionary Processors With Filtered Connections, Journal of Universal Computer Science, vol. 13, no. 11, pg. 1598–1614, Springer.
F. Manea, R. Mercas (2007): Freeness of partial words, Theoretical Computer Science, Vol. 389, no.1-2, pg. 265–277, Elsevier.
F. Manea, C. Martin-Vide, V. Mitrana (2007): Accepting Network of Splicing Processors: Complexity Results, Theoretical Computer Science, Vol. 371, no. 1-2, pg. 72–82, Elsevier. Erratum: Theoretical Computer Science Vol. 378, no.1, pg. 131.
F. Manea, C. Martin-Vide, V. Mitrana (2007) On the Size Complexity of Universal Accepting Hybrid Networks of Evolutionary Processors, Mathematical Structures in Computer Science, Volume 17, no. 4, pg. 753–771, Cambridge University Press.
F. Manea (2007): On the Recognition of Context-Free Languages Using Accepting Hybrid Networks of Evolutionary Processors, International Journal of Computer Mathematics, Vol. 84, no. 3, pg. 273–285, Taylor and Francis.
F. Manea, V. Mitrana (2007): All NP-problems can be solved in Polynomial Time by Accepting Hybrid Networks of Evolutionary Processors of constant size, Information Processing Letters, Vol. 103, nr. 3, pg. 112–118, Elsevier.
F. Manea, C. Ploscaru (2007): A generalization of the Assignment Problem, and its application to the Rank Aggregation Problem, Fundamenta Informaticae, Vol. 81, nr. 4, pg. 459–471, IOS Press.
L. Dinu, F. Manea (2006): An efficient approach for the rank aggregation problem, Theoretical Computer Science, Vol. 359, no. 1-3, pg. 455–461, Elsevier.
F. Manea, V. Mitrana, D. Voinescu (2006): Synchronized shuffle on backbones, Fundamenta Informaticae, Vol. 73, no. 1-2, pg. 191–202 , IOS Press.
R. Gramatovici, F. Manea (2005): Parsing Local Internal Contextual Languages with Context-Free Choice, Fundamenta Informaticae, Vol. 64, no. 1-4, pg. 171–183, IOS Press.
F. Manea, C. Ploscaru (2005): Solving a Combinatorial Problem with Network Flows, Journal of Applied Mathematics and Computing, Vol. 17, no. 1-2, pg. 391–399, Ed. The Korean Society for Computational and Applied Mathematics/Springer.
