Michael A. Bekos

Citata da

	Tutte	Dal 2018
Citazioni	1475	882
Indice H	20	16
i10-index	42	32

220

110

165

20052006200720082009201020112012201320142015201620172018201920202021202220236 10 22 45 23 40 33 36 51 51 74 83 72 104 111 219 150 123 162

Accesso pubblico

Visualizza tutto

37 articoli

2 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Michael KaufmannProfessor of Computer Science, Tübingen UniversityEmail verificata su informatik.uni-tuebingen.de
Antonios SymvonisNational Technical U. of AthensEmail verificata su math.ntua.gr
Martin GronemannNoneEmail verificata su uni-osnabrueck.de
Patrizio AngeliniJohn Cabot UniversityEmail verificata su dia.uniroma3.it
Fabrizio MontecchianiAssociate Professor, University of PerugiaEmail verificata su unipg.it
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienEmail verificata su ac.tuwien.ac.at
Walter DidimoAssociate Professor, University of PerugiaEmail verificata su unipg.it
Stephen KobourovProfessor of Computer Science, University of ArizonaEmail verificata su cs.arizona.edu
Sergey PupyrevApplied ResearchEmail verificata su uran.ru
Philipp KindermannUniversität TrierEmail verificata su uni-trier.de
Evmorfia N. ArgyriouyWorks GmbHEmail verificata su math.ntua.gr
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgEmail verificata su uni-wuerzburg.de
Giuseppe LiottaProfessor of Computer Science, University of PerugiaEmail verificata su unipg.it
Katerina PotikaSan Jose State UniversityEmail verificata su sjsu.edu
Ignaz RutterUniversity of PassauEmail verificata su uni-passau.de
Muhammad Jawaherul AlamPh.D., Computer Science, University of ArizonaEmail verificata su cs.arizona.edu
Sankar VeeramoniIBMEmail verificata su cs.arizona.edu

Segui

Michael A. Bekos

Assistant Professor, Department of Mathematics, University of Ioannina, Greece

Email verificata su uoi.gr - Home page

Graph Algorithms Graph Drawing Map Labeling


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Boundary labeling: Models and efficient algorithms for rectangular maps MA Bekos, M Kaufmann, A Symvonis, A Wolff Computational Geometry 36 (3), 215-236, 2007	145	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	73	2012
Area-feature boundary labeling MA Bekos, M Kaufmann, K Potika, A Symvonis The Computer Journal 53 (6), 827-841, 2010	51*	2010
Boundary labeling with octilinear leaders MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis Algorithmica 57 (3), 436-461, 2010	51	2010
The book thickness of 1-planar graphs is constant MA Bekos, T Bruckdorfer, M Kaufmann, CN Raftopoulou Algorithmica 79, 444-465, 2017	50*	2017
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	46	2017
Maximizing the total resolution of graphs EN Argyriou, MA Bekos, A Symvonis The Computer Journal 56 (7), 887–900, 2012	46	2012
Two-page book embeddings of 4-planar graphs MA Bekos, M Gronemann, CN Raftopoulou Algorithmica 75, 158-185, 2016	43	2016
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 optimal 2-and 3-planar graphs MA Bekos, M Kaufmann, CN Raftopoulou Symposium on Computational Geometry 77, 16:1--16:16, 2017	41	2017
Smooth orthogonal layouts MA Bekos, M Kaufmann, SG Kobourov, A Symvonis J. Graph Algorithms Appl. 17 (5), 575-595, 2013	41	2013
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	39	2020
Queue layouts of planar 3-trees JM Alam, MA Bekos, M Gronemann, M Kaufmann, S Pupyrev Algorithmica 82, 2564-2585, 2020	35	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	34*	2020
On RAC drawings of 1-planar graphs MA Bekos, W Didimo, G Liotta, S Mehrabi, F Montecchiani Theoretical Computer Science 689, 48-57, 2017	33	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	29	2015
Multi-stack boundary labeling problems MA Bekos, M Kaufmann, K Potika, A Symvonis FSTTCS 2006: Foundations of Software Technology and Theoretical Computer …, 2006	29	2006
External labeling techniques: A taxonomy and survey MA Bekos, B Niedermann, M Nöllenburg Computer Graphics Forum 38 (3), 833-860, 2019	27	2019
Geometric RAC simultaneous drawings of graphs E Argyriou, M Bekos, M Kaufmann, A Symvonis Computing and Combinatorics: 18th Annual International Conference, COCOON …, 2012	26	2012
On metro-line crossing minimization. E Argyriou, MA Bekos, M Kaufmann, A Symvonis J. Graph Algorithms Appl. 14 (1), 75-96, 2010	22	2010

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori