BLer: A Boundary Labeller for Technical Drawings. - Michael A. Bekos; Antonios Symvonis (GD, 2005)

Boundary Labelling of Optimal Total Leader Length. - Michael A. Bekos; Michael Kaufmann 001; Katerina Potika; Antonios Symvonis (Panhellenic Conference on Informatics, 2005)

Polygon labelling of minimum leader length. - Michael A. Bekos; Michael Kaufmann 001; Katerina Potika; Antonios Symvonis (APVIS, 2006)

Multi-stack Boundary Labeling Problems. - Michael A. Bekos; Michael Kaufmann 001; Katerina Potika; Antonios Symvonis (FSTTCS, 2006)

Labeling collinear sites. - Michael A. Bekos; Michael Kaufmann 001; Antonios Symvonis (APVIS, 2007)

Line Crossing Minimization on Metro Maps. - Michael A. Bekos; Michael Kaufmann 001; Katerina Potika; Antonios Symvonis (GD, 2007)

Boundary labeling: Models and efficient algorithms for rectangular maps. - Michael A. Bekos; Michael Kaufmann 001; Antonios Symvonis; Alexander Wolff 001 (Comput. Geom., 2007)

Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem. - Evmorfia N. Argyriou; Michael A. Bekos; Michael Kaufmann 001; Antonios Symvonis (GD, 2008)

Efficient Labeling of Collinear Sites. - Michael A. Bekos; Michael Kaufmann 001; Antonios Symvonis (J. Graph Algorithms Appl., 2008)

Boundary Labeling with Octilinear Leaders. - Michael A. Bekos; Michael Kaufmann 001; Martin Nöllenburg; Antonios Symvonis (Algorithmica, 2010)

Area-Feature Boundary Labeling. - Michael A. Bekos; Michael Kaufmann 001; Katerina Potika; Antonios Symvonis (Comput. J., 2010)

On Metro-Line Crossing Minimization. - Evmorfia N. Argyriou; Michael A. Bekos; Michael Kaufmann 001; Antonios Symvonis (J. Graph Algorithms Appl., 2010)

Combining Problems on RAC Drawings and Simultaneous Graph Drawings. - Evmorfia N. Argyriou; Michael A. Bekos; Michael Kaufmann 001; Antonios Symvonis (GD, 2011)

Combining Traditional Map Labeling with Boundary Labeling. - Michael A. Bekos; Michael Kaufmann 001; Dimitrios Papadopoulos 001; Antonios Symvonis (SOFSEM, 2011)

Geometric Simultaneous RAC Drawings of Graphs - Evmorfia N. Argyriou; Michael A. Bekos; Michael Kaufmann 001; Antonios Symvonis (CoRR, 2011)

Circle-Representations of Simple 4-Regular Planar Graphs. - Michael A. Bekos; Chrysanthi N. Raftopoulou (GD, 2012)

The Straight-Line RAC Drawing Problem is NP-Hard. - Evmorfia N. Argyriou; Michael A. Bekos; Antonios Symvonis (J. Graph Algorithms Appl., 2012)

Slanted Orthogonal Drawings. - Michael A. Bekos; Michael Kaufmann 001; Robert Krug 001; Stefan Näher; Vincenzo Roselli (GD, 2013)

Maximizing the Total Resolution of Graphs. - Evmorfia N. Argyriou; Michael A. Bekos; Antonios Symvonis (Comput. J., 2013)

Geometric RAC Simultaneous Drawings of Graphs. - Evmorfia N. Argyriou; Michael A. Bekos; Michael Kaufmann 001; Antonios Symvonis (J. Graph Algorithms Appl., 2013)

Smooth Orthogonal Layouts. - Michael A. Bekos; Michael Kaufmann 001; Stephen G. Kobourov; Antonios Symvonis (J. Graph Algorithms Appl., 2013)

