Förster, Henry; Kaufmann, Michael; Merker, Laura; Pupyrev, Sergey; Raftopoulou, Chrysanthi Linear layouts of bipartite planar graphs. (English) Zbl 07789720 Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 444-459 (2023). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{H. Förster} et al., Lect. Notes Comput. Sci. 14079, 444--459 (2023; Zbl 07789720) Full Text: DOI arXiv
Didimo, Walter; Kaufmann, Michael; Liotta, Giuseppe; Ortali, Giacomo Rectilinear planarity of partial 2-trees. (English) Zbl 07781095 J. Graph Algorithms Appl. 27, No. 8, 679-719 (2023). MSC: 05C10 05C05 PDFBibTeX XMLCite \textit{W. Didimo} et al., J. Graph Algorithms Appl. 27, No. 8, 679--719 (2023; Zbl 07781095) Full Text: DOI
Kaufmann, Michael The family of fan-planar graphs. (English) Zbl 07770277 Lin, Chun-Cheng (ed.) et al., WALCOM: algorithms and computation. 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13973, 12-19 (2023). MSC: 68Wxx PDFBibTeX XMLCite \textit{M. Kaufmann}, Lect. Notes Comput. Sci. 13973, 12--19 (2023; Zbl 07770277) Full Text: DOI
Binucci, Carla; Di Giacomo, Emilio; Kaufmann, Michael; Liotta, Giuseppe; Tappini, Alessandra \(k\)-planar placement and packing of \(\Delta\)-regular caterpillars. (English) Zbl 1526.05112 Int. J. Found. Comput. Sci. 34, No. 7, 875-902 (2023). MSC: 05C70 05C10 PDFBibTeX XMLCite \textit{C. Binucci} et al., Int. J. Found. Comput. Sci. 34, No. 7, 875--902 (2023; Zbl 1526.05112) Full Text: DOI arXiv
Didimo, Walter; Kaufmann, Michael; Liotta, Giuseppe; Ortali, Giacomo Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time. (English) Zbl 07742466 Algorithmica 85, No. 9, 2605-2666 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{W. Didimo} et al., Algorithmica 85, No. 9, 2605--2666 (2023; Zbl 07742466) Full Text: DOI arXiv OA License
Didimo, Walter; Kaufmann, Michael; Liotta, Giuseppe; Ortali, Giacomo Rectilinear planarity of partial 2-trees. (English) Zbl 07727759 Angelini, Patrizio (ed.) et al., Graph drawing and network visualization. 30th international symposium, GD 2022, Tokyo, Japan, September 13–16, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13764, 157-172 (2023). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{W. Didimo} et al., Lect. Notes Comput. Sci. 13764, 157--172 (2023; Zbl 07727759) Full Text: DOI arXiv
Alam, Jawaherul Md.; Bekos, Michael A.; Gronemann, Martin; Kaufmann, Michael; Pupyrev, Sergey Lazy queue layouts of posets. (English) Zbl 07680774 Algorithmica 85, No. 5, 1176-1201 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{J. Md. Alam} et al., Algorithmica 85, No. 5, 1176--1201 (2023; Zbl 07680774) Full Text: DOI
Kaufmann, Michael; Ueckerdt, Torsten The density of fan-planar graphs. (English) Zbl 1486.05166 Electron. J. Comb. 29, No. 1, Research Paper P1.29, 25 p. (2022). MSC: 05C42 05C62 05C10 68R10 PDFBibTeX XMLCite \textit{M. Kaufmann} and \textit{T. Ueckerdt}, Electron. J. Comb. 29, No. 1, Research Paper P1.29, 25 p. (2022; Zbl 1486.05166) Full Text: DOI arXiv
Kaufmann, Michael; Kratochvil, Jan; Lipp, Fabian; Montecchiani, Fabrizio; Raftopoulou, Chrysanthi; Valtr, Pavel The stub resolution of 1-planar graphs. (English) Zbl 1489.05030 J. Graph Algorithms Appl. 25, No. 2, 625-642 (2021). MSC: 05C10 05C62 68R10 PDFBibTeX XMLCite \textit{M. Kaufmann} et al., J. Graph Algorithms Appl. 25, No. 2, 625--642 (2021; Zbl 1489.05030) Full Text: DOI
Frank, Fabian; Kaufmann, Michael; Kobourov, Stephen; Mchedlidze, Tamara; Pupyrev, Sergey; Ueckerdt, Torsten; Wolff, Alexander Using the metro-map metaphor for drawing hypergraphs. (English) Zbl 1490.68153 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 361-372 (2021). MSC: 68R10 05C65 PDFBibTeX XMLCite \textit{F. Frank} et al., Lect. Notes Comput. Sci. 12607, 361--372 (2021; Zbl 1490.68153) Full Text: DOI
Förster, Henry; Kaufmann, Michael On compact RAC drawings. (English) Zbl 07651192 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 53, 21 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{H. Förster} and \textit{M. Kaufmann}, LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 53, 21 p. (2020; Zbl 07651192) Full Text: DOI
Biedl, Therese; Chaplick, Steven; Kaufmann, Michael; Montecchiani, Fabrizio; Nöllenburg, Martin; Raftopoulou, Chrysanthi Layered Fan-planar graph drawings. (English) Zbl 07559385 Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 14, 13 p. (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{T. Biedl} et al., LIPIcs -- Leibniz Int. Proc. Inform. 170, Article 14, 13 p. (2020; Zbl 07559385) Full Text: DOI arXiv
Didimo, Walter; Kaufmann, Michael; Liotta, Giuseppe; Ortali, Giacomo Rectilinear planarity testing of plane series-parallel graphs in linear time. (English) Zbl 07436636 Auber, David (ed.) et al., Graph drawing and network visualization. 28th international symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12590, 436-449 (2020). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{W. Didimo} et al., Lect. Notes Comput. Sci. 12590, 436--449 (2020; Zbl 07436636) Full Text: DOI arXiv
Alam, Jawaherul Md.; Bekos, Michael A.; Gronemann, Martin; Kaufmann, Michael; Pupyrev, Sergey Lazy queue layouts of posets. (English) Zbl 07436607 Auber, David (ed.) et al., Graph drawing and network visualization. 28th international symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12590, 55-68 (2020). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{J. Md. Alam} et al., Lect. Notes Comput. Sci. 12590, 55--68 (2020; Zbl 07436607) Full Text: DOI arXiv
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
Alam, Jawaherul Md.; Bekos, Michael A.; Gronemann, Martin; Kaufmann, Michael; Pupyrev, Sergey Queue layouts of planar 3-trees. (English) Zbl 1457.05024 Algorithmica 82, No. 9, 2564-2585 (2020). MSC: 05C10 05C05 05C30 PDFBibTeX XMLCite \textit{J. Md. Alam} et al., Algorithmica 82, No. 9, 2564--2585 (2020; Zbl 1457.05024) Full Text: DOI
Angelini, Patrizio; Bekos, Michael A.; Förster, Henry; Kaufmann, Michael On RAC drawings of graphs with one bend per edge. (English) Zbl 1443.68117 Theor. Comput. Sci. 828-829, 42-54 (2020). MSC: 68R10 PDFBibTeX XMLCite \textit{P. Angelini} et al., Theor. Comput. Sci. 828--829, 42--54 (2020; Zbl 1443.68117) Full Text: DOI arXiv
Förster, Henry; Kaufmann, Michael; Raftopoulou, Chrysanthi N. Recognizing and embedding simple optimal 2-planar graphs. (English) Zbl 07551735 Purchase, Helen C. (ed.) et al., Graph drawing and network visualization. 29th international symposium, GD 2021, Tübingen, Germany, September 14–17, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12868, 87-100 (2021). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{H. Förster} et al., Lect. Notes Comput. Sci. 12868, 87--100 (2019; Zbl 07551735) Full Text: DOI arXiv
Angelini, Patrizio; Förster, Henry; Hoffmann, Michael; Kaufmann, Michael; Kobourov, Stephen; Liotta, Giuseppe; Patrignani, Maurizio The QuaSEFE problem. (English) Zbl 07266122 Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11904, 268-275 (2019). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{P. Angelini} et al., Lect. Notes Comput. Sci. 11904, 268--275 (2019; Zbl 07266122) Full Text: DOI arXiv
Angelini, Patrizio; Bekos, Michael A.; Kaufmann, Michael; Schneck, Thomas Efficient generation of different topological representations of graphs beyond-planarity. (English) Zbl 07266121 Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11904, 253-267 (2019). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{P. Angelini} et al., Lect. Notes Comput. Sci. 11904, 253--267 (2019; Zbl 07266121) 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
Bekos, Michael A.; Förster, Henry; Kaufmann, Michael On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings. (English) Zbl 1421.68106 Algorithmica 81, No. 5, 2046-2071 (2019). MSC: 68R10 05C85 68Q17 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Algorithmica 81, No. 5, 2046--2071 (2019; Zbl 1421.68106) Full Text: DOI arXiv
Angelini, Patrizio; Bekos, Michael A.; Kaufmann, Michael; Pfister, Maximilian; Ueckerdt, Torsten Beyond-planarity: Turán-type results for non-planar bipartite graphs. (English) Zbl 07561382 Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 28, 13 p. (2018). MSC: 68Wxx PDFBibTeX XMLCite \textit{P. Angelini} et al., LIPIcs -- Leibniz Int. Proc. Inform. 123, Article 28, 13 p. (2018; Zbl 07561382) Full Text: DOI arXiv
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
Bekos, Michael A.; Förster, Henry; Kaufmann, Michael On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings. (English) Zbl 1503.68205 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, 169-183 (2018). MSC: 68R10 05C85 68Q17 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Lect. Notes Comput. Sci. 10692, 169--183 (2018; Zbl 1503.68205) 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
Argyriou, Evmorfia; Cornelsen, Sabine; Förster, Henry; Kaufmann, Michael; Nöllenburg, Martin; Okamoto, Yoshio; Raftopoulou, Chrysanthi; Wolff, Alexander Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity. (English) Zbl 1519.68175 Biedl, Therese (ed.) et al., Graph drawing and network visualization. 26th international symposium, GD 2018, Barcelona, Spain, September 26–28, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11282, 509-523 (2018). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{E. Argyriou} et al., Lect. Notes Comput. Sci. 11282, 509--523 (2018; Zbl 1519.68175) Full Text: DOI arXiv
Bekos, Michael A.; Förster, Henry; Geckeler, Christian; Holländer, Lukas; Kaufmann, Michael; Spallek, Amadäus M.; Splett, Jan A heuristic approach towards drawings of graphs with high crossing resolution. (English) Zbl 1519.68178 Biedl, Therese (ed.) et al., Graph drawing and network visualization. 26th international symposium, GD 2018, Barcelona, Spain, September 26–28, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11282, 271-285 (2018). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Lect. Notes Comput. Sci. 11282, 271--285 (2018; Zbl 1519.68178) Full Text: DOI arXiv
Alam, Jawaherul Md.; Bekos, Michael A.; Gronemann, Martin; Kaufmann, Michael; Pupyrev, Sergey Queue layouts of planar 3-trees. (English) Zbl 1475.05045 Biedl, Therese (ed.) et al., Graph drawing and network visualization. 26th international symposium, GD 2018, Barcelona, Spain, September 26–28, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11282, 213-226 (2018). MSC: 05C10 68R10 PDFBibTeX XMLCite \textit{J. Md. Alam} et al., Lect. Notes Comput. Sci. 11282, 213--226 (2018; Zbl 1475.05045) Full Text: DOI arXiv
Angelini, Patrizio; Bekos, Michael A.; Förster, Henry; Kaufmann, Michael On RAC drawings of graphs with one bend per edge. (English) Zbl 1519.68173 Biedl, Therese (ed.) et al., Graph drawing and network visualization. 26th international symposium, GD 2018, Barcelona, Spain, September 26–28, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11282, 123-136 (2018). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{P. Angelini} et al., Lect. Notes Comput. Sci. 11282, 123--136 (2018; Zbl 1519.68173) Full Text: DOI arXiv
Angelini, Patrizio; Bruckdorfer, Till; Di Battista, Giuseppe; Kaufmann, Michael; Mchedlidze, Tamara; Roselli, Vincenzo; Squarcella, Claudio Small universal point sets for \(k\)-outerplanar graphs. (English) Zbl 1398.05068 Discrete Comput. Geom. 60, No. 2, 430-470 (2018). MSC: 05C10 PDFBibTeX XMLCite \textit{P. Angelini} et al., Discrete Comput. Geom. 60, No. 2, 430--470 (2018; Zbl 1398.05068) Full Text: DOI
Bruckdorfer, Till; Felsner, Stefan; Kaufmann, Michael Planar bus graphs. (English) Zbl 1392.68321 Algorithmica 80, No. 8, 2260-2285 (2018). MSC: 68R10 05C62 05C65 68W40 PDFBibTeX XMLCite \textit{T. Bruckdorfer} et al., Algorithmica 80, No. 8, 2260--2285 (2018; Zbl 1392.68321) Full Text: DOI
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
Evans, William; Felsner, Stefan; Kaufmann, Michael; Kobourov, Stephen G.; Mondal, Debajyoti; Nishat, Rahnuma Islam; Verbeek, Kevin Table cartogram. (English) Zbl 1396.65040 Comput. Geom. 68, 174-185 (2018). Reviewer: Adhemar Bultheel (Leuven) MSC: 65D18 PDFBibTeX XMLCite \textit{W. Evans} et al., Comput. Geom. 68, 174--185 (2018; Zbl 1396.65040) Full Text: DOI Link
Bekos, Michael A.; Cornelsen, Sabine; Grilli, Luca; Hong, Seok-Hee; Kaufmann, Michael On the recognition of fan-planar and maximal outer-fan-planar graphs. (English) Zbl 1372.68201 Algorithmica 79, No. 2, 401-427 (2017). MSC: 68R10 05C10 05C85 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Algorithmica 79, No. 2, 401--427 (2017; Zbl 1372.68201) Full Text: DOI
Bekos, Michael A.; Kaufmann, Michael; Kobourov, Stephen G.; Stavropoulos, Konstantinos; Veeramoni, Sankar The maximum \(k\)-differential coloring problem. (English) Zbl 1421.05040 J. Discrete Algorithms 45, 35-53 (2017). MSC: 05C15 05C85 68Q17 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., J. Discrete Algorithms 45, 35--53 (2017; Zbl 1421.05040) Full Text: DOI arXiv
Bekos, Michael A.; Kaufmann, Michael; Raftopoulou, Chrysanthi N. On the density of non-simple 3-planar graphs. (English) Zbl 1483.68249 Hu, Yifan (ed.) et al., Graph drawing and network visualization. 24th international symposium, GD 2016, Athens, Greece, September 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9801, 344-356 (2016). MSC: 68R10 05C42 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Lect. Notes Comput. Sci. 9801, 344--356 (2016; Zbl 1483.68249) Full Text: DOI arXiv
Zielke, Christian; Kaufmann, Michael A new approach to partial MUS enumeration. (English) Zbl 1471.68176 Heule, Marijn (ed.) et al., Theory and applications of satisfiability testing – SAT 2015. 18th international conference, Austin, TX, USA, September 24–27, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9340, 387-404 (2015). MSC: 68R07 68T20 PDFBibTeX XMLCite \textit{C. Zielke} and \textit{M. Kaufmann}, Lect. Notes Comput. Sci. 9340, 387--404 (2015; Zbl 1471.68176) Full Text: DOI
Alam, Md. Jawaherul; Eppstein, David; Kaufmann, Michael; Kobourov, Stephen G.; Pupyrev, Sergey; Schulz, André; Ueckerdt, Torsten Contact graphs of circular arcs. (English) Zbl 1444.68131 Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 1-13 (2015). MSC: 68R10 05C62 05C85 68Q17 68U05 PDFBibTeX XMLCite \textit{Md. J. Alam} et al., Lect. Notes Comput. Sci. 9214, 1--13 (2015; Zbl 1444.68131) Full Text: DOI
Alam, M. Jawaherul; Biedl, Therese; Felsner, Stefan; Gerasch, Andreas; Kaufmann, Michael; Kobourov, Stephen G. Linear-time algorithms for hole-free rectilinear proportional contact graph representations. (English) Zbl 1275.05037 Algorithmica 67, No. 1, 3-22 (2013). MSC: 05C62 05C10 05C85 PDFBibTeX XMLCite \textit{M. J. Alam} et al., Algorithmica 67, No. 1, 3--22 (2013; Zbl 1275.05037) Full Text: DOI
Kaufmann, Michael; Mchedlidze, Tamara; Symvonis, Antonios On upward point set embeddability. (English) Zbl 1266.05104 Comput. Geom. 46, No. 6, 774-804 (2013). MSC: 05C62 05C20 05C10 05C85 PDFBibTeX XMLCite \textit{M. Kaufmann} et al., Comput. Geom. 46, No. 6, 774--804 (2013; Zbl 1266.05104) Full Text: DOI
Angelini, Patrizio; Di Battista, Giuseppe; Didimo, Walter; Frati, Fabrizio; Hong, Seok-Hee; Kaufmann, Michael; Liotta, Giuseppe; Lubiw, Anna Large angle crossing drawings of planar graphs in subquadratic area. (English) Zbl 1374.68348 Márquez, Alberto (ed.) et al., Computational geometry. XIV Spanish meeting on computational geometry, EGC 2011, dedicated to Ferran Hurtado on the occasion of his 60th birthday, Alcalá de Henares, Spain, June 27–30, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34190-8/pbk). Lecture Notes in Computer Science 7579, 200-209 (2012). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{P. Angelini} et al., Lect. Notes Comput. Sci. 7579, 200--209 (2012; Zbl 1374.68348) Full Text: DOI
Didimo, Walter; Kaufmann, Michael; Liotta, Giuseppe; Okamoto, Yoshio; Spillner, Andreas Vertex angle and crossing angle resolution of leveled tree drawings. (English) Zbl 1248.68373 Inf. Process. Lett. 112, No. 16, 630-635 (2012). MSC: 68R10 05C62 PDFBibTeX XMLCite \textit{W. Didimo} et al., Inf. Process. Lett. 112, No. 16, 630--635 (2012; Zbl 1248.68373) Full Text: DOI
Duncan, C. A.; Gansner, E. R.; Hu, Y. F.; Kaufmann, M.; Kobourov, S. G. Optimal polygonal representation of planar graphs. (English) Zbl 1239.05126 Algorithmica 63, No. 3, 672-691 (2012). MSC: 05C62 05C10 05C85 PDFBibTeX XMLCite \textit{C. A. Duncan} et al., Algorithmica 63, No. 3, 672--691 (2012; Zbl 1239.05126) Full Text: DOI arXiv
Argyriou, Evmorfia N.; Bekos, Michael A.; Kaufmann, Michael; Symvonis, Antonios Combining problems on RAC drawings and simultaneous graph drawings. (English) Zbl 1311.68163 van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 433-434 (2012). MSC: 68U05 68R10 PDFBibTeX XMLCite \textit{E. N. Argyriou} et al., Lect. Notes Comput. Sci. 7034, 433--434 (2012; Zbl 1311.68163) Full Text: DOI
Kaufmann, Michael; Mchedlidze, Tamara; Symvonis, Antonios Upward point set embeddability for convex point sets is in P. (English) Zbl 1312.05133 van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 403-414 (2012). MSC: 05C85 05C05 05C10 05C20 68Q25 PDFBibTeX XMLCite \textit{M. Kaufmann} et al., Lect. Notes Comput. Sci. 7034, 403--414 (2012; Zbl 1312.05133) Full Text: DOI arXiv
Angelini, Patrizio; Di Battista, Giuseppe; Kaufmann, Michael; Mchedlidze, Tamara; Roselli, Vincenzo; Squarcella, Claudio Small point sets for simply-nested planar graphs. (English) Zbl 1311.68098 van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 75-85 (2012). MSC: 68R10 05C10 68U05 PDFBibTeX XMLCite \textit{P. Angelini} et al., Lect. Notes Comput. Sci. 7034, 75--85 (2012; Zbl 1311.68098) Full Text: DOI
Alam, Muhammad Jawaherul; Biedl, Therese; Felsner, Stefan; Kaufmann, Michael; Kobourov, Stephen G. Proportional contact representations of planar graphs. (English) Zbl 1311.68096 van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 26-38 (2012). MSC: 68R10 05C10 05C62 68U05 PDFBibTeX XMLCite \textit{M. J. Alam} et al., Lect. Notes Comput. Sci. 7034, 26--38 (2012; Zbl 1311.68096) Full Text: DOI
Brandes, Ulrik; Erten, Cesim; Estrella-Balderrama, Alejandro; Fowler, J. Joseph; Frati, Fabrizio; Geyer, Markus; Gutwenger, Carsten; Hong, Seok-Hee; Kaufmann, Michael; Kobourov, Stephen G.; Liotta, Giuseppe; Mutzel, Petra; Symvonis, Antonios Colored simultaneous geometric embeddings and universal pointsets. (English) Zbl 1218.68183 Algorithmica 60, No. 3, 569-592 (2011). MSC: 68U05 05C15 05C60 PDFBibTeX XMLCite \textit{U. Brandes} et al., Algorithmica 60, No. 3, 569--592 (2011; Zbl 1218.68183) Full Text: DOI Link
Angelini, Patrizio; Frati, Fabrizio; Kaufmann, Michael Straight-line rectangular drawings of clustered graphs. (English) Zbl 1251.05110 Discrete Comput. Geom. 45, No. 1, 88-140 (2011). MSC: 05C62 05C10 PDFBibTeX XMLCite \textit{P. Angelini} et al., Discrete Comput. Geom. 45, No. 1, 88--140 (2011; Zbl 1251.05110) Full Text: DOI
Geyer, Markus; Kaufmann, Michael; Mchedlidze, Tamara; Symvonis, Antonios Upward point-set embeddability. (English) Zbl 1298.05085 Č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, 272-283 (2011). MSC: 05C10 68Q17 PDFBibTeX XMLCite \textit{M. Geyer} et al., Lect. Notes Comput. Sci. 6543, 272--283 (2011; Zbl 1298.05085) Full Text: DOI arXiv
Fernau, Henning; Kaufmann, Michael; Poths, Mathias Comparing trees via crossing minimization. (English) Zbl 1210.05023 J. Comput. Syst. Sci. 76, No. 7, 593-608 (2010). MSC: 05C05 05C85 PDFBibTeX XMLCite \textit{H. Fernau} et al., J. Comput. Syst. Sci. 76, No. 7, 593--608 (2010; Zbl 1210.05023) Full Text: DOI
Kaufmann, Michael On map labeling with leaders. (English) Zbl 1258.68173 Albers, Susanne (ed.) et al., Efficient algorithms. Essays dedicated to Kurt Mehlhorn on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-03455-8/pbk). Lecture Notes in Computer Science 5760, 290-304 (2009). MSC: 68U05 68W25 90C59 PDFBibTeX XMLCite \textit{M. Kaufmann}, Lect. Notes Comput. Sci. 5760, 290--304 (2009; Zbl 1258.68173) Full Text: DOI
Angelini, Patrizio; Frati, Fabrizio; Kaufmann, Michael Straight-line rectangular drawings of clustered graphs. (English) Zbl 1253.68326 Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 25-36 (2009). MSC: 68U05 05C62 68R10 PDFBibTeX XMLCite \textit{P. Angelini} et al., Lect. Notes Comput. Sci. 5664, 25--36 (2009; Zbl 1253.68326) Full Text: DOI
Kaufmann, Michael; van Kreveld, Marc; Speckmann, Bettina Subdivision drawings of hypergraphs. (English) Zbl 1213.68462 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, 396-407 (2009). MSC: 68R10 68U05 05C62 05C65 PDFBibTeX XMLCite \textit{M. Kaufmann} et al., Lect. Notes Comput. Sci. 5417, 396--407 (2009; Zbl 1213.68462) Full Text: DOI
Frati, Fabrizio; Kaufmann, Michael; Kobourov, Stephen G. Constrained simultaneous and near-simultaneous embeddings. (English) Zbl 1137.68488 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, 268-279 (2008). MSC: 68R10 68U05 05C10 05C62 PDFBibTeX XMLCite \textit{F. Frati} et al., Lect. Notes Comput. Sci. 4875, 268--279 (2008; Zbl 1137.68488) Full Text: DOI