High-level Structured Interactive Programs with Registers and Voices. - Alexandru Popa 001; Alexandru Sofronia; Gheorghe Stefanescu (J. Univers. Comput. Sci., 2007)

Undecidability Results for Finite Interactive Systems. - Alexandru Sofronia; Alexandru Popa 001; Gheorghe Stefanescu (SYNASC, 2008)

Generalised Matching. - Raphaël Clifford; Aram W. Harrow; Alexandru Popa 001; Benjamin Sach (SPIRE, 2009)

Approximation and Hardness Results for the Maximum Edge q-coloring Problem. - Anna Adamaszek; Alexandru Popa 001 (ISAAC (2), 2010)

On Shortest Common Superstring and Swap Permutations. - Zvi Gotthilf; Moshe Lewenstein; Alexandru Popa 001 (SPIRE, 2010)

(In)approximability Results for Pattern Matching Problems. - Raphaël Clifford; Alexandru Popa 001 (Stringology, 2010)

Permuted Common Supersequence - Raphaël Clifford; Zvi Gotthilf; Moshe Lewenstein; Alexandru Popa 001 (CoRR, 2010)

Hardness and Approximation of The Asynchronous Border Minimization Problem - Alexandru Popa 001; Prudence W. H. Wong; Fencol C. C. Yung (CoRR, 2010)

Restricted Common Superstring and Restricted Common Supersequence. - Raphaël Clifford; Zvi Gotthilf; Moshe Lewenstein; Alexandru Popa 001 (CPM, 2011)

Maximum subset intersection. - Raphaël Clifford; Alexandru Popa 001 (Inf. Process. Lett., 2011)

Approximation lower and upper bounds for a selection of combinatorial optimization problems. - Alexandru Popa 001 (2011)

Approximating the Rainbow - Better Lower and Upper Bounds. - Alexandru Popa 001 (COCOON, 2012)

On the Closest String via Rank Distance. - Liviu Petrisor Dinu; Alexandru Popa 001 (CPM, 2012)

Hardness and Approximation of the Asynchronous Border Minimization Problem - (Extended Abstract). - Alexandru Popa 001; Prudence W. H. Wong; Fencol C. C. Yung (TAMC, 2012)

Modelling the Power Supply Network - Hardness and Approximation. - Alexandru Popa 001 (TAMC, 2013)

On the Shannon Capacity of Triangular Graphs. - Ashik Mathew Kizhakkepallathu; Patric R. J. Östergård; Alexandru Popa 001 (Electron. J. Comb., 2013)

Enumerating Cube Tilings. - K. Ashik Mathew; Patric R. J. Östergård; Alexandru Popa 001 (Discret. Comput. Geom., 2013)

Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly. - Eugen Czeizler; Alexandru Popa 001 (Theor. Comput. Sci., 2013)

Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem. - Anna Adamaszek; Guillaume Blin; Alexandru Popa 001 (IWOCA, 2014)

Better lower and upper bounds for the minimum rainbow subgraph problem. - Alexandru Popa 001 (Theor. Comput. Sci., 2014)

A Unifying Framework for Interactive Programming and Applications to Communicating Peer-to-Peer Systems. - Alexandru Popa 001; Iulia Teodora Banu-Demergian; Camelia Chira; Florian Mircea Boian; Gheorghe Stefanescu (EGC, 2015)

Making "Fast" Atomic Operations Computationally Tractable. - Antonio Fernández Anta; Nicolas C. Nicolaou; Alexandru Popa 001 (OPODIS, 2015)

Algorithmic and Hardness Results for the Colorful Components Problems. - Anna Adamaszek; Alexandru Popa 001 (Algorithmica, 2015)

The Min-Max Edge q-Coloring Problem. - Tommi Larjomaa; Alexandru Popa 001 (J. Graph Algorithms Appl., 2015)

Enumeration of Steiner triple systems with subsystems. - Petteri Kaski; Patric R. J. Östergård; Alexandru Popa 001 (Math. Comput., 2015)

Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly. - Alexandru I. Tomescu; Travis Gagie; Alexandru Popa 001; Romeo Rizzi; Anna Kuosmanen; Veli Mäkinen (IEEE ACM Trans. Comput. Biol. Bioinform., 2015)

SOBRA - Shielding Optimization for BRAchytherapy. - Guillaume Blin; Marie Gasparoux; Sebastian Ordyniak; Alexandru Popa 001 (IWOCA, 2016)

