{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:09:15Z","timestamp":1742951355219,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642280498"},{"type":"electronic","value":"9783642280504"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28050-4_7","type":"book-chapter","created":{"date-parts":[[2012,3,8]],"date-time":"2012-03-08T23:40:26Z","timestamp":1331250026000},"page":"80-93","source":"Crossref","is-referenced-by-count":3,"title":["Planar Disjoint-Paths Completion"],"prefix":"10.1007","author":[{"given":"Isolde","family":"Adler","sequence":"first","affiliation":[]},{"given":"Stavros G.","family":"Kolliopoulos","sequence":"additional","affiliation":[]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-22006-7_10","volume-title":"Automata, Languages and Programming","author":"I. Adler","year":"2011","unstructured":"Adler, I., Kolliopoulos, S.G., Krause, P.K., Lokshtanov, D., Saurabh, S., Thilikos, D.: Tight Bounds for Linkages in Planar Graphs. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol.\u00a06755, pp. 110\u2013121. Springer, Heidelberg (2011)"},{"key":"7_CR2","series-title":"Graduate Texts in Mathematics","volume-title":"Graph theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph theory, 3rd edn. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Berlin (2005)","edition":"3"},{"key":"7_CR3","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1006\/aama.1994.1009","volume":"15","author":"M.C. Golumbic","year":"1994","unstructured":"Golumbic, M.C., Kaplan, H., Shamir, R.: On the complexity of DNA physical mapping. Adv. in Appl. Math.\u00a015, 251\u2013261 (1994)","journal-title":"Adv. in Appl. Math."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Grohe, M., Kawarabayashi, K., Marx, D., Wollan, P.: Finding topological subgraphs is fixed-parameter tractable. In: 43rd ACM Symposium on Theory of Computing (STOC 2011), San Jose, California, June 6-8 (2011)","DOI":"10.1145\/1993636.1993700"},{"key":"7_CR6","first-page":"374","volume-title":"Proceedings of the 39th Annual ACM Symposium on the Theory of Computing (STOC 2007)","author":"P. Heggernes","year":"2007","unstructured":"Heggernes, P., Paul, C., Telle, J.A., Villanger, Y.: Interval completion with few edges. In: Proceedings of the 39th Annual ACM Symposium on the Theory of Computing (STOC 2007), pp. 374\u2013381. American Mathematical Society, San Diego (2007)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1137\/S0097539796303044","volume":"28","author":"H. Kaplan","year":"1999","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM Journal on Computing\u00a028, 1906\u20131922 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Wollan, P.: A shorter proof of the graph minor algorithm - the unique linkage theorem. In: Proc. of the 42nd annual ACM Symposium on Theory of Computing, STOC 2010 (2010)","DOI":"10.1145\/1806689.1806784"},{"key":"7_CR9","first-page":"129","volume":"2","author":"M.R. Kramer","year":"1984","unstructured":"Kramer, M.R., van Leeuven, J.: The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. Advances in Comp. Research\u00a02, 129\u2013146 (1984)","journal-title":"Advances in Comp. Research"},{"key":"7_CR10","series-title":"Contemp. Math.","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1090\/conm\/147\/01180","volume-title":"Graph Structure Theory","author":"B.A. Reed","year":"1993","unstructured":"Reed, B.A., Robertson, N., Schrijver, A., Seymour, P.D.: Finding disjoint trees in planar graphs in linear time. In: Graph Structure Theory, Seattle, WA. Contemp. Math., vol.\u00a0147, pp. 295\u2013301. Amer. Math. Soc., Providence (1993)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B\u00a063, 65\u2013110 (1995)","journal-title":"J. Combin. Theory Ser. B"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algebraic Discrete Methods\u00a02, 77\u201379 (1981)","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28050-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T09:42:51Z","timestamp":1556444571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28050-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642280498","9783642280504"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28050-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}