{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:59:22Z","timestamp":1725465562797},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_7","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T12:57:16Z","timestamp":1368622636000},"page":"73-84","source":"Crossref","is-referenced-by-count":1,"title":["On the Characterization of Plane Bus Graphs"],"prefix":"10.1007","author":[{"given":"Till","family":"Bruckdorfer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Felsner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Ada, A., Coggan, M., Marco, P.D., Doyon, A., Flookes, L., Heilala, S., Kim, E., Wing, J.L.O., Pr\u00e9ville-Ratelle, L.F., Whitesides, S., Yu, N.: On bus graph realizability. CCCG abs\/cs\/0609127, 229\u2013232 (2007)","key":"7_CR1"},{"issue":"1-3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0012-365X(00)00201-6","volume":"229","author":"H. Fraysseix De","year":"2001","unstructured":"De Fraysseix, H., De Mendez, P.O.: On topological aspects of orientations. Discrete Mathematics\u00a0229(1-3), 57\u201372 (2001)","journal-title":"Discrete Mathematics"},{"unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)","key":"7_CR3"},{"doi-asserted-by":"crossref","unstructured":"Felsner, S.: Rectangle and square representations of planar graphs. In: Pach, J. (ed.) Thirty Essays in Geometric Graph Theory, Algorithms and Combinatorics, vol.\u00a029. Springer (2012)","key":"7_CR4","DOI":"10.1007\/978-1-4614-0110-0_12"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1016\/j.jcta.2010.03.017","volume":"18","author":"S. Felsner","year":"2011","unstructured":"Felsner, S., Fusy, \u00c9., Noy, M., Orden, D.: Bijections for Baxter families and related objects. Journal of Comb. Theory A\u00a018, 993\u20131020 (2011)","journal-title":"Journal of Comb. Theory A"},{"issue":"3","key":"7_CR6","first-page":"115","volume":"12","author":"S. Felsner","year":"2010","unstructured":"Felsner, S., Huemer, C., Kappes, S., Orden, D.: Binary labelings for plane quadrangulations and their relatives. Discrete Mathematics & Theoretical Computer Science\u00a012(3), 115\u2013138 (2010)","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"unstructured":"Fusy, E.: Combinatoire des cartes planaires et applications algorithmiques. Ph.D. thesis, LIX Ecole Polytechnique (2007)","key":"7_CR7"},{"doi-asserted-by":"crossref","unstructured":"Hanan, M.: On Steiner\u2019s problem with rectilinear distance. SIAM J. Appl. Math (14), 255\u2013265 (1966)","key":"7_CR8","DOI":"10.1137\/0114025"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.1137\/0222072","volume":"22","author":"X. He","year":"1993","unstructured":"He, X.: On finding the rectangular duals of planar triangular graphs. SIAM J. Comput.\u00a022, 1218\u20131226 (1993)","journal-title":"SIAM J. Comput."},{"unstructured":"Hwang, F.W., Richards, D.S., Winter, P.: The Steiner tree problem. Annals of Discrete Mathematics (53) (1992)","key":"7_CR10"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs, Methods and Models","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs, Methods and Models. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"doi-asserted-by":"crossref","unstructured":"Lengauer, T.: VLSI theory. In: Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), pp. 835\u2013868 (1990)","key":"7_CR12","DOI":"10.1016\/B978-0-444-88071-0.50021-7"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-005-1187-5","volume":"45","author":"M. Mucha","year":"2006","unstructured":"Mucha, M., Sankowski, P.: Maximum matchings in planar graphs via gaussian elimination. Algorithmica\u00a045(1), 3\u201320 (2006)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific (2004)","key":"7_CR14","DOI":"10.1142\/5648"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete & Computational Geometry\u00a01, 343\u2013353 (1986)","journal-title":"Discrete & Computational Geometry"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: A unified approach a visibility representation of planar graphs. Discrete & Computational Geometry\u00a01, 321\u2013341 (1986)","journal-title":"Discrete & Computational Geometry"},{"unstructured":"Thompson, C.D.: A Complexity Theory for VLSI. Ph.D. thesis, Carnegie-Mellon University (1980)","key":"7_CR17"},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/B:JOCO.0000021940.40066.0c","volume":"8","author":"X. Zhou","year":"2004","unstructured":"Zhou, X., Nishizeki, T.: Algorithm for the cost edge-coloring of trees. J. Comb. Optim.\u00a08(1), 97\u2013108 (2004)","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T01:39:22Z","timestamp":1557711562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}