{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:44:11Z","timestamp":1767314651185,"version":"3.48.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032118349","type":"print"},{"value":"9783032118356","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-11835-6_9","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:39:09Z","timestamp":1767314349000},"page":"121-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Non-crossing H-Graphs: A\u00a0Generalization of\u00a0Proper Interval Graphs Admitting FPT Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9872-7528","authenticated-orcid":false,"given":"Flavia","family":"Bonomo-Braberman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1136-418X","authenticated-orcid":false,"given":"Nick","family":"Brettell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1509-8832","authenticated-orcid":false,"given":"Andrea","family":"Munaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5945-9287","authenticated-orcid":false,"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.113876","volume":"347","author":"J Balab\u00e1n","year":"2024","unstructured":"Balab\u00e1n, J., Hlin\u011bn\u00fd, P., Jedelsk\u00fd, J.: Twin-width and transductions of proper $$k$$-mixed-thin graphs. Disc. Math. 347, 113876 (2024)","journal-title":"Disc. Math."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0012-365X(92)90646-W","volume":"100","author":"M Bir\u00f3","year":"1992","unstructured":"Bir\u00f3, M., Hujter, M., Tuza, Z.: Precoloring extension. I. Interval graphs. Disc. Math. 100, 267\u2013279 (1992)","journal-title":"Disc. Math."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bonnet, \u00c9., Geniet, C., Kim, E.J., Thomass\u00e9, S., Watrigant, R.: Twin-width II: small classes. Comb. Theory 2, #10 (2022)","DOI":"10.5070\/C62257876"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bonnet, E., Kim, E.J., Thomass\u00e9, S., Watrigant, R.: Twin-width I: tractable FO model checking. J. ACM 69, 3:1\u20133:46 (2021)","DOI":"10.1145\/3486655"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.dam.2018.03.072","volume":"261","author":"F Bonomo","year":"2019","unstructured":"Bonomo, F., de Estrada, D.: On the thinness and proper thinness of a graph. Disc. Appl. Math. 261, 78\u201392 (2019)","journal-title":"Disc. Appl. Math."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2023.06.013","volume":"339","author":"F Bonomo-Braberman","year":"2023","unstructured":"Bonomo-Braberman, F., Brito, G.A.: Intersection models and forbidden pattern characterizations for $$2$$-thin and proper $$2$$-thin graphs. Disc. Appl. Math. 339, 53\u201377 (2023)","journal-title":"Disc. Appl. Math."},{"key":"9_CR7","unstructured":"\u00c7agirici, D.A., et al.: Recognizing $$H$$-graphs - beyond circular-arc graphs. In: Proceedings of MFCS 2023, LIPIcs, vol. 272, pp. 8:1\u20138:14 (2023)"},{"key":"9_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113498","volume":"346","author":"S Chaplick","year":"2023","unstructured":"Chaplick, S.: Intersection graphs of non-crossing paths. Disc. Math. 346, 113498 (2023)","journal-title":"Disc. Math."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1137\/19M1299001","volume":"35","author":"S Chaplick","year":"2021","unstructured":"Chaplick, S., Fomin, F.V., Golovach, P.A., Knop, D., Zeman, P.: Kernelization of graph hamiltonicity: proper $$H$$-graphs. SIAM J. Disc. Math. 35, 840\u2013892 (2021)","journal-title":"SIAM J. Disc. Math."},{"key":"9_CR10","unstructured":"Chaplick, S., Golovach, P.A., Hartmann, T.A., Knop, D.: Recognizing proper tree-graphs. In: Proceedings of IPEC 2020, LIPIcs, vol. 180, pp. 8:1\u20138:15 (2020)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1007\/s00453-021-00846-3","volume":"83","author":"S Chaplick","year":"2021","unstructured":"Chaplick, S., T\u00f6pfer, M., Voborn\u00edk, J., Zeman, P.: On $$H$$-topological intersection graphs. Algorithmica 83, 3281\u20133318 (2021)","journal-title":"Algorithmica"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1137\/S0097539792269095","volume":"25","author":"X Deng","year":"1996","unstructured":"Deng, X., Hell, P., Huang, J.: Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs. SIAM J. Comput. 25, 390\u2013403 (1996)","journal-title":"SIAM J. Comput."},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X","DOI":"10.1007\/3-540-29953-X"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"2432","DOI":"10.1007\/s00453-020-00692-9","volume":"82","author":"FV Fomin","year":"2020","unstructured":"Fomin, F.V., Golovach, P.A., Raymond, J.: On the tractability of optimization problems on $$H$$-graphs. Algorithmica 82, 2432\u20132473 (2020)","journal-title":"Algorithmica"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P., Kr\u00e1l, D., Obdrz\u00e1lek, J., Schwartz, J., Teska, J.: FO model checking of interval graphs. Log. Methods Comput. Sci. 11(4) (2015)","DOI":"10.2168\/LMCS-11(4:11)2015"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2018.10.001","volume":"78","author":"P Hlin\u011bn\u00fd","year":"2019","unstructured":"Hlin\u011bn\u00fd, P., Pokr\u00fdvka, F., Roy, B.: FO model checking on geometric graphs. Comput. Geom. 78, 1\u201319 (2019)","journal-title":"Comput. Geom."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Jaffke, L., Kwon, O., Telle, J.A.: Mim-width II. The feedback vertex set problem. Algorithmica 82, 118\u2013145 (2020)","DOI":"10.1007\/s00453-019-00607-3"},{"key":"9_CR19","unstructured":"Jedelsk\u00fd, J.: Classes of bounded and unbounded twin-width. Bachelor\u2019s thesis, Masaryk University (2021)"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2015.02.007","volume":"576","author":"P Klav\u00edk","year":"2015","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Otachi, Y., Saitoh, T.: Extending partial representations of subclasses of chordal graphs. Theor. Comput. Sci. 576, 85\u2013101 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-62495-3_53","volume-title":"Graph Drawing","author":"J Kratochv\u00edl","year":"1997","unstructured":"Kratochv\u00edl, J.: Intersection graphs of noncrossing arc-connected sets in the plane. In: North, S. (ed.) GD 1996. LNCS, vol. 1190, pp. 257\u2013270. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62495-3_53"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2006.01.009","volume":"35","author":"C Mannino","year":"2007","unstructured":"Mannino, C., Oriolo, G., Ricci, F., Chandran, S.: The stable set problem and the thinness of a graph. Oper. Res. Lett. 35, 1\u20139 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"9_CR23","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00453-011-9588-0","volume":"65","author":"D Marx","year":"2013","unstructured":"Marx, D., Schlotter, I.: Cleaning interval graphs. Algorithmica 65(2), 275\u2013316 (2013)","journal-title":"Algorithmica"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(91)90245-D","volume":"37","author":"S Olariu","year":"1991","unstructured":"Olariu, S.: An optimal greedy heuristic to color interval graphs. Inf. Process. Lett. 37, 21\u201325 (1991)","journal-title":"Inf. Process. Lett."},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0020-0190(88)90091-9","volume":"27","author":"G Ramalingam","year":"1988","unstructured":"Ramalingam, G., Pandu Rangan, C.: A unified approach to domination problems on interval graphs. Inf. Process. Lett. 27, 271\u2013274 (1988)","journal-title":"Inf. Process. Lett."},{"key":"9_CR26","unstructured":"Roberts, F.S.: Indifference graphs. In: Harary, F. (ed.) Proof Techniques in Graph Theory, pp. 139\u2013146. Academic Press (1969)"},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0209001","volume":"9","author":"A Tucker","year":"1980","unstructured":"Tucker, A.: An efficient test for circular-arc graphs. SIAM J. Comput. 9, 1\u201324 (1980)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11835-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:39:11Z","timestamp":1767314351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_9","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":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Otzenhausen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","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":"wg2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.uni-trier.de\/wg2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}