Segui
Henry Förster
Henry Förster
Email verificata su uni-tuebingen.de - Home page
Titolo
Citata da
Citata da
Anno
On RAC drawings of graphs with one bend per edge
P Angelini, MA Bekos, H Förster, M Kaufmann
Theoretical Computer Science, 2020
152020
Planar graphs of bounded degree have bounded queue number
MA Bekos, H Förster, M Gronemann, T Mchedlidze, F Montecchiani, ...
SIAM Journal on Computing 48 (5), 1487-1502, 2019
142019
A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution
MA Bekos, H Förster, C Geckeler, L Holländer, M Kaufmann, AM Spallek, ...
International Symposium on Graph Drawing and Network Visualization, 271-285, 2018
132018
On compact RAC drawings
H Förster, M Kaufmann
28th Annual European Symposium on Algorithms (ESA 2020), 2020
82020
Bitonic st-orderings for upward planar graphs: the variable embedding setting
P Angelini, MA Bekos, H Förster, M Gronemann
Graph-Theoretic Concepts in Computer Science: 46th International Workshop …, 2020
72020
Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity
E Argyriou, S Cornelsen, H Förster, M Kaufmann, M Nöllenburg, ...
International Symposium on Graph Drawing and Network Visualization, 509-523, 2018
72018
Drawing Graphs with Circular Arcs and Right Angle Crossings
S Chaplick, H Förster, M Kryven, A Wolff
arXiv preprint arXiv:2003.04740, 2020
62020
On Arrangements of Orthogonal Circles
S Chaplick, H Förster, M Kryven, A Wolff
International Symposium on Graph Drawing and Network Visualization, 216-229, 2019
62019
On smooth orthogonal and octilinear drawings: relations, complexity and kandinsky drawings
MA Bekos, H Förster, M Kaufmann
Algorithmica 81 (5), 2046-2071, 2019
62019
Algorithms and insights for RaceTrack
MA Bekos, T Bruckdorfer, H Förster, M Kaufmann, S Poschenrieder, ...
Theoretical Computer Science 748, 2-16, 2018
62018
On Strict (Outer-) Confluent Graphs
H Förster, R Ganian, F Klute, M Nöllenburg
International Symposium on Graph Drawing and Network Visualization, 147-161, 2019
52019
Planar graphs of bounded degree have constant queue number
MA Bekos, H Förster, M Gronemann, T Mchedlidze, F Montecchiani, ...
arXiv preprint arXiv:1811.00816, 2018
52018
Weakly and strongly fan-planar graphs
O Cheong, H Förster, J Katheder, M Pfister, L Schlipf
International Symposium on Graph Drawing and Network Visualization, 53-68, 2023
42023
Recognizing and Embedding Simple Optimal 2-Planar Graphs
H Förster, M Kaufmann, CN Raftopoulou
Graph Drawing and Network Visualization: 29th International Symposium, GD …, 2021
42021
Linear Layouts of Bipartite Planar Graphs
H Förster, M Kaufmann, L Merker, S Pupyrev, C Raftopoulou
Algorithms and Data Structures Symposium, 444-459, 2023
22023
On the 2-Layer Window Width Minimization Problem
MA Bekos, H Förster, M Kaufmann, S Kobourov, M Kryven, A Kuckuk, ...
International Conference on Current Trends in Theory and Practice of …, 2023
22023
On Strict (Outer-) Confluent Graphs.
H Förster, R Ganian, F Klute, M Nöllenburg
J. Graph Algorithms Appl. 25 (1), 481-512, 2021
22021
Drawing shortest paths in geodetic graphs
S Cornelsen, M Pfister, H Förster, M Gronemann, M Hoffmann, ...
Graph Drawing and Network Visualization: 28th International Symposium, GD …, 2020
22020
Intersections of double-wedge arrangements
D Bertschinger, H Förster, B Vogtenhuber
Proc. $38^ th $ European Workshop on Computational Geometry (EuroCG 2022 …, 2022
12022
Drawing Shortest Paths in Geodetic Graphs
S Cornelsen, M Pfister, H Förster, M Gronemann, M Hoffmann, ...
Brown University, 2022
12022
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20