{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T18:24:00Z","timestamp":1648837440463},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3490,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2004,2]]},"DOI":"10.1016\/s0012-365x(03)00307-8","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T22:32:50Z","timestamp":1063751570000},"page":"149-159","source":"Crossref","is-referenced-by-count":0,"title":["Laplacian eigenvalues and fixed size multisection"],"prefix":"10.1016","volume":"276","author":[{"given":"C.","family":"Delorme","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00307-8_BIB1","unstructured":"E. \u00c7ela, G.J. Woeginger, A note on the maximum of a certain bilinear form, Technical Report 8, Technische Universit\u00e4t Graz, Austria (September 1994)."},{"key":"10.1016\/S0012-365X(03)00307-8_BIB2","series-title":"Spectra of Graphs","author":"Cvetkovi\u0107","year":"1979"},{"key":"10.1016\/S0012-365X(03)00307-8_BIB3","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF01585184","article-title":"Laplacian eigenvalues and the maximum cut problem","volume":"62","author":"Delorme","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0012-365X(03)00307-8_BIB4","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1147\/rd.175.0420","article-title":"Lower bounds for the partitioning of graphs","volume":"17","author":"Donath","year":"1973","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0012-365X(03)00307-8_BIB5","series-title":"Integer Programming and Combinatorial Optimization","first-page":"1","article-title":"Improved approximation algorithms for max k-cut and max bisection","volume":"Vol. 920","author":"Frieze","year":"1995"},{"issue":"2","key":"10.1016\/S0012-365X(03)00307-8_BIB6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1112\/plms\/s2-25.1.265","article-title":"The maximum of a certain bilinear form","volume":"25","author":"Hardy","year":"1926","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/S0012-365X(03)00307-8_BIB7","series-title":"Topics in Matrix Analysis","author":"Horn","year":"1991"},{"key":"10.1016\/S0012-365X(03)00307-8_BIB8","doi-asserted-by":"crossref","unstructured":"D. Karger, R. Motwani, M. Sudan, Approximate graph coloring by semidefinite programming, in: Proceedings: 35th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring MD, 1994, pp. 2\u201313.","DOI":"10.1109\/SFCS.1994.365710"},{"key":"10.1016\/S0012-365X(03)00307-8_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","article-title":"On the Shannon capacity of a graph","volume":"25","author":"Lov\u00e1sz","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(03)00307-8_BIB10","doi-asserted-by":"crossref","unstructured":"B. Mohar, Some applications of Laplace eigenvalues of graphs, in: G. Hahn, et al. (Eds.), Graph Symmetry: Algebraic Methods and Applications, Proceedings of the NATO Advanced Study Institute and Seminaire de Mathematiques Superieures, Montreal, in NATO ASI Series C, Math. Phys. Sci., Vol. 497, Kluwer Academic Publishers, Dordrecht, 1997, pp. 225\u2013275.","DOI":"10.1007\/978-94-015-8937-6_6"},{"key":"10.1016\/S0012-365X(03)00307-8_BIB11","doi-asserted-by":"crossref","unstructured":"N.Z. Shor, Nondifferentiable Optimization and Polynomial Problems, \u201cNonconvex Optimization and Its Applications\u201d, Vol. 24, Kluwer Academic Publishers, Dordrecht, 1998.","DOI":"10.1007\/978-1-4757-6015-6"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03003078?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03003078?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T08:59:26Z","timestamp":1550998766000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03003078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0012365X03003078"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00307-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}