Michael A. Bekos

Michael A. Bekos

Assistant Professor
Department of Mathematics
University of Ioannina

Michael A. Bekos is an Assistant Professor at the Department of Mathematics of the University of Ioannina in Greece. He holds a Ph.D. from the National Technical University of Athens and a Master degree from the University of Ioannina in Greece.

His research interests primarily focus on theoretical aspects of Computer Science and Discrete Mathematics, and in particular on the development of algorithms to solve optimization and combinatorial problems mostly from the research areas of Graph Drawing, Graph Theory, Information Visualization and Map Labeling. His research work includes research papers published in prestigious journals and peer-reviewed conferences, which have received several citations.

Interests

  • Algorithm Design
  • Graph Drawing
  • Information Visualization
  • Map Labeling

Education

  • Ph.D in Computer Science and Discrete Mathematics

    2004 - 2008, National Technical University of Athens

  • M.Sc. in Computational Mathematics and Computer Science

    2002 - 2004, University of Ioannina

  • B.Sc. in Mathematics

    1998 - 2002, University of Ioannina

How to contact me

 
  • https://myweb.uoi.gr/bekos/
  • bekos [at] uoi [dot] gr
  • +30-26510-08250
  • +30-26510-07005
  • Office: 205γ, 2nd floor
  • Mathematics Department, University Campus Ioannina
    GR-45110 Ioannina, Greece
  • Office hours: Monday 09:00 to 10:00
 

Publications
Latest update: 03/11/2022

Editorships

  1. Michael A. Bekos, Michael Kaufmann (eds.): Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers, Springer (2022).
  2. Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani (eds.): Special Issue on Graph Drawing Beyond Planarity, J. Graph Algorithms Appl. 22(1):1-138 (2018).

Books or Book Chapters

  1. Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg: External Labeling: Fundamental Concepts and Algorithmic Techniques Synthesis Lectures on Visualization, Springer (2021).
  2. Michael A. Bekos, Luca Grilli: Fan-Planar Graphs. Beyond Planar Graphs, Springer: 131-148 (2020).
  3. Michael A. Bekos: k-Planar Graphs. Beyond Planar Graphs, Springer: 109-130 (2020).