A Parameterized Study of Maximum Generalized Pattern Matching Problems. - Sebastian Ordyniak; Alexandru Popa 001 (Algorithmica, 2016)

Approximation and hardness results for the maximum edge q-coloring problem. - Anna Adamaszek; Alexandru Popa 001 (J. Discrete Algorithms, 2016)

Min-Sum 2-Paths Problems. - Trevor I. Fenner; Oded Lachish; Alexandru Popa 001 (Theory Comput. Syst., 2016)

Heuristic Algorithms for the Min-Max Edge 2-Coloring Problem. - Radu Stefan Mincu; Alexandru Popa 001 (COCOON, 2018)

Better Heuristic Algorithms for the Repetition Free LCS and Other Variants. - Radu Stefan Mincu; Alexandru Popa 001 (SPIRE, 2018)

Extremal Graphs with Respect to the Modified First Zagreb Connection Index. - Guillaume Ducoffe; Ruxandra Marinescu-Ghemeci; Camelia Obreja; Alexandru Popa 001; Rozica Maria Tache (SYNASC, 2018)

Heuristic Algorithms for the Longest Filled Common Subsequence Problem. - Radu Stefan Mincu; Alexandru Popa 001 (SYNASC, 2018)

Local search algorithms for wireless mesh networks. - Radu Stefan Mincu; Alexandru Popa 001 (CoRR, 2018)

A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs. - Guillaume Ducoffe; Alexandru Popa 001 (CoRR, 2018)

Hardness and algorithmic results for the approximate cover problem. - Alexandru Popa 001; Andrei Tanasescu (CoRR, 2018)

A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization. - Alexandru Popa 001; Andrei Tanasescu (CoRR, 2018)

Complexity of computing the anti-Ramsey numbers. - Saeed Akhoondian Amiri; Alexandru Popa 001; Golnoosh Shahkarami; Hossein Vahidi 001 (CoRR, 2018)

Hardness and approximation of the asynchronous border minimization problem. - Cindy Y. Li; Alexandru Popa 001; Prudence W. H. Wong; Fencol C. C. Yung (Discret. Appl. Math., 2018)

Some Remarks on the Translocation Distance. - Maria Constantin; Alexandru Popa 001 (KES, 2019)

The Graceful Chromatic Number for Some Particular Classes of Graphs. - Radu Stefan Mincu; Camelia Obreja; Alexandru Popa 001 (SYNASC, 2019)

Algorithms for Closest and Farthest String Problems via Rank Distance. - Liviu P. Dinu; Bogdan Dumitru; Alexandru Popa 001 (TAMC, 2019)

An Output-Sensitive Algorithm for the Minimization of 2-Dimensional String Covers. - Alexandru Popa 001; Andrei Tanasescu (TAMC, 2019)

Parameterized Complexity of Asynchronous Border Minimization. - Robert Ganian; Martin Kronegger; Andreas Pfandler; Alexandru Popa 001 (Algorithmica, 2019)

NewsCompare - A novel application for detecting news influence in a country. - Cristian Pop; Alexandru Popa 001 (SoftwareX, 2019)

Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs. - David Coudert; Guillaume Ducoffe; Alexandru Popa 001 (ACM Trans. Algorithms, 2019)

The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps. - Radu Stefan Mincu; Alexandru Popa 001 (SOFSEM, 2020)

Analyzing of LAM-CIoT: Lightweight Authentication Mechanism in Cloud-based IoT Environment. - Ahmed Yaser Fahad Alsahlani; Alexandru Popa 001 (SSCI, 2020)

A decision support system for optimizing the cost of social distancing in order to stop the spread of COVID-19. - Alexandru Popa 001 (CoRR, 2020)

On the (di)graphs with (directed) proper connection number two. - Guillaume Ducoffe; Ruxandra Marinescu-Ghemeci; Alexandru Popa 001 (Discret. Appl. Math., 2020)

Efficient Algorithms for Counting Gapped Palindromes. - Andrei Popa; Alexandru Popa 001 (CPM, 2021)

Polynomial Algorithms for Synthesizing Specific Classes of Optimal Block-Structured Processes. - Costin Badica; Alexandru Popa 001 (ICCCI, 2021)

Analysis of lightweight and secure two-factor authentication scheme for wireless body area networks in health-care IoT. - Ahmed Yaser Fahad Alsahlani; Alexandru Popa 001 (IWCMC, 2021)

