{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:30Z","timestamp":1720640850056},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80182-9","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T11:08:52Z","timestamp":1114945732000},"page":"266-269","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Solving Problems on Special Classes of Graphs"],"prefix":"10.1016","volume":"5","author":[{"given":"Vijay","family":"Raghavan","sequence":"first","affiliation":[]},{"given":"Jeremy P.","family":"Spinrad","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80182-9_BIB1","author":"Breu","year":"1996","journal-title":"Algorithmic Aspects of Constrained Unit Disk Graphs, Ph.D. Thesis, Computer Science Dept., University of British Columbia"},{"key":"10.1016\/S1571-0653(05)80182-9_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","article-title":"Unit Disk Graph Recognition is NP-hard","volume":"9","author":"Breu","year":"1998","journal-title":"Computational Geometry"},{"key":"10.1016\/S1571-0653(05)80182-9_BIB3","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0167-5060(08)70387-X","article-title":"A Note on Well-Covered Graphs","volume":"55","author":"Chvatal","year":"1993","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S1571-0653(05)80182-9_BIB4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","article-title":"Unit Disk Graphs","volume":"86","author":"Clark","year":"1990","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S1571-0653(05)80182-9_BIB5","author":"Johnson","year":"2000","journal-title":"Robust Polynomial Time Algorithms on k-NLC and Clique Width k Graphs, manuscript"},{"key":"10.1016\/S1571-0653(05)80182-9_BIB6","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1080\/16073606.1993.9631737","article-title":"Well-covered Graphs: A Survey","volume":"16","author":"Plummer","year":"1993","journal-title":"Quaestiones Math."},{"key":"10.1016\/S1571-0653(05)80182-9_BIB7","author":"Raghavan","year":"2000","journal-title":"Robust Algorithms for Restricted Domains, submitted for publication"},{"key":"10.1016\/S1571-0653(05)80182-9_BIB8","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230220304","article-title":"Complexity Results for Well-Covered Graphs","volume":"22","author":"Sankaranarayana","year":"1992","journal-title":"Networks"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801829?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801829?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T19:57:49Z","timestamp":1548532669000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":8,"alternative-id":["S1571065305801829"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80182-9","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}