{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T03:18:44Z","timestamp":1770434324300,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540405344","type":"print"},{"value":"9783540450719","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_50","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"496-508","source":"Crossref","is-referenced-by-count":58,"title":["On Spectral Graph Drawing"],"prefix":"10.1007","author":[{"given":"Yehuda","family":"Koren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"50_CR1","unstructured":"U. Brandes and T. Willhalm, \u201cVisualizing Bibliographic Networks with a Reshaped Landscape Metaphor\u201d, Proc. 4th Joint Eurographics \u2014 IEEE TCVG Symp. Visualization (VisSym\u2019 02), pp. 159\u2013164, ACM Press, 2002."},{"key":"50_CR2","unstructured":"L. Carmel, Y. Koren and D. Harel, \u201cVisualizing and Classifying Odors Using a Similarity Matrix\u201d, Proceedings of the ninth International Symposium on Olfaction and Electronic Nose (ISOEN\u201902), IEEE, to appear, 2003."},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"F.R.K. Chung, Spectral Graph Theory, CBMS Reg. Conf. Ser. Math. 92, American Mathematical Society, 1997.","DOI":"10.1090\/cbms\/092"},{"key":"50_CR4","unstructured":"G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, 1999."},{"key":"50_CR5","unstructured":"G.H. Golub and C.F. Van Loan, Matrix Computations, Johns Hopkins University Press, 1996."},{"key":"50_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/mnsc.17.3.219","volume":"17","author":"K. M. Hall","year":"1970","unstructured":"K. M. Hall, \u201cAn r-dimensional Quadratic Placement Algorithm\u201d, Management Science 17 (1970), 219\u2013229.","journal-title":"Management Science"},{"key":"50_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0166-218X(92)90229-4","volume":"36","author":"M. Juvan","year":"1992","unstructured":"M. Juvan and B. Mohar, \u201cOptimal Linear Labelings and Eigenvalues of Graphs\u201d, Discrete Applied Math. 36 (1992), 153\u2013168.","journal-title":"Discrete Applied Math"},{"key":"50_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Drawing Graphs: Methods and Models","year":"2001","unstructured":"M. Kaufmann and D. Wagner (Eds.), Drawing Graphs: Methods and Models, LNCS 2025, Springer Verlag, 2001."},{"key":"50_CR9","unstructured":"Y. Koren, L. Carmel and D. Harel, \u201cACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs\u201d, Proceedings of IEEE Information Visualization 2002 (InfoVis\u201902), IEEE, pp. 137\u2013144, 2002."},{"key":"50_CR10","doi-asserted-by":"publisher","first-page":"7603","DOI":"10.1063\/1.462413","volume":"96","author":"D.E. Manolopoulos","year":"1992","unstructured":"D.E. Manolopoulos and P.W. Fowler, \u201cMolecular Graphs, Point Groups and Fullerenes\u201d, J. Chem. Phys. 96 (1992), 7603\u20137614.","journal-title":"J. Chem. Phys."},{"key":"50_CR11","first-page":"871","volume":"2","author":"B. Mohar","year":"1991","unstructured":"B. Mohar, \u201cThe Laplacian Spectrum of Graphs\u201d, Graph Theory, Combinatorics, and Applications 2 (1991), 871\u2013898.","journal-title":"Graph Theory, Combinatorics, and Applications"},{"key":"50_CR12","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"A. Pothen, H. Simon and K.-P. Liou, \u201cPartitioning Sparse Matrices with Eigenvectors of Graphs\u201d, SIAM Journal on Matrix Analysis and Applications, 11 (1990), 430\u2013452.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"50_CR13","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"J. Shi and J. Malik, \u201cNormalized Cuts and Image Segmentation\u201d, IEEE Transactions on Pattern Analysis and Machine Intelligence, 22 (2000), 888\u2013905.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"50_CR14","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W. T. Tutte","year":"1963","unstructured":"W. T. Tutte, \u201cHow to Draw a Graph\u201d, Proc. London Math. Society 13 (1963), 743\u2013768.","journal-title":"Proc. London Math. Society"},{"key":"50_CR15","unstructured":"A. Webb, Statistical Pattern Recognition, Arnold, 1999."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T09:36:05Z","timestamp":1629970565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_50","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}