A novel algorithm for clearing financial obligations between companies - An application within the Romanian Ministry of economy. - Lucian-Ionut Gavrila; Alexandru Popa 001 (Algorithmic Finance, 2021)

IP solutions for international kidney exchange programmes. - Radu Stefan Mincu; Péter Biró 001; Márton Gyetvai; Alexandru Popa 001; Utkarsh Verma (Central Eur. J. Oper. Res., 2021)

The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes. - Guillaume Ducoffe; Alexandru Popa 001 (Discret. Appl. Math., 2021)

The b-Matching problem in distance-hereditary graphs and beyond. - Guillaume Ducoffe; Alexandru Popa 001 (Discret. Appl. Math., 2021)

Tractable low-delay atomic memory. - Antonio Fernández Anta; Theophanis Hadjistasi; Nicolas Nicolaou; Alexandru Popa 001; Alexander A. Schwarzmann (Distributed Comput., 2021)

LMAAS-IoT: Lightweight multi-factor authentication and authorization scheme for real-time data access in IoT cloud-based environment. - Ahmed Yaser Fahad Alsahlani; Alexandru Popa 001 (J. Netw. Comput. Appl., 2021)

Covering a Graph with Densest Subgraphs. - Riccardo Dondi; Alexandru Popa 001 (CALDAM, 2022)

Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem. - Eugen Czeizler; Alexandru Popa 001; Victor Popescu (Sci. Ann. Comput. Sci., 2022)

Algorithms on a Path Covering Problem with Applications in Transportation. - Ruxandra Marinescu-Ghemeci; Alexandru Popa 001; Tiberiu Sîrbu (COCOA (1), 2023)

Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor. - Itai Boneh; Dvir Fried; Adrian Miclaus; Alexandru Popa 001 (CPM, 2023)

String Factorization via Prefix Free Families. - Matan Kraus; Moshe Lewenstein; Alexandru Popa 001; Ely Porat; Yonathan Sadia (CPM, 2023)

Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms. - Riccardo Dondi; Alexandru Popa 001 (IWOCA, 2023)

Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem. - Guillaume Blin; Alexandru Popa 001; Mathieu Raffinot; Raluca Uricaru (SPIRE, 2023)

Exact and approximation algorithms for synthesizing specific classes of optimal block-structured processes. - Costin Badica; Alexandru Popa 001 (Simul. Model. Pract. Theory, 2023)

Towards Understanding News Plagiarism: Theoretical and Experimental Analysis. - Ruxandra Marinescu-Ghemeci; Adrian Miclaus; Ionut Muraretu; Alexandru Popa 001 (AAIM (2), 2024)

Maximum Letter-Duplicated Subsequence (short paper). - Riccardo Dondi; Mohammad Mehdi Hosseinzadeh; Alexandru Popa 001 (ICTCS, 2024)

Optimizing Electric Vehicle Charging Infrastructure: A GNN-TSP Approach. - Alexandru Popa 001; Tiberiu Sîrbu (INISTA, 2024)

A Study on the Topic of Crossing Minimisation. - Rares-Ioan Mateiu; Alexandru Popa 001 (SYNASC, 2024)

Approximate and exact results for the harmonious chromatic number. - Ruxandra Marinescu-Ghemeci; Camelia Obreja; Alexandru Popa 001 (Discuss. Math. Graph Theory, 2024)

Representing Paths in Digraphs. - Riccardo Dondi; Alexandru Popa 001 (CPM, 2025)

Approximating Maximum Edge 2-Coloring by Normalizing Graphs. - Tobias Mömke; Alexandru Popa 001; Aida Roshany-Tabrizi; Michael Ruderer; Roland Vincze (Discret. Math. Theor. Comput. Sci., 2025)

Complexity of computing the anti-Ramsey numbers for paths. - Saeed Akhoondian Amiri; Alexandru Popa 001; Mohammad Roghani; Golnoosh Shahkarami; Reza Soltani; Hossein Vahidi 001 (Theor. Comput. Sci., 2025)

Exact and approximation algorithms for the contiguous translocation distance problem. - Maria Constantin; Alexandru Popa 001 (Theor. Comput. Sci., 2025)

Strategic Optimization of Electric Vehicle Charging Station Placement in Romania. - Alexandru Popa 001; Tiberiu Sîrbu (Oper. Res. Forum, 2025)

Exact and approximation algorithms for covering timeline in temporal graphs. - Riccardo Dondi; Alexandru Popa 001 (Ann. Oper. Res., 2025)