{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:23:53Z","timestamp":1725495833386},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669166"},{"type":"electronic","value":"9783540466321"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46632-0_43","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T14:45:01Z","timestamp":1195915501000},"page":"425-434","source":"Crossref","is-referenced-by-count":0,"title":["Bisecting Two Subsets in 3-Connected Graphs"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Nagamochi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshitaka","family":"Nakao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Jord\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"43_CR1","first-page":"433","volume":"11","author":"L. Chi-Yuan","year":"1994","unstructured":"L. Chi-Yuan, J. Matou\u0161ek and W. Steiger, Algorithms for ham-sandwich cuts, Discrete Comput. Geom., 11, 1994, 433\u2013452.","journal-title":"Algorithms for ham-sandwich cuts"},{"key":"43_CR2","first-page":"139","volume":"10","author":"M. E. Dyer","year":"1985","unstructured":"M. E. Dyer and A. M. Frieze, On the complexity of partitioning graphs into connected subgraphs, Discrete Applied Mathematics, 10, 1985, 139\u2013153.","journal-title":"On the complexity of partitioning graphs into connected subgraphs"},{"key":"43_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Berlin, 1987."},{"key":"43_CR4","first-page":"171","volume":"2","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner and R. Waupotitsch, Computing a ham-sandwich cut in two dimensions, J. Symbolic Computation, 2, 1986, 171\u2013178.","journal-title":"Computing a ham-sandwich cut in two dimensions"},{"key":"43_CR5","first-page":"704","volume":"5","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey, D. S. Johnson and R. E. Tarjan, The planar Hamiltonian circuit problem is NP-complete, SIAM J. Comput., 5, 1976, 704\u2013714.","journal-title":"The planar Hamiltonian circuit problem is NP-complete"},{"key":"43_CR6","first-page":"485","volume-title":"On division of connected subgraphs","author":"E. Gy\u00f5ri","year":"1978","unstructured":"E. Gy\u00f5ri, On division of connected subgraphs, Combinatorics (Proc. Fifth Hungarian Combinatorial Coll, 1976, Keszthely), Bolyai-North-Holland, 1978, 485\u2013494."},{"key":"43_CR7","first-page":"91","volume":"8","author":"N. Linial","year":"1988","unstructured":"N. Linial, L. Lov\u00e1sz and A. Wigderson, Rubber bands, convex embeddings and graph connectivity, Combinatorica, 8, 1988, 91\u2013102.","journal-title":"Rubber bands, convex embeddings and graph connectivity"},{"key":"43_CR8","first-page":"241","volume":"30","author":"L. Lov\u00e1sz","year":"1977","unstructured":"L. Lov\u00e1sz, A homology theory for spanning trees of a graph, Acta Math. Acad. Sci. Hungar, 30, 1977, 241\u2013251.","journal-title":"A homology theory for spanning trees of a graph"},{"key":"43_CR9","first-page":"583","volume":"7","author":"H. Nagamochi","year":"1992","unstructured":"H. Nagamochi and T. Ibaraki, A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica, 7, 1992, 583\u2013596.","journal-title":"A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph"},{"key":"43_CR10","unstructured":"E. Steinitz, Polyeder und Raumeinteilungen, Encyklop\u00e4die der mathematischen Wissenschaften, Band III, Teil 1, 2. H\u00e4lfte, IIIAB12, 1916, 1\u2013139."},{"key":"43_CR11","first-page":"227","volume":"33","author":"H. Suzuki","year":"1990","unstructured":"H. Suzuki, N. Takahashi and T. Nishizeki, A linear algorithm for bipartition of biconnected graphs, Information Processing Letters, 33, 1990, 227\u2013232.","journal-title":"A linear algorithm for bipartition of biconnected graphs"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"W.T. Tutte, Connectivity in Graphs, University of Toronto Press, 1966.","DOI":"10.4153\/CJM-1966-129-2"},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"K. Wada and K. Kawaguchi, Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs, Lecture Notes in Comput. Sci., 790, Springer, Graph-theoretic concepts in computer science, 1994, 132\u2013143.","DOI":"10.1007\/3-540-57899-4_47"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46632-0_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T22:04:39Z","timestamp":1557007479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46632-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669166","9783540466321"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46632-0_43","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}