{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:14:34Z","timestamp":1761621274629,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_12","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T10:50:06Z","timestamp":1470307806000},"page":"154-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Finding Paths in Grids with Forbidden Transitions"],"prefix":"10.1007","author":[{"given":"Mamadou Moustapha","family":"Kant\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fatima Zahra","family":"Moataz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Mom\u00e8ge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1002\/net.21490","volume":"61","author":"M Ahmed","year":"2013","unstructured":"Ahmed, M., Lubiw, A.: Shortest paths avoiding forbidden subpaths. Networks 61(4), 322\u2013334 (2013)","journal-title":"Networks"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1364\/JOCN.1.000187","volume":"1","author":"G Bernstein","year":"2009","unstructured":"Bernstein, G., Lee, Y., Gavler, A., Martensson, J.: Modeling WDM wavelength switching systems for use in GMPLS and automated path computation. IEEE Opt. Commun. Networking 1(1), 187\u2013195 (2009)","journal-title":"IEEE Opt. Commun. Networking"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/3-540-19488-6_110","volume-title":"Automata, Languages and Programming","author":"HL Bodlaender","year":"1988","unstructured":"Bodlaender, H.L.: Dynamic programming on graphs with bounded treewidth. In: Lepist\u00f6, T., Salomaa, A. (eds.) Automata, Languages and Programming. LNCS, vol. 317, pp. 105\u2013118. Springer, Heidelberg (1988)"},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/s11107-013-0400-8","volume":"25","author":"Y Chen","year":"2013","unstructured":"Chen, Y., Hua, N., Wan, X., Zhang, H., Zheng, X.: Dynamic lightpath provisioning in optical WDM mesh networks with asymmetric nodes. Photon Netw. Commun. 25(3), 166\u2013177 (2013)","journal-title":"Photon Netw. Commun."},{"issue":"7","key":"12_CR5","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.dam.2009.10.011","volume":"158","author":"F Dorn","year":"2010","unstructured":"Dorn, F.: Dynamic programming and planarity: improved tree-decomposition based algorithms. Discrete Appl. Math. 158(7), 800\u2013808 (2010). Third Workshop on Graph Classes, Optimization, and Width Parameters Eugene, Oregon, USA, October 2007","journal-title":"Discrete Appl. Math."},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/11561071_11","volume-title":"Algorithms \u2013 ESA 2005","author":"F Dorn","year":"2005","unstructured":"Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 95\u2013106. Springer, Heidelberg (2005)"},{"issue":"6","key":"12_CR7","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.dam.2012.10.025","volume":"161","author":"L Gourv\u00e8s","year":"2013","unstructured":"Gourv\u00e8s, L., Lyra, A., Martinhon, C.A., Monnot, J.: Complexity of trails, paths and circuits in arc-colored digraphs. Discrete Appl. Math. 161(6), 819\u2013828 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10479-007-0198-9","volume":"157","author":"E Guti\u00e9rrez","year":"2008","unstructured":"Guti\u00e9rrez, E., Medaglia, A.L.: Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks. Ann. Oper. Res. 157(1), 169\u2013182 (2008)","journal-title":"Ann. Oper. Res."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Hashiguchi, T., Tajima, K., Takita, Y., Naito, T.: Node-disjoint paths search in WDM networks with asymmetric nodes. In: 2011 15th International Conference on Optical Network Design and Modeling (ONDM), pp. 1\u20136 (2011)","DOI":"10.1364\/ECOC.2011.Mo.1.K.4"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/978-3-642-03095-6_60","volume-title":"Algorithms and Architectures for Parallel Processing","author":"C-C Hsu","year":"2009","unstructured":"Hsu, C.-C., Chen, D.-R., Ding, H.-Y.: An efficient algorithm for the shortest path problem with forbidden paths. In: Hua, A., Chang, S.-L. (eds.) ICA3PP 2009. LNCS, vol. 5574, pp. 638\u2013650. Springer, Heidelberg (2009)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Jaumard, B., Kien, D.: Optimizing ROADM configuration in WDM networks. In: 2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks), pp. 1\u20137 (2014)","DOI":"10.1109\/NETWKS.2014.6959206"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Kant\u00e9, M.M., Moataz, F.Z., Mom\u00e8ge, B., Nisse, N.: Finding Paths in Grids with Forbidden Transitions. Inria Sophia Antipolis, Univerist\u00e9 Nice Sophia Antipolis, CNRS, Research report (2015)","DOI":"10.1007\/978-3-662-53174-7_12"},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.ejor.2012.11.010","volume":"227","author":"LDP Pugliese","year":"2013","unstructured":"Pugliese, L.D.P., Guerriero, F.: Shortest path problem with forbidden paths: the elementary version. Eur. J. Oper. Res. 227(2), 254\u2013267 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"issue":"2\u20133","key":"12_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0166-218X(02)00251-2","volume":"126","author":"S Szeider","year":"2003","unstructured":"Szeider, S.: Finding paths in graphs avoiding forbidden transitions. Discrete Appl. Math. 126(2\u20133), 261\u2013273 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16(3), 421\u2013444 (1987)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"LG Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Trans. Comput. 30(2), 135\u2013140 (1981)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.ejor.2004.01.032","volume":"165","author":"D Villeneuve","year":"2005","unstructured":"Villeneuve, D., Desaulniers, G.: The shortest path problem with forbidden paths. Eur. J. Oper. Res. 165(1), 97\u2013107 (2005)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:12:36Z","timestamp":1558314756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 August 2016","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":"Garching","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":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}