Alexandru Popa
Title
Cited by
Cited by
Year
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
D Coudert, G Ducoffe, A Popa
ACM Transactions on Algorithms (TALG) 15 (3), 1-57, 2019
482019
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
D Coudert, G Ducoffe, A Popa
ACM Transactions on Algorithms (TALG) 15 (3), 1-57, 2019
482019
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
D Coudert, G Ducoffe, A Popa
ACM Transactions on Algorithms (TALG) 15 (3), 1-57, 2019
482019
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
D Coudert, G Ducoffe, A Popa
ACM Transactions on Algorithms (TALG) 15 (3), 1-57, 2019
482019
Maximum subset intersection
R Clifford, A Popa
Information Processing Letters 111 (7), 323-325, 2011
212011
High-level Structured Interactive Programs with Registers and Voices.
A Popa, A Sofronia, G Stefanescu
J. Univers. Comput. Sci. 13 (11), 1722-1754, 2007
202007
Extremal graphs with respect to the modified first Zagreb connection index
G Ducoffe, R Marinescu-Ghemeci, C Obreja, A Popa, RM Tache
2018 20th International Symposium on Symbolic and Numeric Algorithms for …, 2018
182018
On the (di) graphs with (directed) proper connection number two
G Ducoffe, R Marinescu-Ghemeci, A Popa
Electronic Notes in Discrete Mathematics 62, 237-242, 2017
142017
Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
E Czeizler, A Popa
Theoretical Computer Science 499, 23-37, 2013
142013
On the closest string via rank distance
LP Dinu, A Popa
Annual Symposium on Combinatorial Pattern Matching, 413-426, 2012
132012
Generalised matching
R Clifford, AW Harrow, A Popa, B Sach
International Symposium on String Processing and Information Retrieval, 295-301, 2009
132009
Restricted common superstring and restricted common supersequence
R Clifford, Z Gotthilf, M Lewenstein, A Popa
Annual Symposium on Combinatorial Pattern Matching, 467-478, 2011
122011
Approximation and Hardness Results for the Maximum Edge q-coloring Problem
A Adamaszek, A Popa
International Symposium on Algorithms and Computation, 132-143, 2010
122010
Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
E Czeizler, A Popa
International Workshop on DNA-Based Computers, 58-72, 2012
112012
A parameterized study of maximum generalized pattern matching problems
S Ordyniak, A Popa
Algorithmica 75 (1), 1-26, 2016
102016
Algorithmic and hardness results for the colorful components problems
A Adamaszek, A Popa
Algorithmica 73 (2), 371-388, 2015
92015
Enumeration of Steiner triple systems with subsystems
P Kaski, P Östergård, A Popa
Mathematics of Computation 84 (296), 3051-3067, 2015
92015
On shortest common superstring and swap permutations
Z Gotthilf, M Lewenstein, A Popa
International Symposium on String Processing and Information Retrieval, 270-278, 2010
92010
Min-sum 2-paths problems
T Fenner, O Lachish, A Popa
Theory of Computing Systems 58 (1), 94-110, 2016
82016
Explaining a weighted DAG with few paths for solving genome-guided multi-assembly
AI Tomescu, T Gagie, A Popa, R Rizzi, A Kuosmanen, V Mäkinen
IEEE/ACM transactions on computational biology and bioinformatics 12 (6 …, 2015
82015
The system can't perform the operation now. Try again later.
Articles 1–20