{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:56:13Z","timestamp":1767315373067,"version":"3.48.0"},"publisher-location":"Cham","reference-count":23,"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_29","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:53:52Z","timestamp":1767315232000},"page":"405-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Interval k-graphs : Recognition and\u00a0Forbidden Obstructions"],"prefix":"10.1007","author":[{"given":"Haiko","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arash","family":"Rafiey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1073\/pnas.45.11.1607","volume":"45","author":"S Benzer","year":"1959","unstructured":"Benzer, S.: On the topology of the genetic fine structure. Proc. Natl. Acad. Sci. U.S.A. 45, 1607\u20131620 (1959)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s11083-017-9445-0","volume":"35","author":"DE Brown","year":"2018","unstructured":"Brown, D.E., Flesch, B.M., Langley, L.J.: Interval $$k$$-graphs and orders. Order 35, 495\u2013514 (2018)","journal-title":"Order"},{"issue":"3","key":"29_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey SIAM Monographs Discrete Math and Applications, Philadelphia (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"29_CR5","first-page":"79","volume":"157","author":"DE Brown","year":"2002","unstructured":"Brown, D.E., Lundgren, J.R., Flink, S.C.: Characterizations of interval bigraphs and unit interval bigraphs. Congressus Num. 157, 79\u201393 (2002)","journal-title":"Congressus Num."},{"key":"29_CR6","unstructured":"Corneil, D.G., Oleariu, S., Stewart, L.: The ultimate interval graph recognition algorithm. SODA, pp. 175\u2013180 (1998)"},{"issue":"4","key":"29_CR7","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1137\/S0895480100373455","volume":"23","author":"DG Corneil","year":"2009","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: The LBFS structure and recognition of interval graphs. SIAM J. Discrete Math. 23(4), 1905\u20131953 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Damaschke, P.: Forbidden ordered subgraphs. Topics in Combinatorics and Graph Theory, pp. 219\u2013229 (1990)","DOI":"10.1007\/978-3-642-46908-4_25"},{"issue":"3","key":"29_CR9","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 Struct. Algorithms 7(3), 223\u2013268 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.dam.2019.08.006","volume":"271","author":"ME Dyer","year":"2019","unstructured":"Dyer, M.E., M\u00fcller, H.: Quasimonotone graphs. Discret. Appl. Math. 271, 25\u201348 (2019)","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"29_CR11","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1016\/j.dam.2011.04.016","volume":"160","author":"T Feder","year":"2012","unstructured":"Feder, T., Hell, P., Huang, J., Rafiey, A.: Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. Discrete Appl. Math. 160(6), 697\u2013707 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"29_CR12","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.ejc.2007.11.012","volume":"29","author":"G Gutin","year":"2008","unstructured":"Gutin, G., Hell, P., Rafiey, A., Yeo, A.: A dichotomy for minimum cost graph homomorphisms. Eur. J. Comb. 29(4), 900\u2013911 (2008)","journal-title":"Eur. J. Comb."},{"key":"29_CR13","first-page":"739","volume":"23","author":"F Harary","year":"1982","unstructured":"Harary, F., Kabell, J.A., McMorris, F.R.: Bipartite intersection graphs. Comment. Math. Universitatis Carolinae 23, 739\u2013745 (1982)","journal-title":"Comment. Math. Universitatis Carolinae"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/jgt.20006","volume":"46","author":"P Hell","year":"2003","unstructured":"Hell, P., Huang, J.: Interval bigraphs and circular arc graphs. J. Graph Theory 46, 313\u2013327 (2003)","journal-title":"J. Graph Theory"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Hell, P., Matrolilli, M., Nevisi, M., Rafiey, A.: Approximation of minimum cost homomorphisms. In: ESA, pp. 587\u2013598 (2012)","DOI":"10.1007\/978-3-642-33090-2_51"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Hell, P., Mohar, B., Rafiey, A.: Ordering without forbidden patterns. In: ESA, pp. 554\u2013565 (2014)","DOI":"10.1007\/978-3-662-44777-2_46"},{"issue":"1","key":"29_CR17","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0218005","volume":"18","author":"N Korte","year":"1989","unstructured":"Korte, N., M\u00f6hring, R.H.: An incremental linear-time algorithm for recognizing interval graphs. SIAM J. Comput. 18(1), 68\u201381 (1989)","journal-title":"SIAM J. Comput."},{"key":"29_CR18","first-page":"386","volume":"42","author":"RM McConnell","year":"2001","unstructured":"McConnell, R.M.: Linear time recognition of circular-arc graphs. FOCS 42, 386\u2013394 (2001)","journal-title":"FOCS"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0166-218X(97)00027-9","volume":"78","author":"H M\u00fcller","year":"1997","unstructured":"M\u00fcller, H.: Recognizing interval digraphs and interval bigraphs in polynomial time. Discrete Appl. Math. 78, 189\u2013205 (1997)","journal-title":"Discrete Appl. Math."},{"key":"29_CR20","doi-asserted-by":"publisher","unstructured":"M\u00fcller, H., Rafiey, A.: Interval H-graphs: recognition and forbidden obstructions (2025), arXiv:2503.00672, https:\/\/doi.org\/10.48550\/arXiv.2503.00672","DOI":"10.48550\/arXiv.2503.00672"},{"issue":"3","key":"29_CR21","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1002\/jgt.22792","volume":"100","author":"A Rafiey","year":"2022","unstructured":"Rafiey, A.: Recognizing interval bigraphs by forbidden patterns. J. Graph Theory 100(3), 504\u2013529 (2022)","journal-title":"J. Graph Theory"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Sen, M., Das, S., Roy, B., West, D.B.: Interval digraphs: an analogue of interval graphs. J. Graph Theory 13, 189\u2013202 (1989)","DOI":"10.1002\/jgt.3190130206"},{"key":"29_CR23","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","volume":"18","author":"JP Spinrad","year":"1987","unstructured":"Spinrad, J.P., Brandst\u00e4dt, A., Stewart, L.: Bipartite permutation graphs. Discrete Appl. Math. 18, 279\u2013292 (1987)","journal-title":"Discrete Appl. Math."}],"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_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:53:54Z","timestamp":1767315234000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_29","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"}}]}}