{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:51Z","timestamp":1725524631046},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_25","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"266-277","source":"Crossref","is-referenced-by-count":3,"title":["On the Hardness of Orthogonal-Order Preserving Graph Drawing"],"prefix":"10.1007","author":[{"given":"Ulrik","family":"Brandes","sequence":"first","affiliation":[]},{"given":"Barbara","family":"Pampel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00453-005-1165-y","volume":"42","author":"P. Agarwal","year":"2000","unstructured":"Agarwal, P., Har-Peled, S., Mustafa, N., Wang, Y.: Near-linear time approximation algorithms for path simplification. Algorithmica\u00a042, 203\u2013219 (2000)","journal-title":"Algorithmica"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1007\/11602613_110","volume-title":"Algorithms and Computation","author":"C. Bachmaier","year":"2005","unstructured":"Bachmaier, C., Brandes, U., Schlieper, B.: Drawing phylogenetic trees. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 1110\u20131121. Springer, Heidelberg (2005)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Boehringer, K.-F., Newbery Paulisch, F.: Using constraints to achieve stability in automatic graph algorithms. In: Proc. of the ACM SIGCHI Conference on Human Factors in Computer Systems, pp. 43\u201351. WA (1990)","DOI":"10.1145\/97243.97250"},{"issue":"3","key":"25_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.7155\/jgaa.00053","volume":"6","author":"S. Bridgeman","year":"2002","unstructured":"Bridgeman, S., Tamassia, R.: A user study in similarity measures for graph drawing. JGAA\u00a06(3), 225\u2013254 (2002)","journal-title":"JGAA"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-37623-2_5","volume-title":"Graph Drawing","author":"S. Bridgeman","year":"1999","unstructured":"Bridgeman, S., Tamassia, R.: Difference metrics for interactive orthogonal graph drawing algorithms. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 57\u201371. Springer, Heidelberg (1999)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-70904-6_9","volume-title":"Graph Drawing","author":"J. Carlson","year":"2007","unstructured":"Carlson, J., Eppstein, D.: Trees with convex faces and optimal angles. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 77\u201388. Springer, Heidelberg (2007)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/11618058_14","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2006","unstructured":"Dwyer, T., Koren, Y., Marriott, K.: Stress majorization with orthogonal order constraints. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 141\u2013152. Springer, Heidelberg (2006)"},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"D. Douglas","year":"1973","unstructured":"Douglas, D., Peucker, T.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Canad. Cartog.\u00a010(2), 112\u2013122 (1973)","journal-title":"Canad. Cartog."},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"R. Eades","year":"1995","unstructured":"Eades, R., Lai, W., Misue, K., Sugiyama, K.: Layout adjustment and the mental map. J. Visual Lang. Comput.\u00a06, 183\u2013210 (1995)","journal-title":"J. Visual Lang. Comput."},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0166-218X(90)90110-X","volume":"28","author":"P. Eades","year":"1990","unstructured":"Eades, P., Wormald, N.: Fixed edge-length graph drawing is \n                    \n                      \n                    \n                    \n$\\mathcal {NP}$\n\n                  -hard. Discrete Appl. Math.\u00a028, 111\u2013134 (1990)","journal-title":"Discrete Appl. Math."},{"key":"25_CR11","volume-title":"Computers and Intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. W. H. Freeman and Company, New York (1979)"},{"issue":"3","key":"25_CR12","first-page":"159","volume":"9","author":"H. Imai","year":"1986","unstructured":"Imai, H., Iri, M.: An optimal algorithm for approximating a piecewise linear function. J. Inform. Process.\u00a09(3), 159\u2013162 (1986)","journal-title":"J. Inform. Process."},{"key":"25_CR13","unstructured":"Lee, Y.-Y., Lin, C.-C., Yen, H.-C.: Mental map preserving graph drawing using simulated annealing. In: Proc. of the 2006 Asia-Pacific Symposium on Inforamtion Visualisation, pp. 179\u2013188. Australian Computer Science (2006)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-70904-6_26","volume-title":"Graph Drawing","author":"D. Merrick","year":"2007","unstructured":"Merrick, D., Gudmundsson, J.: Path simplification for metro map layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 258\u2013269. Springer, Heidelberg (2007)"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-48447-7_2","volume-title":"Algorithms and Data Structures","author":"G. Neyer","year":"1999","unstructured":"Neyer, G.: Line simplification with restricted orientations. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol.\u00a01663, pp. 13\u201324. Springer, Heidelberg (1999)"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/11618058_29","volume-title":"Graph Drawing","author":"M. N\u00f6llenburg","year":"2006","unstructured":"N\u00f6llenburg, M., Wolff, A.: A mixed-integer program for drawing high-quality metro maps. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 321\u2013333. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T00:32:15Z","timestamp":1551745935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}