The campus of the TU Dortmund University is located near the freeway junction Dortmund West, where the Sauerland line A45 crosses the Ruhr expressway B1/A40. The Dortmund-Eichlinghofen exit on the A45 leads to the South Campus, the Dortmund-Dorstfeld exit on the A40 leads to the North Campus. The university is signposted at both exits. All FAIR PIs have offices on the North Campus. FAIR's main offices will be located a bit off the North Campus on Martin-Schmeisser-Weg 17 (parking behind the building).
The "Dortmund Universität" S-Bahn station is located directly on the North Campus. From there, the S-Bahn line S1 runs every 15 or 30 minutes to Dortmund main station and in the opposite direction to Düsseldorf main station via Bochum, Essen and Duisburg. In addition, the university can be reached by bus lines 445, 447 and 462. Timetable information can be found on the homepage of the Verkehrsverbundes Rhein-Ruhr, and DSW21 also offer an interactive route network map.
From Dortmund Airport, the AirportExpress takes just over 20 minutes to Dortmund main station and from there to the university by S-Bahn. A wider range of international flight connections is offered by Düsseldorf Airport, about 60 kilometers away, which can be reached directly by S-Bahn from the university's train station.
One of the landmarks of the TU Dortmund is the H-Bahn. Line 1 runs every 10 minutes between Dortmund Eichlinghofen and the Technology Center via Campus South and Dortmund University S, while Line 2 commutes every 5 minutes between Campus North and Campus South. It covers this distance in two minutes.
Information for
You are here:
Amer Krivošija received his PhD in theoretical computer science in 2021 at the TU Dortmund. He has worked at the TU since 2012, most recently in the collaborative research center SFB 876. Before starting his doctoral research at TU Dortmund, he obtained a diploma in mathematics, and a master in computer science, both from the University of Sarajevo.
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