Computing c-optimal experimental designs using the simplex method of linear programming. - Radoslav Harman; Tomás Jurík (Comput. Stat. Data Anal., 2008)

On decompositional algorithms for uniform sampling from n-spheres and n-balls. - Radoslav Harman; Vladimír Lacko (J. Multivar. Anal., 2010)

Computing efficient exact designs of experiments using integer quadratic programming. - Radoslav Harman; Lenka Filová (Comput. Stat. Data Anal., 2014)

Ascent with quadratic assistance for the construction of exact experimental designs. - Lenka Filová; Radoslav Harman (Comput. Stat., 2020)

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)

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

Green LIME: Improving AI Explainability through Design of Experiments. - Alexandra Stadler; Werner G. Müller; Radoslav Harman (CoRR, 2025)