Perfect smooth orthogonal drawings. - Michael A. Bekos; Martin Gronemann; Sergey Pupyrev; Chrysanthi N. Raftopoulou (IISA, 2014)

Sloggy drawings of graphs. - Michael A. Bekos; Michael Kaufmann 001; Robert Krug 001 (IISA, 2014)

Smooth Orthogonal Drawings of Planar Graphs. - Muhammad Jawaherul Alam; Michael A. Bekos; Michael Kaufmann 001; Philipp Kindermann; Stephen G. Kobourov; Alexander Wolff 001 (LATIN, 2014)

A note on maximum differential coloring of planar graphs. - Michael A. Bekos; Michael Kaufmann 001; Stephen G. Kobourov; Sankar Veeramoni (J. Discrete Algorithms, 2014)

Slanted Orthogonal Drawings: Model, Algorithms and Evaluations. - Michael A. Bekos; Michael Kaufmann 001; Robert Krug 001; Thorsten Ludwig; Stefan Näher; Vincenzo Roselli (J. Graph Algorithms Appl., 2014)

1-Planar Graphs have Constant Book Thickness. - Michael A. Bekos; Till Bruckdorfer; Michael Kaufmann 001; Chrysanthi N. Raftopoulou (ESA, 2015)

The Book Embedding Problem from a SAT-Solving Perspective. - Michael A. Bekos; Michael Kaufmann 001; Christian Zielke (GD, 2015)

Sloginsky drawings of graphs. - Michael A. Bekos; Michael Kaufmann 001; Robert Krug 001 (IISA, 2015)

The Maximum k-Differential Coloring Problem. - Michael A. Bekos; Michael Kaufmann 001; Stephen G. Kobourov; Sankar Veeramoni (SOFSEM, 2015)

The Effect of Almost-Empty Faces on Planar Kandinsky Drawings. - Michael A. Bekos; Michael Kaufmann 001; Robert Krug 001; Martin Siebenhaller (SEA, 2015)

Many-to-One Boundary Labeling with Backbones. - Michael A. Bekos; Sabine Cornelsen; Martin Fink 001; Seok-Hee Hong 001; Michael Kaufmann 001; Martin Nöllenburg; Ignaz Rutter; Antonios Symvonis (J. Graph Algorithms Appl., 2015)

Planar Octilinear Drawings with One Bend Per Edge. - Michael A. Bekos; Martin Gronemann; Michael Kaufmann 001; Robert Krug 001 (J. Graph Algorithms Appl., 2015)

On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs. - Michael A. Bekos; Chrysanthi N. Raftopoulou (J. Comput. Geom., 2015)

Low Ply Drawings of Trees. - Patrizio Angelini; Michael A. Bekos; Till Bruckdorfer; Jaroslav Hancl Jr.; Michael Kaufmann 001; Stephen G. Kobourov; Antonios Symvonis; Pavel Valtr 001 (GD, 2016)

On the Density of Non-simple 3-Planar Graphs. - Michael A. Bekos; Michael Kaufmann 001; Chrysanthi N. Raftopoulou (GD, 2016)

AVDTC of generalized 3-Halin graphs. - Michael A. Bekos; Michael Kaufmann 001; Chrysanthi N. Raftopoulou (IISA, 2016)

Vertex-Coloring with Star-Defects. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Vincenzo Roselli (WALCOM, 2016)

Two-Page Book Embeddings of 4-Planar Graphs. - Michael A. Bekos; Martin Gronemann; Chrysanthi N. Raftopoulou (Algorithmica, 2016)

On the Density of 3-Planar Graphs. - Michael A. Bekos; Michael Kaufmann 001; Chrysanthi N. Raftopoulou (CoRR, 2016)

Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. - Michael A. Bekos; Thomas C. van Dijk; Philipp Kindermann; Alexander Wolff 001 (J. Graph Algorithms Appl., 2016)

A Universal Slope Set for 1-Bend Planar Drawings. - Patrizio Angelini; Michael A. Bekos; Giuseppe Liotta; Fabrizio Montecchiani (SoCG, 2017)

