Samuel Rosa

According to our database, Samuel Rosa authored at least 7 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of seven.
• Erdős number of six.

2026

Removal of redundant candidate points for the exact D-optimal design problem.

Radoslav Harman, Samuel Rosa

Stat. Comput., February, 2026

2025

Laplacian Network Optimization via Information Functions.

Samuel Rosa, Radoslav Harman

CoRR, December, 2025

2024

The polytope of optimal approximate designs: extending the selection of informative experiments.

Radoslav Harman, Lenka Filová, Samuel Rosa

Stat. Comput., December, 2024

Toward more numerically stable computations of optimal experimental designs.

Samuel Rosa

Commun. Stat. Simul. Comput., December, 2024

2022

Computing minimum-volume enclosing ellipsoids for large datasets.

Samuel Rosa, Radoslav Harman

Comput. Stat. Data Anal., 2022

2021

Optimal design of multifactor experiments via grid exploration.

Radoslav Harman, Lenka Filová, Samuel Rosa

Stat. Comput., 2021

2020

On greedy heuristics for computing D-efficient saturated subsets.

Radoslav Harman, Samuel Rosa

Oper. Res. Lett., 2020