{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:33Z","timestamp":1750307913999,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,3,11]],"date-time":"2007-03-11T00:00:00Z","timestamp":1173571200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,3,11]]},"DOI":"10.1145\/1244002.1244171","type":"proceedings-article","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T14:37:31Z","timestamp":1181140651000},"page":"757-761","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A hypermap framework for computer-aided proofs in surface subdivisions"],"prefix":"10.1145","author":[{"given":"Jean-Fran\u00e7ois","family":"Dufourd","sequence":"first","affiliation":[{"name":"Louis-Pasteur University of Strasbourg, Illkirch, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,3,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646529.695210"},{"key":"e_1_3_2_1_2_1","volume-title":"Cast\u00e9ran","author":"Bertot Y.","year":"2004","unstructured":"Bertot , Y. , Cast\u00e9ran , P. : Interactive Theorem Proving and Program Development - Coq'Art: The Calculus of Inductive Construction ( 2004 ), Springer-Verlag . Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development - Coq'Art: The Calculus of Inductive Construction (2004), Springer-Verlag."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/cgip.1994.1005"},{"key":"e_1_3_2_1_4_1","volume-title":"INRIA, France","author":"The Coq Team Development","year":"2004","unstructured":"The Coq Team Development : The Coq Proof Assistant Ref. Manual - V8.0 , INRIA, France ( 2004 ). The Coq Team Development: The Coq Proof Assistant Ref. Manual - V8.0, INRIA, France (2004)."},{"key":"e_1_3_2_1_5_1","volume-title":"Un Code pour les Graphes Planaires et ses Applications. Ast\u00e9risque 27","author":"Cori R.","year":"1970","unstructured":"Cori , R. : Un Code pour les Graphes Planaires et ses Applications. Ast\u00e9risque 27 ( 1970 ), SMF , France . Cori, R.: Un Code pour les Graphes Planaires et ses Applications. Ast\u00e9risque 27 (1970), SMF, France."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2003.09.001"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.05.002"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(00)00004-3"},{"key":"e_1_3_2_1_9_1","first-page":"7","article-title":"A Combinatorial Representation for Polyhedral Surfaces","author":"Edmonds J.","year":"1960","unstructured":"Edmonds , J. : A Combinatorial Representation for Polyhedral Surfaces . Notices AMS 7 ( 1960 ). Edmonds, J.: A Combinatorial Representation for Polyhedral Surfaces. Notices AMS 7 (1960).","journal-title":"Notices AMS"},{"key":"e_1_3_2_1_10_1","unstructured":"Eppstein D. The Geometry Junkyard - Seventeen Proofs of Euler's Formula: V-E+F=2 http:\/\/www.ics.uci.edu\/~eppstein\/junkyard\/euler\/.  Eppstein D. The Geometry Junkyard - Seventeen Proofs of Euler's Formula: V-E+F=2 http:\/\/www.ics.uci.edu\/~eppstein\/junkyard\/euler\/."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/351827.384255"},{"key":"e_1_3_2_1_12_1","volume-title":"Microsoft Research","author":"Gonthier G.","year":"2005","unstructured":"Gonthier , G. : A computer-checked proof of the Four Colour Theorem. TR , Microsoft Research , Cambridge ( 2005 ). Gonthier, G.: A computer-checked proof of the Four Colour Theorem. TR, Microsoft Research, Cambridge (2005)."},{"key":"e_1_3_2_1_13_1","volume-title":"Surfaces","author":"Griffiths H.","year":"1981","unstructured":"Griffiths , H. : Surfaces . Cambridge U. Press ( 1981 ). Griffiths, H.: Surfaces. Cambridge U. Press (1981)."},{"key":"e_1_3_2_1_14_1","unstructured":"Kahn G.: Elements of Constructive Geometry Coq contrib. http:\/\/coq.inria.fr\/contribs-eng.html.  Kahn G.: Elements of Constructive Geometry Coq contrib. http:\/\/coq.inria.fr\/contribs-eng.html."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55611-7","volume-title":": Axioms and Hulls. LNCS 606","author":"Knuth D. E.","year":"1992","unstructured":"Knuth , D. E. : Axioms and Hulls. LNCS 606 ( 1992 ), Springer-Verlag . Knuth, D. E.: Axioms and Hulls. LNCS 606 (1992), Springer-Verlag."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11615798_1"},{"key":"e_1_3_2_1_17_1","volume-title":"Y.: Formalizing Convex Hulls Algorithms. TPHOL Conf.","author":"Pichardie D.","year":"2001","unstructured":"Pichardie , D. , Bertot , Y.: Formalizing Convex Hulls Algorithms. TPHOL Conf. ( 2001 ). LNCS 2152, Springer-Verlag, 346--361. Pichardie, D., Bertot, Y.: Formalizing Convex Hulls Algorithms. TPHOL Conf. (2001). LNCS 2152, Springer-Verlag, 346--361."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00228-X"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/356827.356833"}],"event":{"name":"SAC07: The 2007 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Seoul Korea","acronym":"SAC07"},"container-title":["Proceedings of the 2007 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1244002.1244171","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1244002.1244171","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:55Z","timestamp":1750258075000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1244002.1244171"}},"subtitle":["genus theorem and Euler's formula"],"short-title":[],"issued":{"date-parts":[[2007,3,11]]},"references-count":19,"alternative-id":["10.1145\/1244002.1244171","10.1145\/1244002"],"URL":"https:\/\/doi.org\/10.1145\/1244002.1244171","relation":{},"subject":[],"published":{"date-parts":[[2007,3,11]]},"assertion":[{"value":"2007-03-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}