| Boundary labeling: Models and efficient algorithms for rectangular maps MA Bekos, M Kaufmann, A Symvonis, A Wolff Computational Geometry 36 (3), 215-236, 2007 | 154 | 2007 |
| The straight-line RAC drawing problem is NP-hard EN Argyriou, MA Bekos, A Symvonis J. Graph Algorithms Appl. 16 (2), 569–597, 2012 | 80 | 2012 |
| 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 | 56 | 2017 |
| Boundary labeling with octilinear leaders MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis Algorithmica 57 (3), 436-461, 2010 | 56 | 2010 |
| The book thickness of 1-planar graphs is constant MA Bekos, T Bruckdorfer, M Kaufmann, CN Raftopoulou Algorithmica 79, 444-465, 2017 | 53* | 2017 |
| Four pages are indeed necessary for planar graphs MA Bekos, M Kaufmann, F Klute, S Pupyrev, C Raftopoulou, T Ueckerdt Journal of Computational Geomerty 11 (1), 332-353, 2020 | 52 | 2020 |
| On optimal 2-and 3-planar graphs MA Bekos, M Kaufmann, CN Raftopoulou Symposium on Computational Geometry 77, 16:1--16:16, 2017 | 52 | 2017 |
| Area-feature boundary labeling MA Bekos, M Kaufmann, K Potika, A Symvonis The Computer Journal 53 (6), 827-841, 2010 | 52* | 2010 |
| External labeling techniques: A taxonomy and survey MA Bekos, B Niedermann, M Nöllenburg Computer Graphics Forum 38 (3), 833-860, 2019 | 47* | 2019 |
| Two-page book embeddings of 4-planar graphs MA Bekos, M Gronemann, CN Raftopoulou Algorithmica 75, 158-185, 2016 | 46 | 2016 |
| Maximizing the total resolution of graphs EN Argyriou, MA Bekos, A Symvonis The Computer Journal 56 (7), 887–900, 2012 | 46 | 2012 |
| Queue layouts of planar 3-trees JM Alam, MA Bekos, M Gronemann, M Kaufmann, S Pupyrev Algorithmica 82, 2564-2585, 2020 | 44 | 2020 |
| 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 | 43* | 2020 |
| Smooth orthogonal layouts MA Bekos, M Kaufmann, SG Kobourov, A Symvonis J. Graph Algorithms Appl. 17 (5), 575-595, 2013 | 43 | 2013 |
| Line crossing minimization on metro maps MA Bekos, M Kaufmann, K Potika, A Symvonis Graph Drawing: 15th International Symposium, GD 2007, Sydney, Australia …, 2008 | 43 | 2008 |
| On RAC drawings of 1-planar graphs MA Bekos, W Didimo, G Liotta, S Mehrabi, F Montecchiani Theoretical Computer Science 689, 48-57, 2017 | 39 | 2017 |
| 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 | 34 | 2015 |
| Geometric RAC simultaneous drawings of graphs E Argyriou, M Bekos, M Kaufmann, A Symvonis Computing and Combinatorics: 18th Annual International Conference, COCOON …, 2012 | 29 | 2012 |
| Multi-stack boundary labeling problems MA Bekos, M Kaufmann, K Potika, A Symvonis FSTTCS 2006: Foundations of Software Technology and Theoretical Computer …, 2006 | 28 | 2006 |
| Graph product structure for h-framed graphs MA Bekos, G Da Lozzo, P Hliněný, M Kaufmann arXiv preprint arXiv:2204.11495, 2022 | 27 | 2022 |
Michael KaufmannProfessor of Computer Science, Tübingen Universityuni-tuebingen.de의 이메일 확인됨
