Alexandru Popa

111 papers A* 1B 19C 15Misc 8Journal 58Unranked 9

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