| 2025 | CPM | Representing Paths in Digraphs. | Riccardo Dondi, Alexandru Popa |
| 2025 | TIME | Heuristics for Covering the Timeline in Temporal Graphs. | Riccardo Dondi, Rares-Ioan Mateiu, Alexandru Popa |
| 2024 | AAIM | Towards Understanding News Plagiarism: Theoretical and Experimental Analysis. | Ruxandra Marinescu-Ghemeci, Adrian Miclaus, Ionut Muraretu, Alexandru Popa |
| 2024 | INISTA | Optimizing Electric Vehicle Charging Infrastructure: A GNN-TSP Approach. | Alexandru Popa, Tiberiu Srbu |
| 2024 | SYNASC | A Study on the Topic of Crossing Minimisation. | Rares-Ioan Mateiu, Alexandru Popa |
| 2023 | COCOA | Algorithms on a Path Covering Problem with Applications in Transportation. | Ruxandra Marinescu-Ghemeci, Alexandru Popa, Tiberiu Srbu |
| 2023 | CPM | Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor. | Itai Boneh, Dvir Fried, Adrian Miclaus, Alexandru Popa |
| 2023 | CPM | String Factorization via Prefix Free Families. | Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, Yonathan Sadia |
| 2023 | IWOCA | Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms. | Riccardo Dondi, Alexandru Popa |
| 2023 | SPIRE | Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem. | Guillaume Blin, Alexandru Popa, Mathieu Raffinot, Raluca Uricaru |
| 2023 | WAOA | Approximating Maximum Edge 2-Coloring by Normalizing Graphs. | Tobias Mmke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze |
| 2021 | CPM | Efficient Algorithms for Counting Gapped Palindromes. | Andrei Popa, Alexandru Popa |
| 2021 | ICCCI | Polynomial Algorithms for Synthesizing Specific Classes of Optimal Block-Structured Processes. | Costin Badica, Alexandru Popa |
| 2021 | IWCMC | Analysis of lightweight and secure two-factor authentication scheme for wireless body area networks in health-care IoT. | Ahmed Yaser Fahad Alsahlani, Alexandru Popa |
| 2020 | MFCS | Complexity of Computing the Anti-Ramsey Numbers for Paths. | Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi |
| 2020 | SOFSEM | The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps. | Radu Stefan Mincu, Alexandru Popa |
| 2019 | KES | Some Remarks on the Translocation Distance. | Maria Constantin, Alexandru Popa |
| 2019 | SYNASC | The Graceful Chromatic Number for Some Particular Classes of Graphs. | Radu Stefan Mincu, Camelia Obreja, Alexandru Popa |
| 2019 | TAMC | Algorithms for Closest and Farthest String Problems via Rank Distance. | Liviu P. Dinu, Bogdan Dumitru, Alexandru Popa |
| 2019 | TAMC | An Output-Sensitive Algorithm for the Minimization of 2-Dimensional String Covers. | Alexandru Popa, Andrei Tanasescu |
| 2018 | COCOON | Heuristic Algorithms for the Min-Max Edge 2-Coloring Problem. | Radu Stefan Mincu, Alexandru Popa |
| 2018 | ISAAC | The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes. | Guillaume Ducoffe, Alexandru Popa |
| 2018 | ISAAC | The b-Matching Problem in Distance-Hereditary Graphs and Beyond. | Guillaume Ducoffe, Alexandru Popa |
| 2018 | SODA | Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. | David Coudert, Guillaume Ducoffe, Alexandru Popa |
| 2018 | SPIRE | Better Heuristic Algorithms for the Repetition Free LCS and Other Variants. | Radu Stefan Mincu, Alexandru Popa |
| 2018 | SYNASC | Extremal Graphs with Respect to the Modified First Zagreb Connection Index. | Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, Camelia Obreja, Alexandru Popa, Rozica Maria Tache |
| 2018 | SYNASC | Heuristic Algorithms for the Longest Filled Common Subsequence Problem. | Radu Stefan Mincu, Alexandru Popa |
| 2016 | IWOCA | SOBRA - Shielding Optimization for BRAchytherapy. | Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa |
| 2015 | OPODIS | Making "Fast" Atomic Operations Computationally Tractable. | Antonio Fernndez Anta, Nicolas C. Nicolaou, Alexandru Popa |
| 2015 | TAMC | Parameterized Complexity of Asynchronous Border Minimization. | Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa |
| 2014 | IWOCA | Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem. | Anna Adamaszek, Guillaume Blin, Alexandru Popa |
| 2014 | IWOCA | The Min-max Edge q-Coloring Problem. | Tommi Larjomaa, Alexandru Popa |
| 2014 | LATIN | Algorithmic and Hardness Results for the Colorful Components Problems. | Anna Adamaszek, Alexandru Popa |
| 2014 | SOFA | Hard as a Rock or Deformation Controlled? | Gheorghe Sima, Glavan Dan, Alexandru Popa, Elena Muncut |
| 2013 | TAMC | Modelling the Power Supply Network - Hardness and Approximation. | Alexandru Popa |
| 2013 | WAOA | Min-Sum 2-Paths Problems. | Trevor I. Fenner, Oded Lachish, Alexandru Popa |
| 2012 | COCOON | Approximating the Rainbow - Better Lower and Upper Bounds. | Alexandru Popa |
| 2012 | CPM | On the Closest String via Rank Distance. | Liviu Petrisor Dinu, Alexandru Popa |
| 2012 | DNA | Synthesizing Minimal Tile Sets for Complex Patterns in the Framework of Patterned DNA Self-Assembly. | Eugen Czeizler, Alexandru Popa |
| 2012 | TAMC | Hardness and Approximation of the Asynchronous Border Minimization Problem - (Extended Abstract). | Alexandru Popa, Prudence W. H. Wong, Fencol C. C. Yung |
| 2011 | CPM | Restricted Common Superstring and Restricted Common Supersequence. | Raphal Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa |
| 2010 | ISAAC | Approximation and Hardness Results for the Maximum Edge | Anna Adamaszek, Alexandru Popa |
| 2010 | SPIRE | On Shortest Common Superstring and Swap Permutations. | Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa |
| 2009 | SPIRE | Generalised Matching. | Raphal Clifford, Aram W. Harrow, Alexandru Popa, Benjamin Sach |
| 2008 | SYNASC | Undecidability Results for Finite Interactive Systems. | Alexandru Sofronia, Alexandru Popa, Gheorghe Stefanescu |