Ondrej Sokol

Orcid: 0000-0002-7619-9066

According to our database1, Ondrej Sokol authored at least 7 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability.
Comput. Complex., December, 2024

2022
Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic.
Central Eur. J. Oper. Res., 2022

2021
Clustering with Penalty for Joint Occurrence of Objects: Computational Aspects.
CoRR, 2021

2020
Rank Estimators for Robust Regression: Approximate Algorithms, Exact Algorithms and Two-Stage Methods.
Proceedings of the Integrated Uncertainty in Knowledge Modelling and Decision Making, 2020

2019
The algorithm by Ferson et al. is surprisingly fast: An NP-hard optimization problem solvable in almost linear time with high probability.
CoRR, 2019

2018
A Note on Partial Identification of Regression Parameters in Regression with Interval-Valued Dependent Variable.
Proceedings of the Applied Computer Sciences in Engineering, 2018

2017
Clustering retail products based on customer behaviour.
Appl. Soft Comput., 2017


  Loading...