{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T09:09:11Z","timestamp":1759741751565,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031159138"},{"type":"electronic","value":"9783031159145"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15914-5_23","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"313-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing List Homomorphisms in\u00a0Geometric Intersection Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6856-2902","authenticated-orcid":false,"given":"S\u00e1ndor","family":"Kisfaludi-Bak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1414-3507","authenticated-orcid":false,"given":"Karolina","family":"Okrasa","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":[[2022,10,1]]},"reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jalgor.2003.10.001","volume":"52","author":"J Alber","year":"2004","unstructured":"Alber, J., Fiala, J.: Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. Algorithms 52(2), 134\u2013151 (2004). https:\/\/doi.org\/10.1016\/j.jalgor.2003.10.001","journal-title":"J. Algorithms"},{"issue":"6","key":"23_CR2","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1137\/20M1320870","volume":"49","author":"M de Berg","year":"2020","unstructured":"de Berg, M., Bodlaender, H.L., Kisfaludi-Bak, S., Marx, D., van der Zanden, T.C.: A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. SIAM J. Comput. 49(6), 1291\u20131331 (2020). https:\/\/doi.org\/10.1137\/20M1320870","journal-title":"SIAM J. Comput."},{"key":"23_CR3","doi-asserted-by":"publisher","unstructured":"de Berg, M., Kisfaludi-Bak, S., Monemizadeh, M., Theocharous, L.: Clique-based separators for geometric intersection graphs. In: 32nd International Symposium on Algorithms and Computation, ISAAC 2021. LIPIcs, vol. 212, pp. 22:1\u201322:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2021.22","DOI":"10.4230\/LIPIcs.ISAAC.2021.22"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Bir\u00f3, C., Bonnet, \u00c9., Marx, D., Miltzow, T., Rz\u0105\u017cewski, P.: Fine-grained complexity of coloring unit disks and balls. J. Comput. Geom. 9(2), 47\u201380 (2018). https:\/\/doi.org\/10.20382\/jocg.v9i2a4","DOI":"10.1007\/s00453-017-0387-0"},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/3433160","volume":"68","author":"M Bonamy","year":"2021","unstructured":"Bonamy, M., et al.: EPTAS and subexponential algorithm for maximum clique on disk and unit ball graphs. J. ACM 68(2), 9:1-9:38 (2021). https:\/\/doi.org\/10.1145\/3433160","journal-title":"J. ACM"},{"issue":"7","key":"23_CR6","doi-asserted-by":"publisher","first-page":"3047","DOI":"10.1007\/s00453-019-00568-7","volume":"81","author":"\u00c9 Bonnet","year":"2019","unstructured":"Bonnet, \u00c9., Rz\u0105\u017cewski, P.: Optimality program in segment and string graphs. Algorithmica 81(7), 3047\u20133073 (2019). https:\/\/doi.org\/10.1007\/s00453-019-00568-7","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"23_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discret. Math. 86(1\u20133), 165\u2013177 (1990). https:\/\/doi.org\/10.1016\/0012-365X(90)90358-O","journal-title":"Discret. Math."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(86)90184-2","volume":"43","author":"K Edwards","year":"1986","unstructured":"Edwards, K.: The complexity of colouring problems on dense graphs. Theor. Comput. Sci. 43, 337\u2013343 (1986). https:\/\/doi.org\/10.1016\/0304-3975(86)90184-2","journal-title":"Theor. Comput. Sci."},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-24592-6_23","volume-title":"Approximation and Online Algorithms","author":"AV Fishkin","year":"2004","unstructured":"Fishkin, A.V.: Disk graphs: a short survey. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol. 2909, pp. 260\u2013264. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24592-6_23"},{"issue":"4","key":"23_CR10","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s00454-018-00054-x","volume":"62","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S., Zehavi, M.: Finding, hitting and packing cycles in subexponential time on unit disk graphs. Discrete Computat. Geom. 62(4), 879\u2013911 (2019). https:\/\/doi.org\/10.1007\/s00454-018-00054-x","journal-title":"Discrete Computat. Geom."},{"key":"23_CR11","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S., Zehavi, M.: ETH-tight algorithms for long path and cycle on unit disk graphs. In: Cabello, S., Chen, D.Z. (eds.) 36th International Symposium on Computational Geometry, SoCG 2020, 23\u201326 June 2020, Z\u00fcrich, Switzerland. LIPIcs, vol. 164, pp. 44:1\u201344:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2020.44","DOI":"10.4230\/LIPIcs.SoCG.2020.44"},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S.: Bidimensionality and geometric graphs. In: Rabani, Y. (ed.) Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17\u201319 January 2012, pp. 1563\u20131575. SIAM (2012). https:\/\/doi.org\/10.1137\/1.9781611973099","DOI":"10.1137\/1.9781611973099"},{"key":"23_CR13","doi-asserted-by":"publisher","unstructured":"Golumbic, M.C.: Chapter 8 - interval graphs. In: Golumbic, M.C. (ed.) Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Mathematics, vol. 57, pp. 171\u2013202. Elsevier (2004). https:\/\/doi.org\/10.1016\/S0167-5060(04)80056-6","DOI":"10.1016\/S0167-5060(04)80056-6"},{"key":"23_CR14","doi-asserted-by":"publisher","unstructured":"Huson, M., Sen, A.: Broadcast scheduling algorithms for radio networks. In: Proceedings of MILCOM 1995, vol. 2, pp. 647\u2013651 (1995). https:\/\/doi.org\/10.1109\/MILCOM.1995.483546","DOI":"10.1109\/MILCOM.1995.483546"},{"issue":"2","key":"23_CR15","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of $$k$$-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001). https:\/\/doi.org\/10.1006\/jcss.2000.1727","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"23_CR16","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001). https:\/\/doi.org\/10.1006\/jcss.2001.1774","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR17","doi-asserted-by":"publisher","unstructured":"Jungck, J.R., Viswanathan, R.: Chapter 1 - graph theory for systems biology: interval graphs, motifs, and pattern recognition. In: Robeva, R.S. (ed.) Algebraic and Discrete Mathematical Methods for Modern Biology, pp. 1\u201327. Academic Press, Boston (2015). https:\/\/doi.org\/10.1016\/B978-0-12-801213-0.00001-0","DOI":"10.1016\/B978-0-12-801213-0.00001-0"},{"key":"23_CR18","unstructured":"Kaufmann, M., Kratochv\u00edl, J., Lehmann, K.A., Subramanian, A.R.: Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, 22\u201326 January 2006, pp. 832\u2013841. ACM Press (2006). http:\/\/dl.acm.org\/citation.cfm?id=1109557.1109649"},{"key":"23_CR19","unstructured":"Kisfaludi-Bak, S., Okrasa, K., Rz\u0105\u017cewski, P.: Computing list homomorphisms in geometric intersection graphs. CoRR abs\/2202.08896 (2022). https:\/\/arxiv.org\/abs\/2202.08896"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-319-57586-5_31","volume-title":"Algorithms and Complexity","author":"S Kisfaludi-Bak","year":"2017","unstructured":"Kisfaludi-Bak, S., van der Zanden, T.C.: On the exact complexity of Hamiltonian cycle and q-colouring in disk graphs. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 369\u2013380. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_31"},{"issue":"2","key":"23_CR21","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Comb. Theory Ser. B 62(2), 289\u2013315 (1994). https:\/\/doi.org\/10.1006\/jctb.1994.1071","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"23_CR22","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0095-8956(91)90090-7","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. I. The number of critical nonstring graphs is infinite. J. Comb. Theory Ser. B 52(1), 53\u201366 (1991). https:\/\/doi.org\/10.1016\/0095-8956(91)90090-7","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"23_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(91)90091-W","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. II. Recognizing string graphs is NP-hard. J. Comb. Theory Ser. B 52(1), 67\u201378 (1991). https:\/\/doi.org\/10.1016\/0095-8956(91)90091-W","journal-title":"J. Comb. Theory Ser. B"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Lekkeikerker, C., Boland, J.: Representation of a finite graph by a set of intervals on the real line. Fundam. Math. 51(1), 45\u201364 (1962). http:\/\/eudml.org\/doc\/213681","DOI":"10.4064\/fm-51-1-45-64"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/11561071_41","volume-title":"Algorithms \u2013 ESA 2005","author":"D Marx","year":"2005","unstructured":"Marx, D.: Efficient approximation schemes for geometric problems? In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 448\u2013459. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561071_41"},{"key":"23_CR26","doi-asserted-by":"publisher","unstructured":"Marx, D.: On the optimality of planar and geometric approximation schemes. In: FOCS 2007 Proceedings, pp. 338\u2013348 (2007). https:\/\/doi.org\/10.1109\/FOCS.2007.50","DOI":"10.1109\/FOCS.2007.50"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/978-3-662-48350-3_72","volume-title":"Algorithms - ESA 2015","author":"D Marx","year":"2015","unstructured":"Marx, D., Pilipczuk, M.: Optimal parameterized algorithms for planar facility location problems using voronoi diagrams. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 865\u2013877. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_72"},{"issue":"1","key":"23_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/256292.256294","volume":"44","author":"GL Miller","year":"1997","unstructured":"Miller, G.L., Teng, S., Thurston, W.P., Vavasis, S.A.: Separators for sphere-packings and nearest neighbor graphs. J. ACM 44(1), 1\u201329 (1997). https:\/\/doi.org\/10.1145\/256292.256294","journal-title":"J. ACM"},{"key":"23_CR29","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jcss.2019.12.004","volume":"109","author":"K Okrasa","year":"2020","unstructured":"Okrasa, K., Rz\u0105\u017cewski, P.: Subexponential algorithms for variants of the homomorphism problem in string graphs. J. Comput. Syst. Sci. 109, 126\u2013144 (2020). https:\/\/doi.org\/10.1016\/j.jcss.2019.12.004","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Smith, W.D., Wormald, N.C.: Geometric separator theorems and applications. In: FOCS 1998 Proceedings, pp. 232\u2013243. IEEE Computer Society, Washington, DC, USA (1998)","DOI":"10.1109\/SFCS.1998.743449"}],"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-031-15914-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T00:53:20Z","timestamp":1728089600000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 October 2022","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":"T\u00fcbingen","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"96","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}