Journal Publications

  1. Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani: Universal Slope Sets for Upward Planar Drawings. Algorithmica 84(9): 2556-2580 (2022).
  2. Michael A. Bekos, D. J. C. Dekker, F. Frank, Wouter Meulemans, Peter J. Rodgers, André Schulz, S. Wessel: Computing Schematic Layouts for Spatial Hypergraphs on Concentric Circles and Grids. Comput. Graph. Forum 41(6): 316-335 (2022).
  3. Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter: On Turn-Regular Orthogonal Representations. J. Graph Algorithms Appl. 26(3): 285-306 (2022).
  4. Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister: On morphs of 1-plane graphs. J. Comput. Geom. 13(1) (2022).
  5. Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev: The mixed page number of graphs. Theor. Comput. Sci. 931: 131-141 (2022).
  6. Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze: On mixed linear layouts of series-parallel graphs. Theor. Comput. Sci. 936: 129-138 (2022).
  7. Michael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek, Jan Splett: A Heuristic Approach Towards Drawings of Graphs With High Crossing Resolution. Comput. J. 64(1): 7-26 (2021).
  8. Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Dömötör Pálvölgyi, Antonios Symvonis, Leonidas Theocharous: Grid drawings of graphs with constant edge-vertex resolution. Comput. Geom. 98: 101789 (2021).
  9. Muhammad Jawaherul Alam, Michael A. Bekos, Vida Dujmovic, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev: On dispersable book embeddings. Theor. Comput. Sci. 861: 1-22 (2021).
  10. Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev: Queue Layouts of Planar 3-Trees. Algorithmica 82(9): 2564-2585 (2020).
  11. Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth: Simple k-planar graphs are simple (k + 1)-quasiplanar. J. Comb. Theory, Ser. B 142: 1-35 (2020).
  12. Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck: Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. J. Graph Algorithms Appl. 24(4): 573-601 (2020).
  13. Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt: Four Pages Are Indeed Necessary for Planar Graphs. J. Comput. Geom. 11(1): 332-353 (2020).
  14. Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann: On RAC drawings of graphs with one bend per edge. Theor. Comput. Sci. 828-829: 42-54 (2020).
  15. Patrizio Angelini, Michael A. Bekos: Hierarchical Partial Planarity. Algorithmica 81(6): 2196-2221 (2019).
  16. Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani: Universal Slope Sets for 1-Bend Planar Drawings. Algorithmica 81(6): 2527-2556 (2019).
  17. Michael A. Bekos, Henry Förster, Michael Kaufmann: On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. Algorithmica 81(5): 2046-2071 (2019).
  18. Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg: External Labeling Techniques: A Taxonomy and Survey. Comput. Graph. Forum 38(3): 833-860 (2019).
  19. Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou: Edge partitions of optimal 2-plane and 3-plane graphs. Discret. Math. 342(4): 1038-1047 (2019).
  20. Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt: Planar Graphs of Bounded Degree Have Bounded Queue Number. SIAM J. Comput. 48(5): 1487-1502 (2019).
  21. Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini: Greedy rectilinear drawings. Theor. Comput. Sci. 795: 375-397 (2019).
  22. Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani: On 3D visibility representations of graphs with few crossings per edge. Theor. Comput. Sci. 784: 11-20 (2019).
  23. Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis: Planar drawings of fixed-mobile bigraphs. Theor. Comput. Sci. 795: 408-419 (2019).
  24. Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani: Guest Editors' Foreword and Overview. J. Graph Algorithms Appl. 22(1): 1-10 (2018).
  25. Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck: 1-Fan-bundle-planar drawings of graphs. Theor. Comput. Sci. 723: 23-50 (2018).
  26. Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, Thomas Stüber: Algorithms and insights for RaceTrack. Theor. Comput. Sci. 748: 2-16 (2018).
  27. Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N. Raftopoulou: The Book Thickness of 1-Planar Graphs is Constant. Algorithmica 79(2): 444-465 (2017).
  28. Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann: On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. Algorithmica 79(2): 401-427 (2017).
  29. Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff: Improved Approximation Algorithms for Box Contact Representations. Algorithmica 77(3): 902-920 (2017).
  30. Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Konstantinos S. Stavropoulos, Sankar Veeramoni: The maximum k-differential coloring problem. J. Discrete Algorithms 45: 35-53 (2017).
  31. Patrizio Angelini, Michael A. Bekos, Felice De Luca, Walter Didimo, Michael Kaufmann, Stephen G. Kobourov, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Vincenzo Roselli, Antonios Symvonis: Vertex-Coloring with Defects. J. Graph Algorithms Appl. 21(3): 313-340 (2017).
  32. Michael A. Bekos, Michael Kaufmann, Robert Krug: On the Total Number of Bends for Planar Octilinear Drawings. J. Graph Algorithms Appl. 21(4): 709-730 (2017).
  33. Michael A. Bekos, Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani: On RAC drawings of 1-planar graphs. Theor. Comput. Sci. 689: 48-57 (2017).
  34. Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou: Two-Page Book Embeddings of 4-Planar Graphs. Algorithmica 75(1): 158-185 (2016).
  35. Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, Alexander Wolff: Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. J. Graph Algorithms Appl. 20(1): 133-158 (2016).
  36. Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis: Many-to-One Boundary Labeling with Backbones. J. Graph Algorithms Appl. 19(3): 779-816 (2015).
  37. Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Robert Krug: Planar Octilinear Drawings with One Bend Per Edge. J. Graph Algorithms Appl. 19(2): 657-680 (2015).
  38. Michael A. Bekos, Chrysanthi N. Raftopoulou: On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs. J. Comput. Geom. 6(1): 1-20 (2015).
  39. Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Sankar Veeramoni: A note on maximum differential coloring of planar graphs. J. Discrete Algorithms 29: 1-7 (2014).
  40. Michael A. Bekos, Michael Kaufmann, Robert Krug, Thorsten Ludwig, Stefan Näher, Vincenzo Roselli: Slanted Orthogonal Drawings: Model, Algorithms and Evaluations. J. Graph Algorithms Appl. 18(3): 459-489 (2014).
  41. Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis: Maximizing the Total Resolution of Graphs. Comput. J. 56(7): 887-900 (2013).
  42. Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis: Geometric RAC Simultaneous Drawings of Graphs. J. Graph Algorithms Appl. 17(1): 11-34 (2013).
  43. Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis: Smooth Orthogonal Layouts. J. Graph Algorithms Appl. 17(5): 575-595 (2013).
  44. Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis: The Straight-Line RAC Drawing Problem is NP-Hard. J. Graph Algorithms Appl. 16(2): 569-597 (2012).
  45. Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis: Boundary Labeling with Octilinear Leaders. Algorithmica 57(3): 436-461 (2010).
  46. Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis: Area-Feature Boundary Labeling. Comput. J. 53(6): 827-841 (2010).
  47. Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis: On Metro-Line Crossing Minimization. J. Graph Algorithms Appl. 14(1): 75-96 (2010).
  48. Michael A. Bekos, Michael Kaufmann, Antonios Symvonis: Efficient Labeling of Collinear Sites. J. Graph Algorithms Appl. 12(3): 357-380 (2008).
  49. Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff: Boundary labeling: Models and efficient algorithms for rectangular maps. Comput. Geom. 36(3): 215-236 (2007).

