Michael A. Bekos

Citace

	Všechny	Od 2020
Citace	1782	960
h-index	23	17
i10-index	47	30

220

110

165

2005200620072008200920102011201220132014201520162017201820192020202120222023202420257 10 22 35 28 39 33 38 50 53 75 75 83 99 119 215 161 116 219 191 50

Veřejný přístup

Zobrazit všechny

47 článků

1 článek

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Michael KaufmannProfessor of Computer Science, Tübingen UniversityE-mailová adresa ověřena na: uni-tuebingen.de
Antonios SymvonisNational Technical U. of AthensE-mailová adresa ověřena na: math.ntua.gr
Martin GronemannNoneE-mailová adresa ověřena na: uni-osnabrueck.de
Patrizio AngeliniJohn Cabot UniversityE-mailová adresa ověřena na: dia.uniroma3.it
Fabrizio MontecchianiAssociate Professor, University of PerugiaE-mailová adresa ověřena na: unipg.it
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienE-mailová adresa ověřena na: ac.tuwien.ac.at
Walter DidimoProfessor, University of PerugiaE-mailová adresa ověřena na: unipg.it
Stephen KobourovProfessor of Computer Science, Technical University MunichE-mailová adresa ověřena na: tum.de
Sergey PupyrevApplied ResearchE-mailová adresa ověřena na: uran.ru
Philipp KindermannUniversität TrierE-mailová adresa ověřena na: uni-trier.de
Evmorfia N. ArgyriouyWorks GmbHE-mailová adresa ověřena na: math.ntua.gr
Giuseppe LiottaProfessor of Computer Science, University of PerugiaE-mailová adresa ověřena na: unipg.it
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgE-mailová adresa ověřena na: uni-wuerzburg.de
Ignaz RutterUniversity of PassauE-mailová adresa ověřena na: uni-passau.de
Katerina PotikaSan Jose State UniversityE-mailová adresa ověřena na: sjsu.edu
Muhammad Jawaherul AlamPh.D., Computer Science, University of ArizonaE-mailová adresa ověřena na: cs.arizona.edu
Sankar VeeramoniMetaE-mailová adresa ověřena na: meta.com

Sledovat

Michael A. Bekos

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

E-mailová adresa ověřena na: uoi.gr - Domovská stránka

Graph Algorithms Graph Drawing Map Labeling


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
Boundary labeling: Models and efficient algorithms for rectangular maps MA Bekos, M Kaufmann, A Symvonis, A Wolff Computational Geometry 36 (3), 215-236, 2007	153	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
Boundary labeling with octilinear leaders MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis Algorithmica 57 (3), 436-461, 2010	55	2010
The book thickness of 1-planar graphs is constant MA Bekos, T Bruckdorfer, M Kaufmann, CN Raftopoulou Algorithmica 79, 444-465, 2017	54*	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	54	2017
On optimal 2-and 3-planar graphs MA Bekos, M Kaufmann, CN Raftopoulou Symposium on Computational Geometry 77, 16:1--16:16, 2017	54	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
Area-feature boundary labeling MA Bekos, M Kaufmann, K Potika, A Symvonis The Computer Journal 53 (6), 827-841, 2010	51*	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	47	2016
Maximizing the total resolution of graphs EN Argyriou, MA Bekos, A Symvonis The Computer Journal 56 (7), 887–900, 2012	46	2012
Smooth orthogonal layouts MA Bekos, M Kaufmann, SG Kobourov, A Symvonis J. Graph Algorithms Appl. 17 (5), 575-595, 2013	45	2013
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	44*	2020
Line crossing minimization on metro maps MA Bekos, M Kaufmann, K Potika, A Symvonis Graph Drawing: 15th International Symposium, GD 2007, Sydney, Australia …, 2008	44	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	32	2015
Multi-stack boundary labeling problems MA Bekos, M Kaufmann, K Potika, A Symvonis International Conference on Foundations of Software Technology and …, 2006	29	2006
Graph product structure for h-framed graphs MA Bekos, G Da Lozzo, P Hliněný, M Kaufmann arXiv preprint arXiv:2204.11495, 2022	28	2022
Geometric RAC simultaneous drawings of graphs E Argyriou, M Bekos, M Kaufmann, A Symvonis Computing and Combinatorics: 18th Annual International Conference, COCOON …, 2012	28	2012

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři