Universität Tübingen Fakultät > Wilhelm-Schickard-Institut > Algorithmik > Lehrstuhl > Mitarbeiter > Henry Förster
Arbeitsbereich Algorithmik

Henry Förster

  • Address
    Arbeitsbereich Algorithmik
    WSI für Informatik
    Sand 14
    D-72076 Tübingen
    Contact Information
    • Room:
    • C108
    • Phone:
    • +49 7071 29-70480
    • Email:
    • foersth (at) informatik.uni-tuebingen.de
    • Office Hours:
    • by appointment


Research Interests

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.

Curriculum Vitae

Education

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
Degree: 1.4
B.Sc. in Engineering & Computing
2010 - 2014, TU Bergakademie Freiberg
Degree: 1.8

Publications

Journal Publications

On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
joint with Michael A. Bekos and Michael Kaufmann
In Algorithmica, 2018.
Algorithms and Insights for RaceTrack
joint with Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Simon Poschenrieder and Thomas Stüber
In Theoretical Computer Science: Special issue on selected papers from the 8th Int. Conference on Fun with Algorithms (FUN 2016), 2018.

Conference Publications

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
joint with Evmorfia N. Argyriou, Sabine Cornelsen, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou and Alexander Wolff
In T. Biedl and A. Kerren, Proc. of 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), 2018, to appear.
A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution
joint with Michael A. Bekos, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek and Jan Splett
In T. Biedl and A. Kerren, Proc. of 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), 2018, to appear.
On RAC Drawings of Graphs with one Bend per Edge
joint with Patrizio Angelini, Michael A. Bekos and Michael Kaufmann
In T. Biedl and A. Kerren, Proc. of 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), 2018, to appear.
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
joint with Michael A. Bekos and Michael Kaufmann
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
joint with Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Simon Poschenrieder and Thomas Stüber
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.

Theses

An ILP for Perfect Smooth Orthogonal Drawings
Department of Computer Science, Eberhard-Karls-Universität Tübingen, 2016.

Teaching

  • Praktikum: Graphen und Netzwerkalgorithmen (WS 18/19)
  • Proseminar: Graphenzeichnen (WS 18/19)
  • Seminar: Graph Datenbanken (SS 18)
  • Programmierprojekt: Netzwerkspiel (SS 18)
  • Praktikum: Graphen und Netzwerkalgorithmen (SS 18)
  • Praktikum: Graphen und Netzwerkalgorithmen (WS 17/18)
  • Übungen zur Vorlesung: Algorithmen und Komplexitat (WS 17/18)
  • Programmierprojekt: Moeraki Kemu (SS 17)
  • Übungen zur Vorlesung: Algorithmen und Komplexitat (WS 16/17)
  • Proseminar: Concrete Mathematics (WS 16/17)
Impressum Datenschutzerklärung minicms