×

Found 17 Documents (Results 1–17)

Parameterized complexity of graph planarity with restricted cyclic orders. (English) Zbl 07682424

Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 383-397 (2022).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI

2-colored point-set embeddings of partial 2-trees. (English) Zbl 1514.68208

Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 247-259 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Beyond clustered planar graphs. (English) Zbl 07374193

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. 211-235 (2020).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI

Simultaneous FPQ-ordering and hybrid planarity testing. (English) Zbl 1440.68191

Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 617-626 (2020).
MSC:  68R10 05C10 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

A user study on hybrid graph visualizations. (English) Zbl 07551731

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, 21-38 (2021).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Computing \(k\)-modal embeddings of planar digraphs. (English) Zbl 07525456

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 19, 16 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

ChordLink: a new hybrid visualization model. (English) Zbl 07266123

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, 276-290 (2019).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Turning cliques into paths to achieve planarity. (English) Zbl 1519.68174

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, 67-74 (2018).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Clustered planarity = flat clustered planarity. (English) Zbl 1519.68183

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, 23-38 (2018).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Computing NodeTrix representations of clustered graphs. (English) Zbl 1478.68227

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, 107-120 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field