|Universität Tübingen||Fakultät > Wilhelm-Schickard-Institut > Algorithmik > Lehrstuhl > Mitarbeiter > Henry Förster|
My primary research interests concern theoretical aspects of Computer Science, focusing on algorithms and their complexity, mostly connected to Information Visualization and Graph Drawing. Visualization of relational data has many applications in diverse fields ranging from computer science over engineering and economics to every-day-applications such as metro-maps. Thus by designing and developing visualization techniques it is possible to facilitate information understanding for a broad variety of users.
M.Sc. in Computer Science
2014 - 2016, University of Tübingen
Department of Informatics
Thesis Topic: An ILP for Perfect Smooth Orthogonal Drawings
Advisors: Michael Kaufmann, Michael A. Bekos
B.Sc. in Engineering & Computing
2010 - 2014, TU Bergakademie Freiberg
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
In F. Frati and K.-L. Ma, Proc. of 25th International Symposium on Graph Drawing (GD 2017), LNCS 10692, pp. 169-183, 2017.
Algorithms and Insights for RaceTrack
In E. Demaine and F. Grandoni editors, Proc. of 8th International Conference on Fun with Algorithms (FUN 2016), LIPIcs, pp. 6:1-6:14, 2016.
|Anregungen / Kritik Impressum|