{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:34:39Z","timestamp":1725543279282},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540367116"},{"type":"electronic","value":"9783540368656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11802914_50","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T15:55:21Z","timestamp":1153151721000},"page":"630-636","source":"Crossref","is-referenced-by-count":4,"title":["Spectral Sequencing Based on Graph Distance"],"prefix":"10.1007","author":[{"given":"Rong","family":"Liu","sequence":"first","affiliation":[]},{"given":"Hao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Oliver","family":"van Kaick","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"50_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J. D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Computing Survey\u00a034(3), 313\u2013356 (2002)","journal-title":"ACM Computing Survey"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proc. 24th Nat. Conf. ACM, pp. 157\u2013172 (1969)","DOI":"10.1145\/800195.805928"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Barnard, S.T., Pothen, A., Simon, H.D.: A spectral algorithm for envelope reduction of sparse matrices. In: Proc. ACM\/IEEE Conference on Supercomputing, pp. 493\u2013502 (1993)","DOI":"10.1145\/169627.169790"},{"key":"50_CR4","unstructured":"Corso, G.M.D., Romani, F.: Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices. Technical report, Universit\u00e1 di Pisa, Dipartimento di Informatica (2001)"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Hur, S.-W., Willis, J.: Relaxation and clustering in a local search framework: application to linear placement. In: Proc. ACM\/IEEE Conference on Design Automation, pp. 360\u2013366 (1999)","DOI":"10.1145\/309847.309958"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Mapping the genome: some combinatorial problems arising in molecular biology. In: Proc. ACM Symposium on Theory of Computing, pp. 278\u2013285 (1993)","DOI":"10.1145\/167088.167170"},{"key":"50_CR7","first-page":"107","volume-title":"IMA Volumes in Mathematics and Its Applications","author":"B. Mohar","year":"1993","unstructured":"Mohar, B., Poljak, S.: Eigenvalues in combinatorial optimization. In: Brualdi, R.A., Friedland, S., Klee, V. (eds.) IMA Volumes in Mathematics and Its Applications, vol.\u00a050, pp. 107\u2013151. Springer, Heidelberg (1993)"},{"key":"50_CR8","unstructured":"Isenburg, M., Lindstrom, P., Gumhold, S., Snoeyink, J.: Large mesh simplification using processing sequences. In: Proc. of the 14th IEEE Visualization, pp. 61\u201368 (2003)"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Zhang, H., Fiume, E.: Butterworth filtering and implicit fairing of irregular meshes. In: Proceedings of Pacific Graphics, pp. 502\u2013506 (2003)","DOI":"10.1109\/PCCGA.2003.1238303"},{"key":"50_CR10","unstructured":"Isenburg, M., Lindstrom, P.: Streaming meshes. IEEE Visualization (2005)"},{"key":"50_CR11","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"A. George","year":"1981","unstructured":"George, A., Liu, W.-H.: Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"50_CR12","volume-title":"Numerical Recipies in C","author":"W. Press","year":"1992","unstructured":"Press, W., Tekolsky, S., Vetterling, W., Flannery, B.: Numerical Recipies in C. Cambridge Univ. Press, Cambridge (1992)"},{"key":"50_CR13","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1162\/089976698300017467","volume":"10","author":"B. Sch\u00f6lkopf","year":"1998","unstructured":"Sch\u00f6lkopf, B., Smola, A., Muller, K.-R.: Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation\u00a010, 1299\u20131319 (1998)","journal-title":"Neural Computation"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Liu, R., Zhang, H., van Kaick, O.: An investigation on spectral sequencing using graph distance. Technical Report TR 2006-08, School of Computing Science, Simon Fraser University (2006)","DOI":"10.1007\/11802914_50"},{"key":"50_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/11784203_15","volume-title":"Advances in Computer Graphics","author":"R. Liu","year":"2006","unstructured":"Liu, R., Jain, V., Zhang, H.: Subsampling for efficient spectral mesh processing. In: Nishita, T., Peng, Q., Seidel, H.-P. (eds.) CGI 2006. LNCS, vol.\u00a04035, pp. 172\u2013184. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Geometric Modeling and Processing - GMP 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11802914_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T02:09:48Z","timestamp":1555726188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11802914_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540367116","9783540368656"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11802914_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}