{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:14Z","timestamp":1725493634397},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_16","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T04:04:43Z","timestamp":1193457883000},"page":"139-148","source":"Crossref","is-referenced-by-count":0,"title":["On Even Triangulations of 2-Connected Embedded Graphs"],"prefix":"10.1007","author":[{"given":"Huaming","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"16_CR1","volume-title":"Graph theory with applications","author":"J. A. Bondy","year":"1979","unstructured":"J. A. Bondy and U.S.R. Murty, Graph theory with applications, North Holland, New York, 1979."},{"key":"16_CR2","volume-title":"An introduction to algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson and R. L. Rivest, An introduction to algorithms, McGraw-Hill, New York, 1990"},{"key":"16_CR3","series-title":"Technical Report","volume-title":"A graph-coloring result and its consequences for polygon-guarding problems","author":"F. Hoffmann","year":"1993","unstructured":"F. Hoffmann and K. Kriegel, A graph-coloring result and its consequences for polygon-guarding problems, Technical Report TR-B-93-08, Inst. f. Informatik, Freie Universit\u00e4t, Berlin, 1993."},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0895480194265611","volume":"9","author":"F. Hoffmann","year":"1996","unstructured":"F. Hoffmann and K. Kriegel, A graph-coloring result and its consequences for polygon-guarding problems, SIAM J. Discrete Math, Vol 9(2): 210\u2013224, 1996.","journal-title":"SIAM J. Discrete Math"},{"key":"16_CR5","volume-title":"Lectures in Abstract Algebras","author":"N. Jacobson","year":"1975","unstructured":"N. Jacobson, Lectures in Abstract Algebras, Springer-Verlag, New York, 1975."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton, J. Rose and R. E. Tarjan, Generalized Nested Dissection, SIAM J. Numer. Anal., 16: 346\u2013358, 1979.","journal-title":"SIAM J. Numer. Anal."},{"key":"16_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1007\/3-540-45749-6_78","volume-title":"Proceedings of ESA\u201902","author":"H. Zhang","year":"2002","unstructured":"Huaming Zhang and Xin He, A simple linear time algorithm for finding even triangulations of 2-connected bipartite plane graphs, in Proceedings of ESA\u201902, LNCS 2461, pp. 902\u2013913."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T10:56:07Z","timestamp":1551005767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}