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

    • 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

    Dr. rer. nat.
    2016 - 2020, University of Tübingen
    Faculty of Science
    Doctoral Subject: Computer Science
    Thesis Topic: Graph Drawing Beyond the Beaten Tracks
    Advisor: Michael Kaufmann
    Degree: summa cum laude
    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 RAC Drawings of Graphs with one Bend per Edge
    joint with Patrizio Angelini, Michael A. Bekos and Michael Kaufmann
    In Theoretical Computer Science, 2020.
    Planar Graphs of Bounded Degree have Bounded Queue Number
    joint with Michael Bekos, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi Raftopoulou and Torsten Ueckerdt
    In SIAM Journal on Computing, 2019.
    On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
    joint with Michael A. Bekos and Michael Kaufmann
    In Algorithmica, 2019.
    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

    2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth.
    joint with Patrizio Angelini, Giordano Da Lozzo and Thomas Schneck
    To appear in the proceedings of GD 2020.
    Drawing Shortest Paths in Geodetic Graphs
    joint with Sabine Cornelsen, Maximilian Pfister, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov and Thomas Schneck
    To appear in the proceedings of GD 2020.
    On Compact RAC Drawings
    joint with Michael Kaufmann
    In F. Grandoni, G. Herman and P. Sanders, 28th Annual European Symposium on Algorithms, ESA 2020
    Bitonic st-orderings for Upward Planar Graphs: The Variable Embedding Setting
    joint with Patrizio Angelini, Michael Bekos and Martin Gronemann
    In I. Adler and H. Müller, Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Revised Selected Papers.
    Drawing Graphs with Circular Arcs and Right Angle Crossings
    joint with Steven Chaplick, Myroslav Kryven and Alexander Wollf
    In S. Albers, 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020.
    On Strict (Outer-)Confluent Graphs
    joint with Robert Ganian, Fabian Klute and Martin Nöllenburg
    In D. Archambault and C. D. Tóth, Proc. of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), 2019.
    The QuaSEFE Problem
    joint with Patrizio Angelini, Michael Hoffmann, Michael Kaufmann, Stephen Kobourov, Giuseppe Liotta and Maurizio Patrignani
    In D. Archambault and C. D. Tóth, Proc. of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), 2019.
    On Arrangements of Orthogonal Circles
    joint with Steven Chaplick, Myroslav Kryven and Alexander Wolff
    In D. Archambault and C. D. Tóth, Proc. of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), 2019.
    Planar Graphs of Bounded Degree have Bounded Queue Number
    joint with Michael Bekos, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi Raftopoulou and Torsten Ueckerdt
    In 51st ACM Symposium on Theory of Computing (STOC 2019), 2019.
    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.
    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.
    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.
    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.

    Other Publications

    Monotone Arc Diagrams with few Biarcs
    joint with Steven Chaplick, Michael Hoffmann and Michael Kaufmann
    Extended Abstract presented at EuroCG 2020.
    On Compact RAC Drawings
    joint with Michael Kaufmann
    Poster presented at GD2019.

    Theses

    Graph Drawing Beyond the Beaten Tracks
    Mathematisch-Naturwissenschaftliche Fakultät, Eberhard-Karls-Universität Tübingen, 2020.
    An ILP for Perfect Smooth Orthogonal Drawings
    Department of Computer Science, Eberhard-Karls-Universität Tübingen, 2016.

    Awards

    Teaching

    • Übungen zur Vorlesung: Algorithmen (WS 20/21)
    • Übungen zur Vorlesung: Algorithmen und Komplexitat (SS 20)
    • Praktikum: Graphen und Netzwerkalgorithmen (SS 20)
    • Übungen zur Vorlesung: Algorithmen und Komplexitat (SS 19)
    • Praktikum: Graphen und Netzwerkalgorithmen (SS 19)
    • Programmierprojekt: Escape Game (SS 19)
    • 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)
    --> Our website has moved permanently to https://uni-tuebingen.de/fakultaeten/mathematisch-naturwissenschaftliche-fakultaet/fachbereiche/informatik/lehrstuehle/algorithmik/home/!
    Impressum Datenschutzerklärung minicms