Martin Gronemann
Cited by
Cited by
Two-page book embeddings of 4-planar graphs
MA Bekos, M Gronemann, CN Raftopoulou
Algorithmica 75, 158-185, 2016
Drawing clustered graphs as topographic maps
M Gronemann, M Jünger
Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA …, 2013
Queue layouts of planar 3-trees
JM Alam, MA Bekos, M Gronemann, M Kaufmann, S Pupyrev
Algorithmica 82, 2564-2585, 2020
Multi-level Steiner trees
R Ahmed, P Angelini, FD Sahneh, A Efrat, D Glickenstein, M Gronemann, ...
Journal of Experimental Algorithmics (JEA) 24, 1-22, 2019
Crossing minimization in storyline visualization
M Gronemann, M Jünger, F Liers, F Mambelli
Graph Drawing and Network Visualization: 24th International Symposium, GD …, 2016
Algorithms and characterizations for 2-layer fan-planarity: From caterpillar to stegosaurus
C Binucci, M Chimani, W Didimo, M Gronemann, K Klein, J Kratochvíl, ...
Journal of Graph Algorithms and Applications 21 (1), 81-102, 2017
Book embeddings of nonplanar graphs with small faces in few pages
MA Bekos, G Da Lozzo, S Griesbach, M Gronemann, F Montecchiani, ...
arXiv preprint arXiv:2003.07655, 2020
On dispersable book embeddings
JM Alam, MA Bekos, V Dujmović, M Gronemann, M Kaufmann, S Pupyrev
Theoretical Computer Science 861, 1-22, 2021
Bitonic st-orderings for Upward Planar Graphs
M Gronemann
International Symposium on Graph Drawing and Network Visualization, 222-235, 2016
Planar graphs of bounded degree have bounded queue number
M Bekos, H Förster, M Gronemann, T Mchedlidze, F Montecchiani, ...
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Bitonic st-orderings of Biconnected Planar Graphs
M Gronemann
Graph Drawing: 22nd International Symposium, GD 2014, Würzburg, Germany …, 2014
Planar octilinear drawings with one bend per edge
MA Bekos, M Gronemann, M Kaufmann, R Krug
International Symposium on Graph Drawing, 331-342, 2014
Engineering the fast-multipole-multilevel method for multicore and SIMD architectures
M Gronemann
Master's thesis. Technische Univ. Dortmund, 2009
On the queue number of planar graphs
MA Bekos, M Gronemann, CN Raftopoulou
International Symposium on Graph Drawing and Network Visualization, 271-284, 2021
Perfect smooth orthogonal drawings
MA Bekos, M Gronemann, S Pupyrev, CN Raftopoulou
IISA 2014, The 5th International Conference on Information, Intelligence …, 2014
10 reasons to get interested in graph drawing
C Binucci, U Brandes, T Dwyer, M Gronemann, R von Hanxleden, ...
Computing and Software Science: State of the Art and Perspectives, 85-104, 2019
Bitonic st-orderings for upward planar graphs: the variable embedding setting
P Angelini, MA Bekos, H Förster, M Gronemann
International Workshop on Graph-Theoretic Concepts in Computer Science, 339-351, 2020
Lazy queue layouts of posets
JM Alam, MA Bekos, M Gronemann, M Kaufmann, S Pupyrev
Algorithmica 85 (5), 1176-1201, 2023
Recognizing DAGs with page-number 2 is NP-complete
MA Bekos, G Da Lozzo, F Frati, M Gronemann, T Mchedlidze, ...
Theoretical Computer Science 946, 113689, 2023
Grid drawings of graphs with constant edge-vertex resolution
MA Bekos, M Gronemann, F Montecchiani, D Pálvölgyi, A Symvonis, ...
Computational Geometry 98, 101789, 2021
The system can't perform the operation now. Try again later.
Articles 1–20