{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:47Z","timestamp":1759639007018},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"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-23719-5_13","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"143-154","source":"Crossref","is-referenced-by-count":10,"title":["An $\\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs"],"prefix":"10.1007","author":[{"given":"Andreas Emil","family":"Feldmann","sequence":"first","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"13_CR1","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.J.: A survey of graph layout problems. ACM Comput. Surv.\u00a034(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"13_CR2","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s002360050049","volume":"33","author":"J. D\u00edaz","year":"1996","unstructured":"D\u00edaz, J., Serna, M.J., Tor\u00e1n, J.: Parallel approximation schemes for problems on planar graphs. Acta Informatica\u00a033(4), 387\u2013408 (1996)","journal-title":"Acta Informatica"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1006\/jagm.1993.1013","volume":"14","author":"K. Diks","year":"1993","unstructured":"Diks, K., Djidjev, H.N., Sykora, O., Vrto, I.: Edge separators of planar and outerplanar graphs with applications. Journal of Algorithms\u00a014(2), 258\u2013279 (1993)","journal-title":"Journal of Algorithms"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-17458-2_2","volume-title":"Combinatorial Optimization and Applications","author":"A.E. Feldmann","year":"2010","unstructured":"Feldmann, A.E., Das, S., Widmayer, P.: Simple cuts are fast and good: Optimum right-angled cuts in solid grids. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part I. LNCS, vol.\u00a06508, pp. 11\u201320. Springer, Heidelberg (2010)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Feldmann, A.E., Widmayer, P.: An O(n4) time algorithm to compute the bisection width of solid grid graphs. Technical Report 730, Institute of Theoretical Computer Science, ETH Z\u00fcrich (July 2011)","DOI":"10.1007\/978-3-642-23719-5_13"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoretical Computer Science\u00a01(3), 237\u2013267 (1976)","journal-title":"Theoretical Computer Science"},{"key":"13_CR7","unstructured":"MacGregor, R.M.: On partitioning a graph: a theoretical and empirical study. PhD thesis, University of California, Berkeley (1978)"},{"key":"13_CR8","first-page":"97","volume":"29","author":"C. Papadimitriou","year":"1996","unstructured":"Papadimitriou, C., Sideri, M.: The bisection width of grid graphs. Theory of Computing Systems\u00a029, 97\u2013110 (1996)","journal-title":"Theory of Computing Systems"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1145\/167088.167284","volume-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993","author":"J.K. Park","year":"1993","unstructured":"Park, J.K., Phillips, C.A.: Finding minimum-quotient cuts in planar graphs. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 766\u2013775. ACM, New York (1993)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"R\u00e4cke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (2008)","DOI":"10.1145\/1374376.1374415"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T12:08:58Z","timestamp":1560514138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}