{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T19:24:42Z","timestamp":1776108282682,"version":"3.50.1"},"reference-count":8,"publisher":"IEEE","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1109\/ldav.2011.6092334","type":"proceedings-article","created":{"date-parts":[[2011,12,6]],"date-time":"2011-12-06T16:00:47Z","timestamp":1323187247000},"page":"131-132","source":"Crossref","is-referenced-by-count":1,"title":["Preserving proximity relations and minimizing edge-crossings in high dimensional graph visualizations"],"prefix":"10.1109","author":[{"given":"Amina","family":"Shabbeer","sequence":"first","affiliation":[{"name":"Rensselaer Polytechnic Institute, USA"}]},{"given":"Cagri","family":"Ozcaglar","sequence":"additional","affiliation":[{"name":"Rensselaer Polytechnic Institute, USA"}]},{"given":"B\u00fclent","family":"Yener","sequence":"additional","affiliation":[{"name":"Rensselaer Polytechnic Institute, USA"}]},{"given":"Kristin P.","family":"Bennett","sequence":"additional","affiliation":[{"name":"Rensselaer Polytechnic Institute, USA"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-540-31843-9_25","article-title":"Graph drawing by stress majorization","volume":"3383","author":"gansner","year":"2004","journal-title":"Lecture Notes in Computer Science"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.1561\/9781601984616","author":"boyd","year":"2010","journal-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1162\/089976603321780317"},{"key":"7","author":"puppe","year":"2008","journal-title":"Spectral Graph Drawing A Survey"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971255"},{"key":"5","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1007\/3-540-45071-8_50","article-title":"On spectral graph drawing","author":"koren","year":"2003","journal-title":"Computing and Combinatorics"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/0604033"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3264-1"}],"event":{"name":"2011 IEEE Symposium on Large Data Analysis and Visualization (LDAV)","location":"Providence, RI, USA","start":{"date-parts":[[2011,10,23]]},"end":{"date-parts":[[2011,10,24]]}},"container-title":["2011 IEEE Symposium on Large Data Analysis and Visualization"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6083212\/6092173\/06092334.pdf?arnumber=6092334","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T18:26:58Z","timestamp":1756319218000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6092334\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":8,"URL":"https:\/\/doi.org\/10.1109\/ldav.2011.6092334","relation":{},"subject":[],"published":{"date-parts":[[2011,10]]}}}