Conference Publications (peer-reviewed)

  1. Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis: Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution. IWOCA 2022: 157-171.
  2. Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister: RAC Drawings of Graphs with Low Degree. MFCS 2022: 11:1-11:15.
  3. Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini: Recognizing Map Graphs of Bounded Treewidth. SWAT 2022: 8:1-8:18.
  4. Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou: On the Queue Number of Planar Graphs. Graph Drawing 2021: 271-284.
  5. Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister: On Morphing 1-Planar Drawings. WG 2021: 270-282.
  6. Michael A. Bekos, Giordano Da Lozzo, Svenja Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou: Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages. SoCG 2020: 16:1-16:17.
  7. Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev: Lazy Queue Layouts of Posets. Graph Drawing 2020: 55-68.
  8. Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze: On Mixed Linear Layouts of Series-Parallel Graphs. Graph Drawing 2020: 151-159.
  9. Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter: On Turn-Regular Orthogonal Representations. Graph Drawing 2020: 250-264.
  10. Patrizio Angelini, Michael A. Bekos, Henry Förster, Martin Gronemann: Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting. WG 2020: 339-351.
  11. Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck: Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. Graph Drawing 2019: 253-267.
  12. Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt: Planar graphs of bounded degree have bounded queue number. STOC 2019: 176-184.
  13. Patrizio Angelini, Michael A. Bekos, Martin Gronemann, Antonios Symvonis: Geometric Representations of Dichotomous Ordinal Data. WG 2019: 205-217.
  14. Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev: Queue Layouts of Planar 3-Trees. Graph Drawing 2018: 213-226.
  15. Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini: Greedy Rectilinear Drawings. Graph Drawing 2018: 495-508.
  16. Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann: On RAC Drawings of Graphs with One Bend per Edge. Graph Drawing 2018: 123-136.
  17. Michael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek, Jan Splett: A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution. Graph Drawing 2018: 271-285.
  18. Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani: Universal Slope Sets for Upward Planar Drawings. Graph Drawing 2018: 77-91.
  19. Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt: Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs. ISAAC 2018: 28:1-28:13.
  20. Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev: On Dispersable Book Embeddings. WG 2018: 1-14.
  21. Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou: Edge Partitions of Optimal 2-plane and 3-plane Graphs. WG 2018: 27-39.
  22. Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani: A Universal Slope Set for 1-Bend Planar Drawings. SoCG 2017: 9:1-9:16.
  23. Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou: On Optimal 2- and 3-Planar Graphs. SoCG 2017: 16:1-16:16.
  24. Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck: 1-Fan-Bundle-Planar Drawings of Graphs. Graph Drawing 2017: 517-530.
  25. Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani: 3D Visibility Representations of 1-planar Graphs. Graph Drawing 2017: 102-109.
  26. Michael A. Bekos, Henry Förster, Michael Kaufmann: On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. Graph Drawing 2017: 169-183.
  27. Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis: Planar Drawings of Fixed-Mobile Bigraphs. Graph Drawing 2017: 426-439.
  28. Patrizio Angelini, Michael A. Bekos: Hierarchical Partial Planarity. WG 2017: 45-58.
  29. Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter: On the Relationship Between k-Planar and k-Quasi-Planar Graphs. WG 2017: 59-74.
  30. Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, Thomas Stüber: Algorithms and Insights for RaceTrack. FUN 2016: 6:1-6:14.
  31. Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl Jr., Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr: Low Ply Drawings of Trees. Graph Drawing 2016: 236-248.
  32. Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou: On the Density of Non-simple 3-Planar Graphs. Graph Drawing 2016: 344-356.
  33. Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou: AVDTC of generalized 3-Halin graphs. IISA 2016: 1-6.
  34. Michael A. Bekos, Michael Kaufmann, Robert Krug: On the Total Number of Bends for Planar Octilinear Drawings. LATIN 2016: 152-163.
  35. Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Vincenzo Roselli: Vertex-Coloring with Star-Defects. WALCOM 2016: 40-51.
  36. Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N. Raftopoulou: 1-Planar Graphs have Constant Book Thickness. ESA 2015: 130-141.
  37. Michael A. Bekos, Michael Kaufmann, Christian Zielke: The Book Embedding Problem from a SAT-Solving Perspective. Graph Drawing 2015: 125-138.
  38. Michael A. Bekos, Michael Kaufmann, Robert Krug: Sloginsky drawings of graphs. IISA 2015: 1-6.
  39. Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Sankar Veeramoni: The Maximum k-Differential Coloring Problem. SOFSEM 2015: 115-127.
  40. Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, Alexander Wolff: Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. WALCOM 2015: 222-233.
  41. Michael A. Bekos, Michael Kaufmann, Robert Krug, Martin Siebenhaller: The Effect of Almost-Empty Faces on Planar Kandinsky Drawings. SEA 2015: 352-364.
  42. Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff: Improved Approximation Algorithms for Box Contact Representations. ESA 2014: 87-99.
  43. Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann: On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. Graph Drawing 2014: 198-209.
  44. Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Robert Krug: Planar Octilinear Drawings with One Bend Per Edge. Graph Drawing 2014: 331-342.
  45. Michael A. Bekos, Martin Gronemann, Sergey Pupyrev, Chrysanthi N. Raftopoulou: Perfect smooth orthogonal drawings. IISA 2014: 76-81.
  46. Michael A. Bekos, Michael Kaufmann, Robert Krug: Sloggy drawings of graphs. IISA 2014: 82-87.
  47. Muhammad Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Alexander Wolff: Smooth Orthogonal Drawings of Planar Graphs. LATIN 2014: 144-155.
  48. Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou: Two-Page Book Embeddings of 4-Planar Graphs. STACS 2014: 137-148.
  49. Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis: Many-to-One Boundary Labeling with Backbones. Graph Drawing 2013: 244-255.
  50. Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Näher, Vincenzo Roselli: Slanted Orthogonal Drawings. Graph Drawing 2013: 424-435.
  51. Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis: Geometric RAC Simultaneous Drawings of Graphs. COCOON 2012: 287-298.
  52. Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis: Smooth Orthogonal Layouts. Graph Drawing 2012: 150-161.
  53. Michael A. Bekos, Chrysanthi N. Raftopoulou: Circle-Representations of Simple 4-Regular Planar Graphs. Graph Drawing 2012: 138-149.
  54. Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis: Combining Problems on RAC Drawings and Simultaneous Graph Drawings. Graph Drawing 2011: 433-434.
  55. Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis: The Straight-Line RAC Drawing Problem Is NP-Hard. SOFSEM 2011: 74-85.
  56. Michael A. Bekos, Michael Kaufmann, Dimitrios Papadopoulos, Antonios Symvonis: Combining Traditional Map Labeling with Boundary Labeling. SOFSEM 2011: 111-122.
  57. Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis: Maximizing the Total Resolution of Graphs. Graph Drawing 2010: 62-67.
  58. Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis: Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem. Graph Drawing 2008: 336-347.
  59. Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis: Boundary Labeling with Octilinear Leaders. SWAT 2008: 234-245.
  60. Michael A. Bekos, Michael Kaufmann, Antonios Symvonis: Labeling collinear sites. APVIS 2007: 45-51.
  61. Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis: Line Crossing Minimization on Metro Maps. Graph Drawing 2007: 231-242.
  62. Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis: Polygon labelling of minimum leader length. APVIS 2006: 15-21.
  63. Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis: Multi-stack Boundary Labeling Problems. FSTTCS 2006: 81-92.
  64. Michael A. Bekos, Antonios Symvonis: BLer: A Boundary Labeller for Technical Drawings. Graph Drawing 2005: 503-504.
  65. Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis: Boundary Labelling of Optimal Total Leader Length. Panhellenic Conference on Informatics 2005: 80-89.
  66. Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff: Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. Graph Drawing 2004: 49-59.

