{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:40Z","timestamp":1759063840720},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,8,7]],"date-time":"2010-08-07T00:00:00Z","timestamp":1281139200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9345-3","type":"journal-article","created":{"date-parts":[[2010,8,6]],"date-time":"2010-08-06T15:20:27Z","timestamp":1281108027000},"page":"882-894","source":"Crossref","is-referenced-by-count":3,"title":["Improving an upper bound on the size of k-regular induced subgraphs"],"prefix":"10.1007","volume":"22","author":[{"given":"Carlos J.","family":"Luz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,7]]},"reference":[{"key":"9345_CR1","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s10878-007-9045-9","volume":"14","author":"DM Cardoso","year":"2007","unstructured":"Cardoso DM, Kami\u0144ski M, Lozin V (2007) Maximum k-regular induced subgraphs. J Comb Optim 14:455\u2013463","journal-title":"J Comb Optim"},{"key":"9345_CR2","series-title":"Classics appl math","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and nonsmooth analysis","author":"FH Clarke","year":"1990","unstructured":"Clarke FH (1990) Optimization and nonsmooth analysis. Classics appl math, vol\u00a05. SIAM, Philadelphia"},{"key":"9345_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization. Springer, Berlin"},{"key":"9345_CR4","unstructured":"Hare W, Sagastiz\u00e1bal C (2009) A redistributed proximal bundle method for nonconvex optimization. http:\/\/www.optimization-online.org\/DB_HTML\/2009\/04\/2273.html . Accessed 24 April 2009"},{"key":"9345_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1193","volume":"1","author":"DE Knuth","year":"1994","unstructured":"Knuth DE (1994) The Sandwich theorem. Electron J Comb\u00a01:1","journal-title":"Electron J Comb"},{"issue":"2","key":"9345_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz L (1979) On the Shannon capacity of a graph. IEEE Trans Inf Theory 25(2):1\u20137","journal-title":"IEEE Trans Inf Theory"},{"key":"9345_CR7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-6377(95)00042-9","volume":"18","author":"CJ Luz","year":"1995","unstructured":"Luz CJ (1995) An upper bound on the independence number of a graph computable in polynomial time. Oper Res Lett 18:139\u2013145","journal-title":"Oper Res Lett"},{"issue":"2","key":"9345_CR8","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1137\/S0895480104429181","volume":"19","author":"CJ Luz","year":"2005","unstructured":"Luz CJ, Schrijver A (2005) A convex quadratic characterization of the Lov\u00e1sz theta number. SIAM J Discrete Math 19(2):382\u2013387","journal-title":"SIAM J Discrete Math"},{"key":"9345_CR9","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin TS, Straus EG (1965) Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can J Math 17:533\u2013540","journal-title":"Can J Math"},{"key":"9345_CR10","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh KC, Todd MJ, Tutuncu RH (1999) SDPT3\u2014a Matlab software package for semidefinite programming, version\u00a01.3. Optim Methods Softw 11:545\u2013581","journal-title":"Optim Methods Softw"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9345-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9345-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9345-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T03:03:34Z","timestamp":1591758214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9345-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,7]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9345"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9345-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,7]]}}}