• Streaming algorithms
• Large and high-dimensional data
• Clustering problems
• Curve similarities
• Curve simplification

Selected Publications

A. Krivošija (2021). On clustering and related problems on curves under the Fréchet distance. Ph.D. Thesis, Technische Universität Dortmund, http://dx.doi.org/10.17877/DE290R-22055

M. Buchin, A. Krivošija, A. Neuhaus (2020). Computing the Fréchet distance of trees and graphs of bounded treewidth. 36th European Workshop on Computational Geometry (EuroCG), https://arxiv.org/abs/2001.10502

M. Buchin, N. Funk, A. Krivošija (2020). On the complexity of the middle curve problem. 36th European Workshop on Computational Geometry (EuroCG), https://arxiv.org/abs/2001.10298

A. Krivošija, A. Munteanu (2019). Probabilistic smallest enclosing ball in high dimensions via subgradient sampling. Proceedings of the 35th International Symposium on Computational Geometry (SoCG), pp. 47:1-47:14, https://doi.org/10.4230/LIPIcs.SoCG.2019.47

H. Fichtenberger, A. Krivošija, A. Rey (2019). Testing stability properties in graphical hedonic games. Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS) , pp. 882-890, http://dl.acm.org/citation.cfm?id=3331781

A. Driemel, A. Krivošija (2018). Probabilistic embeddings of the Fréchet distance. Proceedings of the 16th Workshop on Approximation and Online Algorithms (WAOA), pp. 218-237, https://doi.org/10.1007/978-3-030-04693-4_14

A. Driemel, A. Krivošija, C. Sohler (2016). Clustering time series under the Fréchet distance. Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 766-785, https://doi.org/10.1137/1.9781611974331.ch55