{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:36:25Z","timestamp":1770978985561,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319038407","type":"print"},{"value":"9783319038414","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_8","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T00:28:55Z","timestamp":1385944135000},"page":"83-94","source":"Crossref","is-referenced-by-count":20,"title":["Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs"],"prefix":"10.1007","author":[{"given":"Md. Jawaherul","family":"Alam","sequence":"first","affiliation":[]},{"given":"Franz J.","family":"Brandenburg","sequence":"additional","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"369","DOI":"10.4171\/dm\/214","volume":"11","author":"I. B\u00e1r\u00e1ny","year":"2006","unstructured":"B\u00e1r\u00e1ny, I., Rote, G.: Strictly convex drawings of planar graphs. Documenta Mathematica\u00a011, 369\u2013391 (2006)","journal-title":"Documenta Mathematica"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00493-004-0012-0","volume":"24","author":"I. B\u00e1r\u00e1ny","year":"2004","unstructured":"B\u00e1r\u00e1ny, I., Tokushige, N.: The minimum area of convex lattice n-gons. Combinatorica\u00a024(2), 171\u2013185 (2004)","journal-title":"Combinatorica"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0012-365X(82)90193-5","volume":"40","author":"I. Baybars","year":"1982","unstructured":"Baybars, I.: On k-path hamiltonian maximal planar graphs. Discrete Mathematics\u00a040(1), 119\u2013121 (1982)","journal-title":"Discrete Mathematics"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02941309","volume":"53","author":"R. Bodendiek","year":"1983","unstructured":"Bodendiek, R., Schumacher, H., Wagner, K.: Bemerkungen zu einem Sechsfarbenproblem von G. Ringel. Abh. aus dem Math. Seminar der Univ. Hamburg\u00a053, 41\u201352 (1983)","journal-title":"Abh. aus dem Math. Seminar der Univ. Hamburg"},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s00453-006-0177-6","volume":"47","author":"N. Bonichon","year":"2007","unstructured":"Bonichon, N., Felsner, S., Mosbah, M.: Convex drawings of 3-connected plane graphs. Algorithmica\u00a047(4), 399\u2013420 (2007)","journal-title":"Algorithmica"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-36763-2_29","volume-title":"Graph Drawing","author":"F.J. Brandenburg","year":"2013","unstructured":"Brandenburg, F.J., Eppstein, D., Glei\u00dfner, A., Goodrich, M.T., Hanauer, K., Reislhuber, J.: On the density of maximal 1-planar graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 327\u2013338. Springer, Heidelberg (2013)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Goodrich, M.T., Tamassia, R.: Convex drawings of graphs in two and three dimensions. In: Symposium on Computational Geometry, pp. 319\u2013328 (1996)","DOI":"10.1145\/237218.237401"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M. Chrobak","year":"1997","unstructured":"Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. International Journal of Computational Geometry and Applications\u00a07(3), 211\u2013223 (1997)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"7","key":"8_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.ipl.2013.01.013","volume":"113","author":"W. Didimo","year":"2013","unstructured":"Didimo, W.: Density of straight-line 1-planar graph drawings. Information Processing Letter\u00a0113(7), 236\u2013240 (2013)","journal-title":"Information Processing Letter"},{"key":"8_CR10","unstructured":"Dolev, D., Leighton, T., Trickey, H.: Planar embedding of planar graphs. In: Advances in Computing Research, pp. 147\u2013161 (1984)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-36763-2_30","volume-title":"Graph Drawing","author":"P. Eades","year":"2013","unstructured":"Eades, P., Hong, S.H., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: Testing maximal 1-planarity of graphs with a rotation system in linear time. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 339\u2013345. Springer, Heidelberg (2013)"},{"key":"8_CR12","first-page":"149","volume":"29","author":"R.B. Eggleton","year":"1986","unstructured":"Eggleton, R.B.: Rectilinear drawings of graphs. Utilitas Math.\u00a029, 149\u2013172 (1986)","journal-title":"Utilitas Math."},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00224-005-1143-4","volume":"38","author":"C. Erten","year":"2005","unstructured":"Erten, C., Kobourov, S.G.: Simultaneous embedding of a planar graph and its dual on the grid. Theory of Computing Systems\u00a038(3), 313\u2013327 (2005)","journal-title":"Theory of Computing Systems"},{"issue":"7-8","key":"8_CR14","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1016\/j.disc.2005.11.056","volume":"307","author":"I. Fabrici","year":"2007","unstructured":"Fabrici, I., Madaras, T.: The structure of 1-planar graphs. Discrete Mathematics\u00a0307(7-8), 854\u2013865 (2007)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"8_CR15","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"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-0010-x","volume":"49","author":"A. Grigoriev","year":"2007","unstructured":"Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica\u00a049(1), 1\u201311 (2007)","journal-title":"Algorithmica"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-32241-9_29","volume-title":"Computing and Combinatorics","author":"S.-H. Hong","year":"2012","unstructured":"Hong, S.-H., Eades, P., Liotta, G., Poon, S.-H.: F\u00e1ry\u2019s theorem for 1-planar graphs. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol.\u00a07434, pp. 335\u2013346. Springer, Heidelberg (2012)"},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1002\/jgt.21630","volume":"72","author":"V.P. Korzhik","year":"2013","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. Journal of Graph Theory\u00a072(1), 30\u201371 (2013)","journal-title":"Journal of Graph Theory"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J. Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with a few crossings per edge. Combinatorica\u00a017, 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02996313","volume":"29","author":"G. Ringel","year":"1965","unstructured":"Ringel, G.: Ein Sechsfarbenproblem auf der Kugel. Abh. aus dem Math. Seminar der Univ. Hamburg\u00a029, 107\u2013117 (1965)","journal-title":"Abh. aus dem Math. Seminar der Univ. Hamburg"},{"key":"8_CR21","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Johnson, D.S. (ed.) Symposium on Discrete Algorithms, pp. 138\u2013148 (1990)"},{"issue":"4","key":"8_CR22","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1137\/090746835","volume":"24","author":"Y. Suzuki","year":"2010","unstructured":"Suzuki, Y.: Re-embeddings of maximum 1-planar graphs. SIAM Journal of Discrete Mathematics\u00a024(4), 1527\u20131540 (2010)","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"3","key":"8_CR23","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/jgt.3190120306","volume":"12","author":"C. Thomassen","year":"1988","unstructured":"Thomassen, C.: Rectilinear drawings of graphs. Journal of Graph Theory\u00a012(3), 335\u2013341 (1988)","journal-title":"Journal of Graph Theory"},{"issue":"52","key":"8_CR24","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. London Math. Society\u00a013(52), 743\u2013768 (1963)","journal-title":"Proc. London Math. Society"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T11:42:18Z","timestamp":1688816538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}