On Optimal 2- and 3-Planar Graphs. - Michael A. Bekos; Michael Kaufmann 001; Chrysanthi N. Raftopoulou (SoCG, 2017)

3D Visibility Representations of 1-planar Graphs. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Fabrizio Montecchiani (GD, 2017)

On the Relationship Between k-Planar and k-Quasi-Planar Graphs. - Patrizio Angelini; Michael A. Bekos; Franz J. Brandenburg; Giordano Da Lozzo; Giuseppe Di Battista; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Ignaz Rutter (WG, 2017)

The Book Thickness of 1-Planar Graphs is Constant. - Michael A. Bekos; Till Bruckdorfer; Michael Kaufmann 001; Chrysanthi N. Raftopoulou (Algorithmica, 2017)

On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. - Michael A. Bekos; Sabine Cornelsen; Luca Grilli 001; Seok-Hee Hong 001; Michael Kaufmann 001 (Algorithmica, 2017)

Improved Approximation Algorithms for Box Contact Representations. - Michael A. Bekos; Thomas C. van Dijk; Martin Fink 001; Philipp Kindermann; Stephen G. Kobourov; Sergey Pupyrev; Joachim Spoerhase; Alexander Wolff 001 (Algorithmica, 2017)

Beyond-Planarity: Density Results for Bipartite Graphs. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Maximilian Pfister 002; Torsten Ueckerdt (CoRR, 2017)

The maximum k-differential coloring problem. - Michael A. Bekos; Michael Kaufmann 001; Stephen G. Kobourov; Konstantinos S. Stavropoulos; Sankar Veeramoni (J. Discrete Algorithms, 2017)

Vertex-Coloring with Defects. - Patrizio Angelini; Michael A. Bekos; Felice De Luca; Walter Didimo; Michael Kaufmann 001; Stephen G. Kobourov; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou; Vincenzo Roselli; Antonios Symvonis (J. Graph Algorithms Appl., 2017)

On the Total Number of Bends for Planar Octilinear Drawings. - Michael A. Bekos; Michael Kaufmann 001; Robert Krug 001 (J. Graph Algorithms Appl., 2017)

On RAC drawings of 1-planar graphs. - Michael A. Bekos; Walter Didimo; Giuseppe Liotta; Saeed Mehrabi 001; Fabrizio Montecchiani (Theor. Comput. Sci., 2017)

Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Maximilian Pfister 002; Torsten Ueckerdt (ISAAC, 2018)

On Dispersable Book Embeddings. - Jawaherul Md. Alam; Michael A. Bekos; Martin Gronemann; Michael Kaufmann 001; Sergey Pupyrev (WG, 2018)

Queue Layouts of Planar 3-Trees. - Michael A. Bekos; Martin Gronemann; Michael Kaufmann 001; Sergey Pupyrev (CoRR, 2018)

Planar Graphs of Bounded Degree have Constant Queue Number. - Michael A. Bekos; Henry Förster; Martin Gronemann; Tamara Mchedlidze; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou; Torsten Ueckerdt (CoRR, 2018)

Guest Editors' Foreword and Overview. - Michael A. Bekos; Michael Kaufmann 001; Fabrizio Montecchiani (J. Graph Algorithms Appl., 2018)

1-Fan-bundle-planar drawings of graphs. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Philipp Kindermann; Thomas Schneck (Theor. Comput. Sci., 2018)

Algorithms and insights for RaceTrack. - Michael A. Bekos; Till Bruckdorfer; Henry Förster; Michael Kaufmann 001; Simon Poschenrieder; Thomas Stüber (Theor. Comput. Sci., 2018)

Geometric Representations of Dichotomous Ordinal Data. - Patrizio Angelini; Michael A. Bekos; Martin Gronemann; Antonios Symvonis (WG, 2019)

