{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:36:45Z","timestamp":1725824205540},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200859"},{"type":"electronic","value":"9783319200866"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20086-6_27","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:10Z","timestamp":1434702430000},"page":"352-364","source":"Crossref","is-referenced-by-count":3,"title":["The Effect of Almost-Empty Faces on Planar Kandinsky Drawings"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Krug","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Siebenhaller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-70904-6_33","volume-title":"Graph Drawing","author":"W Barth","year":"2007","unstructured":"Barth, W., Mutzel, P., Y\u0131ld\u0131z, C.: A new approximation algorithm for bend minimization in the kandinsky model. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 343\u2013354. Springer, Heidelberg (2007)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-319-03841-4_37","volume-title":"Graph Drawing","author":"MA Bekos","year":"2013","unstructured":"Bekos, M.A., Kaufmann, M., Krug, R., N\u00e4her, S., Roselli, V.: Slanted orthogonal drawings. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 424\u2013435. Springer, Heidelberg (2013)"},{"issue":"8","key":"27_CR3","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1109\/12.868028","volume":"49","author":"P Bertolazzi","year":"2000","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. IEEE Transactions on Computers 49(8), 826\u2013840 (2000)","journal-title":"IEEE Transactions on Computers"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/978-3-662-44777-2_14","volume-title":"Algorithms - ESA 2014","author":"T Bl\u00e4sius","year":"2014","unstructured":"Bl\u00e4sius, T., Br\u00fcckner, G., Rutter, I.: Complexity of higher-degree orthogonal graph embedding in the kandinsky model. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 161\u2013172. Springer, Heidelberg (2014)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Chen, D.S., Batson, R.G., Dang, Y.: Applied Integer Programming: Modeling and Solution. Wiley (2010)","DOI":"10.1002\/9781118166000"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G Battista Di","year":"1999","unstructured":"Di Battista, G., Didimo, W., Patrignani, M., Pizzonia, M.: Orthogonal and quasi-upward drawings with vertices of prescribed size. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 297\u2013310. Springer, Heidelberg (1999)"},{"key":"27_CR7","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall PTR (1998)"},{"key":"27_CR8","unstructured":"Duncan, C.A., Goodrich, M.T.: Graph drawing and cartography. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, chap. 7, pp. 223\u2013246. CRC Press (2013)"},{"key":"27_CR9","unstructured":"Eiglsperger, M.: Automatic Layout of UML Class Diagrams: A Topology-Shape-Metrics Approach. Ph.D. thesis, Universit\u00e4t T\u00fcbingen (2003)"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44969-8_6","volume-title":"Drawing Graphs","author":"M Eiglsperger","year":"2001","unstructured":"Eiglsperger, M., Fekete, S.P., Klau, G.W.: Orthogonal Graph Drawing. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol. 2025, pp. 121\u2013171. Springer, Heidelberg (2001)"},{"key":"27_CR11","unstructured":"Eiglsperger, M., F\u00f6\u00dfmeier, U., Kaufmann, M.: Orthogonal graph drawing with constraints. In: Shmoys, D.B. (ed.) Symposium on Discrete Algorithms, pp. 3\u201311. ACM\/SIAM (2000)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/3-540-45848-4_11","volume-title":"Graph Drawing","author":"M Eiglsperger","year":"2002","unstructured":"Eiglsperger, M., Kaufmann, M.: Fast compaction for orthogonal drawings with vertices of prescribed size. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 124\u2013138. Springer, Heidelberg (2002)"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Graph Drawing","author":"U F\u00f6\u00dfmeier","year":"1996","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Drawing high degree graphs with low bend numbers. In: Brandenburg, Franz J. (ed.) GD 1995. LNCS, vol. 1027, pp. 254\u2013266. Springer, Heidelberg (1996)"},{"key":"27_CR14","unstructured":"Gurobi Optimization, I.: Gurobi optimizer reference manual (2014). \n                      http:\/\/www.gurobi.com"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E.: Area-efficient graph layouts. In: Foundations of Computer Science, pp. 270\u2013281. IEEE Computer Society (1980)","DOI":"10.1109\/SFCS.1980.13"},{"issue":"3","key":"27_CR16","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM Journal of Computing 16(3), 421\u2013444 (1987)","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"27_CR17","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"100","author":"LG Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Transaction on Computers 100(2), 135\u2013140 (1981)","journal-title":"IEEE Transaction on Computers"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20086-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T06:55:51Z","timestamp":1559199351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-20086-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200859","9783319200866"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20086-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}