{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:48:08Z","timestamp":1725828488944},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662483497"},{"type":"electronic","value":"9783662483503"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_20","type":"book-chapter","created":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T01:40:34Z","timestamp":1441071634000},"page":"227-238","source":"Crossref","is-referenced-by-count":1,"title":["Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs"],"prefix":"10.1007","author":[{"given":"Glencora","family":"Borradaile","sequence":"first","affiliation":[]},{"given":"Amir","family":"Nayyeri","sequence":"additional","affiliation":[]},{"given":"Farzad","family":"Zafarani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/978-3-662-43948-7_18","volume-title":"Automata, Languages, and Programming","author":"A. Bj\u00f6rklund","year":"2014","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Shortest two disjoint paths in polynomial time. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol.\u00a08572, pp. 211\u2013222. Springer, Heidelberg (2014)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1109\/FOCS.2013.29","volume-title":"Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013","author":"M. Cygan","year":"2013","unstructured":"Cygan, M., Marx, D., Pilipczuk, M., Pilipczuk, M.: The planar directed k-vertex-disjoint paths problem is fixed-parameter tractable. In: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013, pp. 197\u2013206. IEEE Computer Society, Washington, DC (2013)"},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science\u00a010(2), 111\u2013121 (1980)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1997.1493","volume":"55","author":"M.R. Henzinger","year":"1997","unstructured":"Henzinger, M.R., Klein, P., Rao, S., Subramanian, S.: Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci.\u00a055(1), 3\u201323 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"R. Karp","year":"1974","unstructured":"Karp, R.: On the computational complexity of combinatorial problems. Networks\u00a05, 45\u201368 (1974)","journal-title":"Networks"},{"key":"20_CR6","unstructured":"Klein, P.N.: Multiple-source shortest paths in planar graphs. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Philadelphia, PA, USA, pp. 146\u2013155. Society for Industrial and Applied Mathematics (2005)"},{"issue":"4","key":"20_CR7","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.disopt.2010.05.002","volume":"7","author":"Y. Kobayashi","year":"2010","unstructured":"Kobayashi, Y., Sommer, C.: On shortest disjoint paths in planar graphs. Discrete Optimization\u00a07(4), 234\u2013245 (2010)","journal-title":"Discrete Optimization"},{"key":"20_CR8","first-page":"129","volume":"2","author":"M.R. Kramer","year":"1984","unstructured":"Kramer, M.R., van Leeuwen, J.: The complexity of wire-routing and finding minimum area layouts for arbitrary vlsi circuits. Advances in Computing Research\u00a02, 129\u2013146 (1984)","journal-title":"Advances in Computing Research"},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/1806689.1806784","volume-title":"Proceedings of the Forty-Second ACM Symposium on Theory of Computing, STOC 2010","author":"K.-I. Kawarabayashi","year":"2010","unstructured":"Kawarabayashi, K.-I., Wollan, P.: A shorter proof of the graph minor algorithm: The unique linkage theorem. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, STOC 2010, pp. 687\u2013694. ACM, New York (2010)"},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01202792","volume":"13","author":"M. Middendorf","year":"1993","unstructured":"Middendorf, M., Pfeiffer, F.: On the complexity of the disjoint paths problem. Combinatorica\u00a013(1), 97\u2013107 (1993)","journal-title":"Combinatorica"},{"issue":"1","key":"20_CR11","first-page":"345","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, V., Vazirani, U.: Matching is as easy as matrix inversion. Combinatorica\u00a07(1), 345\u2013354 (1987)","journal-title":"Combinatorica"},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1109\/18.212275","volume":"39","author":"R.G. Ogier","year":"1993","unstructured":"Ogier, R.G., Rutenburg, V., Shacham, N.: Distributed algorithms for computing shortest pairs of disjoint paths. IEEE Transactions on Information Theory\u00a039(2), 443\u2013455 (1993)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"20_CR13","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. Journal of Combinatorial Theory, Series B\u00a063(1), 65\u2013110 (1995)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"4","key":"20_CR14","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1137\/S0097539792224061","volume":"23","author":"A. Schrijver","year":"1994","unstructured":"Schrijver, A.: Finding k disjoint paths in a directed planar graph. SIAM Journal on Computing\u00a023(4), 780\u2013788 (1994)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"20_CR15","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s11276-005-1765-0","volume":"11","author":"A. Srinivas","year":"2005","unstructured":"Srinivas, A., Modiano, E.: Finding minimum energy disjoint paths in wireless ad-hoc networks. Wireless Networks\u00a011(4), 401\u2013417 (2005)","journal-title":"Wireless Networks"},{"issue":"2","key":"20_CR16","first-page":"19","volume":"7","author":"C. Verdi\u00e8re De","year":"2011","unstructured":"De Verdi\u00e8re, C., Schrijver, E.: A Shortest vertex-disjoint two-face paths in planar graphs. ACM Transactions on Algorithms (TALG)\u00a07(2), 19 (2011)","journal-title":"ACM Transactions on Algorithms (TALG)"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T04:43:15Z","timestamp":1653108195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}