Hierarchical Partial Planarity. - Patrizio Angelini; Michael A. Bekos (Algorithmica, 2019)

Universal Slope Sets for 1-Bend Planar Drawings. - Patrizio Angelini; Michael A. Bekos; Giuseppe Liotta; Fabrizio Montecchiani (Algorithmica, 2019)

On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. - Michael A. Bekos; Henry Förster; Michael Kaufmann 001 (Algorithmica, 2019)

External Labeling Techniques: A Taxonomy and Survey. - Michael A. Bekos; Benjamin Niedermann; Martin Nöllenburg (Comput. Graph. Forum, 2019)

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar. - Patrizio Angelini; Michael A. Bekos; Franz J. Brandenburg; Giordano Da Lozzo; Giuseppe Di Battista; Walter Didimo; Michael Hoffmann 001; Giuseppe Liotta; Fabrizio Montecchiani; Ignaz Rutter; Csaba D. Tóth (CoRR, 2019)

Coloring outerplanar graphs and planar 3-trees with small monochromatic components. - Michael A. Bekos; Carla Binucci; Michael Kaufmann 001; Chrysanthi N. Raftopoulou; Antonios Symvonis; Alessandra Tappini (CoRR, 2019)

Edge partitions of optimal 2-plane and 3-plane graphs. - Michael A. Bekos; Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou (Discret. Math., 2019)

Planar Graphs of Bounded Degree Have Bounded Queue Number. - Michael A. Bekos; Henry Förster; Martin Gronemann; Tamara Mchedlidze; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou; Torsten Ueckerdt (SIAM J. Comput., 2019)

Greedy rectilinear drawings. - Patrizio Angelini; Michael A. Bekos; Walter Didimo; Luca Grilli 001; Philipp Kindermann; Tamara Mchedlidze; Roman Prutkin; Antonios Symvonis; Alessandra Tappini (Theor. Comput. Sci., 2019)

On 3D visibility representations of graphs with few crossings per edge. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Fabrizio Montecchiani (Theor. Comput. Sci., 2019)

Planar drawings of fixed-mobile bigraphs. - Michael A. Bekos; Felice De Luca; Walter Didimo; Tamara Mchedlidze; Martin Nöllenburg; Antonios Symvonis; Ioannis G. Tollis (Theor. Comput. Sci., 2019)

Fan-Planar Graphs. - Michael A. Bekos; Luca Grilli 001 (Beyond Planar Graphs, 2020)

k-Planar Graphs. - Michael A. Bekos (Beyond Planar Graphs, 2020)

Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages. - Michael A. Bekos; Giordano Da Lozzo; Svenja Griesbach; Martin Gronemann; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou (SoCG, 2020)

Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting. - Patrizio Angelini; Michael A. Bekos; Henry Förster; Martin Gronemann (WG, 2020)

Queue Layouts of Planar 3-Trees. - Jawaherul Md. Alam; Michael A. Bekos; Martin Gronemann; Michael Kaufmann 001; Sergey Pupyrev (Algorithmica, 2020)

An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs. - Michael A. Bekos; Mirco Haug; Michael Kaufmann 001; Julia Männecke (CoRR, 2020)

Grid Drawings of Graphs with Constant Edge-Vertex Resolution. - Michael A. Bekos; Martin Gronemann; Fabrizio Montecchiani; Antonios Symvonis; Leonidas Theocharous (CoRR, 2020)

Simple k-planar graphs are simple (k + 1)-quasiplanar. - Patrizio Angelini; Michael A. Bekos; Franz J. Brandenburg; Giordano Da Lozzo; Giuseppe Di Battista; Walter Didimo; Michael Hoffmann 001; Giuseppe Liotta; Fabrizio Montecchiani; Ignaz Rutter; Csaba D. Tóth (J. Comb. Theory B, 2020)

Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Thomas Schneck (J. Graph Algorithms Appl., 2020)

