{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:36:32Z","timestamp":1725795392156},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079585"},{"type":"electronic","value":"9783319079592"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_5","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:44:25Z","timestamp":1402404265000},"page":"46-58","source":"Crossref","is-referenced-by-count":2,"title":["Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth"],"prefix":"10.1007","author":[{"given":"David","family":"Coudert","sequence":"first","affiliation":[]},{"given":"Dorian","family":"Mazauric","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-319-03841-4_40","volume-title":"Graph Drawing","author":"T.C. Biedl","year":"2013","unstructured":"Biedl, T.C., Bl\u00e4sius, T., Niedermann, B., N\u00f6llenburg, M., Prutkin, R., Rutter, I.: Using ILP\/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol.\u00a08242, pp. 460\u2013471. Springer, Heidelberg (2013)"},{"issue":"3","key":"5_CR2","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., Kratsch, D., Thilikos, D.M.: A note on exact algorithms for vertex ordering problems on graphs. Theory Comput. Syst.\u00a050(3), 420\u2013432 (2012)","journal-title":"Theory Comput. Syst."},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-31155-0_31","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"H.L. Bodlaender","year":"2012","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernel bounds for structural parameterizations of pathwidth. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol.\u00a07357, pp. 352\u2013363. Springer, Heidelberg (2012)"},{"issue":"2","key":"5_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. J. Algorithms\u00a021(2), 358\u2013402 (1996)","journal-title":"J. Algorithms"},{"issue":"7","key":"5_CR5","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. Inf. Comput.\u00a0209(7), 1103\u20131119 (2011)","journal-title":"Inf. Comput."},{"key":"5_CR6","unstructured":"Coudert, D., Huc, F., Mazauric, D., Nisse, N., Sereni, J.-S.: Reconfiguration of the routing in WDM networks with two classes of services. In: Optical Network Design and Modeling (ONDM), pp. 1\u20136. IEEE (2009)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Coudert, D., Mazauric, D., Nisse, N.: Experimental evaluation of a branch and bound algorithm for computing pathwidth. Tech. Rep. RR-8470. Inria (February 2014)","DOI":"10.1007\/978-3-319-07959-2_5"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J. D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey on graph layout problems. ACM Comput. Surveys\u00a034(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Surveys"},{"issue":"12","key":"5_CR9","doi-asserted-by":"publisher","first-page":"3247","DOI":"10.1016\/j.cor.2012.04.017","volume":"39","author":"A. Duarte","year":"2012","unstructured":"Duarte, A., Escudero, L.F., Mart\u00ed, R., Mladenovic, N., Pantrigo, J.J., S\u00e1nchez-Oro, J.: Variable neighborhood search for the vertex separation problem. Computers & OR\u00a039(12), 3247\u20133255 (2012)","journal-title":"Computers & OR"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-20662-7_19","volume-title":"Experimental Algorithms","author":"A. Hein","year":"2011","unstructured":"Hein, A., Koster, A.M.C.A.: An experimental evaluation of treewidth at most four reductions. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 218\u2013229. Springer, Heidelberg (2011)"},{"key":"5_CR11","unstructured":"MIPLIB - mixed integer problem library, \n                    \n                      http:\/\/miplib.zib.de\/\n                    \n                    \n                  ."},{"key":"5_CR12","unstructured":"Rome graphs, \n                    \n                      http:\/\/www.graphdrawing.org\/download\/rome-graphml.tgz"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/S0196-6774(02)00225-0","volume":"47","author":"K. Skodinis","year":"2003","unstructured":"Skodinis, K.: Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time. J. Algorithms\u00a047(1), 40\u201359 (2003)","journal-title":"J. Algorithms"},{"issue":"12","key":"5_CR14","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1364\/JOCN.2.001010","volume":"2","author":"F. Solano","year":"2010","unstructured":"Solano, F., Pi\u00f3ro, M.: Lightpath reconfiguration in WDM networks. IEEE\/OSA J. Opt. Commun. Netw.\u00a02(12), 1010\u20131021 (2010)","journal-title":"IEEE\/OSA J. Opt. Commun. Netw."},{"key":"5_CR15","unstructured":"Stein, W., et al.: Sage Mathematics Software (Version 6.0). The Sage Development Team (2013), \n                    \n                      http:\/\/www.sagemath.org"},{"key":"5_CR16","unstructured":"VSPLIB (2012), \n                    \n                      http:\/\/www.optsicom.es\/vsp\/"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:36:45Z","timestamp":1558906605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}