{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T02:10:06Z","timestamp":1750471806892,"version":"3.41.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319621265"},{"type":"electronic","value":"9783319621272"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62127-2_21","type":"book-chapter","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T02:47:31Z","timestamp":1499136451000},"page":"241-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Balanced Line Separators of Unit Disk Graphs"],"prefix":"10.1007","author":[{"given":"Paz","family":"Carmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Man Kwun","family":"Chiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"van Renssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Roeloffzen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taichi","family":"Shiitada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shakhar","family":"Smorodinsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF02187724","volume":"4","author":"N Alon","year":"1989","unstructured":"Alon, N., Katchalski, M., Pulleyblank, W.R.: Cutting disjoint disks by straight lines. Discrete & Computational Geometry 4, 239\u2013243 (1989)","journal-title":"Discrete & Computational Geometry"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1090\/S0894-0347-1990-1065053-0","volume":"3","author":"N Alon","year":"1990","unstructured":"Alon, N., Seymour, P., Thomas, R.: A separator theorem for nonplanar graphs. J. Amer. Math. Soc. 3, 801\u2013808 (1990)","journal-title":"J. Amer. Math. Soc."},{"issue":"2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0304-3975(92)90319-B","volume":"92","author":"H Edelsbrunner","year":"1992","unstructured":"Edelsbrunner, H., Guibas, L.J., Pach, J., Pollack, R., Seidel, R., Sharir, M.: Arrangements of curves in the plane\u2014topology, combinatorics and algorithms. Theor. Comput. Sci. 92(2), 319\u2013336 (1992)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"21_CR4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.3233\/FI-1995-2241","volume":"22","author":"D Eppstein","year":"1995","unstructured":"Eppstein, D., Miller, G.L., Teng, S.: A deterministic linear time algorithm for geometric separators and its applications. Fundam. Inform. 22(4), 309\u2013329 (1995)","journal-title":"Fundam. Inform."},{"issue":"3","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1016\/j.aim.2008.06.002","volume":"219","author":"J Fox","year":"2008","unstructured":"Fox, J., Pach, J.: Separator theorems and Tur\u00e1n-type results for planar intersection graphs. Advances in Mathematics 219(3), 1070\u20131080 (2008)","journal-title":"Advances in Mathematics"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Fox-Epstein, E., Mozes, S., Phothilimthana, P.M., Sommer, C.: Short and simple cycle separators in planar graphs. In: Proc. of the 15th Meeting on Algorithm Engineering and Experiments, pp. 26\u201340. SIAM (2013)","DOI":"10.1137\/1.9781611972931.3"},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0196-6774(84)90019-1","volume":"5","author":"JR Gilbert","year":"1984","unstructured":"Gilbert, J.R., Hutchinson, J.P., Tarjan, R.E.: A separator theorem for graphs of bounded genus. J. Algorithms 5(3), 391\u2013407 (1984)","journal-title":"J. Algorithms"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/978-3-662-48350-3_60","volume-title":"Algorithms - ESA 2015","author":"S Har-Peled","year":"2015","unstructured":"Har-Peled, S., Quanrud, K.: Approximation algorithms for polynomial-expansion and low-density graphs. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 717\u2013728. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-48350-3_60"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-662-44777-2_47","volume-title":"Algorithms - ESA 2014","author":"M Hoffmann","year":"2014","unstructured":"Hoffmann, M., Kusters, V., Miltzow, T.: Halving balls in deterministic linear time. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 566\u2013578. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44777-2_47"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Holzer, M., Schulz, F., Wagner, D., Prasinos, G., Zaroliagis, C.D.: Engineering planar separator algorithms. ACM Journal of Experimental Algorithmics 14 (2009)","DOI":"10.1145\/1498698.1571635"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF02574382","volume":"12","author":"S Jadhav","year":"1994","unstructured":"Jadhav, S., Mukhopadhyay, A.: Computing a centerpoint of a finite planar set of points in linear time. Discrete & Computational Geometry 12, 291\u2013312 (1994)","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics 36(2), 177\u2013189 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"1","key":"21_CR13","first-page":"1","volume":"5","author":"M L\u00f6ffler","year":"2014","unstructured":"L\u00f6ffler, M., Mulzer, W.: Unions of onions: Preprocessing imprecise points for fast onion decomposition. JoCG 5(1), 1\u201313 (2014)","journal-title":"JoCG"},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1017\/S0963548313000400","volume":"23","author":"J Matou\u0161ek","year":"2014","unstructured":"Matou\u0161ek, J.: Near-optimal separators in string graphs. Combinatorics, Probability & Computing 23(1), 135\u2013139 (2014)","journal-title":"Combinatorics, Probability & Computing"},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(86)90030-9","volume":"32","author":"GL Miller","year":"1986","unstructured":"Miller, G.L.: Finding small simple cycle separators for 2-connected planar graphs. J. Comput. Syst. Sci. 32(3), 265\u2013279 (1986)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"21_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/256292.256294","volume":"44","author":"GL Miller","year":"1997","unstructured":"Miller, G.L., Teng, S., Thurston, W.P., Vavasis, S.A.: Separators for sphere-packings and nearest neighbor graphs. J. ACM 44(1), 1\u201329 (1997)","journal-title":"J. ACM"},{"issue":"3","key":"21_CR17","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1016\/j.ejc.2006.07.014","volume":"29","author":"J Ne\u0161et\u0159il","year":"2008","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Grad and classes with bounded expansion II. Algorithmic aspects. Eur. J. Comb. 29(3), 777\u2013791 (2008)","journal-title":"Eur. J. Comb."},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Smith, W.D., Wormald, N.C.: Geometric separator theorems & applications. In: Proc. of the 39th Annual Symposium on Foundations of Computer Science, pp. 232\u2013243 (1998)","DOI":"10.1109\/SFCS.1998.743449"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62127-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T01:34:13Z","timestamp":1750469653000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62127-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319621265","9783319621272"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62127-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"5 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. John's","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}