Alexandru Popa

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 57

Top Venues

University of Bristol, UK (PHD)

Education History

University of Bristol, UK

PHD

Publications

Ruxandra Marinescu-Ghemeci, Camelia Obreja, Alexandru Popa
Approximate and exact results for the harmonious chromatic number. Discuss. Math. Graph Theory 44 (2) (2024)
Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze
Approximating Maximum Edge 2-Coloring by Normalizing Graphs. CoRR (2024)
Ruxandra Marinescu-Ghemeci, Alexandru Popa, Tiberiu Sîrbu
Algorithms on a Path Covering Problem with Applications in Transportation. COCOA (1) (2023)
Riccardo Dondi, Alexandru Popa
Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms. IWOCA (2023)
Itai Boneh, Dvir Fried, Adrian Miclaus, Alexandru Popa
Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor. CPM (2023)
Guillaume Blin, Alexandru Popa, Mathieu Raffinot, Raluca Uricaru
Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem. SPIRE (2023)
Costin Badica, Alexandru Popa
Exact and approximation algorithms for synthesizing specific classes of optimal block-structured processes. Simul. Model. Pract. Theory 127 (2023)
Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, Yonathan Sadia
String Factorization via Prefix Free Families. CPM (2023)
Riccardo Dondi, Alexandru Popa
Covering a Graph with Densest Subgraphs. CALDAM (2022)
Eugen Czeizler, Alexandru Popa, Victor Popescu
Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem. Sci. Ann. Comput. Sci. 32 (1) (2022)
Lucian-Ionut Gavrila, Alexandru Popa
A novel algorithm for clearing financial obligations between companies - An application within the Romanian Ministry of economy. Algorithmic Finance 9 (1-2) (2021)
Guillaume Ducoffe, Alexandru Popa
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes. Discret. Appl. Math. 291 (2021)
Andrei Popa, Alexandru Popa
Efficient Algorithms for Counting Gapped Palindromes. CPM (2021)
Costin Badica, Alexandru Popa
Polynomial Algorithms for Synthesizing Specific Classes of Optimal Block-Structured Processes. ICCCI (2021)
Ruxandra Marinescu-Ghemeci, Camelia Obreja, Alexandru Popa
Approximate and exact results for the harmonious chromatic number. CoRR (2021)
Ahmed Yaser Fahad Alsahlani, Alexandru Popa
Analysis of lightweight and secure two-factor authentication scheme for wireless body area networks in health-care IoT. IWCMC (2021)
Ahmed Yaser Fahad Alsahlani, Alexandru Popa
LMAAS-IoT: Lightweight multi-factor authentication and authorization scheme for real-time data access in IoT cloud-based environment. J. Netw. Comput. Appl. 192 (2021)
Antonio Fernández Anta, Theophanis Hadjistasi, Nicolas Nicolaou, Alexandru Popa, Alexander A. Schwarzmann
Tractable low-delay atomic memory. Distributed Comput. 34 (1) (2021)
Guillaume Ducoffe, Alexandru Popa
The b-Matching problem in distance-hereditary graphs and beyond. Discret. Appl. Math. 305 (2021)
Radu Stefan Mincu, Péter Biró, Márton Gyetvai, Alexandru Popa, Utkarsh Verma
IP solutions for international kidney exchange programmes. Central Eur. J. Oper. Res. 29 (2) (2021)
Ahmed Yaser Fahad Alsahlani, Alexandru Popa
Analyzing of LAM-CIoT: Lightweight Authentication Mechanism in Cloud-based IoT Environment. SSCI (2020)
Lucian-Ionut Gavrila, Alexandru Popa
A novel algorithm for clearing financial obligations between companies - an application within the Romanian Ministry of Economy. CoRR (2020)
Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, Alexandru Popa
On the (di)graphs with (directed) proper connection number two. Discret. Appl. Math. 281 (2020)
Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi
Complexity of Computing the Anti-Ramsey Numbers for Paths. MFCS (2020)
Radu Stefan Mincu, Alexandru Popa
The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps. SOFSEM (2020)
Alexandru Popa
A decision support system for optimizing the cost of social distancing in order to stop the spread of COVID-19. CoRR (2020)
Liviu P. Dinu, Bogdan Dumitru, Alexandru Popa
Algorithms for Closest and Farthest String Problems via Rank Distance. TAMC (2019)
Cristian Pop, Alexandru Popa
NewsCompare - a novel application for detecting news influence in a country. CoRR (2019)
David Coudert, Guillaume Ducoffe, Alexandru Popa
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs. ACM Trans. Algorithms 15 (3) (2019)
Alexandru Popa, Andrei Tanasescu
An Output-Sensitive Algorithm for the Minimization of 2-Dimensional String Covers. TAMC (2019)
Radu Stefan Mincu, Camelia Obreja, Alexandru Popa
The Graceful Chromatic Number for Some Particular Classes of Graphs. SYNASC (2019)
Maria Constantin, Alexandru Popa
Some Remarks on the Translocation Distance. KES (2019)
Radu Stefan Mincu, Alexandru Popa
Heuristic algorithms for the Longest Filled Common Subsequence Problem. CoRR (2019)
Cristian Pop, Alexandru Popa
NewsCompare - A novel application for detecting news influence in a country. SoftwareX 10 (2019)
Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa
Parameterized Complexity of Asynchronous Border Minimization. Algorithmica 81 (1) (2019)
Cindy Y. Li, Alexandru Popa, Prudence W. H. Wong, Fencol C. C. Yung
Hardness and approximation of the asynchronous border minimization problem. Discret. Appl. Math. 235 (2018)
Saeed Akhoondian Amiri, Alexandru Popa, Golnoosh Shahkarami, Hossein Vahidi
Complexity of computing the anti-Ramsey numbers. CoRR (2018)
Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, Camelia Obreja, Alexandru Popa, Rozica Maria Tache
Extremal Graphs with Respect to the Modified First Zagreb Connection Index. SYNASC (2018)
Alexandru Popa, Andrei Tanasescu
Hardness and algorithmic results for the approximate cover problem. CoRR (2018)
Radu Stefan Mincu, Alexandru Popa
Heuristic Algorithms for the Min-Max Edge 2-Coloring Problem. COCOON (2018)
Eugen Czeizler, Alexandru Popa, Victor Popescu
Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem. AlCoB (2018)
Radu Stefan Mincu, Alexandru Popa
Better Heuristic Algorithms for the Repetition Free LCS and Other Variants. SPIRE (2018)
Alexandru Popa, Andrei Tanasescu
A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization. CoRR (2018)
Guillaume Ducoffe, Alexandru Popa
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes. CoRR (2018)
Guillaume Ducoffe, Alexandru Popa
A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs. CoRR (2018)
Radu Stefan Mincu, Alexandru Popa
Heuristic Algorithms for the Longest Filled Common Subsequence Problem. SYNASC (2018)
Radu Stefan Mincu, Alexandru Popa
Local search algorithms for wireless mesh networks. CoRR (2018)
Guillaume Ducoffe, Alexandru Popa
The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes. ISAAC (2018)
Alexandru Popa, Andrei Tanasescu
An output-sensitive algorithm for the minimization of 2-dimensional String Covers. CoRR (2018)
Guillaume Ducoffe, Alexandru Popa
The b-Matching Problem in Distance-Hereditary Graphs and Beyond. ISAAC (2018)
David Coudert, Guillaume Ducoffe, Alexandru Popa
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. SODA (2018)
David Coudert, Guillaume Ducoffe, Alexandru Popa
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. CoRR (2017)
Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, Alexandru Popa
On the (di)graphs with (directed) proper connection number two. Electron. Notes Discret. Math. 62 (2017)
Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa
SOBRA - Shielding Optimization for BRAchytherapy. IWOCA (2016)
Anna Adamaszek, Alexandru Popa
Approximation and hardness results for the maximum edge q-coloring problem. J. Discrete Algorithms (2016)
Trevor I. Fenner, Oded Lachish, Alexandru Popa
Min-Sum 2-Paths Problems. Theory Comput. Syst. 58 (1) (2016)
Sebastian Ordyniak, Alexandru Popa
A Parameterized Study of Maximum Generalized Pattern Matching Problems. Algorithmica 75 (1) (2016)
Anna Adamaszek, Alexandru Popa
Algorithmic and Hardness Results for the Colorful Components Problems. Algorithmica 73 (2) (2015)
Tommi Larjomaa, Alexandru Popa
The Min-Max Edge q-Coloring Problem. J. Graph Algorithms Appl. 19 (1) (2015)
Petteri Kaski, Patric R. J. Östergård, Alexandru Popa
Enumeration of Steiner triple systems with subsystems. Math. Comput. 84 (296) (2015)
Alexandru Popa, Iulia Teodora Banu-Demergian, Camelia Chira, Florian Mircea Boian, Gheorghe Stefanescu
A Unifying Framework for Interactive Programming and Applications to Communicating Peer-to-Peer Systems. EGC (2015)
Alexandru I. Tomescu, Travis Gagie, Alexandru Popa, Romeo Rizzi, Anna Kuosmanen, Veli Mäkinen
Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly. IEEE ACM Trans. Comput. Biol. Bioinform. 12 (6) (2015)
Antonio Fernández Anta, Nicolas C. Nicolaou, Alexandru Popa
Making "Fast" Atomic Operations Computationally Tractable. OPODIS (2015)
Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa
Parameterized Complexity of Asynchronous Border Minimization. CoRR (2015)
Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa
Parameterized Complexity of Asynchronous Border Minimization. TAMC (2015)
Alexandru Popa
Better lower and upper bounds for the minimum rainbow subgraph problem. Theor. Comput. Sci. 543 (2014)
Tommi Larjomaa, Alexandru Popa
The Min-max Edge q-Coloring Problem. IWOCA (2014)
Anna Adamaszek, Alexandru Popa
Algorithmic and Hardness Results for the Colorful Components Problems. LATIN (2014)
Sebastian Ordyniak, Alexandru Popa
A Parameterized Study of Maximum Generalized Pattern Matching Problems. IPEC (2014)
Anna Adamaszek, Guillaume Blin, Alexandru Popa
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem. IWOCA (2014)
Sebastian Ordyniak, Alexandru Popa
A Parameterized Study of Maximum Generalized Pattern Matching Problems. CoRR (2014)
Ashik Mathew Kizhakkepallathu, Patric R. J. Östergård, Alexandru Popa
On the Shannon Capacity of Triangular Graphs. Electron. J. Comb. 20 (2) (2013)
Tommi Larjomaa, Alexandru Popa
The min-max edge q-coloring problem CoRR (2013)
Trevor I. Fenner, Oded Lachish, Alexandru Popa
Min-Sum 2-Paths Problems. WAOA (2013)
Anna Adamaszek, Alexandru Popa
Algorithmic and Hardness Results for the Colorful Components Problems. CoRR (2013)
Alexandru Popa
Modelling the Power Supply Network - Hardness and Approximation. TAMC (2013)
K. Ashik Mathew, Patric R. J. Östergård, Alexandru Popa
Enumerating Cube Tilings. Discret. Comput. Geom. 50 (4) (2013)
Eugen Czeizler, Alexandru Popa
Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly. Theor. Comput. Sci. 499 (2013)
Alexandru Popa, Prudence W. H. Wong, Fencol C. C. Yung
Hardness and Approximation of the Asynchronous Border Minimization Problem - (Extended Abstract). TAMC (2012)
Liviu Petrisor Dinu, Alexandru Popa
On the Closest String via Rank Distance. CPM (2012)
Eugen Czeizler, Alexandru Popa
Synthesizing Minimal Tile Sets for Complex Patterns in the Framework of Patterned DNA Self-Assembly. DNA (2012)
Alexandru Popa
Approximating the Rainbow - Better Lower and Upper Bounds. COCOON (2012)
Raphaël Clifford, Alexandru Popa
Maximum subset intersection. Inf. Process. Lett. 111 (7) (2011)
Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa
Restricted Common Superstring and Restricted Common Supersequence. CPM (2011)
Alexandru Popa, Prudence W. H. Wong, Fencol C. C. Yung
Hardness and Approximation of The Asynchronous Border Minimization Problem CoRR (2010)
Anna Adamaszek, Alexandru Popa
-coloring Problem. ISAAC (2) (2010)
Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa
On Shortest Common Superstring and Swap Permutations. SPIRE (2010)
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefanescu
Undecidability Results for Finite Interactive Systems CoRR (2010)
Raphaël Clifford, Alexandru Popa
(In)approximability Results for Pattern Matching Problems. Stringology (2010)
Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa
Permuted Common Supersequence CoRR (2010)
Raphaël Clifford, Aram W. Harrow, Alexandru Popa, Benjamin Sach
Generalised Matching. SPIRE (2009)
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefanescu
Undecidability Results for Finite Interactive Systems. SYNASC (2008)
Alexandru Popa, Alexandru Sofronia, Gheorghe Stefanescu
High-level Structured Interactive Programs with Registers and Voices. J. Univers. Comput. Sci. 13 (11) (2007)

Alexandru Popa.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Alexandru Popa