{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:25:16Z","timestamp":1725549916281},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_56","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T12:46:24Z","timestamp":1128602784000},"page":"628-639","source":"Crossref","is-referenced-by-count":6,"title":["Engineering Planar Separator Algorithms"],"prefix":"10.1007","author":[{"given":"Martin","family":"Holzer","sequence":"first","affiliation":[]},{"given":"Grigorios","family":"Prasinos","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Schulz","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Zaroliagis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"56_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics\u00a036, 177\u2013189 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"56_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/0603022","volume":"3","author":"H.N. Djidjev","year":"1982","unstructured":"Djidjev, H.N.: On the problem of partitioning planar graphs. SIAM Journal on Algebraic and Discrete Methods\u00a03, 229\u2013240 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"56_CR3","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/S0895480191198768","volume":"7","author":"N. Alon","year":"2004","unstructured":"Alon, N., Seymour, P., Thomas, R.: Planar separators. SIAM Journal on Discrete Mathematics\u00a07, 184\u2013193 (2004)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"56_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s002360050082","volume":"34","author":"H.N. Djidjev","year":"1997","unstructured":"Djidjev, H.N., Venkatesan, S.M.: Reduced constants for simple cycle graph separation. Acta Informatica\u00a034, 231\u2013243 (1997)","journal-title":"Acta Informatica"},{"key":"56_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-45643-0_8","volume-title":"Algorithm Engineering and Experiments","author":"L. Aleksandrov","year":"2002","unstructured":"Aleksandrov, L., Djidjev, H.N., Guo, H., Maheshwari, A.: Partitioning planar graphs with costs and weights. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol.\u00a02409, pp. 98\u2013110. Springer, Heidelberg (2002)"},{"key":"56_CR6","doi-asserted-by":"crossref","unstructured":"Holzer, M., Prasinos, G., Schulz, F., Wagner, D., Zaroliagis, C.: Engineering planar separator algorithms. Technical Report 2005-20, Fakult\u00e4t Informatik, Universit\u00e4t Karlsruhe, TH (2005), http:\/\/www.ubka.uni-karlsruhe.de\/vvv\/ira\/2005\/20\/20.pdf","DOI":"10.1007\/11561071_56"},{"key":"56_CR7","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T. Leighton","year":"1999","unstructured":"Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM\u00a046, 787\u2013832 (1999)","journal-title":"Journal of the ACM"},{"key":"56_CR8","volume-title":"Data Structures and Algorithms 1, 2, and 3","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 1, 2, and 3. Springer, Heidelberg (1984)"},{"key":"56_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4400-4","volume-title":"The Design and Analysis of Algorithms","author":"D. Kozen","year":"1992","unstructured":"Kozen, D.: The Design and Analysis of Algorithms. Springer, Heidelberg (1992)"},{"key":"56_CR10","unstructured":"Ashcraft, C., Liu, J.W.H.: Applications of the Dulmage-Mendelsohn decomposition and network flow to graph bisection improvement. Technical Report CS-96-05, Dept. of Computer Science, York University, North York, Ontario, Canada (1996), http:\/\/www.cs.yorku.ca\/techreports\/1996\/CS-96-05.html"},{"key":"56_CR11","unstructured":"Bourke, P.: Sphere generation (1992), http:\/\/astronomy.swin.edu.au\/~pbourke\/modelling\/sphere\/"},{"key":"56_CR12","volume-title":"The LEDA Platform of Combinatorial and Geometric Computing","author":"S. N\u00e4her","year":"1999","unstructured":"N\u00e4her, S., Mehlhorn, K.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999), http:\/\/www.algorithmic-solutions.com"},{"key":"56_CR13","unstructured":"Diekmann, R.: (Graph Partitioning Graph Collection), http:\/\/wwwcs.upb.de\/fachbereich\/AG\/monien\/RESEARCH\/PART\/graphs.html"},{"key":"56_CR14","unstructured":"BARD (Bay Area Regional Database), http:\/\/bard.wr.usgs.gov"},{"key":"56_CR15","unstructured":"ESRI (Environmental Systems Research Institute), http:\/\/www.esri.com"},{"key":"56_CR16","unstructured":"Karypis, G.: (MeTiS), http:\/\/www-users.cs.umn.edu\/~karypis\/metis"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:50:46Z","timestamp":1605642646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11561071_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}