Michael A. Bekos
Michael A. Bekos
Postdoctoral Reasearcher, Eberhard-Karls-Universität Tübingen - Department of Computer Science
Verified email at informatik.uni-tuebingen.de - Homepage
Title
Cited by
Cited by
Year
Boundary labeling: Models and efficient algorithms for rectangular maps
MA Bekos, M Kaufmann, A Symvonis, A Wolff
Computational Geometry 36 (3), 215-236, 2007
1322007
The straight-line RAC drawing problem is NP-hard
EN Argyriou, MA Bekos, A Symvonis
J. Graph Algorithms Appl. 16 (2), 569–597, 2012
612012
Area-feature boundary labeling
MA Bekos, M Kaufmann, K Potika, A Symvonis
The Computer Journal 53 (6), 827-841, 2010
46*2010
Boundary labeling with octilinear leaders
MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis
Algorithmica 57 (3), 436-461, 2010
452010
Smooth orthogonal layouts
MA Bekos, M Kaufmann, SG Kobourov, A Symvonis
J. Graph Algorithms Appl. 17 (5), 575-595, 2013
402013
On the recognition of fan-planar and maximal outer-fan-planar graphs
MA Bekos, S Cornelsen, L Grilli, SH Hong, M Kaufmann
Algorithmica 79 (2), 401–427, 2017
362017
Line crossing minimization on metro maps
MA Bekos, M Kaufmann, K Potika, A Symvonis
International Symposium on Graph Drawing, 231-242, 2007
362007
Maximizing the total resolution of graphs
EN Argyriou, MA Bekos, A Symvonis
The Computer Journal 56 (7), 887–900, 2012
332012
The book thickness of 1-planar graphs is constant
MA Bekos, T Bruckdorfer, M Kaufmann, CN Raftopoulou
Algorithmica 79 (2), 444-465, 2017
32*2017
Two-page book embeddings of 4-planar graphs
MA Bekos, M Gronemann, CN Raftopoulou
Algorithmica 75 (1), 158-185, 2016
302016
Simple k-planar graphs are simple (k+ 1)-quasiplanar
P Angelini, MA Bekos, FJ Brandenburg, G Da Lozzo, G Di Battista, ...
Journal of Combinatorial Theory, Series B 142, 1-35, 2020
26*2020
Multi-stack boundary labeling problems
MA Bekos, M Kaufmann, K Potika, A Symvonis
International Conference on Foundations of Software Technology and …, 2006
262006
On RAC drawings of 1-planar graphs
MA Bekos, W Didimo, G Liotta, S Mehrabi, F Montecchiani
Theoretical Computer Science 689, 48-57, 2017
242017
On optimal 2-and 3-planar graphs
MA Bekos, M Kaufmann, CN Raftopoulou
Symposium on Computational Geometry 77, 16:1--16:16, 2017
242017
Many-to-one boundary labeling with backbones
MA Bekos, S Cornelsen, M Fink, SH Hong, M Kaufmann, M Nöllenburg, ...
J. Graph Algorithms Appl. 19 (3), 779-816, 2015
232015
Geometric RAC simultaneous drawings of graphs
E Argyriou, M Bekos, M Kaufmann, A Symvonis
International Computing and Combinatorics Conference, 287-298, 2012
222012
Queue layouts of planar 3-trees
JM Alam, MA Bekos, M Gronemann, M Kaufmann, S Pupyrev
Algorithmica, 1-22, 2020
192020
Smooth orthogonal drawings of planar graphs
MJ Alam, MA Bekos, M Kaufmann, P Kindermann, SG Kobourov, A Wolff
Latin American Symposium on Theoretical Informatics, 144-155, 2014
192014
On metro-line crossing minimization.
E Argyriou, MA Bekos, M Kaufmann, A Symvonis
J. Graph Algorithms Appl. 14 (1), 75-96, 2010
192010
Simultaneous drawing of planar graphs with right-angle crossings and few bends
MA Bekos, TC van Dijk, P Kindermann, A Wolff
International Workshop on Algorithms and Computation, 222-233, 2015
162015
The system can't perform the operation now. Try again later.
Articles 1–20