default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael A. Bekos
Person information
- affiliation: University of Ioannina, Greece
- affiliation (former): Eberhard Karls University of Tübingen, Department of Informatics, Germany
- affiliation (PhD 2008): National Technical University of Athens, Department of Mathematics, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j57]Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
Recognizing Map Graphs of Bounded Treewidth. Algorithmica 86(2): 613-637 (2024)- [j56]Michael A. Bekos, Giordano Da Lozzo, Svenja M. Griesbach, Martin Gronemann, Fabrizio Montecchiani
, Chrysanthi N. Raftopoulou:
Book embeddings of k-framed graphs and k-map graphs. Discret. Math. 347(1): 113690 (2024) - [j55]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Convex grid drawings of planar graphs with constant edge-vertex resolution. Theor. Comput. Sci. 982: 114290 (2024) - [i58]Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger:
On k-planar Graphs without Short Cycles. CoRR abs/2408.16085 (2024) - 2023
- [j54]Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou:
An Improved Upper Bound on the Queue Number of Planar Graphs. Algorithmica 85(2): 544-562 (2023) - [j53]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Lazy Queue Layouts of Posets. Algorithmica 85(5): 1176-1201 (2023) - [j52]Patrizio Angelini, Michael A. Bekos, Henry Förster, Martin Gronemann:
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario. Algorithmica 85(9): 2667-2692 (2023) - [j51]Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger:
Splitting Vertices in 2-Layer Graph Drawings. IEEE Computer Graphics and Applications 43(3): 24-35 (2023) - [j50]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
Recognizing DAGs with page-number 2 is NP-complete. Theor. Comput. Sci. 946: 113689 (2023) - [c73]Michael A. Bekos, Michael Kaufmann, Maria Eleni Pavlidi, Xenia Rieger:
On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs. CCCG 2023: 89-95 - [c72]Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt:
Axis-Parallel Right Angle Crossing Graphs. ESA 2023: 9:1-9:15 - [c71]Michael A. Bekos, Henry Förster, Michael Kaufmann, Stephen G. Kobourov, Myroslav Kryven, Axel Kuckuk, Lena Schlipf:
On the 2-Layer Window Width Minimization Problem. SOFSEM 2023: 209-221 - [e3]Michael A. Bekos, Markus Chimani:
Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part I. Lecture Notes in Computer Science 14465, Springer 2023, ISBN 978-3-031-49271-6 [contents] - [e2]Michael A. Bekos, Markus Chimani:
Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II. Lecture Notes in Computer Science 14466, Springer 2023, ISBN 978-3-031-49274-7 [contents] - [i57]Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger:
Splitting Vertices in 2-Layer Graph Drawings. CoRR abs/2301.10872 (2023) - [i56]Michael A. Bekos, Michael Kaufmann, Maria Eleni Pavlidi, Xenia Rieger:
On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs. CoRR abs/2306.15395 (2023) - [i55]Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt:
Axis-Parallel Right Angle Crossing Graphs. CoRR abs/2306.17073 (2023) - [i54]Michael A. Bekos, Markus Chimani:
Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023). CoRR abs/2309.07166 (2023) - 2022
- [j49]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) - [j48]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) - [j47]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) - [j46]Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister:
On morphs of 1-plane graphs. J. Comput. Geom. 13(1) (2022) - [j45]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) - [j44]Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze:
On mixed linear layouts of series-parallel graphs. Theor. Comput. Sci. 936: 129-138 (2022) - [c70]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Strictly-Convex Drawings of 3-Connected Planar Graphs. GD 2022: 144-156 - [c69]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
Recognizing DAGs with Page-Number 2 Is NP-complete. GD 2022: 361-370 - [c68]Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter:
The Rique-Number of Graphs. GD 2022: 371-386 - [c67]Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann:
Graph Product Structure for h-Framed Graphs. ISAAC 2022: 23:1-23:15 - [c66]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution. IWOCA 2022: 157-171 - [c65]Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister:
RAC Drawings of Graphs with Low Degree. MFCS 2022: 11:1-11:15 - [c64]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 - [e1]Michael A. Bekos, Michael Kaufmann:
Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13453, Springer 2022, ISBN 978-3-031-15913-8 [contents] - [i53]Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann:
Graph Product Structure for h-Framed Graphs. CoRR abs/2204.11495 (2022) - [i52]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Convex Grid Drawings of Planar Graphs\\with Constant Edge-Vertex Resolution. CoRR abs/2204.14040 (2022) - [i51]Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
Recognizing Map Graphs of Bounded Treewidth. CoRR abs/2206.14898 (2022) - [i50]Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister:
RAC Drawings of Graphs with Low Degree. CoRR abs/2206.14909 (2022) - [i49]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Strictly-Convex Drawings of 3-Connected Planar Graphs. CoRR abs/2208.13388 (2022) - [i48]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
Recognizing DAGs with Page-Number 2 is NP-complete. CoRR abs/2208.13615 (2022) - [i47]Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter:
The Rique-Number of Graphs. CoRR abs/2209.00424 (2022) - 2021
- [b1]Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg:
External Labeling: Fundamental Concepts and Algorithmic Techniques. Synthesis Lectures on Visualization, Morgan & Claypool Publishers 2021, ISBN 978-3-031-01481-9, pp. 1-130 - [j43]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) - [j42]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) - [j41]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) - [c63]Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou:
On the Queue Number of Planar Graphs. GD 2021: 271-284 - [c62]Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister:
On Morphing 1-Planar Drawings. WG 2021: 270-282 - [i46]Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister:
On Morphing 1-Planar Drawings. CoRR abs/2105.13040 (2021) - [i45]Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou:
On the Queue Number of Planar Graphs. CoRR abs/2106.08003 (2021) - [i44]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
The Mixed Page Number of Graphs. CoRR abs/2107.04993 (2021) - 2020
- [j40]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Queue Layouts of Planar 3-Trees. Algorithmica 82(9): 2564-2585 (2020) - [j39]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 B 142: 1-35 (2020) - [j38]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) - [j37]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) - [j36]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) - [c61]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 - [c60]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Lazy Queue Layouts of Posets. GD 2020: 55-68 - [c59]Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze:
On Mixed Linear Layouts of Series-Parallel Graphs. GD 2020: 151-159 - [c58]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. GD 2020: 250-264 - [c57]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 - [p2]Michael A. Bekos:
k-Planar Graphs. Beyond Planar Graphs 2020: 109-130 - [p1]Michael A. Bekos, Luca Grilli:
Fan-Planar Graphs. Beyond Planar Graphs 2020: 131-148 - [i43]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. CoRR abs/2003.07655 (2020) - [i42]Michael A. Bekos, Mirco Haug, Michael Kaufmann, Julia Männecke:
An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs. CoRR abs/2003.09642 (2020) - [i41]Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Four Pages Are Indeed Necessary for Planar Graphs. CoRR abs/2004.07630 (2020) - [i40]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis, Leonidas Theocharous:
Grid Drawings of Graphs with Constant Edge-Vertex Resolution. CoRR abs/2005.02082 (2020) - [i39]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. CoRR abs/2008.09002 (2020) - [i38]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Lazy Queue Layouts of Posets. CoRR abs/2008.10336 (2020) - [i37]Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze:
On Mixed Linear Layouts of Series-Parallel Graphs. CoRR abs/2008.10475 (2020)
2010 – 2019
- 2019
- [j35]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) - [j34]Patrizio Angelini, Michael A. Bekos:
Hierarchical Partial Planarity. Algorithmica 81(6): 2196-2221 (2019) - [j33]Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for 1-Bend Planar Drawings. Algorithmica 81(6): 2527-2556 (2019) - [j32]Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg:
External Labeling Techniques: A Taxonomy and Survey. Comput. Graph. Forum 38(3): 833-860 (2019) - [j31]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) - [j30]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) - [j29]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) - [j28]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) - [j27]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) - [c56]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck:
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. GD 2019: 253-267 - [c55]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 - [c54]Patrizio Angelini, Michael A. Bekos, Martin Gronemann, Antonios Symvonis:
Geometric Representations of Dichotomous Ordinal Data. WG 2019: 205-217 - [i36]Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg:
External Labeling Techniques: A Taxonomy and Survey. CoRR abs/1902.01454 (2019) - [i35]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck:
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. CoRR abs/1908.03042 (2019) - [i34]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. CoRR abs/1909.00223 (2019) - [i33]Michael A. Bekos, Chrysanthi N. Raftopoulou:
On a Conjecture of Lovász on Circle-Representations of Simple 4-Regular Planar Graphs. CoRR abs/1909.01721 (2019) - [i32]Michael A. Bekos, Carla Binucci, Michael Kaufmann, Chrysanthi N. Raftopoulou, Antonios Symvonis, Alessandra Tappini:
Coloring outerplanar graphs and planar 3-trees with small monochromatic components. CoRR abs/1911.10863 (2019) - 2018
- [j26]Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani:
Guest Editors' Foreword and Overview. J. Graph Algorithms Appl. 22(1): 1-10 (2018) - [j25]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) - [j24]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) - [c53]Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for Upward Planar Drawings. GD 2018: 77-91 - [c52]Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann:
On RAC Drawings of Graphs with One Bend per Edge. GD 2018: 123-136 - [c51]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Queue Layouts of Planar 3-Trees. GD 2018: 213-226 - [c50]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. GD 2018: 271-285 - [c49]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. GD 2018: 495-508 - [c48]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 - [c47]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
On Dispersable Book Embeddings. WG 2018: 1-14 - [c46]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 - [i31]Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for Upward Planar Drawings. CoRR abs/1803.09949 (2018) - [i30]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
On Dispersable Book Embeddings. CoRR abs/1803.10030 (2018) - [i29]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. CoRR abs/1808.09063 (2018) - [i28]Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann:
On RAC Drawings of Graphs with one Bend per Edge. CoRR abs/1808.10470 (2018) - [i27]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. CoRR abs/1808.10519 (2018) - [i26]Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Queue Layouts of Planar 3-Trees. CoRR abs/1808.10841 (2018) - [i25]Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Planar Graphs of Bounded Degree have Constant Queue Number. CoRR abs/1811.00816 (2018) - 2017
- [j23]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) - [j22]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) - [j21]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) - [j20]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) - [j19]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) - [j18]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) - [j17]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) - [c45]Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani:
A Universal Slope Set for 1-Bend Planar Drawings. SoCG 2017: 9:1-9:16 - [c44]Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou:
On Optimal 2- and 3-Planar Graphs. SoCG 2017: 16:1-16:16 - [c43]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani:
3D Visibility Representations of 1-planar Graphs. GD 2017: 102-109 - [c42]Michael A. Bekos, Henry Förster, Michael Kaufmann:
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. GD 2017: 169-183 - [c41]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar Drawings of Fixed-Mobile Bigraphs. GD 2017: 426-439 - [c40]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck:
1-Fan-Bundle-Planar Drawings of Graphs. GD 2017: 517-530 - [c39]Patrizio Angelini, Michael A. Bekos:
Hierarchical Partial Planarity. WG 2017: 45-58 - [c38]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 - [i24]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck:
1-Fan-Bundle-Planar Drawings of Graphs. CoRR abs/1702.06163 (2017) - [i23]