Alexandru Popa
Orcid: 0000-0003-3364-1210Affiliations:
- University of Bucharest, Romania
- Nazarbayev University, Kazakhstan (2015 - 2016)
- Masaryk University, Czech Republic (2013 - 2015)
- Aalto University, Finland (2011 - 2013)
- University of Bristol, UK (PhD 2011)
- University of Bucharest, Romania (2005 - 2008)
According to our database1,
Alexandru Popa
authored at least 71 papers
between 2007 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Exact and approximation algorithms for synthesizing specific classes of optimal block-structured processes.
Simul. Model. Pract. Theory, September, 2023
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023
Proceedings of the String Processing and Information Retrieval, 2023
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023
Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023
Proceedings of the Combinatorial Optimization and Applications, 2023
2022
Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem.
Sci. Ann. Comput. Sci., 2022
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022
2021
LMAAS-IoT: Lightweight multi-factor authentication and authorization scheme for real-time data access in IoT cloud-based environment.
J. Netw. Comput. Appl., 2021
Discret. Appl. Math., 2021
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes.
Discret. Appl. Math., 2021
Central Eur. J. Oper. Res., 2021
A novel algorithm for clearing financial obligations between companies - An application within the Romanian Ministry of economy.
Algorithmic Finance, 2021
Analysis of lightweight and secure two-factor authentication scheme for wireless body area networks in health-care IoT.
Proceedings of the 17th International Wireless Communications and Mobile Computing, 2021
Polynomial Algorithms for Synthesizing Specific Classes of Optimal Block-Structured Processes.
Proceedings of the Computational Collective Intelligence - 13th International Conference, 2021
Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021
2020
A decision support system for optimizing the cost of social distancing in order to stop the spread of COVID-19.
CoRR, 2020
Analyzing of LAM-CIoT: Lightweight Authentication Mechanism in Cloud-based IoT Environment.
Proceedings of the 2020 IEEE Symposium Series on Computational Intelligence, 2020
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020
2019
ACM Trans. Algorithms, 2019
SoftwareX, 2019
Proceedings of the Theory and Applications of Models of Computation, 2019
Proceedings of the Theory and Applications of Models of Computation, 2019
Proceedings of the 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2019
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 23rd International Conference KES-2019, 2019
2018
Discret. Appl. Math., 2018
A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization.
CoRR, 2018
A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs.
CoRR, 2018
Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018
Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018
Proceedings of the String Processing and Information Retrieval, 2018
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018
2017
Electron. Notes Discret. Math., 2017
2016
J. Discrete Algorithms, 2016
Algorithmica, 2016
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016
2015
IEEE ACM Trans. Comput. Biol. Bioinform., 2015
Algorithmica, 2015
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015
A Unifying Framework for Interactive Programming and Applications to Communicating Peer-to-Peer Systems.
Proceedings of the Embracing Global Computing in Emerging Economies - First Workshop, 2015
2014
Theor. Comput. Sci., 2014
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014
2013
Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly.
Theor. Comput. Sci., 2013
Proceedings of the Theory and Applications of Models of Computation, 2013
2012
Hardness and Approximation of the Asynchronous Border Minimization Problem - (Extended Abstract).
Proceedings of the Theory and Applications of Models of Computation, 2012
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012
2011
Approximation lower and upper bounds for a selection of combinatorial optimization problems.
PhD thesis, 2011
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011
2010
CoRR, 2010
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010
Proceedings of the String Processing and Information Retrieval, 2010
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
2009
Proceedings of the String Processing and Information Retrieval, 2009
2008
Proceedings of the SYNASC 2008, 2008
2007
J. Univers. Comput. Sci., 2007