{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:07:04Z","timestamp":1743084424481,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319575858"},{"type":"electronic","value":"9783319575865"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-57586-5_9","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T15:23:34Z","timestamp":1492097014000},"page":"92-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved Lower Bounds for Graph Embedding Problems"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]},{"given":"Tom C.","family":"van der Zanden","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38756-2_1","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"D Marx","year":"2013","unstructured":"Marx, D.: The square root phenomenon in planar graphs. In: Fellows, M., Tan, X., Zhu, B. (eds.) AAIM\/FAW -2013. LNCS, vol. 7924, p. 1. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-38756-2_1"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-642-30891-8_20","volume-title":"The Multivariate Algorithmic Revolution and Beyond","author":"D Marx","year":"2012","unstructured":"Marx, D.: What\u2019s next? Future directions in parameterized complexity. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds.) The Multivariate Algorithmic Revolution and Beyond. LNCS, vol. 7370, pp. 469\u2013496. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-30891-8_20"},{"key":"9_CR3","unstructured":"Bodlaender, H.L., Nederlof, J., van der Zanden, T.C.: Subexponential time algorithms for embedding $$H$$-minor free graphs. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), vol. 55, Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, pp. 9: 1\u20139: 14 (2016)"},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00224-015-9616-6","volume":"58","author":"HL Bodlaender","year":"2016","unstructured":"Bodlaender, H.L., van Rooij, J.M.M.: Exact algorithms for Intervalizing Coloured Graphs. Theor. Comput. Syst. 58(2), 273\u2013286 (2016)","journal-title":"Theor. Comput. Syst."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-662-48350-3_16","volume-title":"Algorithms \u2013 ESA 2015","author":"HL Bodlaender","year":"2015","unstructured":"Bodlaender, H.L., Nederlof, J.: Subexponential time algorithms for finding small tree and path decompositions. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 179\u2013190. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-48350-3_16"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., van der Zanden, T.C.: Improved lower bounds for graph embedding problems. arXiv preprint (2016). arXiv:1610.09130","DOI":"10.1007\/978-3-319-57586-5_9"},{"issue":"4","key":"9_CR7","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)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0012-365X(00)00257-0","volume":"235","author":"C \u00c0lvarez","year":"2001","unstructured":"\u00c0lvarez, C., Di\u00e1z, J., Serna, M.: The hardness of intervalizing four colored caterpillars. Discret. Math. 235(1), 19\u201327 (2001)","journal-title":"Discret. Math."},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-642-40104-6_38","volume-title":"Algorithms and Data Structures","author":"K Jansen","year":"2013","unstructured":"Jansen, K., Land, F., Land, K.: Bounding the running time of algorithms for scheduling and packing problems. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 439\u2013450. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40104-6_38"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., de Fluiter, B.: Intervalizing $$k$$-colored graphs. Technical report UU-CS-1995-15, Department of Information and Computing Sciences, Utrecht University (1995)","DOI":"10.1007\/3-540-60084-1_65"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(96)00057-1","volume":"71","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., de Fluiter, B.: On intervalizing $$k$$-colored graphs for DNA physical mapping. Discret. Appl. Math. 71(1), 55\u201377 (1996)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/PL00009277","volume":"24","author":"H Kaplan","year":"1999","unstructured":"Kaplan, H., Shamir, R.: Bounded degree interval sandwich problems. Algorithmica 24(2), 96\u2013104 (1999)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57586-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:47:57Z","timestamp":1710341277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57586-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319575858","9783319575865"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57586-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/ciac2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}