{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:48Z","timestamp":1720640808273},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"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":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1016\/s1571-0653(05)80039-3","type":"journal-article","created":{"date-parts":[[2005,4,30]],"date-time":"2005-04-30T11:22:13Z","timestamp":1114860133000},"page":"128-132","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Equilateral Drawing of 2-Connected Planar Chordal Graphs"],"prefix":"10.1016","volume":"3","author":[{"given":"L.","family":"Markenzon","sequence":"first","affiliation":[]},{"given":"N.","family":"Paciornik","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80039-3_BIB1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"Algorithms for Automatic Graph Drawing: An Annotated Bibliography","volume":"4","author":"Di Battista","year":"1994","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S1571-0653(05)80039-3_BIB2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0166-218X(90)90110-X","article-title":"Fixed Edge-Length Graph Drawing is NP-Hard","volume":"28","author":"Eades","year":"1990","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/S1571-0653(05)80039-3_BIB3","unstructured":"Kant, G., Algorithms for Drawing Planar Graphs, Ph. D. Thesis, University of Utrecht, Nederlands, (1993)."},{"key":"10.1016\/S1571-0653(05)80039-3_BIB4","doi-asserted-by":"crossref","unstructured":"Kumar, P.S., Madhavan, C.E.V., A New Class of Separators and Planarity of Chordal Graphs, Proc. Ninth FST&TCS Conf., Lecture Notes in Comput. Sci. 405 (1989), 30-41.","DOI":"10.1007\/3-540-52048-1_30"},{"key":"10.1016\/S1571-0653(05)80039-3_BIB5","unstructured":"Markenzon, L., N. Paciornik, Equilateral Drawing of Planar Chordal Graphs, Tec. Rep. RT 020\/DE9\/97 IME, (1997)."},{"key":"10.1016\/S1571-0653(05)80039-3_BIB6","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/0210028","article-title":"Recursive Graphs, Recursive Labelings and Shortest Paths","volume":"10","author":"Proskurowski","year":"1981","journal-title":"Siam J. of Comput."},{"key":"10.1016\/S1571-0653(05)80039-3_BIB7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","article-title":"On Simple Characterizations of k-trees","volume":"7","author":"Rose","year":"1974","journal-title":"Disc. Math."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305800393?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305800393?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T07:05:36Z","timestamp":1550387136000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305800393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":7,"alternative-id":["S1571065305800393"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80039-3","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}