{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,10]],"date-time":"2026-10-10T13:14:53Z","timestamp":1791638093950,"version":"4.3.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540359043","type":"print"},{"value":"9783540359050","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_60","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"691-702","source":"Crossref","is-referenced-by-count":4,"title":["An Adaptive Spectral Heuristic for Partitioning Random Graphs"],"prefix":"10.1007","author":[{"given":"Amin","family":"Coja-Oghlan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"60_CR1","doi-asserted-by":"publisher","first-page":"1733","DOI":"10.1137\/S0097539794270248","volume":"26","author":"N. Alon","year":"1997","unstructured":"Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM J. Comput.\u00a026, 1733\u20131748 (1997)","journal-title":"SIAM J. Comput."},{"key":"60_CR2","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W","volume":"13","author":"N. Alon","year":"1998","unstructured":"Alon, N., Krivelevich, M., Sudakov, B.: Finding a large hidden clique in a random graph. Random Structures and Algorithms\u00a013, 457\u2013466 (1998)","journal-title":"Random Structures and Algorithms"},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"Boppana, R.: Eigenvalues and graph bisection: an average-case analysis. In: Proc.\u00a028th FOCS, pp. 280\u2013285 (1987)","DOI":"10.1109\/SFCS.1987.22"},{"key":"60_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/3-540-61310-2_26","volume-title":"Integer Programming and Combinatorial Optimization","author":"H. Chen","year":"1996","unstructured":"Chen, H., Frieze, A.: Coloring bipartite hypergraphs. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol.\u00a01084, pp. 345\u2013358. Springer, Heidelberg (1996)"},{"key":"60_CR5","unstructured":"Coja-Oghlan, A.: A spectral heuristic for bisecting random graphs. In: Proc.16th SODA, pp. 850\u2013859 (2005)"},{"key":"60_CR6","unstructured":"Dasgupta, A., Hopcroft, J.E., McSherry, F.: Spectral Partitioning of Random Graphs. In: Proc.\u00a045th FOCS, pp. 529\u2013537 (2004)"},{"key":"60_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1002\/rsa.20089","volume":"27","author":"U. Feige","year":"2005","unstructured":"Feige, U., Ofek, E.: Spectral techniques applied to sparse random graphs. Random Structures and Algorithms\u00a027, 251\u2013275 (2005)","journal-title":"Random Structures and Algorithms"},{"key":"60_CR8","unstructured":"Flaxman, A.: A spectral technique for random satisfiable 3CNF formulas. In: Proc.14th SODA, pp. 357\u2013363 (2003)"},{"key":"60_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF02579329","volume":"1","author":"Z. F\u00fcredi","year":"1981","unstructured":"F\u00fcredi, Z., Komlo\u015b, J.: The eigenvalues of random symmetric matrices. Combinatorica\u00a01, 233\u2013241 (1981)","journal-title":"Combinatorica"},{"key":"60_CR10","doi-asserted-by":"crossref","unstructured":"McSherry, F.: Spectral Partitioning of Random Graphs. In: Proc.\u00a042nd FOCS, pp. 529\u2013537 (2001)","DOI":"10.1109\/SFCS.2001.959929"},{"key":"60_CR11","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"Pothen, A., Simon, H.D., Kang-Pu, L.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J.\u00a0Matrix Anal.Appl.\u00a011, 430\u2013452 (1990)","journal-title":"SIAM J.\u00a0Matrix Anal.Appl."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:31:40Z","timestamp":1558308700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11786986_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}