Follow
Martin Gronemann
Martin Gronemann
Postdoctoral Reasearcher, University Osnabrück, Germany
Verified email at uni-osnabrueck.de
Title
Cited by
Cited by
Year
Drawing clustered graphs as topographic maps
M Gronemann, M Jünger
International Symposium on Graph Drawing, 426-438, 2012
362012
Two-page book embeddings of 4-planar graphs
MA Bekos, M Gronemann, CN Raftopoulou
Algorithmica 75 (1), 158-185, 2016
352016
Queue layouts of planar 3-trees
JM Alam, MA Bekos, M Gronemann, M Kaufmann, S Pupyrev
Algorithmica 82 (9), 2564-2585, 2020
282020
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
212019
Crossing minimization in storyline visualization
M Gronemann, M Jünger, F Liers, F Mambelli
International Symposium on Graph Drawing and Network Visualization, 367-381, 2016
172016
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, ...
J. Graph Algorithms Appl. 21 (1), 81-102, 2017
162017
On dispersable book embeddings
JM Alam, MA Bekos, V Dujmović, M Gronemann, M Kaufmann, S Pupyrev
Theoretical Computer Science 861, 1-22, 2021
122021
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
112019
Bitonic st-orderings of Biconnected Planar Graphs
M Gronemann
International Symposium on Graph Drawing, 162-173, 2014
112014
Planar octilinear drawings with one bend per edge
MA Bekos, M Gronemann, M Kaufmann, R Krug
International Symposium on Graph Drawing, 331-342, 2014
112014
Engineering the fast-multipole-multilevel method for multicore and SIMD architectures
M Gronemann
Master's thesis. Technische Univ. Dortmund, 2009
112009
Perfect smooth orthogonal drawings
MA Bekos, M Gronemann, S Pupyrev, CN Raftopoulou
IISA 2014, The 5th International Conference on Information, Intelligence …, 2014
102014
Bitonic st-orderings for Upward Planar Graphs
M Gronemann
International Symposium on Graph Drawing and Network Visualization, 222-235, 2016
92016
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
82020
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
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
42020
Algorithms for incremental planar graph drawing and two-page book embeddings
M Gronemann
Universität zu Köln, 2015
42015
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
32021
On the queue number of planar graphs
MA Bekos, M Gronemann, CN Raftopoulou
International Symposium on Graph Drawing and Network Visualization, 271-284, 2021
32021
10 Reasons to get interested in graph drawing
C Binucci, U Brandes, T Dwyer, M Gronemann, R Hanxleden, M Kreveld, ...
Computing and software science, 85-104, 2019
32019
The system can't perform the operation now. Try again later.
Articles 1–20