Alexandru Popa

Cited by

	All	Since 2018
Citations	461	314
h-index	12	8
i10-index	16	7

20082009201020112012201320142015201620172018201920202021202220236 1 1 4 18 14 27 32 18 19 38 35 57 63 85 31

Public access

View all

9 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Guillaume DucoffeUniversity of Bucharest - Faculty of Mathematics and Informatics, and ICIVerified email at ici.ro
Raphael CliffordUniversity of BristolVerified email at cs.bris.ac.uk
Radu Stefan MincuUniversity of BucharestVerified email at fmi.unibuc.ro
Marinescu-Ghemeci R.University of BucharestVerified email at fmi.unibuc.ro
Anna AdamaszekPostdoc, University of CopenhagenVerified email at di.ku.dk
Patric ÖstergårdVerified email at aalto.fi
Eugen CzeizlerUniversity Researcher, University of HelsinkiVerified email at helsinki.fi
Ahmed AlsahlaniPhD. in Computer Science, University of BucharestVerified email at drd.unibuc.ro
Gheorghe StefanescuProfessor of Computer Science, University of BucharestVerified email at fmi.unibuc.ro
Moshe LewensteinProfessor of Computer Science, Bar-Ilan UniversityVerified email at cs.biu.ac.il
David CoudertINRIAVerified email at inria.fr
Sebastian OrdyniakUniversity of LeedsVerified email at sheffield.ac.uk
Veli MäkinenProfessor of Computer Science, University of HelsinkiVerified email at helsinki.fi
Travis GagieAssociate Professor at Dalhousie UniversityVerified email at dal.ca
aram harrowPhysics, MITVerified email at mit.edu
Benjamin SachThe Alan Turing InstituteVerified email at turing.ac.uk
Liviu P. DinuProfessor, University of Bucharest, Dept. of Computer Science,Verified email at fmi.unibuc.ro
Antonio Fernández AntaIMDEA Networks Institute, Madrid, SpainVerified email at imdea.org
Nicolas NicolaouAlgolysis LtdVerified email at algolysis.com
Guillaume BlinFull Professor of Computer Science, Université de Bordeaux, FranceVerified email at labri.fr

Alexandru Popa

Professor, University of Bucharest

Verified email at fmi.unibuc.ro - Homepage

Combinatorial Optimization Graph Theory Bioinformatics Artificial Intelligence Operations Research


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs D Coudert, G Ducoffe, A Popa ACM Transactions on Algorithms (TALG) 15 (3), 1-57, 2019	62	2019
Extremal graphs with respect to the modified first Zagreb connection index G Ducoffe, R Marinescu-Ghemeci, C Obreja, A Popa, RM Tache 2018 20th International Symposium on Symbolic and Numeric Algorithms for …, 2018	28	2018
LMAAS-IoT: Lightweight multi-factor authentication and authorization scheme for real-time data access in IoT cloud-based environment AYF Alsahlani, A Popa Journal of Network and Computer Applications 192, 103177, 2021	24	2021
Maximum subset intersection R Clifford, A Popa Information Processing Letters 111 (7), 323-325, 2011	24	2011
High-level Structured Interactive Programs with Registers and Voices. A Popa, A Sofronia, G Stefanescu J. Univers. Comput. Sci. 13 (11), 1722-1754, 2007	20	2007
IP solutions for international kidney exchange programmes RS Mincu, P Biró, M Gyetvai, A Popa, U Verma Central European Journal of Operations Research 29, 403-423, 2021	17	2021
Explaining a weighted DAG with few paths for solving genome-guided multi-assembly AI Tomescu, T Gagie, A Popa, R Rizzi, A Kuosmanen, V Mäkinen IEEE/ACM transactions on computational biology and bioinformatics 12 (6 …, 2015	17	2015
On the (di) graphs with (directed) proper connection number two G Ducoffe, R Marinescu-Ghemeci, A Popa Electronic Notes in Discrete Mathematics 62, 237-242, 2017	16	2017
Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly E Czeizler, A Popa Theoretical Computer Science 499, 23-37, 2013	15	2013
Generalised matching R Clifford, AW Harrow, A Popa, B Sach String Processing and Information Retrieval: 16th International Symposium …, 2009	14	2009
On the closest string via rank distance LP Dinu, A Popa Combinatorial Pattern Matching: 23rd Annual Symposium, CPM 2012, Helsinki …, 2012	13	2012
Approximation and Hardness Results for the Maximum Edge q-coloring Problem A Adamaszek, A Popa Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju …, 2010	13	2010
Restricted Common Superstring and Restricted Common Supersequence. R Clifford, Z Gotthilf, M Lewenstein, A Popa CPM, 467-478, 2011	12	2011
A parameterized study of maximum generalized pattern matching problems S Ordyniak, A Popa Algorithmica 75, 1-26, 2016	10	2016
Algorithmic and hardness results for the colorful components problems A Adamaszek, A Popa Algorithmica 73, 371-388, 2015	10	2015
Synthesizing Minimal Tile Sets for Complex Patterns in the Framework of Patterned DNA Self-Assembly. E Czeizler, A Popa DNA 18, 58-72, 2012	10	2012
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes G Ducoffe, A Popa Discrete Applied Mathematics 291, 201-222, 2021	9	2021
Min-sum 2-paths problems T Fenner, O Lachish, A Popa Theory of Computing Systems 58, 94-110, 2016	9	2016
Enumeration of Steiner triple systems with subsystems P Kaski, P Östergård, A Popa Mathematics of Computation 84 (296), 3051-3067, 2015	9	2015
Modelling the power supply network–hardness and approximation A Popa Theory and Applications of Models of Computation: 10th International …, 2013	9	2013

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

Follow

Cited by

Co-authors