Radoslav Harman

According to our database, Radoslav Harman authored at least 11 papers between 2008 and 2026.

Collaborative distances:

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

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

Green LIME: Improving AI Explainability through Design of Experiments.

Alexandra Stadler, Werner G. Müller, Radoslav Harman

CoRR, February, 2025

2024

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

Radoslav Harman, Lenka Filová, Samuel Rosa

Stat. 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

Ascent with quadratic assistance for the construction of exact experimental designs.

Lenka Filová, Radoslav Harman

Comput. Stat., 2020

2014

Computing efficient exact designs of experiments using integer quadratic programming.

Radoslav Harman, Lenka Filová

Comput. Stat. Data Anal., 2014

2010

On decompositional algorithms for uniform sampling from n-spheres and n-balls.

Radoslav Harman, Vladimír Lacko

J. Multivar. Anal., 2010

2008

Computing c-optimal experimental designs using the simplex method of linear programming.

Radoslav Harman, Tomás Jurík

Comput. Stat. Data Anal., 2008