Four Pages Are Indeed Necessary for Planar Graphs. - Michael A. Bekos; Michael Kaufmann 001; Fabian Klute; Sergey Pupyrev; Chrysanthi N. Raftopoulou; Torsten Ueckerdt (J. Comput. Geom., 2020)

On RAC drawings of graphs with one bend per edge. - Patrizio Angelini; Michael A. Bekos; Henry Förster; Michael Kaufmann 001 (Theor. Comput. Sci., 2020)

On the Queue Number of Planar Graphs. - Michael A. Bekos; Martin Gronemann; Chrysanthi N. Raftopoulou (GD, 2021)

On Morphing 1-Planar Drawings. - Patrizio Angelini; Michael A. Bekos; Fabrizio Montecchiani; Maximilian Pfister 002 (WG, 2021)

A Heuristic Approach Towards Drawings of Graphs With High Crossing Resolution. - Michael A. Bekos; Henry Förster; Christian Geckeler; Lukas Holländer; Michael Kaufmann 001; Amadäus M. Spallek; Jan Splett (Comput. J., 2021)

Grid drawings of graphs with constant edge-vertex resolution. - Michael A. Bekos; Martin Gronemann; Fabrizio Montecchiani; Dömötör Pálvölgyi; Antonios Symvonis; Leonidas Theocharous (Comput. Geom., 2021)

On dispersable book embeddings. - Muhammad Jawaherul Alam; Michael A. Bekos; Vida Dujmovic; Martin Gronemann; Michael Kaufmann 001; Sergey Pupyrev (Theor. Comput. Sci., 2021)

External Labeling: Fundamental Concepts and Algorithmic Techniques - Michael A. Bekos; Benjamin Niedermann; Martin Nöllenburg (External Labeling, 2021)

The Rique-Number of Graphs. - Michael A. Bekos; Stefan Felsner; Philipp Kindermann; Stephen G. Kobourov; Jan Kratochvíl; Ignaz Rutter (GD, 2022)

RAC Drawings of Graphs with Low Degree. - Patrizio Angelini; Michael A. Bekos; Julia Katheder; Michael Kaufmann 001; Maximilian Pfister 002 (MFCS, 2022)

Universal Slope Sets for Upward Planar Drawings. - Michael A. Bekos; Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (Algorithmica, 2022)

Computing Schematic Layouts for Spatial Hypergraphs on Concentric Circles and Grids. - Michael A. Bekos; D. J. C. Dekker; F. Frank; Wouter Meulemans; Peter J. Rodgers; André Schulz 001; Sten Wessel (Comput. Graph. Forum, 2022)

On Turn-Regular Orthogonal Representations. - Michael A. Bekos; Carla Binucci; Giuseppe Di Battista; Walter Didimo; Martin Gronemann; Karsten Klein 001; Maurizio Patrignani; Ignaz Rutter (J. Graph Algorithms Appl., 2022)

On morphs of 1-plane graphs. - Patrizio Angelini; Michael A. Bekos; Fabrizio Montecchiani; Maximilian Pfister 002 (J. Comput. Geom., 2022)

The mixed page number of graphs. - Jawaherul Md. Alam; Michael A. Bekos; Martin Gronemann; Michael Kaufmann 001; Sergey Pupyrev (Theor. Comput. Sci., 2022)

On mixed linear layouts of series-parallel graphs. - Patrizio Angelini; Michael A. Bekos; Philipp Kindermann; Tamara Mchedlidze (Theor. Comput. Sci., 2022)

On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs. - Michael A. Bekos; Michael Kaufmann 001; Maria Eleni Pavlidi; Xenia Rieger (CCCG, 2023)

Axis-Parallel Right Angle Crossing Graphs. - Patrizio Angelini; Michael A. Bekos; Julia Katheder; Michael Kaufmann 001; Maximilian Pfister 002; Torsten Ueckerdt (ESA, 2023)

