| 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 | 71 | 2019 |
| 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 | 41 | 2021 |
| 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 | 33 | 2018 |
| Maximum subset intersection R Clifford, A Popa Information Processing Letters 111 (7), 323-325, 2011 | 23 | 2011 |
| 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 | 21 | 2017 |
| High-level Structured Interactive Programs with Registers and Voices. A Popa, A Sofronia, G Stefanescu J. Univers. Comput. Sci. 13 (11), 1722-1754, 2007 | 21 | 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 | 20 | 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 | 20 | 2015 |
| 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 | 16 | 2010 |
| Generalised matching R Clifford, AW Harrow, A Popa, B Sach International Symposium on String Processing and Information Retrieval, 295-301, 2009 | 15 | 2009 |
| The graceful chromatic number for some particular classes of graphs R Mincu, C Obreja, A Popa 2019 21st International Symposium on Symbolic and Numeric Algorithms for …, 2019 | 13 | 2019 |
| 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 | 13 | 2013 |
| On the closest string via rank distance LP Dinu, A Popa Annual Symposium on Combinatorial Pattern Matching, 413-426, 2012 | 13 | 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 | 12 | 2021 |
| A parameterized study of maximum generalized pattern matching problems S Ordyniak, A Popa Algorithmica 75, 1-26, 2016 | 12 | 2016 |
| Min-sum 2-paths problems T Fenner, O Lachish, A Popa Theory of Computing Systems 58, 94-110, 2016 | 12 | 2016 |
| Restricted common superstring and restricted common supersequence R Clifford, Z Gotthilf, M Lewenstein, A Popa Combinatorial Pattern Matching: 22nd Annual Symposium, CPM 2011, Palermo …, 2011 | 12 | 2011 |
| Approximation and hardness results for the maximum edge q-coloring problem A Adamaszek, A Popa Journal of Discrete Algorithms 38, 1-8, 2016 | 11 | 2016 |
| Enumeration of Steiner triple systems with subsystems P Kaski, P Östergård, A Popa Mathematics of Computation 84 (296), 3051-3067, 2015 | 11 | 2015 |
| The Min-max Edge q-Coloring Problem T Larjomaa, A Popa Combinatorial Algorithms: 25th International Workshop, IWOCA 2014, Duluth …, 2015 | 11 | 2015 |
Guillaume DucoffeUniversity of Bucharest - Faculty of Mathematics and Informatics, and ICI在 ici.ro 的电子邮件经过验证