Posters

  1. Michael Bekos, Paul Goehring, Michael Kaufmann and Axel Kuckuk: The Universe Beyond Planarity. Graph Drawing 2021: 458-461.
    Article PDF
  2. Michael Bekos, Martin Gronemann, Fabrizio Montecchiani and Antonios Symvonis: Compact Convex Planar Grid Drawings of Graphs with Constant Edge-Vertex Resolution. Graph Drawing 2021: 428-430.
    Article PDF
  3. Patrizio Angelini, Michael Bekos, Henry Förster and Martin Gronemann: Bitonicity and Upwardness - Splits, Bends and their Relation to Area Requirements. Graph Drawing 2021:437-439.
    Article PDF
  4. Patrizio Angelini, Michael A. Bekos, Michael Kaufmann and Thomas Schneck: Low-Degree Graphs Beyond Planarity. Graph Drawing 2018: 630-633.
    Article PDF
  5. Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann and Thomas Schneck: 1-Fan-Bundle-Planar Drawings. Graph Drawing 2016: 634-636.
    Article PDF
  6. Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann and Alexander Wolf: Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. Graph Drawing 2014: 515-516.
    Article PDF
  7. Evmorfia Argyriou, Michael A. Bekos, Michael Kaufmann and Antonios Symvonis: Combining Problems on RAC Drawings and Simultaneous Graph Drawings. Graph Drawing 2011: 433-434.
    Article PDF
  8. Michael A. Bekos and Antonios Symvonis: A Boundary Labeller for Technical Drawings. Graph Drawing 2005: 503-504.
    Article PDF

