{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:33Z","timestamp":1725664113328},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540589501"},{"type":"electronic","value":"9783540491552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-58950-3_397","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:55:27Z","timestamp":1330275327000},"page":"436-443","source":"Crossref","is-referenced-by-count":0,"title":["A practical approach to static node positioning"],"prefix":"10.1007","author":[{"given":"Junhui","family":"Luo","sequence":"first","affiliation":[]},{"given":"Kanth","family":"Miriyala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M. and Mattheyses, R.M., A Linear-Time Heuristic for Improving Network Partitions, Proceedings of the 19th Design Automation Conference, IEEE, 1982, pp.175\u2013181.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"Miriyala, K. Hornick, S.W., and Tamassia, R, An Incremental Approach to Aesthetic Graph Layout, Proc. of 6th Intl. Workshop on Computer-Aided Software Engineering, 1993, pp.297\u2013308.","DOI":"10.1109\/CASE.1993.634832"},{"key":"47_CR3","unstructured":"Naidu, B. and Miriyala, K., Space Creation and Compaction in Dynamic Diagramming, Andersen Consulting Internal Paper."},{"key":"47_CR4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W. and Lin, S.: An Efficient Heuristic Procedure for Partitioning graphs, Bell System Technical Journal, Vol. 49, Feb. 1970, pp.291\u2013307.","journal-title":"Bell System Technical Journal"},{"key":"47_CR5","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"Eades, P.: A Heuristic for Graph Drawing, Congressus Numerantium, Vol. 42, pp. 149\u2013160, 1984.","journal-title":"Congressus Numerantium"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Di Battista, Eades, P., and Tamassia, R.: Algorithms for Drawing Graphs: an Annotated bibliography, unpublished paper, March, 1993.","DOI":"10.1016\/0925-7721(94)00014-X"},{"issue":"No.11","key":"47_CR7","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T.M.J. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J. and Reingold, E.M.: Graph Drawing by Force-Directed Placement, Software Practice and Experience, Vol. 21, No. 11, pp. 1129\u20131164, 1991","journal-title":"Software Practice and Experience"},{"issue":"No.1","key":"47_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R. Tamassia","year":"1988","unstructured":"Tamassia, R., Di Battista, G., and Batini, C.: Automatic Graph Drawing and Readability of Diagrams, IEEE Trans. on Systems, Man, and Cybernetics, Vol. 18, No. 1, pp. 61\u201379, 1988.","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics"},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"Kamada, T.: On Visualization of Abstract Objects and Relations, Ph.D. thesis, Department of Information Science, University of Tokyo, 1988.","DOI":"10.1142\/0922"},{"key":"47_CR10","unstructured":"Garey, M., and Johnson, D.: Computers and Intractability: a guide to the theory of NP-completeness, W. Freeman and Company, 1979."},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Cai, J.,Han, X., and Tarjan, R.E.,: An O(m log n)-time Algorithm for the Maximal Subgraph Problem, SIAM J. on Computing, 1993.","DOI":"10.1137\/0222068"},{"key":"47_CR12","unstructured":"Batini, C., Nardelli, E., Talamo, M., and Tamassia, R.: A Graphtheoretic Approach to Aesthetic Layout of Information Systems Diagrams, Proc. 10th Intl. Workshop on Graphtheoretic Concepts in Computer Science (Berlin, June 1984), pp.9\u201318, Trauner Verlag, 1984."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58950-3_397.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T08:47:33Z","timestamp":1640940453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_397"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_397","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}