{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:37:07Z","timestamp":1770921427596,"version":"3.50.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-17801-5_37","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:38Z","timestamp":1770918818000},"page":"505-516","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["k-Planar and\u00a0Fan-Crossing Drawings and\u00a0Transductions of\u00a0Planar Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2125-1514","authenticated-orcid":false,"given":"Petr","family":"Hlin\u011bn\u00fd","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9585-2553","authenticated-orcid":false,"given":"Jan","family":"Jedelsk\u00fd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/J.TCS.2018.03.005","volume":"723","author":"P Angelini","year":"2018","unstructured":"Angelini, P., Bekos, M.A., Kaufmann, M., Kindermann, P., Schneck, T.: 1-fan-bundle-planar drawings of graphs. Theor. Comput. Sci. 723, 23\u201350 (2018). https:\/\/doi.org\/10.1016\/J.TCS.2018.03.005","journal-title":"Theor. Comput. Sci."},{"key":"37_CR2","doi-asserted-by":"publisher","unstructured":"Bonnet, \u00c9., Kim, E.J., Thomass\u00e9, S., Watrigant, R.: Twin-width I: tractable FO model checking. J. ACM, 69(1), 3:1\u20133:46 (2022). https:\/\/doi.org\/10.1145\/3486655","DOI":"10.1145\/3486655"},{"key":"37_CR3","doi-asserted-by":"publisher","unstructured":"Braunfeld, S., Ne\u0161et\u0159il, J., de Mendez, P.O., Siebertz, v S.: On first-order transductions of classes of graphs. CoRR, abs\/2208.14412, 2022. http:\/\/arxiv.org\/abs\/2208.14412 arXiv:2208.14412, https:\/\/doi.org\/10.48550\/ARXIV.2208.14412","DOI":"10.48550\/ARXIV.2208.14412"},{"issue":"2","key":"37_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/S002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000). https:\/\/doi.org\/10.1007\/S002249910009","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"37_CR5","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1137\/16M1062879","volume":"31","author":"V Dujmovic","year":"2017","unstructured":"Dujmovic, V., Eppstein, D., Wood, D.R.: Structure of graphs with locally restricted crossings. SIAM J. Discret. Math. 31(2), 805\u2013824 (2017). https:\/\/doi.org\/10.1137\/16M1062879","journal-title":"SIAM J. Discret. Math."},{"key":"37_CR6","doi-asserted-by":"publisher","unstructured":"Dvo\u0159\u00e1k, Z., Wood, D.R.: Product structure of graph classes with strongly sublinear separators. CoRR, abs\/2208.10074, 2022. http:\/\/arxiv.org\/abs\/2208.10074 arXiv:2208.10074, https:\/\/doi.org\/10.48550\/ARXIV.2208.10074","DOI":"10.48550\/ARXIV.2208.10074"},{"key":"37_CR7","doi-asserted-by":"publisher","unstructured":"Gajarsk\u00fd, J., G\u0142adkowski, J., Jedelsk\u00fd, J., Pilipczuk, M., Toru\u0144czyk, S.: First-order transducibility among classes of sparse graphs. CoRR, abs\/2505.15655, 2025. http:\/\/arxiv.org\/abs\/2505.15655 arXiv:2505.15655, https:\/\/doi.org\/10.48550\/ARXIV.2505.15655","DOI":"10.48550\/ARXIV.2505.15655"},{"key":"37_CR8","doi-asserted-by":"publisher","unstructured":"Gajarsk\u00fd, J., Hlin\u011bn\u00fd, P., Obdr\u017e\u00e1lek, J., Lokshtanov, D., Ramanujan, M.S.: A new perspective on FO model checking of dense graph classes. ACM Trans. Comput. Log. 21(4), 28:1\u201328:23 (2020). https:\/\/doi.org\/10.1145\/3383206","DOI":"10.1145\/3383206"},{"key":"37_CR9","doi-asserted-by":"publisher","unstructured":"Gajarsk\u00fd, J., Pilipczuk, M., Pokr\u00fdvka, F.: 3D-grids are not transducible from planar graphs. In: 40th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2025, Singapore, June 23-26, 2025, pp. 831\u2013842. IEEE (2025). https:\/\/doi.org\/10.1109\/LICS65433.2025.00068","DOI":"10.1109\/LICS65433.2025.00068"},{"key":"37_CR10","doi-asserted-by":"publisher","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P., Ne\u0161et\u0159il, J., Obdr\u017e\u00e1lek, J., de Mendez, P.O.: Shrub-depth: Capturing height of dense graphs. Log. Methods Comput. Sci. 15(1) (2019). https:\/\/doi.org\/10.23638\/LMCS-15(1:7)2019","DOI":"10.23638\/LMCS-15(1:7)2019"},{"key":"37_CR11","doi-asserted-by":"publisher","unstructured":"Hlinen\u00fd, P., Jedelsk\u00fd, J.: Transductions of graph classes admitting product structure. In: 40th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2025, Singapore, June 23-26, 2025, pp. 843\u2013855. IEEE (2025). https:\/\/doi.org\/10.1109\/LICS65433.2025.00069","DOI":"10.1109\/LICS65433.2025.00069"},{"key":"37_CR12","doi-asserted-by":"publisher","unstructured":"Pilipczuk, M.: Graph classes through the lens of logic. CoRR, abs\/2501.04166 (2025). http:\/\/arxiv.org\/abs\/2501.04166 arXiv:2501.04166, https:\/\/doi.org\/10.48550\/ARXIV.2501.04166","DOI":"10.48550\/ARXIV.2501.04166"},{"key":"37_CR13","doi-asserted-by":"publisher","unstructured":"Toru\u0144czyk, S.: Flip-width: cops and robber on dense graphs. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pp. 663\u2013700. IEEE (2023). https:\/\/doi.org\/10.1109\/FOCS57990.2023.00045","DOI":"10.1109\/FOCS57990.2023.00045"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:39Z","timestamp":1770918819000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}