{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:36Z","timestamp":1759638456959},"reference-count":11,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0020-0190(01)00297-6","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"293-298","source":"Crossref","is-referenced-by-count":7,"title":["New bounds on the barycenter heuristic for bipartite graph drawing"],"prefix":"10.1016","volume":"82","author":[{"given":"Xiao Yu","family":"Li","sequence":"first","affiliation":[]},{"given":"Matthias F.","family":"Stallmann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00297-6_BIB001","series-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"Di Battista","year":"1999"},{"key":"10.1016\/S0020-0190(01)00297-6_BIB002","series-title":"Proc. 9th Australian Computer Science Conference","first-page":"327","article-title":"On an edge crossing problem","author":"Eades","year":"1986"},{"key":"10.1016\/S0020-0190(01)00297-6_BIB003","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0304-3975(94)90179-1","article-title":"Drawing graphs in two layers","volume":"131","author":"Eades","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(01)00297-6_BIB004","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01187020","article-title":"Edge crossings in drawings of bipartite graphs","volume":"11","author":"Eades","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(01)00297-6_BIB005","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","article-title":"Crossing number is NP-complete","volume":"4","author":"Garey","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0020-0190(01)00297-6_BIB006","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1112\/S0025579300008494","article-title":"Trees with Hamiltonian square","volume":"18","author":"Harary","year":"1971","journal-title":"Mathematika"},{"key":"10.1016\/S0020-0190(01)00297-6_BIB007","first-page":"203","article-title":"A new crossing number for bipartite graphs","volume":"1","author":"Harary","year":"1972","journal-title":"Utilitas Math."},{"key":"10.1016\/S0020-0190(01)00297-6_BIB008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","article-title":"2-layer straightline crossing minimization: Performance of exact and heuristic algorithms","volume":"1","author":"J\u00fcnger","year":"1997","journal-title":"J. Graph Algorithms Appl. (JGAA)"},{"key":"10.1016\/S0020-0190(01)00297-6_BIB009","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/00207169008803921","article-title":"Experiments on drawing 2-level hierarchical graphs","volume":"36","author":"M\u00e4kinen","year":"1990","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0020-0190(01)00297-6_BIB010","first-page":"156","article-title":"A conjecture on the error bound of the barycenter heuristic","volume":"70","author":"M\u00e4kinen","year":"2000","journal-title":"EATCS Bull."},{"key":"10.1016\/S0020-0190(01)00297-6_BIB011","series-title":"COCOON","first-page":"81","article-title":"An approximation algorithm for the two-layered graph drawing problem","volume":"1627","author":"Yamaguchi","year":"1999"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002976?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002976?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:53:09Z","timestamp":1556650389000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002976"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0020019001002976"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00297-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}