Alexandru Popa

507 total citations
37 papers, 151 citations indexed

About

Alexandru Popa is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Alexandru Popa has authored 37 papers receiving a total of 151 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Computational Theory and Mathematics, 13 papers in Computer Networks and Communications and 9 papers in Artificial Intelligence. Recurrent topics in Alexandru Popa's work include Advanced Graph Theory Research (12 papers), Complexity and Algorithms in Graphs (8 papers) and Algorithms and Data Compression (6 papers). Alexandru Popa is often cited by papers focused on Advanced Graph Theory Research (12 papers), Complexity and Algorithms in Graphs (8 papers) and Algorithms and Data Compression (6 papers). Alexandru Popa collaborates with scholars based in Romania, Finland and United Kingdom. Alexandru Popa's co-authors include Guillaume Ducoffe, David Coudert, Raphaël Clifford, Eugen Czeizler, Patric R. J. Östergård, Péter Bíró, Sebastian Ordyniak, Anna Kuosmanen, Veli Mäkinen and Moshe Lewenstein and has published in prestigious journals such as Mathematics of Computation, Annals of Operations Research and Journal of Network and Computer Applications.

In The Last Decade

Alexandru Popa

28 papers receiving 146 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Alexandru Popa Romania 7 65 53 34 30 23 37 151
Chang‐An Zhao China 8 33 0.5× 27 0.5× 86 2.5× 167 5.6× 5 0.2× 40 196
Frank Kammer Germany 7 57 0.9× 51 1.0× 6 0.2× 13 0.4× 6 0.3× 21 110
Dimitrios M. Thilikos France 7 127 2.0× 36 0.7× 5 0.1× 18 0.6× 5 0.2× 25 149
Carlos Aguilar Melchor France 6 33 0.5× 32 0.6× 53 1.6× 147 4.9× 4 0.2× 8 176
Abhishek Bhowmick United States 6 11 0.2× 141 2.7× 31 0.9× 34 1.1× 9 0.4× 15 190
J. B. Johnston United States 7 59 0.9× 55 1.0× 29 0.9× 104 3.5× 11 0.5× 25 213
Toshiki Saitoh Japan 8 80 1.2× 40 0.8× 2 0.1× 48 1.6× 16 0.7× 26 129
Manfred Kunde Germany 8 42 0.6× 112 2.1× 4 0.1× 19 0.6× 12 0.5× 17 143
Luı́s Cruz-Filipe Denmark 7 52 0.8× 42 0.8× 10 0.3× 109 3.6× 5 0.2× 36 129
Frank Gurski Germany 9 144 2.2× 72 1.4× 5 0.1× 14 0.5× 4 0.2× 26 186

Countries citing papers authored by Alexandru Popa

Since Specialization
Citations

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

Fields of papers citing papers by Alexandru Popa

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Alexandru Popa

This figure shows the co-authorship network connecting the top 25 collaborators of Alexandru Popa. A scholar is included among the top collaborators of Alexandru Popa 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 Alexandru Popa. Alexandru Popa is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Dondi, Riccardo & Alexandru Popa. (2024). Exact and approximation algorithms for covering timeline in temporal graphs. Annals of Operations Research. 351(1). 609–628.
3.
Popa, Alexandru, et al.. (2021). LMAAS-IoT: Lightweight multi-factor authentication and authorization scheme for real-time data access in IoT cloud-based environment. Journal of Network and Computer Applications. 192. 103177–103177. 36 indexed citations
4.
Popa, Alexandru, et al.. (2021). UNHIDING FORESTED LANDSCAPES. THE ARCHAEOLOGICAL INDEX OF SOUTH-EASTERN CARPATHIANS. Journal of Ancient History and Archeology. 8(2). 1 indexed citations
6.
Bíró, Péter, et al.. (2020). IP solutions for international kidney exchange programmes. Central European Journal of Operations Research. 29(2). 403–423. 11 indexed citations
7.
Anta, Antonio Fernández, et al.. (2020). Tractable low-delay atomic memory. Distributed Computing. 34(1). 33–58. 1 indexed citations
8.
Popa, Alexandru, et al.. (2020). Analyzing of LAM-CIoT: Lightweight Authentication Mechanism in Cloud-based IoT Environment. 1837–1844. 4 indexed citations
9.
Ducoffe, Guillaume & Alexandru Popa. (2020). The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes. Discrete Applied Mathematics. 291. 201–222. 4 indexed citations
10.
Popa, Alexandru, et al.. (2019). The Graceful Chromatic Number for Some Particular Classes of Graphs. 109–115. 8 indexed citations
11.
Coudert, David, Guillaume Ducoffe, & Alexandru Popa. (2019). Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs. ACM Transactions on Algorithms. 15(3). 1–57. 22 indexed citations
12.
Anta, Antonio Fernández, Nicolas Nicolaou, & Alexandru Popa. (2016). Making "Fast" Atomic Operations Computationally Tractable. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations
13.
Adamaszek, Anna & Alexandru Popa. (2016). Approximation and hardness results for the maximum edge q-coloring problem. Journal of Discrete Algorithms. 38-41. 1–8.
14.
Kaski, Petteri, Patric R. J. Östergård, & Alexandru Popa. (2015). Enumeration of Steiner triple systems with subsystems. Mathematics of Computation. 84(296). 3051–3067. 2 indexed citations
15.
Popa, Alexandru. (2014). Better lower and upper bounds for the minimum rainbow subgraph problem. Theoretical Computer Science. 543. 1–8. 4 indexed citations
16.
Czeizler, Eugen & Alexandru Popa. (2013). Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly. Theoretical Computer Science. 499. 23–37. 8 indexed citations
17.
Östergård, Patric R. J., et al.. (2013). The Mendelsohn Triple Systems of Order 13. Journal of Combinatorial Designs. 22(1). 1–11. 2 indexed citations
18.
Popa, Alexandru, et al.. (2012). Hardness and Approximation of the Asynchronous Border Minimization Problem - (Extended Abstract).. 164–176.
19.
Clifford, Raphaël, et al.. (2011). Combinatorial Pattern Matching (CPM). 3 indexed citations
20.
Clifford, Raphaël & Alexandru Popa. (2010). In)approximability results for pattern matching problems. 52–62. 1 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

Rankless by CCL
2026