Ph.D. Thesis

  • Michael A. Bekos: Map Labeling Algorithms with Application in Graph Drawing and Cartography. School of Applied Mathematics and Physical Sciences, National Technical University of Athens, 2008.
    English Version Greek Version

EDs, PCs, et al.

  • Co-chair and co-organizer of EuroCG2024, Ioannina, Greece, March 13-15, 2024.
  • Co-chair of GD2023, Sicily (Isola delle Femmine), Italy, September 20-22, 2023.
  • Steering Committee member of Graph Drawing and Network Visualization (2022-2024).
  • PC-member of EuroCG2023, Barcelona, Spain, March 29–31, 2023.
  • Co-chair and co-organizer of WG2022, Tübingen, Germany, June 21-23, 2022.
  • PC-member of EuroCG2022, Perugia, Italy, March 14–16, 2022.
  • Co-organizer of GNV2022 workshop, Heiligkreuztal, Germany, June 26–July 1, 2022.
  • Co-organizer of GD2021, Tübingen, Germany, September 15-17, 2021.
  • PC-member of GD2021, Tübingen, Germany, September 15-17, 2021.
  • PC-member of EuroCG2020, Würzburg, Germany, March 16–18, 2020.
  • PC-member of GD2019, Prague, Czech Republic, September 17-20, 2019.
  • Co-organizer of GNV2019 workshop, Heiligkreuztal, Germany, June 30–July 5, 2019.
  • Co-organizer of GNV2018 workshop, Heiligkreuztal, Germany, July 1-6, 2018.
  • Guest editor, Special issue on Graph Drawing Beyond Planarity, JGAA, 2017.
  • PC-member of GD2017, Boston, USA, September 25-27, 2017.
  • Co-organizer of GNV2017 workshop, Heiligkreuztal, Germany, June 25-30, 2017.
  • PC-member of IISA2016, co-Chair of GNV special session, Chalkidiki, Greece, July 13-15, 2016.
  • Co-organizer of GNV2016 workshop, Chalkidiki, Greece, July 12-16, 2016.
  • PC-member of IISA2015,co-Chair of GNV special session, Corfu, Greece, July 6-8, 2015.
  • Co-organizer of GNV2015 workshop, Corfu, Greece, July 4-8, 2015.
  • PC-member of GD2014, Würzburg, Germany, September 24-26, 2014.
  • PC-member of IISA2014, co-Chair of GNV special session, Chania, Greece, July 7-9, 2014.
  • Co-organizer of GNV2014 workshop, Chania, Greece, July 6-9, 2014.
  • Regular member of the annual Bertinoro Workshops on Graph Drawing (BWGD) since 2013.

