Henry Förster
Scholar

Henry Förster

Google Scholar ID: xGbEZOMAAAAJ
Post-Doc, Technical University of Munich
Graph DrawingGraph AlgorithmsInformation Visualization
Citations & Impact
All-time
Citations
190
 
H-index
8
 
i10-index
7
 
Publications
20
 
Co-authors
16
list available
Contact
No contact links provided.
Resume (English only)
Academic Achievements
  • Publications: Please refer to the list on DBLP; Awards: Best Paper Award at GD 2024, First Place at GD Contest 2022 Live Challenge (Manual Category), Best Presentation Award at GD 2022, First Place at GD Contest 2020 Live Challenge (Automatic Category), First Place at GD Contest 2019 Live Challenge (Automatic and Manual Categories), First Place at GD Contest 2018 Live Challenge (Automatic Category); Committees and Other Services to the Community: PC member GD2025, PC member WG2025, OC member WG2022, PC member GD2022, OC member GD2021, SafeToC advocate for GD
Research Experience
  • 2024-today: Post-Doc, Technical University of Munich; 2020-2024: Post-Doc, University of Tübingen
Education
  • 2010-2014: B.Sc. in Engineering & Computing, TU Bergakademie Freiberg; 2014-2016: M.Sc. in Computer Science, University of Tübingen, Advisors: Michael Kaufmann, Michael A. Bekos; 2016-2020: Dr. rer. nat., University of Tübingen, Advisor: Michael Kaufmann, Thesis Topic: Graph Drawing Beyond the Beaten Tracks
Background
  • Research Interests: Mainly studies graph embeddings, with a focus on algorithms for automatic generation of graph embeddings, their time complexity, and theoretical bounds for aesthetic criteria motivated by practical applications. Graph embeddings arise not only in network visualization but also in technical applications such as VLSI layouting or floor planning.