The following pages link to Alexandru Popa (Q260262):
Displaying 41 items.
- Min-sum 2-paths problems (Q260263) (← links)
- A parameterized study of maximum generalized pattern matching problems (Q300450) (← links)
- Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721) (← links)
- Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly (Q391179) (← links)
- Enumerating cube tilings (Q393746) (← links)
- Algorithmic and hardness results for the colorful components problems (Q747623) (← links)
- Fixed parameter algorithms and hardness of approximation results for the structural target controllability problem (Q1660123) (← links)
- Hardness and approximation of the asynchronous border minimization problem (Q1682885) (← links)
- Parameterized complexity of asynchronous border minimization (Q1755787) (← links)
- Maximum subset intersection (Q1944892) (← links)
- On the Shannon capacity of triangular graphs (Q1953512) (← links)
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
- Better lower and upper bounds for the minimum rainbow subgraph problem (Q2250438) (← links)
- Algorithms for closest and farthest string problems via rank distance (Q2327465) (← links)
- Tractable low-delay atomic memory (Q2657276) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- SOBRA - Shielding Optimization for BRAchytherapy (Q2819514) (← links)
- Hardness and Approximation of the Asynchronous Border Minimization Problem (Q2898027) (← links)
- On the Closest String via Rank Distance (Q2904514) (← links)
- Approximating the Rainbow – Better Lower and Upper Bounds (Q2914324) (← links)
- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem (Q2946037) (← links)
- The Min-max Edge q-Coloring Problem (Q2946058) (← links)
- Restricted Common Superstring and Restricted Common Supersequence (Q3011876) (← links)
- Approximation and Hardness Results for the Maximum Edge q-coloring Problem (Q3060768) (← links)
- Min-Sum 2-Paths Problems (Q3188861) (← links)
- The Min-Max Edge q-Coloring Problem (Q3196318) (← links)
- (Q4608071) (← links)
- Modelling the Power Supply Network – Hardness and Approximation (Q4922115) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- (Q5090996) (← links)
- (Q5091021) (← links)
- Synthesizing Minimal Tile Sets for Complex Patterns in the Framework of Patterned DNA Self-Assembly (Q5200598) (← links)
- (Q5363810) (← links)
- The Mendelsohn Triple Systems of Order 13 (Q5406954) (← links)
- Enumeration of Steiner triple systems with subsystems (Q5501161) (← links)
- On the (di)graphs with (directed) proper connection number two (Q5918844) (← links)
- On the (di)graphs with (directed) proper connection number two (Q5920180) (← links)
- Approximation and fixed parameter algorithms for the approximate cover problem (Q6545414) (← links)
- Fixed parameter algorithms and hardness of approximation results for the structural target controllability problem (Q6588075) (← links)
- Algorithms on a path covering problem with applications in transportation (Q6606160) (← links)
- String factorization via prefix free families (Q6622026) (← links)
