{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:31:03Z","timestamp":1775097063161,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111753","type":"print"},{"value":"9783032111760","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T00:00:00Z","timestamp":1763856000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T00:00:00Z","timestamp":1763856000000},"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-11176-0_27","type":"book-chapter","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T20:11:35Z","timestamp":1763842295000},"page":"459-467","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Computational Aspects of\u00a0Ordered Matching Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-6880-4896","authenticated-orcid":false,"given":"Michal","family":"\u010cert\u00edk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6229-5332","authenticated-orcid":false,"given":"Andreas Emil","family":"Feldmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5133-5586","authenticated-orcid":false,"given":"Jaroslav","family":"Ne\u0161et\u0159il","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7696-3848","authenticated-orcid":false,"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,23]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Axenovich, M., Rollin, J., Ueckerdt, T.: Chromatic number of ordered graphs with forbidden ordered subgraphs. Combinatorica 38, 1021\u20131043 (2016). https:\/\/api.semanticscholar.org\/CorpusID:7776173","DOI":"10.1007\/s00493-017-3593-0"},{"key":"27_CR2","doi-asserted-by":"publisher","unstructured":"Balko, M., Cibulka, J., Kr\u00e1l, K., Kyn\u010dl, J.: Ramsey numbers of ordered graphs. Electron. J. Comb. 27(1) (2020). https:\/\/doi.org\/10.37236\/7816","DOI":"10.37236\/7816"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Balko, M., Poljak, M.: On off-diagonal ordered Ramsey numbers of nested matchings (2022)","DOI":"10.1007\/978-3-030-83823-2_38"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Bonnet, \u00c9., Giocanti, U., de\u00a0Mendez, P.O., Simon, P., Thomass\u00e9, S., Toru\u0144czyk, S.: Twin-width IV: ordered graphs and matrices (2021)","DOI":"10.1145\/3519935.3520037"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Bonnet, \u00c9., Ne\u0161et\u0159il, J., de\u00a0Mendez, P.O., Siebertz, S., Thomass\u00e9, S.: Twin-width and permutations (2024)","DOI":"10.46298\/lmcs-20(3:4)2024"},{"key":"27_CR6","doi-asserted-by":"publisher","unstructured":"Bose, P., Buss, J.F., Lubiw, A.: Pattern matching for permutations. In: Dehne, F., Sack, J.-R., Santoro, N., Whitesides, S. (eds.) WADS 1993. LNCS, vol. 709, pp. 200\u2013209. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57155-8_248","DOI":"10.1007\/3-540-57155-8_248"},{"key":"27_CR7","unstructured":"\u010cert\u00edk, M., Ne\u0161et\u0159il, J.: Duality, $$\\chi ^<$$-Boundedness and Order Density of Ordered Graphs (2024)"},{"key":"27_CR8","unstructured":"\u010cert\u00edk, M., Ne\u0161et\u0159il, J.: Duality and $$\\chi ^<$$-Boundedness of Ordered Relational Systems (2025)"},{"key":"27_CR9","unstructured":"\u010cert\u00edk, M., Feldmann, A.E., Ne\u0161et\u0159il, J., Rz\u0105\u017cewski, P.: Complexity Aspects of Homomorphisms of Ordered Graphs (2025)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"\u010cert\u00edk, M., Feldmann, A.E., Ne\u0161et\u0159il, J., Rz\u0105\u017cewski, P.: On Computational Aspects of Cores of Ordered Graphs and Hypergraphs (2025)","DOI":"10.1007\/978-3-032-11176-0_27"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"\u010cert\u00edk, M., Feldmann, A.E., Ne\u0161et\u0159il, J., Rz\u0105\u017cewski, P.: On Computational Aspects of Ordered Matchings (2025)","DOI":"10.1007\/978-3-032-11176-0_27"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Conlon, D., Fox, J., Lee, C., Sudakov, B.: Ordered Ramsey numbers (2016)","DOI":"10.1016\/j.jctb.2016.06.007"},{"issue":"3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/rsa.3240070304","volume":"7","author":"D Duffus","year":"1995","unstructured":"Duffus, D., Ginn, M., R\u00f6dl, V.: On the computational complexity of ordered subgraph recognition. Random Structures & Algorithms 7(3), 223\u2013268 (1995). https:\/\/doi.org\/10.1002\/rsa.3240070304","journal-title":"Random Structures & Algorithms"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Hedrl\u00edn, Z., Pultr, A., Trnkov\u00e1, V.: Concerning a categorial approach to topological and algebraic theories. In: General Topology and its Relations to Modern Analysis and Algebra, pp. 176\u2013181. Academia Publishing House of the Czechoslovak Academy of Sciences (1967). http:\/\/eudml.org\/doc\/220068","DOI":"10.1016\/B978-1-4831-9850-7.50047-3"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: Graphs and Homomorphisms. Oxford University Press (2004). https:\/\/global.oup.com\/academic\/product\/graphs-and-homomorphisms-9780198528173?cc=cz","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001"},{"key":"27_CR16","doi-asserted-by":"publisher","unstructured":"Kun, G., Ne\u0161et\u0159il, J.: Dichotomy for orderings? arXiv (2025). https:\/\/doi.org\/10.48550\/arxiv.2504.13268","DOI":"10.48550\/arxiv.2504.13268"},{"key":"27_CR17","unstructured":"Ne\u0161et\u0159il, J.: Ramsey theory, pp. 1331\u20131403. MIT Press, Cambridge (1996)"},{"key":"27_CR18","unstructured":"Ne\u0161et\u0159il, J., de\u00a0Mendez, P.O.: Towards a characterization of universal categories (2016)"},{"key":"27_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02773960","author":"J Pach","year":"2006","unstructured":"Pach, J., Tardos, G.: Forbidden paths and cycles in ordered graphs and matrices. Israel J. Math. (2006). https:\/\/doi.org\/10.1007\/BF02773960","journal-title":"Israel J. Math."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11176-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T11:09:22Z","timestamp":1770721762000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11176-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,23]]},"ISBN":["9783032111753","9783032111760"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11176-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,23]]},"assertion":[{"value":"23 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakesh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","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":"24 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2025.digital-hub.sh\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}