{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:12:20Z","timestamp":1725577940380},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_27","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T05:30:40Z","timestamp":1297315840000},"page":"293-304","source":"Crossref","is-referenced-by-count":5,"title":["Drawing Planar Graphs of Bounded Degree with Few Slopes"],"prefix":"10.1007","author":[{"given":"Bal\u00e1zs","family":"Keszegh","sequence":"first","affiliation":[]},{"given":"J\u00e1nos","family":"Pach","sequence":"additional","affiliation":[]},{"given":"D\u00f6m\u00f6t\u00f6r","family":"P\u00e1lv\u00f6lgyi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Bar\u00e1t, J., Matou\u0161ek, J., Wood, D.: Bounded-degree graphs have arbitrarily large geometric thickness. Electronic J. Combinatorics\u00a013(1) (2006) R3","DOI":"10.37236\/1029"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T. Biedl","year":"1998","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings, Comput. Comput. Geom.\u00a09, 159\u2013180 (1998)","journal-title":"Comput. Geom."},{"key":"27_CR3","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.comgeo.2006.09.002","volume":"38","author":"V. Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Eppstein, D., Suderman, M., Wood, D.R.: Drawings of planar graphs with few slopes and segments. Comput. Geom.\u00a038(3), 194\u2013212 (2007)","journal-title":"Comput. Geom."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.comgeo.2006.08.002","volume":"38","author":"V. Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Suderman, M., Wood, D.R.: Graph drawings with few slopes. Comput. Geom.\u00a038, 181\u2013193 (2007)","journal-title":"Comput. Geom."},{"key":"27_CR6","first-page":"340","volume-title":"Proc. 20th ACM Symp. on Computational Geometry (SoCG 2004)","author":"C.A. Duncan","year":"2004","unstructured":"Duncan, C.A., Eppstein, D., Kobourov, S.G.: The geometric thickness of low degree graphs. In: Proc. 20th ACM Symp. on Computational Geometry (SoCG 2004), pp. 340\u2013346. ACM Press, New York (2004)"},{"key":"27_CR7","unstructured":"Engelstein, M.: Drawing graphs with few slopes, Research paper submitted to the Intel Competition for high school students, New York (October 2005)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Separating thickness from geometric thickness. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs, Contemporary Mathematics, Amer. Math. Soc., Providence, pp. 75\u201386 (2004)","DOI":"10.1090\/conm\/342\/06132"},{"key":"27_CR9","first-page":"229","volume":"11","author":"I. F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight line representation of planar graphs. Acta Univ. Szeged. Sect. Sci. Math.\u00a011, 229\u2013233 (1948)","journal-title":"Acta Univ. Szeged. Sect. Sci. Math."},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H. Fraysseix de","year":"1994","unstructured":"de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: On triangle contact graphs. Combinatorics, Probability and Computing\u00a03, 233\u2013246 (1994)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"1","key":"27_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/BFb0049393","volume-title":"Algorithms - ESA \u201994","author":"A. Garg","year":"1994","unstructured":"Garg, A., Tamassia, R.: Planar drawings and angular resolution: Algorithms and bounds. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 12\u201323. Springer, Heidelberg (1994)"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-642-11805-0_29","volume-title":"Graph Drawing","author":"V. Jel\u00ednek","year":"2010","unstructured":"Jel\u00ednek, V., Jel\u00ednkov\u00e1, E., Kratochv\u00edl, J., Lidick\u00fd, B., Tesa\u0159, M., Vysko\u010dil, T.: The planar slope number of planar partial 3-trees of bounded degree. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 304\u2013315. Springer, Heidelberg (2010)"},{"key":"27_CR14","first-page":"141","volume":"88","author":"P. Koebe","year":"1936","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte Verhand. S\u00e4chs. Akad. Wiss. Leipzig, Math.-Phys. Klasse\u00a088, 141\u2013164 (1936)","journal-title":"Berichte Verhand. S\u00e4chs. Akad. Wiss. Leipzig, Math.-Phys. Klasse"},{"issue":"2","key":"27_CR15","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.comgeo.2007.05.003","volume":"40","author":"B. Keszegh","year":"2008","unstructured":"Keszegh, B., Pach, J., Plvlgyi, D., Tth, G.: Drawing cubic graphs with at most five slopes, Drawing cubic graphs with at most five slopes. Comput. Geom.\u00a040(2), 138\u2013147 (2008)","journal-title":"Comput. Geom."},{"key":"27_CR16","first-page":"215","volume-title":"Theory of Graphs","author":"A. Lempel","year":"1967","unstructured":"Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Rosenstiehl, P. (ed.) Theory of Graphs, pp. 215\u2013232. Gordon and Breach, New York (1967)"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02006104","volume":"7","author":"Y. Liu","year":"1991","unstructured":"Liu, Y., Morgana, A., Simeone, B.: General theoretical results on rectilinear embeddability of graphs. Acta Math. Appl. Sinica\u00a07, 187\u2013192 (1991)","journal-title":"Acta Math. Appl. Sinica"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/S0895480193242931","volume":"7","author":"S. Malitz","year":"1994","unstructured":"Malitz, S., Papakostas, A.: On the angular resolution of planar graphs. SIAM J. Discrete Math.\u00a07, 172\u2013183 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.comgeo.2009.01.005","volume":"42","author":"P. Mukkamala","year":"2009","unstructured":"Mukkamala, P., Szegedy, M.: Geometric representation of cubic graphs with four directions. Comput. Geom.\u00a042, 842\u2013851 (2009)","journal-title":"Comput. Geom."},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Pach, J., P\u00e1lv\u00f6lgyi, D.: Bounded-degree graphs can have arbitrarily large slope numbers. Electronic J. Combinatorics\u00a013(1) (2006) N1","DOI":"10.37236\/1139"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/11618058_30","volume-title":"Graph Drawing","author":"J. Pach","year":"2006","unstructured":"Pach, J., T\u00f3th, G.: Crossing number of toroidal graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 334\u2013342. Springer, Heidelberg (2006)"},{"key":"27_CR22","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1112\/jlms\/s1-28.3.336","volume":"28","author":"P. Ungar","year":"1953","unstructured":"Ungar, P.: On diagrams representing maps. J. London Math. Soc.\u00a028, 336\u2013342 (1953)","journal-title":"J. London Math. Soc."},{"key":"27_CR23","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1093\/comjnl\/37.2.139","volume":"37","author":"G.A. Wade","year":"1994","unstructured":"Wade, G.A., Chu, J.H.: Drawability of complete graphs using a minimal slope set. The Computer J.\u00a037, 139\u2013142 (1994)","journal-title":"The Computer J."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,16]],"date-time":"2020-06-16T11:45:48Z","timestamp":1592307948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}