{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:20Z","timestamp":1725567080249},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_86","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"849-858","source":"Crossref","is-referenced-by-count":7,"title":["On the Complexity of the Balanced Vertex Ordering Problem"],"prefix":"10.1007","author":[{"given":"Jan","family":"K\u00e1ra","sequence":"first","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"86_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.dam.2004.12.001","volume":"148","author":"T. Biedl","year":"2005","unstructured":"Biedl, T., Chan, T., Ganjali, Y., Hajiaghayi, M.T., Wood, D.R.: Balanced vertex-orderings of graphs. Discrete Applied Mathematics\u00a0148(1), 27\u201348 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"86_CR2","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica\u00a016, 4\u201332 (1996)","journal-title":"Algorithmica"},{"issue":"1-2","key":"86_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(95)00257-X","volume":"172","author":"G. Kant","year":"1997","unstructured":"Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science\u00a0172(1-2), 175\u2013193 (1997)","journal-title":"Theoretical Computer Science"},{"key":"86_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0925-7721(97)00017-5","volume":"9","author":"A. Papakostas","year":"1998","unstructured":"Papakostas, A., Tollis, I.G.: Algorithms for area-efficient orthogonal drawings. Computational Geometry: Theory and Applications\u00a09, 83\u2013110 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"86_CR5","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/800133.804350","volume-title":"Proceedings of 10th Annual ACM Symposium on Theory of Computing (STOC 1978)","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of 10th Annual ACM Symposium on Theory of Computing (STOC 1978), pp. 216\u2013226. ACM, New York (1978)"},{"key":"86_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00453-004-1091-4","volume":"39","author":"D.R. Wood","year":"2004","unstructured":"Wood, D.R.: Minimizing the number of bends and volume in three-dimensional orthogonal graph drawings with a diagonal vertex layout. Algorithmica\u00a039, 235\u2013253 (2004)","journal-title":"Algorithmica"},{"issue":"1-3","key":"86_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(02)00044-0","volume":"299","author":"D.R. Wood","year":"2003","unstructured":"Wood, D.R.: Optimal three-dimensional orthogonal graph drawing in the general position model. Theoretical Computer Science\u00a0299(1-3), 151\u2013178 (2003)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_86","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T03:19:45Z","timestamp":1553138385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_86"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11533719_86","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}