{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:33:42Z","timestamp":1767339222294,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00453-021-00846-3","type":"journal-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T08:03:02Z","timestamp":1627027382000},"page":"3281-3318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On H-Topological Intersection Graphs"],"prefix":"10.1007","volume":"83","author":[{"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[]},{"given":"Martin","family":"T\u00f6pfer","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Voborn\u00edk","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0071-9149","authenticated-orcid":false,"given":"Peter","family":"Zeman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"846_CR1","unstructured":"Agaoglu, D., Hlinen\u00fd, P.: Isomorphism problem for s\\_d-graphs. In: Esparza, J., Daniel, K (eds) 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24\u201328, 2020, Prague, Czech Republic, volume 170 of LIPIcs, pp. 4:1\u20134:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"2","key":"846_CR2","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/130947374","volume":"45","author":"HL Bodlaender","year":"2016","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A c$${}^{{\\rm k}}$$ n 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317\u2013378 (2016)","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"846_CR3","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. Discrete. Math. 100(1\u20133), 267\u2013279 (1992)","journal-title":"Discrete. Math."},{"issue":"1","key":"846_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/0211015","volume":"11","author":"KS Booth","year":"1982","unstructured":"Booth, K.S., Johnson, J.H.: Dominating sets in chordal graphs. SIAM J. Comput. 11(1), 191\u2013199 (1982)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"846_CR5","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."},{"issue":"45","key":"846_CR6","doi-asserted-by":"publisher","first-page":"6261","DOI":"10.1016\/j.tcs.2011.07.012","volume":"412","author":"F Bonomo","year":"2011","unstructured":"Bonomo, F., Mattia, S., Oriolo, G.: Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem. Theor. Comput. Sci. 412(45), 6261\u20136268 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"846_CR7","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/12.46293","volume":"39","author":"ML Brady","year":"1990","unstructured":"Brady, M.L., Sarrafzadeh, M.: Stretching a knock-knee layout for multilayer wiring. IEEE Trans. Comput. 39(1), 148\u2013151 (1990)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"846_CR8","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1137\/S0097539799359683","volume":"31","author":"V Bouchitt\u00e9","year":"2001","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. Comput. 31(1), 212\u2013232 (2001)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"846_CR9","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/050629276","volume":"21","author":"M Chleb\u00edk","year":"2007","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: The complexity of combinatorial optimization problems on d-dimensional boxes. SIAM J. Discrete Math. 21(1), 158\u2013169 (2007)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"846_CR10","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1002\/jgt.22146","volume":"87","author":"K Cameron","year":"2018","unstructured":"Cameron, K., Chaplick, S., Ho\u00e0ng, C.T.: On the structure of (pan, even hole)-free graphs. J. Graph Theory 87(1), 108\u2013129 (2018)","journal-title":"J. Graph Theory"},{"key":"846_CR11","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach, volume 138 of Encyclopedia of Mathematics and Its Applications. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511977619"},{"key":"846_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., D\u00e1niel, M., Michal, P., Saket, S.: Parameterized Algorithms. Springer, Marcin, Pilipczuk (2015)"},{"issue":"6","key":"846_CR13","doi-asserted-by":"publisher","first-page":"1671","DOI":"10.1137\/S0097539792238431","volume":"27","author":"M-S Chang","year":"1998","unstructured":"Chang, M.-S.: Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM J. Comput. 27(6), 1671\u20131694 (1998)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"846_CR14","first-page":"157","volume":"15","author":"AR Curtis","year":"2013","unstructured":"Curtis, A.R., Lin, M.C., McConnell, R.M., Nussbaum, Y., Soulignac, F.J., Spinrad, J.P., Szwarcfiter, J.L.: Isomorphism of graph classes related to the circular-ones property. Discrete Math. Theor. Comput. Sci. 15(1), 157\u2013182 (2013). arXiv:1203.4822","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"846_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.dam.2012.12.006","volume":"168","author":"S Chaplick","year":"2014","unstructured":"Chaplick, S., Stacho, J.: The vertex leafage of chordal graphs. Discret. Appl. Math. 168, 14\u201325 (2014)","journal-title":"Discret. Appl. Math."},{"key":"846_CR16","doi-asserted-by":"crossref","unstructured":"Chaplick, S., Toepfer, M., Voborn\u00edk, J., Zeman, P.: On H-topological intersection graphs. In: Hans, L.B. Gerhard, J.W. (eds.) Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21\u201323, 2017, Revised Selected Papers, Volume 10520 of Lecture Notes in Computer Science, pp. 167\u2013179. Springer (2017)","DOI":"10.1007\/978-3-319-68705-6_13"},{"key":"846_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.endm.2017.06.042","volume":"61","author":"S Chaplick","year":"2017","unstructured":"Chaplick, S., Zeman, P.: Combinatorial problems on H-graphs. Electron. Notes Discret. Math. 61, 223\u2013229 (2017)","journal-title":"Electron. Notes Discret. Math."},{"issue":"3","key":"846_CR18","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1137\/S0895480103433410","volume":"18","author":"ED Demaine","year":"2004","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M.T., Thilikos, D.M.: Bidimensional parameters and local treewidth. SIAM J. Discret. Math. 18(3), 501\u2013511 (2004)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"846_CR19","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1137\/13090465X","volume":"28","author":"J Enright","year":"2014","unstructured":"Enright, J., Stewart, L., Tardos, G.: On list coloring and list homomorphism of permutation and interval graphs. SIAM J. Discrete Math. 28(4), 1675\u20131685 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"846_CR20","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"DR Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pac. J. Math. 15, 835\u2013855 (1965)","journal-title":"Pac. J. Math."},{"issue":"4","key":"846_CR21","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/s00453-013-9828-6","volume":"71","author":"MC Francis","year":"2013","unstructured":"Francis, M.C., Gon\u00e7alves, D., Ochem, P.: The maximum clique problem in multiple interval graphs. Algorithmica 71(4), 812\u2013836 (2013)","journal-title":"Algorithmica"},{"issue":"9","key":"846_CR22","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.-F.: On the tractability of optimization problems on $$H$$-graphs. Algorithmica 82(9), 2432\u20132473 (2020)","journal-title":"Algorithmica"},{"issue":"1","key":"846_CR23","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/140964801","volume":"44","author":"FV Fomin","year":"2015","unstructured":"Fomin, F.V., Todinca, I., Villanger, Y.: Large induced subgraphs via triangulations and CMSO. SIAM J. Comput. 44(1), 54\u201387 (2015)","journal-title":"SIAM J. Comput."},{"key":"846_CR24","first-page":"701","volume":"7","author":"DR Fulkerson","year":"1956","unstructured":"Fulkerson, D.R.: Note on Dilworth\u2019s decomposition theorem for partially ordered sets. Proc. Am. Math. Soc. 7, 701\u2013702 (1956)","journal-title":"Proc. Am. Math. Soc."},{"issue":"4","key":"846_CR25","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/net.3230040407","volume":"4","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: Algorithms on circular-arc graphs. Networks 4(4), 357\u2013369 (1974)","journal-title":"Networks"},{"issue":"1","key":"846_CR26","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Ser. B 16(1), 47\u201356 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"846_CR27","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0166-218X(94)00136-2","volume":"66","author":"F Gavril","year":"1996","unstructured":"Gavril, F.: Intersection graphs of Helly families of subtrees. Discrete Appl. Math. 66(1), 45\u201356 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"846_CR28","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1002\/jgt.22179","volume":"87","author":"S Gaspers","year":"2018","unstructured":"Gaspers, S., Mackenzie, S.: On the number of minimal separators in graphs. J. Graph Theory 87(4), 653\u2013659 (2018)","journal-title":"J. Graph Theory"},{"issue":"3","key":"846_CR29","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02253207","volume":"18","author":"MC Golumbic","year":"1977","unstructured":"Golumbic, M.C.: The complexity of comparability graph recognition and coloring. Computing 18(3), 199\u2013208 (1977)","journal-title":"Computing"},{"key":"846_CR30","volume-title":"Algorithmic Graph Theory and Perfect graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect graphs, vol. 57. Elsevier (2004)"},{"issue":"4","key":"846_CR31","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n$${}^{\\text{5\/2 }}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"846_CR32","doi-asserted-by":"crossref","unstructured":"Huson, M.L., Sen, A.: Broadcast scheduling algorithms for radio networks. In: Proceedings of MILCOM \u201995, volu. 2, pp. 647\u2013651 (1995)","DOI":"10.1109\/MILCOM.1995.483546"},{"issue":"5","key":"846_CR33","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1016\/j.ejc.2011.09.031","volume":"33","author":"M Habib","year":"2012","unstructured":"Habib, M., Stacho, J.: Reduced clique graphs of chordal graphs. Eur. J. Comb. 33(5), 712\u2013735 (2012)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"846_CR34","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/0214018","volume":"14","author":"W-L Hsu","year":"1985","unstructured":"Hsu, W.-L.: Maximum weight clique algorithms for circular-arc graphs and circle graphs. SIAM J. Comput. 14(1), 224\u2013231 (1985)","journal-title":"SIAM J. Comput."},{"key":"846_CR35","doi-asserted-by":"crossref","unstructured":"Jaffke, L., Kwon, O.-J., Telle, J.A.: Mim-width II. the feedback vertex set problem. Algorithmica 82(1), 118\u2013145 (2020)","DOI":"10.1007\/s00453-019-00607-3"},{"key":"846_CR36","doi-asserted-by":"crossref","unstructured":"Joseph, D., Meidanis, J., Tiwari, P.: Determining DNA sequence similarity using maximum independent set algorithms for interval graphs. In: Otto, N., Esko, U. (eds.) Algorithm Theory - SWAT \u201992, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8\u201410, 1992, Proceedings, volume 621 of Lecture Notes in Computer Science, pp. 326\u2013337. Springer (1992)","DOI":"10.1007\/3-540-55706-7_29"},{"issue":"2","key":"846_CR37","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0166-218X(96)00085-6","volume":"75","author":"K Jansen","year":"1997","unstructured":"Jansen, K., Scheffler, P.: Generalized coloring for tree-like graphs. Discret. Appl. Math. 75(2), 135\u2013155 (1997)","journal-title":"Discret. Appl. Math."},{"key":"846_CR38","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."},{"issue":"2","key":"846_CR39","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1006\/jagm.1998.0936","volume":"28","author":"T Kloks","year":"1998","unstructured":"Kloks, T., Kratsch, D., Wong, C.K.: Minimum fill-in on circle and circular-arc graphs. J. Algorithms 28(2), 272\u2013289 (1998)","journal-title":"J. Algorithms"},{"issue":"2","key":"846_CR40","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/322123.322125","volume":"26","author":"GS Lueker","year":"1979","unstructured":"Lueker, G.S., Booth, K.S.: A linear time algorithm for deciding interval graph isomorphism. J. ACM 26(2), 183\u2013195 (1979)","journal-title":"J. ACM"},{"issue":"1","key":"846_CR41","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-Tersenghi, F., Chandran, L.S.: The stable set problem and the thinness of a graph. Oper. Res. Lett. 35(1), 1\u20139 (2007)","journal-title":"Oper. Res. Lett."},{"key":"846_CR42","doi-asserted-by":"crossref","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Torben, H., Jyrki, K. (eds.) Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8\u201310, 2004, Proceedings, Volume 3111 of Lecture Notes in Computer Science, pp. 260\u2013272. Springer (2004)","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"846_CR43","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970401","volume-title":"S: Graph Theory and Its Applications to Problems of Society","author":"F Roberts","year":"1978","unstructured":"Roberts, F.: S: Graph Theory and Its Applications to Problems of Society. SIAM (1978)"},{"key":"846_CR44","doi-asserted-by":"crossref","unstructured":"Robertson, N.S., Paul, D.: Graph minors. III. planar tree-width. J. Comb. Theory Ser. B 36(1), 49\u201364 (1984)","DOI":"10.1016\/0095-8956(84)90013-3"},{"issue":"2","key":"846_CR45","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"846_CR46","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1002\/j.1538-7305.1966.tb01713.x","volume":"45","author":"FW Sinden","year":"1966","unstructured":"Sinden, F.W.: Topology of thin film RC circuits. Bell Syst. Tech. J. 45(9), 1639\u20131662 (1966)","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"846_CR47","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"RE Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Decomposition by clique separators. Discret. Math. 55(2), 221\u2013232 (1985)","journal-title":"Discret. Math."},{"key":"846_CR48","doi-asserted-by":"crossref","unstructured":"Whitesides, S.H.: A method for solving certain graph recognition and optimization problems, with applications to perfect graphs. In: Topics on Perfect Graphs., pp. 281\u2013298, 1984. Annals of Discrete Mathematics 21","DOI":"10.1016\/S0304-0208(08)72941-4"},{"issue":"3","key":"846_CR49","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M Yannakakis","year":"1982","unstructured":"Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods 3(3), 351\u2013358 (1982)","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00846-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00846-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00846-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:11:32Z","timestamp":1725487892000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00846-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,23]]},"references-count":49,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["846"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00846-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2021,7,23]]},"assertion":[{"value":"7 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}