{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T13:32:03Z","timestamp":1772717523846,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319079585","type":"print"},{"value":"9783319079592","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_33","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:44:25Z","timestamp":1402404265000},"page":"388-399","source":"Crossref","is-referenced-by-count":5,"title":["Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study"],"prefix":"10.1007","author":[{"given":"Yasuaki","family":"Kobayashi","sequence":"first","affiliation":[]},{"given":"Keita","family":"Komuro","sequence":"additional","affiliation":[]},{"given":"Hisao","family":"Tamaki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"33_CR1","first-page":"277","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM Journal on Matrix Analysis and Applications\u00a08(2), 277\u2013284 (1987)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/11775096_24","volume-title":"Algorithmic Aspects in Information and Management","author":"E.H. Bachoore","year":"2006","unstructured":"Bachoore, E.H., Bodlaender, H.L.: A branch and bound algorithm for exact, upper, and lower bounds on treewidth. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol.\u00a04041, pp. 255\u2013266. Springer, Heidelberg (2006)"},{"key":"33_CR3","unstructured":"van den Broek, J., Bodlaender, H.L.: TreewidthLIB, \n                    \n                      http:\/\/www.cs.uu.nl\/research\/projects\/treewidthlib\/\n                    \n                    \n                   (accessed February 9 2014)"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms\u00a021, 358\u2013402 (1996)","journal-title":"Journal of Algorithms"},{"issue":"6","key":"33_CR5","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing\u00a025(6), 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"33_CR6","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/s00224-011-9312-0","volume":"50","author":"H.L. Bodlaender","year":"2012","unstructured":"Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D., Thilikos, D.M.: A note on exact algorithms for vertex ordering problems on graphs. Theory of Computing Systems\u00a050(3), 420\u2013432 (2012)","journal-title":"Theory of Computing Systems"},{"issue":"1","key":"33_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/2390176.2390188","volume":"9","author":"H.L. Bodlaender","year":"2012","unstructured":"Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D., Thilikos, D.M.: On exact algorithms for treewidth. ACM Transactions on Algorithms\u00a09(1), 12 (2012)","journal-title":"ACM Transactions on Algorithms"},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00453-007-9056-z","volume":"51","author":"H.L. Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Grigoriev, A., Koster, A.M.C.A.: Treewidth lower bounds with brambles. Algorithmica\u00a051(1), 81\u201398 (2008)","journal-title":"Algorithmica"},{"issue":"7","key":"33_CR9","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1016\/j.ic.2011.04.003","volume":"209","author":"H.L. Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Treewidth Computations II. Lower Bounds. Information and Computtation\u00a0209(7), 1103\u20131119 (2011)","journal-title":"Lower Bounds. Information and Computtation"},{"key":"33_CR10","volume-title":"Introduction to algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. The MIT Press, Boston (2001)"},{"key":"33_CR11","volume-title":"Parameterized complexity","author":"R.G. Downey","year":"1998","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, Berlin (1998)"},{"key":"33_CR12","unstructured":"Kashiwabara, T., Fujisawa, T.: NP-completeness of the problem of finding a minimum-clique-number interval graph containing a given graph as a subgraph. In: Proceedings of International Symposium on Circuits and Systems, pp. 657\u2013660 (1979)"},{"issue":"6","key":"33_CR13","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","volume":"42","author":"G.N. Kinnersley","year":"1992","unstructured":"Kinnersley, G.N.: The vertex separation number of a graph equals its path-width. Information Processing Letters\u00a042(6), 345\u2013350 (1992)","journal-title":"Information Processing Letters"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-33293-7_18","volume-title":"Parameterized and Exact Computation","author":"K. Kitsunai","year":"2012","unstructured":"Kitsunai, K., Kobayashi, Y., Komuro, K., Tamaki, H., Tano, T.: Computing directed pathwidth in O(1.89\n                    n\n                  ) time. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol.\u00a07535, pp. 182\u2013193. Springer, Heidelberg (2012)"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/S1571-0653(05)80078-2","volume":"8","author":"A.M.C.A. Koster","year":"2001","unstructured":"Koster, A.M.C.A., Bodlaender, H.L., van Hoesel, S.P.: Treewidth: computational experiments. Electronic Notes in Discrete Mathematics\u00a08, 54\u201357 (2001)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1","key":"33_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N. Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. Journal of Combinatorial Theory, Series B\u00a035(1), 39\u201361 (1983)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"3","key":"33_CR17","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms\u00a07(3), 309\u2013322 (1984)","journal-title":"Journal of Algorithms"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-642-11269-0_27","volume-title":"Parameterized and Exact Computation","author":"K. Suchan","year":"2009","unstructured":"Suchan, K., Villanger, Y.: Computing pathwidth faster than 2n. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 324\u2013335. Springer, Heidelberg (2009)"},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-25870-1_30","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H. Tamaki","year":"2011","unstructured":"Tamaki, H.: A polynomial time algorithm for bounded directed pathwidth. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol.\u00a06986, pp. 331\u2013342. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,9]],"date-time":"2018-10-09T18:13:17Z","timestamp":1539108797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}