Michael A. Bekos

Cited by

	All	Since 2016
Citations	1032	626
h-index	17	14
i10-index	32	22

240

120

180

200520062007200820092010201120122013201420152016201720182019202020216 10 24 42 27 42 32 31 45 49 71 79 79 88 132 226 15

Co-authors

Michael KaufmannProfessor of Computer Science, Tübingen UniversityVerified email at informatik.uni-tuebingen.de
Antonios SymvonisNational Technical U. of AthensVerified email at math.ntua.gr
Patrizio AngeliniJohn Cabot UniversityVerified email at dia.uniroma3.it
Fabrizio MontecchianiUniversity of PerugiaVerified email at unipg.it
Martin GronemannPostdoctoral Reasearcher, University Osnabrück, GermanyVerified email at uni-osnabrueck.de
Evmorfia N. ArgyriouSpecial Laboratory and Teaching Staff - National Technical University of AthensVerified email at math.ntua.gr
Stephen KobourovProfessor of Computer Science, University of ArizonaVerified email at cs.arizona.edu
Walter DidimoAssociate Professor, University of PerugiaVerified email at unipg.it
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgVerified email at uni-wuerzburg.de
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienVerified email at ac.tuwien.ac.at
Katerina PotikaSan Jose State UniversityVerified email at sjsu.edu
Philipp KindermannUniversität WürzburgVerified email at uni-wuerzburg.de
Sergey PupyrevFacebookVerified email at uran.ru
Giuseppe LiottaProfessor of Computer Science, University of PerugiaVerified email at unipg.it
Ignaz RutterUniversity of PassauVerified email at uni-passau.de
Muhammad Jawaherul AlamPh.D., Computer Science, University of ArizonaVerified email at cs.arizona.edu
Sankar VeeramoniTurbonomicVerified email at cs.arizona.edu

Michael A. Bekos

Postdoctoral Reasearcher, Eberhard-Karls-Universität Tübingen - Department of Computer Science

Verified email at informatik.uni-tuebingen.de - Homepage

Graph Algorithms


Title Sort by citations Sort by year Sort by 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	128	2007
The straight-line RAC drawing problem is NP-hard EN Argyriou, MA Bekos, A Symvonis International Conference on Current Trends in Theory and Practice of …, 2011	60	2011
Boundary labeling with octilinear leaders MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis Algorithmica 57 (3), 436-461, 2010	43	2010
Smooth orthogonal layouts MA Bekos, M Kaufmann, SG Kobourov, A Symvonis International Symposium on Graph Drawing, 150-161, 2012	40	2012
Line crossing minimization on metro maps MA Bekos, M Kaufmann, K Potika, A Symvonis International Symposium on Graph Drawing, 231-242, 2007	36	2007
On the recognition of fan-planar and maximal outer-fan-planar graphs MA Bekos, S Cornelsen, L Grilli, SH Hong, M Kaufmann International Symposium on Graph Drawing, 198-209, 2014	34	2014
Maximizing the total resolution of graphs EN Argyriou, MA Bekos, A Symvonis International Symposium on Graph Drawing, 62-67, 2010	33	2010
Two-page book embeddings of 4-planar graphs MA Bekos, M Gronemann, CN Raftopoulou Algorithmica 75 (1), 158-185, 2016	29	2016
Polygon labelling of minimum leader length MA Bekos, M Kaufmann, K Potika, A Symvonis APVis, 15-21, 2006	27	2006
Multi-stack boundary labeling problems MA Bekos, M Kaufmann, K Potika, A Symvonis International Conference on Foundations of Software Technology and …, 2006	26	2006
On RAC drawings of 1-planar graphs MA Bekos, W Didimo, G Liotta, S Mehrabi, F Montecchiani Theoretical Computer Science 689, 48-57, 2017	24	2017
On optimal 2-and 3-planar graphs MA Bekos, M Kaufmann, CN Raftopoulou arXiv preprint arXiv:1703.06526, 2017	24	2017
Area-feature boundary labeling MA Bekos, M Kaufmann, K Potika, A Symvonis The Computer Journal 53 (6), 827-841, 2010	23	2010
Geometric RAC simultaneous drawings of graphs E Argyriou, M Bekos, M Kaufmann, A Symvonis International Computing and Combinatorics Conference, 287-298, 2012	22	2012
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	19	2014
On metro-line crossing minimization. E Argyriou, MA Bekos, M Kaufmann, A Symvonis Journal of Graph Algorithms and Applications 14 (1), 75-96, 2010	19	2010
Queue layouts of planar 3-trees JM Alam, MA Bekos, M Gronemann, M Kaufmann, S Pupyrev Algorithmica, 1-22, 2020	18	2020
The book thickness of 1-planar graphs is constant MA Bekos, T Bruckdorfer, M Kaufmann, CN Raftopoulou Algorithmica 79 (2), 444-465, 2017	17	2017
On the Relationship Between k-Planar and k-Quasi-Planar Graphs P Angelini, MA Bekos, FJ Brandenburg, G Da Lozzo, G Di Battista, ... International Workshop on Graph-Theoretic Concepts in Computer Science, 59-74, 2017	17	2017
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	16	2015

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors