{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:54Z","timestamp":1761611214678},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662006"},{"type":"electronic","value":"9783540486862"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48686-0_8","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T11:54:12Z","timestamp":1184586852000},"page":"81-91","source":"Crossref","is-referenced-by-count":9,"title":["An Approximation Algorithm for the Two-Layered Graph Drawing Problem"],"prefix":"10.1007","author":[{"given":"Atsuko","family":"Yamaguchi","sequence":"first","affiliation":[]},{"given":"Akihiro","family":"Sugimoto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,6,25]]},"reference":[{"key":"8_CR1","unstructured":"C. Batini, L. Furlani, and E. Nardelli: What Is a Good Diagram?: A Pragmatic Approach, Proc. of the 4th International Conference on Entity-Relationship Approach, pp. 312\u2013319, 1985."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis: Algorithms for Drawing Graphs: An Annotated Bibliography, Computational Geometry, 4 (1994), pp. 235\u2013282.","journal-title":"Computational Geometry"},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/21.364865","volume":"25","author":"T. Catarci","year":"1995","unstructured":"T. Catarci: The Assignment Heuristic for Crossing Reduction, IEEE Transactions on Systems, Man, and Cybernetics, 25 (1995), 3, pp. 515\u2013521.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"8_CR4","unstructured":"P. Eades, B. D. McKay, and N. Wormald: On an Edge Crossing Problem, Proc. of the 9th Australian Computer Science Conference, pp. 327\u2013334, 1986."},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P. Eades","year":"1994","unstructured":"P. Eades and N. Wormald: Edge Crossings in Drawings of Bipartite Graphs, Algorithmica, 11 (1994), 4, pp. 379\u2013403.","journal-title":"Algorithmica"},{"issue":"4","key":"8_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0898-1221(88)90208-8","volume":"15","author":"C. Esposito","year":"1988","unstructured":"C. Esposito: Graph Graphics: Theory and Practice, Computers and Mathematics with Applications, 15 (1988), 4, pp. 247\u2013253.","journal-title":"Computers and Mathematics with Applications"},{"issue":"1","key":"8_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M. J\u00fcnger","year":"1997","unstructured":"M. J\u00fcnger and P. Mutzel: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms, Journal of Graph Algorithms and Applications, 1 (1997), 1, pp. 1\u201325.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/00207169008803921","volume":"36","author":"E. M\u00e4kinen","year":"1990","unstructured":"E. M\u00e4kinen: Experiments on Drawing 2-level Hierarchical Graphs, International Journal of Computer Mathematics, 36 (1990), pp. 175\u2013181.","journal-title":"International Journal of Computer Mathematics"},{"key":"8_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BFb0021827","volume-title":"Proc. of Symposium on Graph Drawing, GD'95","author":"H. C. Purchase","year":"1996","unstructured":"H. C. Purchase, R. F. Cohen, and M. James: Validating Graph Drawing Aesthetics, Proc. of Symposium on Graph Drawing, GD'95 (Lecture Notes in Computer Science, Vol. 1027), pp. 435\u2013446, Springer, 1996."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"K. Sugiyama, S. Tagawa, and M. Toda: Methods for Visual Understanding of Hierarchical Systems, IEEE Transactions on Systems, Man, and Cybernetics, 11 (1981), 2, pp. 109\u2013125.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"A. Yamaguchi and A. Sugimoto: An Approximation Algorithm for the Two-layered Graph Drawing Problem, ARL Research Report, 98-001, 1999.","DOI":"10.1007\/3-540-48686-0_8"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48686-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:13:03Z","timestamp":1556665983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48686-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662006","9783540486862"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-48686-0_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}