On the 2-Layer Window Width Minimization Problem. - Michael A. Bekos; Henry Förster; Michael Kaufmann 001; Stephen G. Kobourov; Myroslav Kryven; Axel Kuckuk; Lena Schlipf (SOFSEM, 2023)

Splitting Vertices in 2-Layer Graph Drawings. - Abu Reyan Ahmed; Patrizio Angelini; Michael A. Bekos; Giuseppe Di Battista; Michael Kaufmann 001; Philipp Kindermann; Stephen G. Kobourov; Martin Nöllenburg; Antonios Symvonis; Anaïs Villedieu; Markus Wallinger (IEEE Computer Graphics and Applications, 2023)

Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023). - Michael A. Bekos; Markus Chimani (CoRR, 2023)

An Improved Upper Bound on the Queue Number of Planar Graphs. - Michael A. Bekos; Martin Gronemann; Chrysanthi N. Raftopoulou (Algorithmica, 2023)

Recognizing DAGs with page-number 2 is NP-complete. - Michael A. Bekos; Giordano Da Lozzo; Fabrizio Frati; Martin Gronemann; Tamara Mchedlidze; Chrysanthi N. Raftopoulou (Theor. Comput. Sci., 2023)

Lazy Queue Layouts of Posets. - Jawaherul Md. Alam; Michael A. Bekos; Martin Gronemann; Michael Kaufmann 001; Sergey Pupyrev (Algorithmica, 2023)

Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario. - Patrizio Angelini; Michael A. Bekos; Henry Förster; Martin Gronemann (Algorithmica, 2023)

On k-Planar Graphs Without Short Cycles. - Michael A. Bekos; Prosenjit Bose; Aaron Büngener; Vida Dujmovic; Michael Hoffmann 001; Michael Kaufmann 001; Pat Morin; Saeed Odak; Alexandra Weinberger (GD, 2024)

On the Complexity of Recognizing k^+-Real Face Graphs. - Michael A. Bekos; Giuseppe Di Battista; Emilio Di Giacomo; Walter Didimo; Michael Kaufmann 001; Fabrizio Montecchiani (GD, 2024)

Weakly Leveled Planarity with Bounded Span. - Michael A. Bekos; Giordano Da Lozzo; Fabrizio Frati; Siddharth Gupta 002; Philipp Kindermann; Giuseppe Liotta; Ignaz Rutter; Ioannis G. Tollis (GD, 2024)

Graph Product Structure for $h$-Framed Graphs. - Michael A. Bekos; Giordano Da Lozzo; Petr Hlinený; Michael Kaufmann 001 (Electron. J. Comb., 2024)

On k-planar Graphs without Short Cycles. - Michael A. Bekos; Prosenjit Bose; Aaron Büngener; Vida Dujmovic; Michael Hoffmann 001; Michael Kaufmann 001; Pat Morin; Saeed Odak; Alexandra Weinberger (CoRR, 2024)

Guest Editors' Foreword. - Michael A. Bekos; Markus Chimani (J. Graph Algorithms Appl., 2024)

Strictly-convex drawings of 3-connected planar graphs. - Michael A. Bekos; Martin Gronemann; Fabrizio Montecchiani; Antonios Symvonis (J. Comput. Geom., 2024)

Book embeddings of k-framed graphs and k-map graphs. - Michael A. Bekos; Giordano Da Lozzo; Svenja M. Griesbach; Martin Gronemann; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou (Discret. Math., 2024)

Convex grid drawings of planar graphs with constant edge-vertex resolution. - Michael A. Bekos; Martin Gronemann; Fabrizio Montecchiani; Antonios Symvonis (Theor. Comput. Sci., 2024)

Recognizing Map Graphs of Bounded Treewidth. - Patrizio Angelini; Michael A. Bekos; Giordano Da Lozzo; Martin Gronemann; Fabrizio Montecchiani; Alessandra Tappini (Algorithmica, 2024)

Cgta. - Michael A. Bekos; Charis Papadopoulos (Comput. Geom., 2025)