×

Found 56 Documents (Results 1–56)

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
Full Text: DOI arXiv

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
Full Text: DOI

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
Full Text: DOI arXiv

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
Full Text: DOI

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
Full Text: DOI

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI arXiv

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software