{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T08:33:18Z","timestamp":1766305998508,"version":"3.48.0"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:00:00Z","timestamp":1758672000000},"content-version":"vor","delay-in-days":266,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1016\/j.procs.2025.09.353","type":"journal-article","created":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T22:13:24Z","timestamp":1762467204000},"page":"2318-2325","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Logic Programming for Orthogonal Graph Drawing on Restricted Grids"],"prefix":"10.1016","volume":"270","author":[{"given":"\u0141ukasz","family":"Str\u0105k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Wieczorek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arkadiusz","family":"Nowakowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2025.09.353_bib1","doi-asserted-by":"crossref","unstructured":"Chitta Baral. Knowledge Representation, Reasoning, and Declarative Problem Solving. Cambridge University Press, 2003.","DOI":"10.1017\/CBO9780511543357"},{"key":"10.1016\/j.procs.2025.09.353_bib2","doi-asserted-by":"crossref","unstructured":"Carlo Batini, Maurizio Talamo, and Roberto Tamassia. Computer aided layout of entity relationship diagrams. Journal of Systems and Software, 4(2-3):163\u2013173, 1984.","DOI":"10.1016\/0164-1212(84)90006-2"},{"key":"10.1016\/j.procs.2025.09.353_bib3","doi-asserted-by":"crossref","unstructured":"Stina S Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, and Luca Vismara. Turn-regularity and optimal area drawings of orthogonal representations. Computational Geometry, 16(1):53\u201393, 2000.","DOI":"10.1016\/S0925-7721(99)00054-1"},{"key":"10.1016\/j.procs.2025.09.353_bib4","unstructured":"Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G Tollis. Graph drawing, volume 357. Prentice Hall, Upper Saddle River, NJ, 1999."},{"key":"10.1016\/j.procs.2025.09.353_bib5","doi-asserted-by":"crossref","unstructured":"W Didimo and G Liotta. Mining graph data (graph visualization and data mining), ch. 3, 2007.","DOI":"10.1002\/9780470073049.ch3"},{"key":"10.1016\/j.procs.2025.09.353_bib6","doi-asserted-by":"crossref","unstructured":"Markus Eiglsperger, Carsten Gutwenger, Michael Kaufmann, Joachim Kupke, Michael J\u00fcnger, Sebastian Leipert, Karsten Klein, Petra Mutzel, and Martin Siebenhaller. Automatic layout of uml class diagrams in orthogonal style. Information Visualization, 3(3):189\u2013208, 2004.","DOI":"10.1057\/palgrave.ivs.9500078"},{"key":"10.1016\/j.procs.2025.09.353_bib7","doi-asserted-by":"crossref","unstructured":"Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub. Answer Set Solving in Practice. Morgan & Claypool Publishers, 2012.","DOI":"10.1007\/978-3-031-01561-8"},{"key":"10.1016\/j.procs.2025.09.353_bib8","unstructured":"Michael J\u00fcnger and Petra Mutzel. Graph drawing software. Springer Science & Business Media, 2012."},{"issue":"7","key":"10.1016\/j.procs.2025.09.353_bib9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.3390\/info9070153","article-title":"More compact orthogonal drawings by allowing additional bends","volume":"9","author":"J\u00fcnger","year":"2018","journal-title":"Information"},{"key":"10.1016\/j.procs.2025.09.353_bib10","doi-asserted-by":"crossref","unstructured":"Gunnar W Klau and Petra Mutzel. Optimal compaction of orthogonal grid drawings. In International Conference on Integer Programming and Combinatorial Optimization, pages 304\u2013319. Springer, 1999.","DOI":"10.1007\/3-540-48777-8_23"},{"key":"10.1016\/j.procs.2025.09.353_bib11","unstructured":"Thomas Lengauer. Combinatorial algorithms for integrated circuit layout. Springer Science & Business Media, 2012."},{"key":"10.1016\/j.procs.2025.09.353_bib12","doi-asserted-by":"crossref","unstructured":"Vladimir Lifschitz. Answer set programming, volume 3. Springer Heidelberg, 2019.","DOI":"10.1007\/978-3-030-24658-7"},{"key":"10.1016\/j.procs.2025.09.353_bib13","doi-asserted-by":"crossref","unstructured":"Maurizio Patrignani. On the complexity of orthogonal compaction. Computational Geometry, 19(1):47\u201367, 2001.","DOI":"10.1016\/S0925-7721(01)00010-4"},{"key":"10.1016\/j.procs.2025.09.353_bib14","unstructured":"Martin Siebenhaller. Orthogonal graph drawing with constraints: algorithms and applications. PhD thesis, Universit\u00e4t T\u00fcbingen, 2009."},{"key":"10.1016\/j.procs.2025.09.353_bib15","doi-asserted-by":"crossref","unstructured":"Roberto Tamassia. Handbook of graph drawing and visualization. CRC press, 2013.","DOI":"10.1201\/b15385"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925030261?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925030261?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T08:28:41Z","timestamp":1766305721000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050925030261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":15,"alternative-id":["S1877050925030261"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2025.09.353","relation":{},"ISSN":["1877-0509"],"issn-type":[{"type":"print","value":"1877-0509"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Logic Programming for Orthogonal Graph Drawing on Restricted Grids","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2025.09.353","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}