{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:47:35Z","timestamp":1725486455695},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540413486"},{"type":"electronic","value":"9783540444114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44411-4_21","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T18:52:31Z","timestamp":1182192751000},"page":"327-335","source":"Crossref","is-referenced-by-count":7,"title":["On-Line Maximum-Order Induced Hereditary Subgraph Problems"],"prefix":"10.1007","author":[{"given":"Marc","family":"Demange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Paradon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,1,22]]},"reference":[{"issue":"2","key":"21_CR1","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01994876","volume":"32","author":"B. B. Boppana","year":"1992","unstructured":"Boppana, B. B., Halld\u00f3rsson, M. M.: Approximating maximum independent sets by excluding subgraphs. BIT 32(2) (1992) 180\u2013196. 331, 332","journal-title":"BIT"},{"key":"21_CR2","unstructured":"Demange, M., Paschos, V. Th.: Maximum-weight independent set is as \u201cwellapproximated\u201d as the unweighted one. Technical Report 163 (1999) LAMSADE, Universit\u00e9 Paris-Dauphine. 332"},{"key":"21_CR3","first-page":"331","volume":"328","author":"M. Demange","year":"2000","unstructured":"Demange, M., Paradon, X., Paschos, V. Th.: On-line maximum-order induced hereditary subgraph problems. Research Note 25 (2000) LAMSADE, Universit\u00e9 Paris-Dauphine. 328, 329, 331, 332","journal-title":"Research Note"},{"key":"21_CR4","series-title":"JAIST Research Report","volume-title":"Approximations via partitioning","author":"M. M. Halld\u00f3rsson","year":"1995","unstructured":"Halld\u00f3rsson, M. M.: Approximations via partitioning. JAIST Research Report ISRR-95-0003F (1995) Japan Advanced Institute of Science and Technology, Japan. 329"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2000: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44411-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T06:25:04Z","timestamp":1550384704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44411-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540413486","9783540444114"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-44411-4_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}