{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:25:38Z","timestamp":1725643538728},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_32","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T02:23:04Z","timestamp":1323915784000},"page":"332-342","source":"Crossref","is-referenced-by-count":2,"title":["Every Graph Admits an Unambiguous Bold Drawing"],"prefix":"10.1007","author":[{"given":"J\u00e1nos","family":"Pach","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.7155\/jgaa.00078","volume":"8","author":"G. Barequet","year":"2004","unstructured":"Barequet, G., Goodrich, M.T., Riley, C.: Drawing planar graphs with large vertices and thick edges. J. Graph Algorithms Appl.\u00a08, 3\u201320 (2004)","journal-title":"J. Graph Algorithms Appl."},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/147508.147511","volume":"39","author":"B. Chazelle","year":"1992","unstructured":"Chazelle, B., Edelsbrunner, H.: An optimal algorithm for intersecting line segments in the plane. J. ACM\u00a039, 1\u201354 (1992)","journal-title":"J. ACM"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K.L. Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Application of random sampling in computational geometry, II. Discrete & Computational Geometry\u00a04, 387\u2013421 (1989)","journal-title":"Discrete & Computational Geometry"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1142\/S0129054106004315","volume":"17","author":"C.A. Duncan","year":"2006","unstructured":"Duncan, C.A., Efrat, A., Kobourov, S.G., Wenk, C.: Drawing with fat edges. Int. J. Found. Comput. Sci.\u00a017, 1143\u20131164 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"32_CR5","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Mathematica\u00a02, 463\u2013470 (1935)","journal-title":"Compositio Mathematica"},{"key":"32_CR6","volume-title":"Ramsey Theory","author":"R. Graham","year":"1990","unstructured":"Graham, R., Rothschild, B., Spencer, J.H.: Ramsey Theory. John Wiley and Sons, New York (1990)"},{"unstructured":"van Kreveld, M.: Bold graph drawings. In: Proc. Canadian Conference on Computational Geometry, CCCG 2009 (2009),     http:\/\/cccg.ca\/proceedings\/2009\/cccg09_31.pdf;","key":"#cr-split#-32_CR7.1"},{"unstructured":"van Kreveld, M.: Bold graph drawings. In: Proc. Canadian Conference on Computational Geometry, CCCG 2009 (2009),     http:\/\/cccg.ca\/proceedings\/2009\/cccg09_31.pdf      ; Also Computational Geometry: Theory & Applications (to appear)","key":"#cr-split#-32_CR7.2"},{"doi-asserted-by":"crossref","unstructured":"Mulmuley, K.: A fast planar partition algorithm, I. In: Proc. 29th FOCS, pp. 580\u2013589 (1988)","key":"32_CR8","DOI":"10.1109\/SFCS.1988.21974"},{"unstructured":"North, S.C.: Drawing Graphs with Neato (2004), \n                    \n                      http:\/\/www.graphviz.org\/Documentation\/neatoguide.pdf","key":"32_CR9"},{"issue":"2","key":"32_CR10","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F.P. Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc. Series\u00a030(2), 264\u2013286 (1930)","journal-title":"Proc. London Math. Soc. Series"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T00:43:12Z","timestamp":1555893792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}