{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:57:09Z","timestamp":1725638229598},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_38","type":"book-chapter","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T19:32:34Z","timestamp":1322854354000},"page":"364-373","source":"Crossref","is-referenced-by-count":1,"title":["Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem"],"prefix":"10.1007","author":[{"given":"Chunhao","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian-Ping","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-68552-4_7","volume-title":"Experimental Algorithms","author":"Z. Bian","year":"2008","unstructured":"Bian, Z., Gu, Q.P.: Computing Branch Decomposition of Large Planar Graphs. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 87\u2013100. Springer, Heidelberg (2008)"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Bian, Z., Gu, Q.P., Marzban, M., Tamaki, H., Yoshitake, Y.: Empirical study on branchwidth and branch decomposition of planar graphs. In: Proc.\u00a0of the 9th SIAM Workshop on Algorithm Engineering and Experiments (ALENEX 2008), pp. 152\u2013165 (2008)","DOI":"10.1137\/1.9781611972887.15"},{"issue":"1","key":"38_CR3","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\u201389 (2008)","journal-title":"Algorithmica"},{"issue":"6","key":"38_CR4","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1287\/opre.32.6.1381","volume":"32","author":"T.H. Byers","year":"1984","unstructured":"Byers, T.H., Waterman, M.S.: Determining all optimal and near-optimal solutions when solving shortest path problems by dynamic programming. Operations Research\u00a032(6), 1381\u20131384 (1984)","journal-title":"Operations Research"},{"key":"38_CR5","unstructured":"de Fraysseix, H., de Mendez, P.O.: PIGALE-Public Implementation of a Graph Algorithm Library and Editor. SourceForge project page, http:\/\/sourceforge.net\/projects\/pigale"},{"issue":"3","key":"38_CR6","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1137\/S0895480103433410","volume":"18","author":"E. Demaine","year":"2005","unstructured":"Demaine, E., Fomin, F., Hajiaghayi, M., Thilikos, D.: Bidimensional parameters and local treewidth. SIAM J. Discret. Math.\u00a018(3), 501\u2013511 (2005)","journal-title":"SIAM J. Discret. Math."},{"issue":"6","key":"38_CR7","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1145\/1101821.1101823","volume":"52","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. Journal of the ACM (JACM)\u00a052(6), 866\u2013893 (2005)","journal-title":"Journal of the ACM (JACM)"},{"issue":"1","key":"38_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00493-008-2140-4","volume":"28","author":"E.D. Demaine","year":"2008","unstructured":"Demaine, E.D., Hajiaghayi, M.T.: Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica\u00a028(1), 19\u201336 (2008)","journal-title":"Combinatorica"},{"issue":"2","key":"38_CR9","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1137\/040616929","volume":"20","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Thilikos, D.M.: The bidimensional theory of bounded-genus graphs. SIAM Journal on Discrete Mathematics\u00a020(2), 357\u2013371 (2007)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"38_CR10","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1007\/s00453-009-9296-1","volume":"58","author":"F. Dorn","year":"2010","unstructured":"Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. Algorithmica\u00a058(3), 790\u2013810 (2010)","journal-title":"Algorithmica"},{"issue":"4","key":"38_CR11","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput.\u00a05(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"38_CR12","volume-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, a Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Gu, Q.P., Tamaki, H.: Improved bounds on the planar branchwidth with respect to the largest grid minor size. Algorithmica (to appear, 2011)","DOI":"10.1007\/978-3-642-17514-5_8"},{"issue":"3","key":"38_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1367064.1367070","volume":"4","author":"Q.P. Gu","year":"2008","unstructured":"Gu, Q.P., Tamaki, H.: Optimal branch-decomposition of planar graphs in O(n 3) time. ACM Transactions on Algorithms (TALG)\u00a04(3), 1\u201313 (2008)","journal-title":"ACM Transactions on Algorithms (TALG)"},{"issue":"52","key":"38_CR15","doi-asserted-by":"publisher","first-page":"5455","DOI":"10.1016\/j.tcs.2009.04.012","volume":"410","author":"M. Marzban","year":"2009","unstructured":"Marzban, M., Gu, Q.P., Jia, X.: Computational study on planar dominating set problem. Theoretical Computer Science\u00a0410(52), 5455\u20135466 (2009)","journal-title":"Theoretical Computer Science"},{"key":"38_CR16","unstructured":"Mehlhorn, K., N\u00e4her, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press (1999)"},{"issue":"4","key":"38_CR17","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2013A traveling salesman problem library. INFORMS Journal on Computing\u00a03(4), 376 (1991)","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"38_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1006\/jctb.1994.1073","volume":"62","author":"N. Robertson","year":"1994","unstructured":"Robertson, N., Seymour, P., Thomas, R.: Quickly excluding a planar graph. Journal of Combinatorial Theory, Series B\u00a062(2), 323\u2013348 (1994)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2","key":"38_CR19","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. Journal of Combinatorial Theory, Series B\u00a052(2), 153\u2013190 (1991)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2","key":"38_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"P.D. Seymour","year":"1994","unstructured":"Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica\u00a014(2), 217\u2013241 (1994)","journal-title":"Combinatorica"},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"Wang, C.: Computational study on bidimensionality theory based algorithms. MSc Thesis, Simon Fraser University (August 2011)","DOI":"10.1007\/978-3-642-25591-5_38"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T02:11:38Z","timestamp":1560996698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}