{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:15Z","timestamp":1742598615967,"version":"3.40.2"},"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_372","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:54:11Z","timestamp":1330275251000},"page":"206-217","source":"Crossref","is-referenced-by-count":2,"title":["Drawing telecommunication networks"],"prefix":"10.1007","author":[{"given":"Ioannis G.","family":"Tollis","sequence":"first","affiliation":[]},{"given":"Chunliang","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"22_CR1","unstructured":"G. Di Battista,P. Eades, R. Tamassia and I. G. Tollis, \u201dAlgorithms for Automatic Graph Drawing: An Annotated Bibliography,\u201d Dept. of Comp. Science, Brown Univ., Technical Report, 1993. To appear in Comput. Geom. Theory Appl. Preliminary version available via anonymous ftp from wilma.cs.brown.edu(128.148.33.66), files \/pub\/gdbiblio.tex.Z and \/pub\/gdbiblio.ps.Z."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"G. Di Battista, E. Pietrosanti, R. Tamassia, and I.G. Tollis, \u201cAutomatic Layout of PERT Diagrams with XPERT,\u201d Proc. IEEE Workshop on Visual Languages (VL'89), pp. 171\u2013176, 1989.","DOI":"10.1109\/WVL.1989.77060"},{"key":"22_CR3","unstructured":"G.R. Dattatreya, J.P. Fonseka, K. Kiasaleh, I.H. Sudborough, I.G. Tollis, and S. Venkatesan, \u201cAdvanced Network Topologies for Network Survivability,\u201d Technical Report, UTD, January 1993."},{"key":"22_CR4","unstructured":"M.R. Garey and D.S. Johnson, \u201cComputers and Intractability: A Guide to the Theory of NP-Completeness\u201d, Freeman, 1979."},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"L.M. Gardner, M. Heydari, J. Shah, I.H. Sudborough, I.G. Tollis, and C. Xia, \u201cTechniques for Finding Ring Covers in Survivable Networks,\u201d Proceedings of IEEE GLOBECOM 1994, to appear.","DOI":"10.1109\/GLOCOM.1994.513193"},{"key":"22_CR6","unstructured":"W.D. Grover, B.D. Venables, J.H. Sandham, and A.F. Milne, \u201dPerformance Studies of a Slef-Healing Network Protocol in Telecom Canada Long Haul Networks,\u201d Proceedings of IEEE GLOBECOM 1990, pp. 403.3.1\u2013403.3.7."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"G. Kar, B. Madden and R. S. Gilbert, \u201cHeuristic layout Algorithms for Network Management Presentation Services\u201d IEEE Network, November, 1988.","DOI":"10.1109\/65.10027"},{"key":"22_CR8","unstructured":"Y. Lin and S. Skiena, \u201dComplexity aspects of visibility graphs\u201d Technical Report 92\/08 SUNY Stony Brook, 1992."},{"key":"22_CR9","unstructured":"H. Sakauchi, Y. Nishimura, and S. Hasegawa, \u201dA Self-Healing Network with an economical Spare-Channel Assignment,\u201d IEEE GLOBECOM 1990, pp. 403.1.1\u2013403.1.6."},{"key":"22_CR10","unstructured":"J. C. Shah, \u201dRestoration Network Planning Tool\u201d, Proc. 8th Annual Fiber Optic Engineers Conf. April 21, 1992."},{"issue":"No.11","key":"22_CR11","doi-asserted-by":"crossref","first-page":"1698","DOI":"10.1109\/50.9987","volume":"6","author":"T.H. Wu","year":"1988","unstructured":"T.H. Wu, D.J. Collar, and R.H. Cardwell, \u201cSurvivable Network Architectures for Broadband Fiber Optic Networks: Model and Performance Comparisons,\u201d IEEE Journal of Lightwave Technology, Vol. 6, No. 11, November 1988, pp. 1698\u20131709.","journal-title":"IEEE Journal of Lightwave Technology"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Tsong-Ho Wu and R. C. Lau, \u201dA Class of Self-Healing Ring Architectures for SONET Network Applications, IEEE Trans. on Communication, Vol. 40, No. 11, Nov. 1992.","DOI":"10.1109\/26.179938"}],"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_372.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:31Z","timestamp":1742596831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_372"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_372","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}