{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:58Z","timestamp":1725663478136},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540518594"},{"type":"electronic","value":"9783540468318"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51859-2_12","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:18:15Z","timestamp":1330204695000},"page":"126-138","source":"Crossref","is-referenced-by-count":1,"title":["Improved bounds on the size of separators of toroidal graphs"],"prefix":"10.1007","author":[{"given":"L. G.","family":"Aleksandrov","sequence":"first","affiliation":[]},{"given":"H. N.","family":"Djidjev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/0603022","volume":"3","author":"H. N. Djidjev","year":"1982","unstructured":"H. N. Djidjev, On the problem of partitioning planar graphs, SIAM J. Alg. Discr. Methods, vol. 3 (1982), 229\u2013240.","journal-title":"SIAM J. Alg. Discr. Methods"},{"key":"12_CR2","first-page":"319","volume":"11","author":"H. N. Djidjev","year":"1985","unstructured":"H. N. Djidjev, A separator theorems for graphs of fixed genus, Serdica, vol. 11 (1985), 319\u2013329.","journal-title":"Serdica"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-19487-8_25","volume-title":"Linear algorithms for graph separation problems","author":"H. N. Djidjev","year":"1988","unstructured":"H. N. Djidjev, Linear algorithms for graph separation problems, Proc. SWAT'88, Lecture Notes in Computer Science, vol. 318, North-Holland, Berlin, Heidelberg, New York, Tokyo, 1988, 216\u2013221."},{"key":"12_CR4","unstructured":"H. Gazit, An improved algorithm for separating planar graphs, manuscript."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"J.R. Gilbert, J.P. Hutchinson, R.E. Tarjan, A separator theorem for graphs of bounded genus, Journal of Algorithms, No 5, 1984, pp. 391\u2013398.","DOI":"10.1016\/0196-6774(84)90019-1"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"R.J. Lipton, R.E. Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math., Vol. 36, No. 2, 1979, pp. 177\u2013189.","journal-title":"SIAM J. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Optimal Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51859-2_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:23:03Z","timestamp":1605648183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51859-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540518594","9783540468318"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-51859-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}