乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T09:48:06Z","timestamp":1721036886813},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T00:00:00Z","timestamp":1627689600000},"content-version":"vor","delay-in-days":1491,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["280152"],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["GA14-10799S"],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1016\/j.dam.2017.04.023","type":"journal-article","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T10:01:19Z","timestamp":1494928879000},"page":"106-116","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["On edge intersection graphs of paths with 2 bends"],"prefix":"10.1016","volume":"226","author":[{"given":"Martin","family":"Pergel","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-7696-3848","authenticated-orcid":false,"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2017.04.023_br000005","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.disc.2011.10.005","article-title":"Some properties of edge intersection graphs of single-bend paths on a grid","volume":"312","author":"Asinowski","year":"2012","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2017.04.023_br000010","doi-asserted-by":"crossref","first-page":"3174","DOI":"10.1016\/j.dam.2009.06.015","article-title":"Edge intersection graphs of paths on a grid with a bounded number of bends","volume":"157","author":"Asinowski","year":"2009","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2017.04.023_br000015","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0097539703437843","article-title":"Scheduling split intervals","volume":"36","author":"Bar-Yehuda","year":"2006","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.dam.2017.04.023_br000020","first-page":"1","article-title":"On edge-intersection graphs of k-bend paths in grids","volume":"12","author":"Biedl","year":"2010","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"10.1016\/j.dam.2017.04.023_br000025","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.dam.2017.04.023_br000030","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.dam.2015.01.039","article-title":"Edge intersection graphs of L-shaped paths in grids","volume":"210","author":"Cameron","year":"2016","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2017.04.023_br000035","series-title":"GD 2001 Proc.","first-page":"261","article-title":"On intersection graphs of segments with prescribed slopes","volume":"vol. 2265","author":"\u010cern\u00fd","year":"2002"},{"key":"10.1016\/j.dam.2017.04.023_br000040","series-title":"WG 2012 Proc.","first-page":"274","article-title":"Bend-Bounded path intersection graphs: sausages, noodles, and waffles on a grill","volume":"vol. 7551","author":"Chaplick","year":"2012"},{"key":"10.1016\/j.dam.2017.04.023_br000045","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 Math."},{"key":"10.1016\/j.dam.2017.04.023_br000050","series-title":"WADS 2013 Proc.","first-page":"328","article-title":"Approximation algorithms for B1-EPG graphs","volume":"8037","author":"Epstein","year":"2013"},{"key":"10.1016\/j.dam.2017.04.023_br000055","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1007\/s00453-013-9828-6","article-title":"The maximum clique problem in multiple interval graphs","volume":"71","author":"Francis","year":"2015","journal-title":"Algoritmica"},{"key":"10.1016\/j.dam.2017.04.023_br000060","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1002\/net.20305","article-title":"Edge intersection graphs of single bend paths on a grid","volume":"54","author":"Golumbic","year":"2009","journal-title":"Networks"},{"key":"10.1016\/j.dam.2017.04.023_br000065","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.dam.2013.10.035","article-title":"Edge-intersection graphs of grid paths: The bend-number","volume":"167","author":"Heldt","year":"2014","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2017.04.023_br000070","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.dam.2014.07.015","article-title":"On the bend number of planar and outerplanar graphs","volume":"179","author":"Heldt","year":"2014","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2017.04.023_br000075","unstructured":"L. Lov\u00e1sz, Coverings and coloring of hypergraphs, in: 4th SEICCGTC Proc., 1973, pp. 3\u201312."},{"key":"10.1016\/j.dam.2017.04.023_br000080","series-title":"WG 2016 Proc.","first-page":"207","article-title":"On edge intersection graphs of paths with 2 bends","volume":"vol. 9941","author":"Pergel","year":"2016"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X17301890?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X17301890?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T01:43:21Z","timestamp":1656207801000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X17301890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":16,"alternative-id":["S0166218X17301890"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2017.04.023","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2017,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On edge intersection graphs of paths with 2 bends","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2017.04.023","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}