Alexandru Popa - Citegraph

Author Info

Name	Affiliation	Papers
ALEXANDRU POPA	Aalto Univ, Sch Elect Engn, Dept Commun & Networking, Aalto 00076, Finland	33
Collaborators	Citations	PageRank
40	70	13.34
Referers	Referees	References
129	391	240

Search Limit

100391

Publications (33 rows)

Collaborators (40 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
The Use Of A Pruned Modular Decomposition For Maximum Matching Algorithms On Some Graph Classes	0	0.34	2021
The b-MATCHING problem in distance-hereditary graphs and beyond	0	0.34	2021
LMAAS-IoT: Lightweight multi-factor authentication and authorization scheme for real-time data access in IoT cloud-based environment	1	0.35	2021
Algorithms for Closest and Farthest String Problems via Rank Distance.	0	0.34	2019
Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem.	0	0.34	2018
Hardness and approximation of the asynchronous border minimization problem.	0	0.34	2018
Sobra - Shielding Optimization For Brachytherapy	0	0.34	2016
Enumeration of Steiner triple systems with subsystems	0	0.34	2015
Making "Fast" Atomic Operations Computationally Tractable.	1	0.36	2015
A Unifying Framework for Interactive Programming and Applications to Communicating Peer-to-Peer Systems.	0	0.34	2015
The Min-Max Edge Q-Coloring Problem	0	0.34	2015
Parameterized Complexity of Asynchronous Border Minimization.	0	0.34	2015
Hard as a Rock or Deformation Controlled?	0	0.34	2014
Approximation And Hardness Results For The Maximum Edges In Transitive Closure Problem	2	0.39	2014
Algorithmic and Hardness Results for the Colorful Components Problems.	3	0.43	2014
Modelling the Power Supply Network - Hardness and Approximation.	5	0.45	2013
On the Shannon Capacity of Triangular Graphs.	1	0.38	2013
Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly	5	0.50	2013
Min-Sum 2-Paths Problems.	2	0.40	2013
Enumerating Cube Tilings.	1	0.38	2013
Hardness and Approximation of the Asynchronous Border Minimization Problem - (Extended Abstract).	1	0.36	2012
On the closest string via rank distance	6	0.49	2012
Approximating the Rainbow - Better Lower and Upper Bounds.	0	0.34	2012
Maximum subset intersection	8	0.63	2011
Restricted common superstring and restricted common supersequence	7	0.49	2011
On shortest common superstring and swap permutations	6	0.46	2010
(In)Approximability Results For Pattern Matching Problems	1	0.36	2010
Permuted Common Supersequence	0	0.34	2010
A software framework for multi-agent control of multiple autonomous underwater vehicles for underwater mine counter-measures.	2	0.48	2010
Hardness and approximation of the asynchronous border minimization problem	0	0.34	2010
Approximation and Hardness Results for the Maximum Edge q-coloring Problem.	3	0.43	2010
Undecidability Results for Finite Interactive Systems	4	0.47	2010
High-level Structured Interactive Programs with Registers and Voices	11	0.79	2007