Bekos, Michael A.; Binucci, Carla; Di Battista, Giuseppe; Didimo, Walter; Gronemann, Martin; Klein, Karsten; Patrignani, Maurizio; Rutter, Ignaz On turn-regular orthogonal representations. (English) Zbl 1498.05189 J. Graph Algorithms Appl. 26, No. 3, 285-306 (2022). MSC: 05C62 05C10 68R10 05C85 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., J. Graph Algorithms Appl. 26, No. 3, 285--306 (2022; Zbl 1498.05189) Full Text: DOI
Alam, Jawaherul Md.; Bekos, Michael A.; Dujmović, Vida; Gronemann, Martin; Kaufmann, Michael; Pupyrev, Sergey On dispersable book embeddings. (English) Zbl 1497.68362 Theor. Comput. Sci. 861, 1-22 (2021). MSC: 68R10 05C10 05C62 PDFBibTeX XMLCite \textit{J. Md. Alam} et al., Theor. Comput. Sci. 861, 1--22 (2021; Zbl 1497.68362) Full Text: DOI arXiv
Bekos, Michael A.; Grilli, Luca Fan-planar graphs. (English) Zbl 1512.05105 Hong, Seok-Hee (ed.) et al., Beyond planar graphs. Communications of National Institute of Informatics (NII) Shonan meetings, Shonan, Japan, November 27 – December 1, 2016. Singapore: Springer. 131-148 (2020). MSC: 05C10 05C62 05C85 68R10 68Q17 PDFBibTeX XMLCite \textit{M. A. Bekos} and \textit{L. Grilli}, in: Beyond planar graphs. Communications of National Institute of Informatics (NII) Shonan meetings, Shonan, Japan, November 27 -- December 1, 2016. Singapore: Springer. 131--148 (2020; Zbl 1512.05105) Full Text: DOI
Bekos, Michael A. \(k\)-planar graphs. (English) Zbl 1487.05071 Hong, Seok-Hee (ed.) et al., Beyond planar graphs. Communications of National Institute of Informatics (NII) Shonan meetings, Shonan, Japan, November 27 – December 1, 2016. Singapore: Springer. 109-130 (2020). Reviewer: Liangxia Wan (Beijing) MSC: 05C10 05C62 PDFBibTeX XMLCite \textit{M. A. Bekos}, in: Beyond planar graphs. Communications of National Institute of Informatics (NII) Shonan meetings, Shonan, Japan, November 27 -- December 1, 2016. Singapore: Springer. 109--130 (2020; Zbl 1487.05071) Full Text: DOI
Angelini, Patrizio; Bekos, Michael A.; Kaufmann, Michael; Schneck, Thomas Efficient generation of different topological representations of graphs beyond-planarity. (English) Zbl 1451.05055 J. Graph Algorithms Appl. 24, No. 4, 573-601 (2020). MSC: 05C10 05C62 05C85 PDFBibTeX XMLCite \textit{P. Angelini} et al., J. Graph Algorithms Appl. 24, No. 4, 573--601 (2020; Zbl 1451.05055) Full Text: DOI
Angelini, Patrizio; Bekos, Michael A.; Brandenburg, Franz J.; Da Lozzo, Giordano; Di Battista, Giuseppe; Didimo, Walter; Hoffmann, Michael; Liotta, Giuseppe; Montecchiani, Fabrizio; Rutter, Ignaz; Tóth, Csaba D. Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar. (English) Zbl 1436.05031 J. Comb. Theory, Ser. B 142, 1-35 (2020). MSC: 05C10 05C62 PDFBibTeX XMLCite \textit{P. Angelini} et al., J. Comb. Theory, Ser. B 142, 1--35 (2020; Zbl 1436.05031) Full Text: DOI arXiv
Bekos, Michael A.; Förster, Henry; Gronemann, Martin; Mchedlidze, Tamara; Montecchiani, Fabrizio; Raftopoulou, Chrysanthi; Ueckerdt, Torsten Planar graphs of bounded degree have bounded queue number. (English) Zbl 1423.05049 SIAM J. Comput. 48, No. 5, 1487-1502 (2019). MSC: 05C10 05C62 05C85 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., SIAM J. Comput. 48, No. 5, 1487--1502 (2019; Zbl 1423.05049) Full Text: DOI arXiv
Angelini, Patrizio; Bekos, Michael A.; Kaufmann, Michael; Montecchiani, Fabrizio On 3D visibility representations of graphs with few crossings per edge. (English) Zbl 1423.68325 Theor. Comput. Sci. 784, 11-20 (2019). MSC: 68R10 05C62 PDFBibTeX XMLCite \textit{P. Angelini} et al., Theor. Comput. Sci. 784, 11--20 (2019; Zbl 1423.68325) Full Text: DOI
Angelini, Patrizio; Bekos, Michael A.; Kaufmann, Michael; Kindermann, Philipp; Schneck, Thomas 1-fan-bundle-planar drawings of graphs. (English) Zbl 1426.68193 Frati, Fabrizio (ed.) et al., Graph drawing and network visualization. 25th international symposium, GD 2017, Boston, MA, USA, September 25–27, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10692, 517-530 (2018). MSC: 68R10 05C62 PDFBibTeX XMLCite \textit{P. Angelini} et al., Lect. Notes Comput. Sci. 10692, 517--530 (2018; Zbl 1426.68193) Full Text: DOI arXiv
Angelini, Patrizio; Bekos, Michael A.; Kaufmann, Michael; Montecchiani, Fabrizio 3D visibility representations of 1-planar graphs. (English) Zbl 1503.68201 Frati, Fabrizio (ed.) et al., Graph drawing and network visualization. 25th international symposium, GD 2017, Boston, MA, USA, September 25–27, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10692, 102-109 (2018). MSC: 68R10 05C10 05C62 68U05 PDFBibTeX XMLCite \textit{P. Angelini} et al., Lect. Notes Comput. Sci. 10692, 102--109 (2018; Zbl 1503.68201) Full Text: DOI arXiv
Alam, Jawaherul Md.; Bekos, Michael A.; Gronemann, Martin; Kaufmann, Michael; Pupyrev, Sergey On dispersable book embeddings. (English) Zbl 1497.68363 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 44th international workshop, WG 2018, Cottbus, Germany, June 27–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11159, 1-14 (2018). MSC: 68R10 05C10 05C62 PDFBibTeX XMLCite \textit{J. Md. Alam} et al., Lect. Notes Comput. Sci. 11159, 1--14 (2018; Zbl 1497.68363) Full Text: DOI arXiv
Angelini, Patrizio; Bekos, Michael A.; Kaufmann, Michael; Kindermann, Philipp; Schneck, Thomas 1-fan-bundle-planar drawings of graphs. (English) Zbl 1392.68320 Theor. Comput. Sci. 723, 23-50 (2018). MSC: 68R10 05C62 PDFBibTeX XMLCite \textit{P. Angelini} et al., Theor. Comput. Sci. 723, 23--50 (2018; Zbl 1392.68320) Full Text: DOI arXiv
Bekos, Michael A. (ed.); Kaufmann, Michael (ed.); Montecchiani, Fabrizio (ed.) Special issue on graph drawing beyond planarity. Guest editors’ foreword and overview. (English) Zbl 1384.00057 J. Graph Algorithms Appl. 22, No. 1, 1-10 (2018). MSC: 00B15 05-06 05C62 PDFBibTeX XMLCite \textit{M. A. Bekos} (ed.) et al., J. Graph Algorithms Appl. 22, No. 1, 1--10 (2018; Zbl 1384.00057) Full Text: DOI
Bekos, Michael A.; Bruckdorfer, Till; Kaufmann, Michael; Raftopoulou, Chrysanthi N. The book thickness of 1-planar graphs is constant. (English) Zbl 1372.05049 Algorithmica 79, No. 2, 444-465 (2017). MSC: 05C10 05C62 05C85 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Algorithmica 79, No. 2, 444--465 (2017; Zbl 1372.05049) Full Text: DOI arXiv
Bekos, Michael A.; Didimo, Walter; Liotta, Giuseppe; Mehrabi, Saeed; Montecchiani, Fabrizio On RAC drawings of 1-planar graphs. (English) Zbl 1372.68202 Theor. Comput. Sci. 689, 48-57 (2017). MSC: 68R10 05C62 68Q17 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Theor. Comput. Sci. 689, 48--57 (2017; Zbl 1372.68202) Full Text: DOI arXiv
Bekos, Michael A.; Kaufmann, Michael; Krug, Robert On the total number of bends for planar octilinear drawings. (English) Zbl 1366.05074 J. Graph Algorithms Appl. 21, No. 4, 709-730 (2017). MSC: 05C62 05C10 68R10 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., J. Graph Algorithms Appl. 21, No. 4, 709--730 (2017; Zbl 1366.05074) Full Text: DOI
Bekos, Michael A.; Kaufmann, Michael; Krug, Robert On the total number of bends for planar octilinear drawings. (English) Zbl 1411.05187 Kranakis, Evangelos (ed.) et al., LATIN 2016: theoretical informatics. 12th Latin American symposium, Ensenada, Mexico, April 11–15, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9644, 152-163 (2016). MSC: 05C62 05C10 68R10 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Lect. Notes Comput. Sci. 9644, 152--163 (2016; Zbl 1411.05187) Full Text: DOI arXiv
Bekos, Michael A.; van Dijk, Thomas C.; Kindermann, Philipp; Wolff, Alexander Simultaneous drawing of planar graphs with right-angle crossings and few bends. (English) Zbl 1331.05157 J. Graph Algorithms Appl. 20, No. 1, 133-158 (2016). MSC: 05C62 05C10 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., J. Graph Algorithms Appl. 20, No. 1, 133--158 (2016; Zbl 1331.05157) Full Text: DOI arXiv
Bekos, Michael A.; Raftopoulou, Chrysanthi N. On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs. (English) Zbl 1405.05123 J. Comput. Geom. 6, No. 1, 1-20 (2015). MSC: 05C62 05C10 05C40 PDFBibTeX XMLCite \textit{M. A. Bekos} and \textit{C. N. Raftopoulou}, J. Comput. Geom. 6, No. 1, 1--20 (2015; Zbl 1405.05123) Full Text: DOI
Bekos, Michael A.; Kaufmann, Michael; Zielke, Christian The book embedding problem from a SAT-solving perspective. (English) Zbl 1471.68184 Di Giacomo, Emilio (ed.) et al., Graph drawing and network visualization. 23rd international symposium, GD 2015, Los Angeles, CA, USA, September 24–26, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9411, 125-138 (2015). MSC: 68R10 05C10 05C62 68R07 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Lect. Notes Comput. Sci. 9411, 125--138 (2015; Zbl 1471.68184) Full Text: DOI
Bekos, Michael A.; Gronemann, Martin; Kaufmann, Michael; Krug, Robert Planar octilinear drawings with one bend per edge. (English) Zbl 1328.05129 J. Graph Algorithms Appl. 19, No. 2, 657-680 (2015). MSC: 05C62 05C10 05C07 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., J. Graph Algorithms Appl. 19, No. 2, 657--680 (2015; Zbl 1328.05129) Full Text: DOI
Bekos, Michael A.; Bruckdorfer, Till; Kaufmann, Michael; Raftopoulou, Chrysanthi 1-planar graphs have constant book thickness. (English) Zbl 1370.05046 Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer (ISBN 978-3-662-48349-7/pbk; 978-3-662-48350-3/ebook). Lecture Notes in Computer Science 9294, 130-141 (2015). MSC: 05C10 05C62 05C85 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Lect. Notes Comput. Sci. 9294, 130--141 (2015; Zbl 1370.05046) Full Text: DOI arXiv
Bekos, Michael A.; Kaufmann, Michael; Krug, Robert; Ludwig, Thorsten; Näher, Stefan; Roselli, Vincenzo Slanted orthogonal drawings: model, algorithms and evaluations. (English) Zbl 1305.05157 J. Graph Algorithms Appl. 18, No. 3, 459-489 (2014). MSC: 05C62 05C85 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., J. Graph Algorithms Appl. 18, No. 3, 459--489 (2014; Zbl 1305.05157) Full Text: DOI
Bekos, Michael A.; Kaufmann, Michael; Krug, Robert; Näher, Stefan; Roselli, Vincenzo Slanted orthogonal drawings. (English) Zbl 1406.68063 Wismath, Stephen (ed.) et al., Graph drawing. 21st international symposium, GD 2013, Bordeaux, France, September 23–25, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03840-7/pbk). Lecture Notes in Computer Science 8242, 424-435 (2013). MSC: 68R10 05C62 05C85 68U05 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Lect. Notes Comput. Sci. 8242, 424--435 (2013; Zbl 1406.68063) Full Text: DOI
Bekos, Michael A.; Kaufmann, Michael; Kobourov, Stephen G.; Symvonis, Antonios Smooth orthogonal layouts. (English) Zbl 1377.68163 Didimo, Walter (ed.) et al., Graph drawing. 20th international symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-36762-5/pbk). Lecture Notes in Computer Science 7704, 150-161 (2013). MSC: 68R10 05C10 05C62 68U05 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Lect. Notes Comput. Sci. 7704, 150--161 (2013; Zbl 1377.68163) Full Text: DOI
Bekos, Michael A.; Raftopoulou, Chrysanthi N. Circle-representations of simple 4-regular planar graphs. (English) Zbl 1377.05119 Didimo, Walter (ed.) et al., Graph drawing. 20th international symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-36762-5/pbk). Lecture Notes in Computer Science 7704, 138-149 (2013). MSC: 05C62 05C10 PDFBibTeX XMLCite \textit{M. A. Bekos} and \textit{C. N. Raftopoulou}, Lect. Notes Comput. Sci. 7704, 138--149 (2013; Zbl 1377.05119) Full Text: DOI arXiv
Argyriou, Evmorfia N.; Bekos, Michael A.; Kaufmann, Michael; Symvonis, Antonios Geometric RAC simultaneous drawings of graphs. (English) Zbl 1256.05155 J. Graph Algorithms Appl. 17, No. 1, 11-34 (2013). MSC: 05C62 05C10 68R10 PDFBibTeX XMLCite \textit{E. N. Argyriou} et al., J. Graph Algorithms Appl. 17, No. 1, 11--34 (2013; Zbl 1256.05155) Full Text: DOI
Argyriou, Evmorfia N.; Bekos, Michael A.; Symvonis, Antonios The straight-line RAC drawing problem is NP-hard. (English) Zbl 1254.05120 J. Graph Algorithms Appl. 16, No. 2, 569-597 (2012). MSC: 05C62 05C60 68R10 68Q17 PDFBibTeX XMLCite \textit{E. N. Argyriou} et al., J. Graph Algorithms Appl. 16, No. 2, 569--597 (2012; Zbl 1254.05120) Full Text: DOI
Argyriou, Evmorfia; Bekos, Michael; Kaufmann, Michael; Symvonis, Antonios Geometric RAC simultaneous drawings of graphs. (English) Zbl 1364.68301 Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20–22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 287-298 (2012). MSC: 68R10 05C62 05C85 PDFBibTeX XMLCite \textit{E. Argyriou} et al., Lect. Notes Comput. Sci. 7434, 287--298 (2012; Zbl 1364.68301) Full Text: DOI
Argyriou, Evmorfia N.; Bekos, Michael A.; Symvonis, Antonios The straight-line RAC drawing problem is NP-hard. (English) Zbl 1298.68198 Černá, Ivana (ed.) et al., SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22–28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). Lecture Notes in Computer Science 6543, 74-85 (2011). MSC: 68R10 05C62 68Q17 68U05 PDFBibTeX XMLCite \textit{E. N. Argyriou} et al., Lect. Notes Comput. Sci. 6543, 74--85 (2011; Zbl 1298.68198) Full Text: DOI arXiv
Argyriou, Evmorfia N.; Bekos, Michael A.; Symvonis, Antonios Maximizing the total resolution of graphs. (English) Zbl 1314.68214 Brandes, Ulrik (ed.) et al., Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21–24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). Lecture Notes in Computer Science 6502, 62-67 (2011). MSC: 68R10 05C62 05C85 68U05 PDFBibTeX XMLCite \textit{E. N. Argyriou} et al., Lect. Notes Comput. Sci. 6502, 62--67 (2011; Zbl 1314.68214) Full Text: DOI arXiv
Argyriou, Evmorfia; Bekos, Michael A.; Kaufmann, Michael; Symvonis, Antonios On metro-line crossing minimization. (English) Zbl 1202.05090 J. Graph Algorithms Appl. 14, No. 1, 75-96 (2010). MSC: 05C62 05C10 PDFBibTeX XMLCite \textit{E. Argyriou} et al., J. Graph Algorithms Appl. 14, No. 1, 75--96 (2010; Zbl 1202.05090) Full Text: DOI EuDML
Argyriou, Evmorfia; Bekos, Michael A.; Kaufmann, Michael; Symvonis, Antonios Two polynomial time algorithms for the metro-line crossing minimization problem. (English) Zbl 1213.68647 Tollis, Ioannis G. (ed.) et al., Graph drawing. 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21–24, 2008. Revised papers. Berlin: Springer (ISBN 978-3-642-00218-2/pbk). Lecture Notes in Computer Science 5417, 336-347 (2009). MSC: 68U05 05C10 05C62 05C85 PDFBibTeX XMLCite \textit{E. Argyriou} et al., Lect. Notes Comput. Sci. 5417, 336--347 (2009; Zbl 1213.68647) Full Text: DOI
Bekos, Michael A.; Kaufmann, Michael; Potika, Katerina; Symvonis, Antonios Line crossing minimization on metro maps. (English) Zbl 1137.68467 Hong, Seok-Hee (ed.) et al., Graph drawing. 15th international symposium, GD 2007, Sydney, Australia, September 24–26, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-77536-2/pbk). Lecture Notes in Computer Science 4875, 231-242 (2008). MSC: 68R10 68U05 05C62 05C85 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Lect. Notes Comput. Sci. 4875, 231--242 (2008; Zbl 1137.68467) Full Text: DOI
Bekos, Michael A.; Kaufmann, Michael; Symvonis, Antonios; Wolff, Alexander Boundary labeling: Models and efficient algorithms for rectangular maps. (English) Zbl 1278.68308 Comput. Geom. 36, No. 3, 215-236 (2007). MSC: 68U05 05C62 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Comput. Geom. 36, No. 3, 215--236 (2007; Zbl 1278.68308) Full Text: DOI Link