Florin Manea - Google Scholar

Cited by

	All	Since 2015
Citations	1177	608
h-index	19	12
i10-index	36	19

140

105

20052006200720082009201020112012201320142015201620172018201920204 10 42 24 84 71 102 88 44 92 102 78 118 100 132 77

Co-authors

Victor MitranaProfessor, University of BucharestVerified email at fmi.unibuc.ro
Dirk NowotkaProfessor für Informatik, Christian-Albrechts-Universität zu KielVerified email at zs.uni-kiel.de
Robert MercasLoughborough UniversityVerified email at lboro.ac.uk
Carlos Martin-VideProfessor, Rovira i Virgili UniversityVerified email at urv.cat
Paweł GawrychowskiUniversity of WrocławVerified email at cs.uni.wroc.pl
Joel DayLoughborough UniversityVerified email at lboro.ac.uk
Markus L. SchmidPost-Doc Researcher, Theoretical Computer Science, Humboldt University BerlinVerified email at mlschmid.de
José M. SempereValencian Research Institute for Artificial Intelligence - Universidad Politécnica de ValenciaVerified email at dsic.upv.es
Henning FernauProfessor für Informatik, Universität TrierVerified email at uni-trier.de
Liviu P. DinuProfessor, University of Bucharest, Dept. of Computer Science,Verified email at fmi.unibuc.ro
Thorsten EhlersGerman Aerospace CenterVerified email at dlr.de
Paolo BottoniProfessor of Computer Science - Sapienza RomaVerified email at di.uniroma1.it
Ion PetreProfessor of Mathematics, University of Turku, FinlandVerified email at utu.fi
Radu GramatoviciUniversity of BucharestVerified email at fmi.unibuc.ro
James CurrieMathematics and Statistics, University of WinnipegVerified email at uwinnipeg.ca
Paolo BottoniProfessor of Computer Science, Sapienza University of RomeVerified email at di.uniroma1.it
Dmitry KosolobovUral Federal University, Ekaterinburg, RussiaVerified email at urfu.ru
Dominik D. FreydenbergerLoughborough University, Loughborough, UKVerified email at ddfy.de
Juhani KarhumäkiProfessor of discrete mathematics, University of TurkuVerified email at utu.fi
Wojciech RytterWarsaw UniversityVerified email at mimuw.edu.pl

Florin Manea

Göttingen University

Verified email at informatik.uni-goettingen.de - Homepage

Theoretical Computer Science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
An efficient approach for the rank aggregation problem LP Dinu, F Manea Theoretical Computer Science 359 (1-3), 455-461, 2006	55	2006
On the size complexity of universal accepting hybrid networks of evolutionary processors F Manea, C Martin-Vide, V Mitrana Mathematical Structures in Computer Science 17 (4), 753, 2007	46	2007
Accepting networks of splicing processors: Complexity results F Manea, C Martin-Vide, V Mitrana Theoretical Computer Science 371 (1-2), 72-82, 2007	44	2007
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size F Manea, V Mitrana Information Processing Letters 103 (3), 112-118, 2007	43	2007
Freeness of partial words F Manea, R Mercaş Theoretical Computer Science 389 (1-2), 265-277, 2007	42	2007
A new characterization for NP, P, and PSPACE with accepting hybrid networks of evolutionary processors F Manea, M Margenstern, V Mitrana, M Perez-Jimenez Theory of Computing Systems 46 (2), 174-192, 2010	35*	2010
On some algorithmic problems regarding the hairpin completion F Manea, C Martín-Vide, V Mitrana Discrete Applied Mathematics 157 (9), 2143-2152, 2009	35	2009
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction F Manea, V Mitrana, T Yokomori Theoretical Computer Science 410 (4-5), 417-425, 2009	34	2009
Tighter bounds and optimal algorithms for all maximal α-gapped repeats and palindromes P Gawrychowski, I Tomohiro, S Inenaga, D Köppl, F Manea Theory of Computing Systems 62 (1), 162-191, 2018	32*	2018
Hairpin completion versus hairpin reduction F Manea, V Mitrana Conference on Computability in Europe, 532-541, 2007	32	2007
All NP-problems can be solved in polynomial time by accepting networks of splicing processors of constant size F Manea, C Martin-Vide, V Mitrana International Workshop on DNA-Based Computers, 47-57, 2006	30	2006
Pattern matching with variables: Fast algorithms and new hardness results H Fernau, F Manea, R Mercas, ML Schmid 32nd International Symposium on Theoretical Aspects of Computer Science …, 2015	28	2015
Accepting networks of evolutionary word and picture processors: A survey F Manea, C Martín-Vide, V Mitrana Scientific Applications of Language Methods, 525-561, 2011	28	2011
Testing generalised freeness of words P Gawrychowski, F Manea, D Nowotka 31st International Symposium on Theoretical Aspects of Computer Science …, 2014	26	2014
Solving 3CNF-SAT and HPP in linear time using WWW F Manea, C Martín-Vide, V Mitrana International Conference on Machines, Computations, and Universality, 269-280, 2004	26	2004
Finding pseudo-repetitions P Gawrychowski, F Manea, R Mercas, D Nowotka, C Tiseanu LIPIcs-Leibniz International Proceedings in Informatics 20, 257-268, 2013	25	2013
Accepting Networks of Evolutionary Processors with Filtered Connections. C Dragoi, F Manea, V Mitrana J. UCS 13 (11), 1598-1614, 2007	23	2007
Fine and Wilf’s theorem and pseudo-repetitions F Manea, R Mercaş, D Nowotka International Symposium on Mathematical Foundations of Computer Science, 668-680, 2012	21	2012
Bounded hairpin completion M Ito, P Leupold, F Manea, V Mitrana Information and Computation 209 (3), 471-485, 2011	19	2011
Some remarks on the hairpin completion F Manea, V Mitrana, T Yokomori International Journal of Foundations of Computer Science 21 (05), 859-872, 2010	17	2010

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors