Alexandru Popa

Available identifiers

zbMath Open popa.alexandruMaRDI QIDQ260262

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5090996	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5091021	2022-07-21	Paper
The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond	2021-10-21	Paper
Approximate and exact results for the harmonious chromatic number	2021-06-01	Paper
The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes	2021-03-25	Paper
Tractable low-delay atomic memory	2021-03-12	Paper
On the (di)graphs with (directed) proper connection number two	2020-05-29	Paper
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs	2019-11-25	Paper
Algorithms for closest and farthest string problems via rank distance	2019-10-15	Paper
IP Solutions for International Kidney Exchange Programmes	2019-04-15	Paper
Parameterized complexity of asynchronous border minimization	2019-01-11	Paper
Fixed parameter algorithms and hardness of approximation results for the structural target controllability problem	2018-08-15	Paper
On the (di)graphs with (directed) proper connection number two	2018-04-09	Paper
https://portal.mardi4nfdi.de/entity/Q4608071	2018-03-15	Paper
Hardness and approximation of the asynchronous border minimization problem	2017-12-06	Paper
https://portal.mardi4nfdi.de/entity/Q5363810	2017-09-29	Paper
Approximation and hardness results for the maximum edge \(q\)-coloring problem	2016-12-09	Paper
SOBRA - Shielding Optimization for BRAchytherapy	2016-09-29	Paper
A parameterized study of maximum generalized pattern matching problems	2016-06-28	Paper
Min-sum 2-paths problems	2016-03-21	Paper
The Min-Max Edge q-Coloring Problem	2015-10-29	Paper
Algorithmic and hardness results for the colorful components problems	2015-10-19	Paper
Parameterized complexity of asynchronous border minimization	2015-09-30	Paper
A parameterized study of maximum generalized pattern matching problems	2015-09-15	Paper
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem	2015-09-15	Paper
The Min-max Edge q-Coloring Problem	2015-09-15	Paper
Enumeration of Steiner triple systems with subsystems	2015-08-13	Paper
Min-Sum 2-Paths Problems	2014-09-02	Paper
Better lower and upper bounds for the minimum rainbow subgraph problem	2014-07-07	Paper
The Mendelsohn Triple Systems of Order 13	2014-04-04	Paper
Algorithmic and hardness results for the colorful components problems	2014-03-31	Paper
Enumerating cube tilings	2014-01-24	Paper
Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly	2014-01-10	Paper
On the Shannon capacity of triangular graphs	2013-06-07	Paper
Modelling the Power Supply Network – Hardness and Approximation	2013-05-28	Paper
Maximum subset intersection	2013-03-28	Paper
Synthesizing Minimal Tile Sets for Complex Patterns in the Framework of Patterned DNA Self-Assembly	2012-11-06	Paper
Approximating the Rainbow – Better Lower and Upper Bounds	2012-09-25	Paper
On the Closest String via Rank Distance	2012-08-14	Paper
Hardness and Approximation of the Asynchronous Border Minimization Problem	2012-07-16	Paper
Restricted Common Superstring and Restricted Common Supersequence	2011-06-29	Paper
Approximation and Hardness Results for the Maximum Edge q-coloring Problem	2010-12-09	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Alexandru Popa