{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T15:45:50Z","timestamp":1781797550155,"version":"3.54.5"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2016,1,31]],"date-time":"2016-01-31T00:00:00Z","timestamp":1454198400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Australian Research Council through Discovery Project","award":["DP140100077"],"award-info":[{"award-number":["DP140100077"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Visual. Comput. Graphics"],"published-print":{"date-parts":[[2016,1,31]]},"DOI":"10.1109\/tvcg.2015.2467251","type":"journal-article","created":{"date-parts":[[2015,8,13]],"date-time":"2015-08-13T22:35:03Z","timestamp":1439505303000},"page":"339-348","source":"Crossref","is-referenced-by-count":32,"title":["High-Quality Ultra-Compact Grid Layout of Grouped Networks"],"prefix":"10.1109","volume":"22","author":[{"given":"Vahan","family":"Yoghourdjian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tim","family":"Dwyer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Graeme","family":"Gange","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steve","family":"Kieffer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karsten","family":"Klein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"ref38","author":"m\u00fcller-brockmann","year":"0","journal-title":"Grid Systems in Graphic Design 1981"},{"key":"ref33","first-page":"383","article-title":"Force-directed drawing algorithms","author":"kobourov","year":"2013","journal-title":"Handbook of Graph Drawing and Visualization"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48777-8_23"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/978-3-319-03841-4_39","article-title":"Incremental grid-like layout using soft and hard constraints","author":"kieffer","year":"2013","journal-title":"Graph Drawing"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2015.2467451"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068412000130"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2012.245"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-008-0463-6"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-8-76"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFVIS.2003.1249009"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1006\/jvlc.1995.1014"},{"key":"ref29","author":"kennedy","year":"0","journal-title":"The graph landscape - a concept for the visual analysis of graph set properties"},{"key":"ref2","year":"0","journal-title":"CPLEX MIP solver"},{"key":"ref1","year":"2014","journal-title":"Graph Drawing Conference contest"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2009.109"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/PacificVis.2014.46"},{"key":"ref21","first-page":"153","article-title":"Fast node overlap removal","author":"dwyer","year":"2006","journal-title":"Graph Drawing volume 3843 of LNCS"},{"key":"ref24","article-title":"Semantic learning for lazy clause generation","author":"feydy","year":"0","journal-title":"TRICS workshop held alongside CP 2013"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","article-title":"Translating pseudo-boolean constraints into SAT","volume":"2","author":"e\u00e9n","year":"2006","journal-title":"Journal on Satisfiability Boolean Modeling and Computation"},{"key":"ref26","first-page":"239","article-title":"Graph drawing by stress majorization","author":"gansner","year":"2005","journal-title":"Proc of Graph Drawing Volume 3383 of LNCS"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18469-7_22"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11805-0_22"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-010-9105-0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2008.117"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11805-0_36"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1986.6312901"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/12.868028"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00341"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03841-4_40"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17511-4_10"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/234535.234538"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2013.151"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1109\/TVCG.2006.156","article-title":"Ipsep-cola: An incremental procedure for separation constraint layout of graphs","volume":"12","author":"dwyer","year":"2006","journal-title":"Visualization and Computer Graphics IEEE Transactions on"},{"key":"ref4","year":"0"},{"key":"ref3","year":"0","journal-title":"D3 Js"},{"key":"ref6","year":"0","journal-title":"Rome Graphs"},{"key":"ref5","year":"0","journal-title":"ILOG Concert Technology"},{"key":"ref8","year":"0","journal-title":"yFiles automatic network layout software"},{"key":"ref7","year":"0","journal-title":"webcola"},{"key":"ref49","author":"williams","year":"2013","journal-title":"M odel building in mathematical programming"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00338-9"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1000108"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11805-0_26"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1981.4308636"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24595-7_35"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","article-title":"Large neighborhood search","author":"pisinger","year":"2010","journal-title":"Handbook of Metaheuristics"},{"key":"ref41","first-page":"321","article-title":"A mixed-integer program for drawing high-quality metro maps","author":"n\u00f6llenburg","year":"2006","journal-title":"Graph Drawing volume 3843 of LNCS"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvlc.2013.08.006"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.269"}],"container-title":["IEEE Transactions on Visualization and Computer Graphics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/2945\/4359476\/07192733.pdf?arnumber=7192733","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:58:48Z","timestamp":1642003128000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7192733\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,31]]},"references-count":50,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tvcg.2015.2467251","relation":{},"ISSN":["1077-2626"],"issn-type":[{"value":"1077-2626","type":"print"}],"subject":[],"published":{"date-parts":[[2016,1,31]]}}}