On greedy heuristics for computing D-efficient saturated subsets. - Radoslav Harman; Samuel Rosa (Oper. Res. Lett., 2020)

Optimal design of multifactor experiments via grid exploration. - Radoslav Harman; Lenka Filová; Samuel Rosa (Stat. Comput., 2021)

Computing minimum-volume enclosing ellipsoids for large datasets. - Samuel Rosa; Radoslav Harman (Comput. Stat. Data Anal., 2022)

Toward more numerically stable computations of optimal experimental designs. - Samuel Rosa (Commun. Stat. Simul. Comput., 2024)

The polytope of optimal approximate designs: extending the selection of informative experiments. - Radoslav Harman; Lenka Filová; Samuel Rosa (Stat. Comput., 2024)