Kolovsky.cz
Home Papers Orienteering maps training plan
ResearchID: Q-5197-2017
ORCID: http://orcid.org/0000-0002-2070-5871

Implementace paralelního algoritmu pro hledání optimální cesty závislé na čase
My Bachelor thesis at Univesity of West Bohemia (in czech language)
English version: Time depentent shortest path problem using MapReduce

Restricted Areas Obeying Path Search Algorithm without Preprocessing
ACM SIGSPATIAL 2015 (GIS Cup paper)

Traffic Volume Modeling in Parallel Computing Environment
My Master thesis at Univesity of West Bohemia

The Origin-Destination matrix estimation for large transportation models in an uncongested network
ICMA 2018

Algorithms in transportation
The State of the Art and Concept of PhD Thesis

The e-approximation of the Label Correcting Modification of the Dijkstra's Algorithm
In Proceedings of the 5th International Conference on Geographical Information Systems Theory, Applications and Management (GISTAM 2019)

The ε-Approximation of the Time-Dependent Shortest Path Problem Solution for All Departure Times
ISPRS International Journal of Geo-Information