{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:31:02Z","timestamp":1774333862462,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","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-981-95-7127-7_11","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:08Z","timestamp":1770977228000},"page":"157-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Order-Preserving Subgraphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-0901-6542","authenticated-orcid":false,"given":"Haruya","family":"Imamura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3244-6915","authenticated-orcid":false,"given":"Yasuaki","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0087-853X","authenticated-orcid":false,"given":"Yota","family":"Otachi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4676-5167","authenticated-orcid":false,"given":"Toshiki","family":"Saitoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keita","family":"Sato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0194-7138","authenticated-orcid":false,"given":"Asahi","family":"Takaoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5175-465X","authenticated-orcid":false,"given":"Ryo","family":"Yoshinaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3080-3210","authenticated-orcid":false,"given":"Tom C.","family":"van der Zanden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Belmonte, R., Heggernes, P., van\u00a0\u2019t Hof, P.: Edge contractions in subclasses of chordal graphs. Discret. Appl. Math. 160(7-8), 999\u20131010 (2012)","DOI":"10.1016\/j.dam.2011.12.012"},{"issue":"5","key":"11_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(97)00209-3","volume":"65","author":"P Bose","year":"1998","unstructured":"Bose, P., Buss, J.F., Lubiw, A.: Pattern matching for permutations. Inf. Process. Lett. 65(5), 277\u2013283 (1998)","journal-title":"Inf. Process. Lett."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. Society for Industrial and Applied Mathematics (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Damaschke, P.: Forbidden ordered subgraphs. In: Topics in Combinatorics and Graph Theory, pp. 219\u2013229. Physica-Verlag HD (1990)","DOI":"10.1007\/978-3-642-46908-4_25"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Damaschke, P.: Induced subgraph isomorphism for cographs in NP-complete. In: WG 1990. LNCS, vol.\u00a0484, pp. 72\u201378. Springer (1990)","DOI":"10.1007\/3-540-53832-1_32"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1598","DOI":"10.1021\/cr3002356","volume":"113","author":"L Di Paola","year":"2013","unstructured":"Di Paola, L., De Ruvo, M., Paci, P., Santoni, D., Giuliani, A.: Protein contact networks: an emerging paradigm in chemistry. Chem. Rev. 113(3), 1598\u20131613 (2013)","journal-title":"Chem. Rev."},{"key":"11_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Elsevier Science (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Guillemot, S., Marx, D.: Finding small patterns in permutations in linear time. In: SODA 2014, pp. 82\u2013101. SIAM (2014)","DOI":"10.1137\/1.9781611973402.7"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Heggernes, P., van\u00a0\u2019t Hof, P., Meister, D., Villanger, Y.: Induced subgraph isomorphism on proper interval and bipartite permutation graphs. Theor. Comput. Sci. 562, 252\u2013269 (2015)","DOI":"10.1016\/j.tcs.2014.10.002"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-642-17514-5_34","volume-title":"Algorithms and Computation","author":"P Heggernes","year":"2010","unstructured":"Heggernes, P., Meister, D., Villanger, Y.: Induced subgraph isomorphism on interval and proper interval graphs. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6507, pp. 399\u2013409. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17514-5_34"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1137\/S0895480103430259","volume":"18","author":"P Hell","year":"2004","unstructured":"Hell, P., Huang, J.: Certifying LexBFS recognition algorithms for proper interval graphs and proper interval bigraphs. SIAM J. Discret. Math. 18(3), 554\u2013570 (2004)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1137\/19M1241763","volume":"34","author":"P Hell","year":"2020","unstructured":"Hell, P., Huang, J., McConnell, R.M., Rafiey, A.: Min-orderable digraphs. SIAM J. Discret. Math. 34(3), 1710\u20131724 (2020)","journal-title":"SIAM J. Discret. Math."},{"issue":"21","key":"11_CR15","doi-asserted-by":"publisher","first-page":"3164","DOI":"10.1016\/j.disc.2012.07.010","volume":"312","author":"S Kijima","year":"2012","unstructured":"Kijima, S., Otachi, Y., Saitoh, T., Uno, T.: Subgraph isomorphism in graph classes. Discret. Math. 312(21), 3164\u20133173 (2012)","journal-title":"Discret. Math."},{"issue":"6","key":"11_CR16","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","volume":"42","author":"NG Kinnersley","year":"1992","unstructured":"Kinnersley, N.G.: The vertex separation number of a graph equals its path-width. Inf. Process. Lett. 42(6), 345\u2013350 (1992)","journal-title":"Inf. Process. Lett."},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.dam.2015.01.040","volume":"199","author":"M Konagaya","year":"2016","unstructured":"Konagaya, M., Otachi, Y., Uehara, R.: Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs. Discret. Appl. Math. 199, 37\u201345 (2016)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"11_CR18","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"},{"issue":"15","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1016\/j.dam.2010.06.002","volume":"158","author":"AMS Shrestha","year":"2010","unstructured":"Shrestha, A.M.S., Tayu, S., Ueno, S.: On orthogonal ray graphs. Discrete Appl. Math. 158(15), 1650\u20131659 (2010)","journal-title":"Discrete Appl. Math."},{"key":"11_CR20","first-page":"261","volume":"34","author":"DR Wood","year":"2006","unstructured":"Wood, D.R.: Characterisations of intersection graphs by vertex orderings. Australas. J Comb. 34, 261\u2013268 (2006)","journal-title":"Australas. J Comb."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:09:50Z","timestamp":1774325390000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_11","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":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}