×

Found 7 Documents (Results 1–7)

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

\((k, p)\)-planarity: a relaxation of hybrid planarity. (English) Zbl 1514.68210

Das, Gautam K. (ed.) et al., WALCOM: algorithms and computation. 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11355, 148-159 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

Year of Publication

Main Field

Software