Radoslav Harman

11 papers Journal 11
YearRankTypeTitle / Venue / Authors
2026 J jnl
Removal of redundant candidate points for the exact D-optimal design problem.
Stat. Comput.
Radoslav Harman, Samuel Rosa
2025 J jnl
Green LIME: Improving AI Explainability through Design of Experiments.
CoRR
Alexandra Stadler, Werner G. Müller, Radoslav Harman
2025 J jnl
Laplacian Network Optimization via Information Functions.
CoRR
Samuel Rosa, Radoslav Harman
2024 J jnl
The polytope of optimal approximate designs: extending the selection of informative experiments.
Stat. Comput.
Radoslav Harman, Lenka Filová, Samuel Rosa
2022 J jnl
Computing minimum-volume enclosing ellipsoids for large datasets.
Comput. Stat. Data Anal.
Samuel Rosa, Radoslav Harman
2021 J jnl
Optimal design of multifactor experiments via grid exploration.
Stat. Comput.
Radoslav Harman, Lenka Filová, Samuel Rosa
2020 J jnl
Ascent with quadratic assistance for the construction of exact experimental designs.
Comput. Stat.
Lenka Filová, Radoslav Harman
2020 J jnl
On greedy heuristics for computing D-efficient saturated subsets.
Oper. Res. Lett.
Radoslav Harman, Samuel Rosa
2014 J jnl
Computing efficient exact designs of experiments using integer quadratic programming.
Comput. Stat. Data Anal.
Radoslav Harman, Lenka Filová
2010 J jnl
On decompositional algorithms for uniform sampling from n-spheres and n-balls.
J. Multivar. Anal.
Radoslav Harman, Vladimír Lacko
2008 J jnl
Computing c-optimal experimental designs using the simplex method of linear programming.
Comput. Stat. Data Anal.
Radoslav Harman, Tomás Jurík