Michael A. Bekos

About Michael A. Bekos

Michael A. Bekos, With an exceptional h-index of 21 and a recent h-index of 15 (since 2020), a distinguished researcher at Eberhard Karls Universität Tübingen, specializes in the field of Graph Algorithms, Graph Drawing, Map Labeling.

His recent articles reflect a diverse array of research interests and contributions to the field:

Graph Drawing and Network Visualization: 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20–22, 2023, Revised Selected Papers, Part I

Book embeddings of k-framed graphs and k-map graphs

Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023)

Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario

Axis-parallel right angle crossing graphs

On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs

Lazy queue layouts of posets

Splitting Vertices in 2-Layer Graph Drawings

Michael A. Bekos Information

University

Position

Postdoctoral Reasearcher - Department of Computer Science

Citations(all)

1513

Citations(since 2020)

814

Cited By

1056

hIndex(all)

21

hIndex(since 2020)

15

i10Index(all)

43

i10Index(since 2020)

29

Email

University Profile Page

Google Scholar

Michael A. Bekos Skills & Research Interests

Graph Algorithms

Graph Drawing

Map Labeling

Top articles of Michael A. Bekos

Graph Drawing and Network Visualization: 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20–22, 2023, Revised Selected Papers, Part I

2024/1/11

Book embeddings of k-framed graphs and k-map graphs

Discrete Mathematics

2024/1/1

Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023)

arXiv preprint arXiv:2309.07166

2023/9/11

Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario

Algorithmica

2023/9

Axis-parallel right angle crossing graphs

arXiv preprint arXiv:2306.17073

2023/6/29

On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs

arXiv preprint arXiv:2306.15395

2023/6/27

Lazy queue layouts of posets

Algorithmica

2023/5

Recognizing DAGs with page-number 2 is NP-complete

Theoretical Computer Science

2023/2/10

An improved upper bound on the queue number of planar graphs

Algorithmica

2023/2

On the 2-Layer Window Width Minimization Problem

SOFSEM 2023: Theory and Practice of Computer Science

2023/1/1

Graph-Theoretic Concepts in Computer Science

Lecture Notes in Computer Science

2022/9/13

Strictly-convex drawings of 3-connected planar graphs

2022/9/13

Computing schematic layouts for spatial hypergraphs on concentric circles and grids

Computer Graphics Forum

2022/9

RAC drawings of graphs with low degree

arXiv preprint arXiv:2206.14909

2022/6/29

Recognizing map graphs of bounded treewidth

arXiv preprint arXiv:2206.14898

2022/6/29

Convex grid drawings of planar graphs with constant edge-vertex resolution

2022/5/29

Graph Product Structure for h-Framed Graphs

2022/4/25

See List of Professors in Michael A. Bekos University(Eberhard Karls Universität Tübingen)

Co-Authors

academic-engine