{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T00:58:35Z","timestamp":1778547515068,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":[[2001,6]]},"DOI":"10.1016\/s1571-0653(04)00327-0","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T09:34:04Z","timestamp":1113039244000},"page":"269-277","source":"Crossref","is-referenced-by-count":14,"special_numbering":"C","title":["A Satisfiability Formulation of Problems on Level Graphs"],"prefix":"10.1016","volume":"9","author":[{"given":"Bert","family":"Randerath","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ewald","family":"Speckenmeyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Endre","family":"Boros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Hammer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Kogan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Simeone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ondrej","family":"Cepek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S1571-0653(04)00327-0_BIB1","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1109\/21.23105","article-title":"Hierarchies and planarity theory","volume":"18","author":"Di Battista","year":"1988","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"10.1016\/S1571-0653(04)00327-0_BIB2","series-title":"Graph Drawing","author":"Di Battista","year":"1998"},{"key":"10.1016\/S1571-0653(04)00327-0_BIB3","first-page":"327","article-title":"On an edge crossing problem","author":"Eades","year":"1986","journal-title":"Proc. 9th Australian Computer Science Conference, Australian National University"},{"issue":"3","key":"10.1016\/S1571-0653(04)00327-0_BIB4","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 Journal on Algebraic and Discrete Methods"},{"key":"10.1016\/S1571-0653(04)00327-0_BIB5","unstructured":"L. Heath and S. Pemmaraju, Recognizing leveled-planar dags in linear time, In F. J. Brandenburg, editor, Proc. Graph Drawing 95', vol. 1027 of Lecture Notes in Computer Science, Springer Verlag, pp. 300-311."},{"key":"10.1016\/S1571-0653(04)00327-0_BIB6","unstructured":"P. Healy and A. Kuusik Characterisation of Level Non-Planar Graphs by Minimal Patterns, Technical Report UL-CSIS-98-4, Department of Computer Science & Information, University of Limerick, e"},{"key":"10.1016\/S1571-0653(04)00327-0_BIB7","unstructured":"P. Healy and A. Kuusik The Vertex-Exchange Graph and its use in Multi-Level Graph Layout, Technical Report UL-CSIS- 99-1, Department of Computer Science &: Information, University of Limerick."},{"key":"10.1016\/S1571-0653(04)00327-0_BIB8","first-page":"263","article-title":"Local Search Algorithms for Partial MAXSAT","author":"Iwam","year":"1997","journal-title":"Proc. AAAI'97"},{"key":"10.1016\/S1571-0653(04)00327-0_BIB9","unstructured":"M. J\u00fcnger, E. K. Lee, P. Mutzel and T. Odenthal, A polyhedral approach to the multi-layer crossing minimization problem, In G. Di. Battista, editor, Proc. Graph Drawing 97', vol. 1353 of Lecture Notes in Computer Science, Springer Verlag, pp. 13-24."},{"key":"10.1016\/S1571-0653(04)00327-0_BIB10","first-page":"1","volume":"1","author":"J\u00fcnger","year":"1997","journal-title":"2-layer straightline crossing minimization: Performance of exact and heuristic algorithms, Journal on Graph Algorithms and Applications"},{"key":"10.1016\/S1571-0653(04)00327-0_BIB11","series-title":"Level Planarity Testing and Embedding in Linear Time","author":"Leiper","year":"1998"},{"issue":"2","key":"10.1016\/S1571-0653(04)00327-0_BIB12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","article-title":"Methods for visual understanding of hierarchical systems","volume":"11","author":"Sugiyama","year":"1981","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304003270?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304003270?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T08:50:24Z","timestamp":1548579024000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304003270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":12,"alternative-id":["S1571065304003270"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00327-0","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}