Michael A. Bekos

Navedeno

	Vse	Od leta 2019
Navedbe	1725	1023
indeks h	22	18
indeks i10	46	34

240

120

180

200520062007200820092010201120122013201420152016201720182019202020212022202320247 10 22 35 28 39 33 37 50 51 72 87 78 104 117 216 149 116 229 190

Javni dostop

Prikaži vse

45 člankov

2 članka

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Michael KaufmannProfessor of Computer Science, Tübingen UniversityPreverjeni e-poštni naslov na uni-tuebingen.de
Antonios SymvonisNational Technical U. of AthensPreverjeni e-poštni naslov na math.ntua.gr
Martin GronemannNonePreverjeni e-poštni naslov na uni-osnabrueck.de
Patrizio AngeliniJohn Cabot UniversityPreverjeni e-poštni naslov na dia.uniroma3.it
Fabrizio MontecchianiAssociate Professor, University of PerugiaPreverjeni e-poštni naslov na unipg.it
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienPreverjeni e-poštni naslov na ac.tuwien.ac.at
Walter DidimoProfessor, University of PerugiaPreverjeni e-poštni naslov na unipg.it
Stephen KobourovProfessor of Computer Science, Technical University MunichPreverjeni e-poštni naslov na tum.de
Philipp KindermannUniversität TrierPreverjeni e-poštni naslov na uni-trier.de
Sergey PupyrevApplied ResearchPreverjeni e-poštni naslov na uran.ru
Evmorfia N. ArgyriouyWorks GmbHPreverjeni e-poštni naslov na math.ntua.gr
Giuseppe LiottaProfessor of Computer Science, University of PerugiaPreverjeni e-poštni naslov na unipg.it
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgPreverjeni e-poštni naslov na uni-wuerzburg.de
Ignaz RutterUniversity of PassauPreverjeni e-poštni naslov na uni-passau.de
Katerina PotikaSan Jose State UniversityPreverjeni e-poštni naslov na sjsu.edu
Muhammad Jawaherul AlamPh.D., Computer Science, University of ArizonaPreverjeni e-poštni naslov na cs.arizona.edu
Sankar VeeramoniMetaPreverjeni e-poštni naslov na meta.com

Spremljaj

Michael A. Bekos

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

Preverjeni e-poštni naslov na uoi.gr - Domača stran

Graph Algorithms Graph Drawing Map Labeling


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
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	78	2012
Boundary labeling with octilinear leaders MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis Algorithmica 57 (3), 436-461, 2010	56	2010
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	55	2017
The book thickness of 1-planar graphs is constant MA Bekos, T Bruckdorfer, M Kaufmann, CN Raftopoulou Algorithmica 79, 444-465, 2017	52*	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	51	2020
On optimal 2-and 3-planar graphs MA Bekos, M Kaufmann, CN Raftopoulou Symposium on Computational Geometry 77, 16:1--16:16, 2017	51	2017
Area-feature boundary labeling MA Bekos, M Kaufmann, K Potika, A Symvonis The Computer Journal 53 (6), 827-841, 2010	51*	2010
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	43	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
External labeling techniques: A taxonomy and survey MA Bekos, B Niedermann, M Nöllenburg Computer Graphics Forum 38 (3), 833-860, 2019	41	2019
On RAC drawings of 1-planar graphs MA Bekos, W Didimo, G Liotta, S Mehrabi, F Montecchiani Theoretical Computer Science 689, 48-57, 2017	37	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	33	2015
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
Geometric RAC simultaneous drawings of graphs E Argyriou, M Bekos, M Kaufmann, A Symvonis Computing and Combinatorics: 18th Annual International Conference, COCOON …, 2012	27	2012
Graph product structure for h-framed graphs MA Bekos, G Da Lozzo, P Hliněný, M Kaufmann arXiv preprint arXiv:2204.11495, 2022	25	2022

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji