{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:03Z","timestamp":1780783143037,"version":"3.54.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_22","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:09Z","timestamp":1780780449000},"page":"311-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Layer-Based Width for\u00a0PAFP on\u00a0DAGs: A BFS-Width-2 Normal Form and\u00a0Exact-Length Width-2 Tractability"],"prefix":"10.1007","author":[{"given":"Samuel","family":"German","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308\u2013340 (1991). https:\/\/doi.org\/10.1016\/0196-6774(91)90006-K","journal-title":"J. Algorithms"},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Bannister, M.J., Devanny, W.E., Dujmovi\u0107, V., Eppstein, D., Wood, D.R.: Track layouts, layered path decompositions, and leveled planarity. Algorithmica 81(4), 1561\u20131583 (2019). https:\/\/doi.org\/10.1007\/s00453-018-0487-5","DOI":"10.1007\/s00453-018-0487-5"},{"key":"22_CR3","doi-asserted-by":"publisher","unstructured":"Bez\u00e1kov\u00e1, I., Curticapean, R., Dell, H., Fomin, F.V.: Finding detours is fixed-parameter tractable. In: Chatzigiannakis, I., Indyk, P., Kuhn, F., Muscholl, A. (eds.) 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a080, pp. 54:1\u201354:14. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.54, https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.ICALP.2017.54","DOI":"10.4230\/LIPIcs.ICALP.2017.54"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tcs.2012.09.006","volume":"511","author":"HL Bodlaender","year":"2013","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernel bounds for path and cycle problems. Theoret. Comput. Sci. 511, 117\u2013136 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.09.006","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR5","doi-asserted-by":"publisher","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layered separators in minor-closed graph classes with applications. J. Comb. Theory Ser. B 127, 111\u2013147 (2017). https:\/\/doi.org\/10.1016\/j.jctb.2017.05.006","DOI":"10.1016\/j.jctb.2017.05.006"},{"key":"22_CR6","doi-asserted-by":"publisher","unstructured":"Eppstein, D., Goodrich, M.T., Liu, S.A.: Bandwidth vs BFS width in matrix reordering, graph reconstruction, and graph drawing. In: Benoit, A., Kaplan, H., Wild, S., Herman, G. (eds.) 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0351, pp. 69:1\u201369:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2025). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2025.69, https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.ESA.2025.69","DOI":"10.4230\/LIPIcs.ESA.2025.69"},{"issue":"3","key":"22_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1109\/TSE.1976.233819","volume":"2","author":"HN Gabow","year":"1976","unstructured":"Gabow, H.N., Maheshwari, S.N., Osterweil, L.J.: On two problems in the generation of program test paths. IEEE Trans. Software Eng. 2(3), 227\u2013231 (1976). https:\/\/doi.org\/10.1109\/TSE.1976.233819","journal-title":"IEEE Trans. Software Eng."},{"issue":"11","key":"22_CR8","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/368996.369025","volume":"5","author":"AB Kahn","year":"1962","unstructured":"Kahn, A.B.: Topological sorting of large networks. Commun. ACM 5(11), 558\u2013562 (1962). https:\/\/doi.org\/10.1145\/368996.369025","journal-title":"Commun. ACM"},{"issue":"13","key":"22_CR9","doi-asserted-by":"publisher","first-page":"2871","DOI":"10.1016\/j.dam.2009.03.018","volume":"157","author":"P Kolman","year":"2009","unstructured":"Kolman, P., Pangr\u00e1c, O.: On the complexity of paths avoiding forbidden pairs. Discret. Appl. Math. 157(13), 2871\u20132876 (2009). https:\/\/doi.org\/10.1016\/j.dam.2009.03.018","journal-title":"Discret. Appl. Math."},{"key":"22_CR10","doi-asserted-by":"publisher","unstructured":"Kov\u00e1\u010d, J.: Complexity of the path avoiding forbidden pairs problem revisited. Discrete Appl. Math. 161(10\u201311), 1506\u20131512 (2013). https:\/\/doi.org\/10.1016\/j.dam.2012.12.022, early version available as arXiv:1111.3996","DOI":"10.1016\/j.dam.2012.12.022"},{"key":"22_CR11","doi-asserted-by":"publisher","unstructured":"Kova\u010d, J., Vina\u0159, T., Brejov\u00e1, B.: Predicting gene structures from multiple RT-PCR tests. In: Algorithms in Bioinformatics (WABI 2009). Lecture Notes in Computer Science, vol.\u00a05724, pp. 181\u2013193. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-04241-6_16","DOI":"10.1007\/978-3-642-04241-6_16"},{"key":"22_CR12","unstructured":"Krause, K.W., Smith, R.W., Goodwin, M.A.: Optimal software test planning through automated network analysis. In: Proceedings of the 1973 IEEE Symposium on Computer Software Reliability, pp. 18\u201322. IEEE (1973)"},{"key":"22_CR13","doi-asserted-by":"publisher","unstructured":"Samer, M., Szeider, S.: Constraint satisfaction with bounded treewidth revisited. J. Comput. Syst. Sci. 76(2), 103\u2013114 (2010). https:\/\/doi.org\/10.1016\/j.jcss.2009.04.003","DOI":"10.1016\/j.jcss.2009.04.003"},{"key":"22_CR14","doi-asserted-by":"publisher","unstructured":"Yinnone, H.: On paths avoiding forbidden pairs of vertices in a graph. Discrete Appl. Math. 74(1), 85\u201392 (1997). https:\/\/doi.org\/10.1016\/S0166-218X(96)00017-0","DOI":"10.1016\/S0166-218X(96)00017-0"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:11Z","timestamp":1780780451000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The author has no competing interests to declare.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}