Michael A. Bekos

Michael A. Bekos

Auto-generated profile, based on publicly available information

Michael A. Bekos

University of Ioannina

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2007 in Computational Geometry
Verified
Journal Article
Closed access
MBMichael A. Bekos
Michael A. Bekos
MKMichael Kaufmann
Michael Kaufmann
ASAntonios Symvonis
Antonios Symvonis
AWAlexander Wolff
Alexander Wolff

1 June 2019 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
MBMichael A. Bekos
Michael A. Bekos
BNBenjamin Niedermann
Benjamin Niedermann
MNMartin Nöllenburg
Martin Nöllenburg

1 January 2012 in Journal of Graph Algorithms and Applications
Verified
Journal Article
Closed access
EAEvmorfia N. Argyriou
Evmorfia N. Argyriou
MBMichael A. Bekos
Michael A. Bekos
ASAntonios Symvonis
Antonios Symvonis

5 February 2009 in Algorithmica
Verified
Journal Article
Closed access
PDF file
MBMichael A. Bekos
Michael A. Bekos
MKMichael Kaufmann
Michael Kaufmann
MNMartin Nöllenburg
Martin Nöllenburg
ASAntonios Symvonis
Antonios Symvonis

1 August 2017 in Theoretical Computer Science
Verified
Journal Article
Closed access
MBMichael A. Bekos
Michael A. Bekos
WDWalter Didimo
Walter Didimo
GLGiuseppe Liotta
Giuseppe Liotta
SMSaeed Mehrabi
Saeed Mehrabi
Fabrizio MontecchianiFabrizio Montecchiani
Fabrizio Montecchiani

23 March 2020 in Algorithmica
Verified
Journal Article
Open access
PDF file
JAJawaherul Md. Alam
Jawaherul Md. Alam
MBMichael A. Bekos
Michael A. Bekos
MGMartin Gronemann
Martin Gronemann
MKMichael Kaufmann
Michael Kaufmann
SPSergey Pupyrev
Sergey Pupyrev
A queue layout of a graph G consists of a linear order of the vertices of G and a partition of the edges of G into queues, so that no two independent edges of the same queue are nested. The queue number of graph G is defined as the minimum number of queues required by any queue layout of G. In this paper, we continue the study of the queue number of planar 3-trees, which form a well-studied subclass of planar graphs. Prior to this work, it was known that the queue number of planar 3-trees is at most seven. In this work, we improve this upper bound to five. We also show that there exist planar 3-trees whose queue number is at least four. Notably, this is the first example of a planar graph with queue number greater than three.