| On RAC drawings of graphs with one bend per edge P Angelini, MA Bekos, H Förster, M Kaufmann Theoretical Computer Science, 2020 | 23 | 2020 |
| 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 | 18 | 2018 |
| 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 | 15 | 2019 |
| On compact RAC drawings H Förster, M Kaufmann 28th Annual European Symposium on Algorithms (ESA 2020), 2020 | 13 | 2020 |
| 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 | 9 | 2021 |
| 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 | 8 | 2023 |
| Drawing Graphs with Circular Arcs and Right Angle Crossings S Chaplick, H Förster, M Kryven, A Wolff arXiv preprint arXiv:2003.04740, 2020 | 8 | 2020 |
| Algorithms and insights for RaceTrack MA Bekos, T Bruckdorfer, H Förster, M Kaufmann, S Poschenrieder, ... Theoretical Computer Science 748, 2-16, 2018 | 7 | 2018 |
| 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 | 7 | 2018 |
| 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 | 6 | 2023 |
| 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 | 6 | 2020 |
| 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 | 6 | 2019 |
| On smooth orthogonal and octilinear drawings: relations, complexity and kandinsky drawings MA Bekos, H Förster, M Kaufmann Algorithmica 81 (5), 2046-2071, 2019 | 6 | 2019 |
| 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 | 5 | 2019 |
| 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 | 5 | 2018 |
| Geometric Thickness of Multigraphs is -Complete H Förster, P Kindermann, T Miltzow, I Parada, S Terziadis, B Vogtenhuber Latin American Symposium on Theoretical Informatics, 336-349, 2024 | 4 | 2024 |
| 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 | 4 | 2023 |
| On Strict (Outer-) Confluent Graphs. H Förster, R Ganian, F Klute, M Nöllenburg J. Graph Algorithms Appl. 25 (1), 481-512, 2021 | 4 | 2021 |
| Evaluating Animation Parameters for Morphing Edge Drawings C Binucci, H Förster, J Katheder, A Tappini International Symposium on Graph Drawing and Network Visualization, 246-262, 2023 | 2 | 2023 |
| Drawing Shortest Paths in Geodetic Graphs S Cornelsen, M Pfister, H Förster, M Gronemann, M Hoffmann, ... Brown University, 2022 | 2 | 2022 |
Michael KaufmannProfessor of Computer Science, Tübingen University確認したメール アドレス: uni-tuebingen.de