{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:15:38Z","timestamp":1726409738034},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_9","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T05:30:40Z","timestamp":1297315840000},"page":"92-104","source":"Crossref","is-referenced-by-count":0,"title":["Orthogonal Graph Drawing with Flexibility Constraints"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Bl\u00e4sius","sequence":"first","affiliation":[]},{"given":"Marcus","family":"Krug","sequence":"additional","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1137\/S0097539794262847","volume":"27","author":"G.D. Battista","year":"1998","unstructured":"Battista, G.D., Liotta, G., Vargiu, F.: Spirality and optimal orthogonal drawings. SIAM J. Comput.\u00a027(6), 1764\u20131811 (1998)","journal-title":"SIAM J. Comput."},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/BFb0049394","volume-title":"Algorithms - ESA \u201994","author":"T. Biedl","year":"1994","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 24\u201335. Springer, Heidelberg (1994)"},{"key":"9_CR3","unstructured":"Bl\u00e4sius, T., Krug, M., Rutter, I., Wagner, D.: Orthogonal graph drawing with flexibility constraints. Technical Report 2010-18, Faculty of Informatics, Karlsruhe Institute of Technology, KIT (2010), \n                    \n                      http:\/\/digbib.ubka.uni-karlsruhe.de\/volltexte\/1000019793"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01961541","volume":"15","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica\u00a015(4), 302\u2013318 (1996)","journal-title":"Algorithmica"},{"issue":"5","key":"9_CR5","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput.\u00a025(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput.\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 77\u201390. Springer, Heidelberg (2001)"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/BF02006154","volume":"8","author":"Y. Liu","year":"1992","unstructured":"Liu, Y., Marchioro, P., Petreschi, R., Simeone, B.: Theoretical results on at most 1-bend embeddability of graphs. Acta Math. Appl. Sinica (English Ser.)\u00a08(2), 188\u2013192 (1992)","journal-title":"Acta Math. Appl. Sinica (English Ser.)"},{"issue":"1\u20133","key":"9_CR9","first-page":"69","volume":"81","author":"Y. Liu","year":"1998","unstructured":"Liu, Y., Morgana, A., Simeone, B.: A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid. Discr. Appl. Math.\u00a081(1\u20133), 69\u201391 (1998)","journal-title":"Discr. Appl. Math."},{"issue":"1-3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0166-218X(03)00373-1","volume":"141","author":"A. Morgana","year":"2004","unstructured":"Morgana, A., de Mello, C.P., Sontacchi, G.: An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid. Discr. Appl. Math.\u00a0141(1-3), 225\u2013241 (2004)","journal-title":"Discr. Appl. Math."},{"issue":"3","key":"9_CR11","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 J. Comput.\u00a016(3), 421\u2013444 (1987)","journal-title":"SIAM J. Comput."}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T08:31:02Z","timestamp":1553416262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}