Teaching

MAY343 - Introduction to programming

WS2022-2023 BSc Course

More details at ecourse.uoi.gr

MAE748 - Efficient algorithms

WS2022-2023 BSc Course

More details at ecourse.uoi.gr

PL3 - Advanced Algorithmic Topics

WS2022-2023 MSc Course

More details at ecourse.uoi.gr

Lecture Notes

You can download my lecture notes for the algorithmic courses that I am offering using this link

Past Courses

Here is a list of courses that I have taught in the past.

  • Special Topics in Computer Science, WS2022, BSc, U. Ioannina.
    Methoden der Algorithmik, WS2021, SS2021, BSc, U. Tübingen.
    Effiziente Algorithmen, SS2020, BSc, U. Passau.
    Graphen und Netzwerkalgorithmen Praktikum, SS2020, MSc, U. Passau.
    Methoden der Algorithmik, WS2020, BSc, U. Tübingen.
    Algorithmen und Komplexitat, SS2019, MSc, U. Tübingen.
    Graphen und Netzwerkalgorithmen Praktikum, SS2019, MSc, U. Tübingen.
    Methoden der Algorithmik, WS2018, BSc, U. Tübingen.
    Graphenzeichnen Seminar, WS2018, BSc, U. Tübingen.
    Graphen und Netzwerkalgorithmen Praktikum, WS2015-2018, MSc, U. Tübingen.
    Graph Databases Seminar, SS2018, BSc, U. Tübingen.
    Spezialle Themen der Algorithmik, SS2016-2017, MSc, U. Tübingen.
  • Computational Complexity Seminar, WS2017, BSc, U. Tübingen.
    Graph Coloring Seminar, WS2017, BSc, U. Tübingen.
    Seminar Beyond Planarity, WS2016, MSc, U. Tübingen.
    Kombinatorische Algorithmen Seminar, SS2015, BSc, U. Tübingen.
    Seminar zum Programmierprojekt RaceTrack, SS2015, BSc, U. Tübingen.
    Concrete Mathematics Seminar, WS2014, BSc, U. Tübingen.
    Programmierprojekt in Software Engineering, SS2014, BSc, U. Tübingen.
    Graphenzeichnen Seminar, SS2014, BSc, U. Tübingen.
    Object oriented programming, WS2005-2008, 2010-2011, MSc, NTUA.
    Complexity, WS2010, MSc, TEI Athens.
    Algorithms and complexity, WS2010, BSc, TEI Athens.