{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:57:13Z","timestamp":1742943433678,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319729251"},{"type":"electronic","value":"9783319729268"}],"license":[{"start":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T00:00:00Z","timestamp":1513814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-72926-8_44","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T17:42:36Z","timestamp":1513791756000},"page":"527-539","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Smooth Graphs with Small Independence Numbers"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Klocker","sequence":"first","affiliation":[]},{"given":"Herbert","family":"Fleischner","sequence":"additional","affiliation":[]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"44_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Mathematical Proceedings of the Cambridge Philosophical Society 37, 194\u2013197 (1941)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"issue":"20","key":"44_CR2","doi-asserted-by":"publisher","first-page":"2742","DOI":"10.1016\/j.disc.2010.05.028","volume":"310","author":"H Fleischner","year":"2010","unstructured":"Fleischner, H., Sabidussi, G., Sarvanov, V.I.: Maximum independent sets in 3-and 4-regular Hamiltonian graphs. Discrete Math. 310(20), 2742\u20132749 (2010)","journal-title":"Discrete Math."},{"issue":"1","key":"44_CR3","first-page":"10","volume":"57","author":"H Fleischner","year":"2013","unstructured":"Fleischner, H., Sarvanov, V.I.: Small maximum independent sets in Hamiltonian four-regular graphs. Rep. Nat. Acad. Sci. Belarus 57(1), 10 (2013)","journal-title":"Rep. Nat. Acad. Sci. Belarus"},{"issue":"1\u20133","key":"44_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0012-365X(92)90588-7","volume":"101","author":"H Fleischner","year":"1992","unstructured":"Fleischner, H., Stiebitz, M.: A solution to a colouring problem of P. Erd\u0151s. Discrete Math. 101(1\u20133), 39\u201348 (1992)","journal-title":"Erd\u0151s. Discrete Math."},{"key":"44_CR5","volume-title":"Institute of Computer Graphics and Algorithms","author":"H Fleischner","year":"2016","unstructured":"Fleischner, H.: Institute of Computer Graphics and Algorithms. TU Wien, Personal communication (2016)"},{"issue":"1","key":"44_CR6","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/0095-8956(83)90003-5","volume":"34","author":"JR Griggs","year":"1983","unstructured":"Griggs, J.R.: Lower bounds on the independence number in terms of the degrees. J. Comb. Theor. Ser. B 34(1), 22\u201339 (1983)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"44_CR7","unstructured":"Gurobi Optimization Inc: Gurobi optimizer reference manual, version 7.0.1 (2016)"},{"issue":"1","key":"44_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02523693","volume":"18","author":"M Halld\u00f3rsson","year":"1997","unstructured":"Halld\u00f3rsson, M., Radhakrishnan, J.: Greed is good: approximating independent sets in sparse and bounded-degree graphs. Algorithmica 18(1), 145\u2013163 (1997)","journal-title":"Algorithmica"},{"issue":"3","key":"44_CR9","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0095-8956(84)90058-3","volume":"37","author":"KF Jones","year":"1984","unstructured":"Jones, K.F.: Independence in graphs with maximum degree four. J. Comb. Theor. Ser. B 37(3), 254\u2013269 (1984)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"4","key":"44_CR10","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler, E.L., Wood, D.E.: Branch-and-bound methods: a survey. Oper. Res. 14(4), 699\u2013719 (1966)","journal-title":"Oper. Res."},{"key":"44_CR11","unstructured":"Sarvanov, V.I.: Institute of Mathematics at the National Academy of Sciences of Belarus. Personal communication (2016)"},{"issue":"1","key":"44_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0012-365X(83)90273-X","volume":"46","author":"JB Shearer","year":"1983","unstructured":"Shearer, J.B.: A note on the independence number of triangle-free graphs. Discrete Math. 46(1), 83\u201387 (1983)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72926-8_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:10:06Z","timestamp":1710324606000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-72926-8_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,21]]},"ISBN":["9783319729251","9783319729268"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72926-8_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,21]]},"assertion":[{"value":"21 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Machine Learning, Optimization, and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Volterra","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.taosciences.it\/mod\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}