{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:17:00Z","timestamp":1649117820066},"reference-count":7,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5707,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1016\/s0166-218x(97)00087-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"223-229","source":"Crossref","is-referenced-by-count":2,"title":["On the two-connected planar spanning subgraph polytope"],"prefix":"10.1016","volume":"80","author":[{"given":"Caterina","family":"De Simone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00087-5_BIB1","article-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/S0166-218X(97)00087-5_BIB2","article-title":"Computer and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(97)00087-5_BIB3","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","article-title":"Sur le probl\u00e8me de courbes gauches en topologie","volume":"15","author":"Kuratowski","year":"1930","journal-title":"Fund. Math."},{"key":"10.1016\/S0166-218X(97)00087-5_BIB4","article-title":"The maximum planar subgraph problem","author":"Mutzel","year":"1994"},{"key":"10.1016\/S0166-218X(97)00087-5_BIB5","series-title":"Algorithms \u2014 ESA'95","first-page":"494","article-title":"A polyhedral approach to planar augmentation and related problem","author":"Mutzel","year":"1995"},{"key":"10.1016\/S0166-218X(97)00087-5_BIB6","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0166-218X(97)00087-5_BIB7","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0088966","article-title":"Design of Survivable Networks","author":"Stoer","year":"1992"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000875?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000875?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:50:38Z","timestamp":1556117438000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97000875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":7,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0166218X97000875"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00087-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}