{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T20:40:49Z","timestamp":1777668049359,"version":"3.51.4"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,11,7]],"date-time":"2012-11-07T00:00:00Z","timestamp":1352246400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s00453-012-9705-8","type":"journal-article","created":{"date-parts":[[2012,11,6]],"date-time":"2012-11-06T20:04:47Z","timestamp":1352232287000},"page":"859-885","source":"Crossref","is-referenced-by-count":17,"title":["Orthogonal Graph Drawing with Flexibility Constraints"],"prefix":"10.1007","volume":"68","author":[{"given":"Thomas","family":"Bl\u00e4sius","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Krug","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,7]]},"reference":[{"issue":"3","key":"9705_CR1","doi-asserted-by":"crossref","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. Geom. 9(3), 159\u2013180 (1998)","journal-title":"Comput. Geom."},{"issue":"6","key":"9705_CR2","doi-asserted-by":"crossref","first-page":"1764","DOI":"10.1137\/S0097539794262847","volume":"27","author":"G. Di Battista","year":"1998","unstructured":"Di Battista, G., Liotta, G., Vargiu, F.: Spirality and optimal orthogonal drawings. SIAM J. Comput. 27(6), 1764\u20131811 (1998)","journal-title":"SIAM J. Comput."},{"key":"9705_CR3","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/s004539900017","volume":"15","author":"G. Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica 15, 302\u2013318 (1996)","journal-title":"Algorithmica"},{"issue":"5","key":"9705_CR4","doi-asserted-by":"crossref","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 Journal on Computing 25(5), 956\u2013997 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"9705_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"issue":"2","key":"9705_CR6","doi-asserted-by":"crossref","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. 31(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"key":"9705_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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: Graph Drawing. Lecture Notes in Computer Science, vol. 1984, pp. 77\u201390. Springer, Berlin\/Heidelberg (2001)"},{"issue":"1","key":"9705_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1006\/jcss.1997.1493","volume":"55","author":"M.R. Henzinger","year":"1997","unstructured":"Henzinger, M.R., Klein, P.N., Rao, S., Subramanian, S.: Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55(1), 3\u201323 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"9705_CR9","doi-asserted-by":"crossref","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. Sin. 8, 188\u2013192 (1992)","journal-title":"Acta Math. Appl. Sin."},{"issue":"1\u20133","key":"9705_CR10","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. Discrete Appl. Math. 81(1\u20133), 69\u201391 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"9705_CR11","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1137\/S0097539789162997","volume":"24","author":"G.L. Miller","year":"1995","unstructured":"Miller, G.L., Naor, J.: Flow in planar graphs with multiple sources and sinks. SIAM J. Comput. 24(5), 1002\u20131017 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"9705_CR12","doi-asserted-by":"crossref","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. Discrete Appl. Math. 141(1\u20133), 225\u2013241 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"9705_CR13","doi-asserted-by":"crossref","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. 16(3), 421\u2013444 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9705_CR14","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H. Whitney","year":"1932","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs. Am. J. Math. 54(1), 150\u2013168 (1932)","journal-title":"Am. J. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9705-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9705-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9705-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:10Z","timestamp":1559137510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9705-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,7]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9705"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9705-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,7]]}}}