{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:46Z","timestamp":1750307806644,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:00:00Z","timestamp":1212969600000},"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":[[2008,6,9]]},"DOI":"10.1145\/1377676.1377738","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"365-374","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Combinatorial genericity and minimal rigidity"],"prefix":"10.1145","author":[{"given":"Ileana","family":"Streinu","sequence":"first","affiliation":[{"name":"Smith College, Northampton, MA, USA"}]},{"given":"Louis","family":"Theran","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,6,9]]},"reference":[{"volume-title":"Oliver and Boyd","year":"1948","author":"Aitken A. C.","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1978-0511410-9"},{"key":"e_1_3_2_1_3_1","unstructured":"S. Bereg. Faster algorithms for rigidity in the plane. http:\/\/arxiv.org\/abs\/0711.2835 2007.  S. Bereg. Faster algorithms for rigidity in the plane. http:\/\/arxiv.org\/abs\/0711.2835 2007."},{"volume-title":"John Wiley and Research Studies Press","year":"1988","author":"Crippen G. M.","key":"e_1_3_2_1_5_1"},{"volume-title":"The Proceedings of the 17th Fall Workshop on Computational and Combinatorial Geometry (FWCG '07), 2007","year":"2007","author":"Daescu O.","key":"e_1_3_2_1_6_1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2005.10.005"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758774"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4771-1_10"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0066118"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"J.\n       \n      Graver B.\n       \n      Servatius and \n      \n      \n      H.\n       \n      Servatius\n      \n  \n  . \n  Combinatorial rigidity volume \n  2\n   of \n  Graduate Studies in Mathematics\n  . \n  American Mathematical Society November \n  1993\n  .  J. Graver B. Servatius and H. Servatius. Combinatorial rigidity volume 2 of Graduate Studies in Mathematics. American Mathematical Society November 1993.","DOI":"10.1090\/gsm\/002"},{"key":"e_1_3_2_1_12_1","first-page":"129","article-title":"Characterizations of arboricity of graphs","volume":"63","author":"Haas R.","year":"2002","journal-title":"Ars Combinatorica"},{"key":"e_1_3_2_1_13_1","first-page":"3","article-title":"Characterizing sparse graphs by map decompositions","volume":"62","author":"Haas R.","year":"2007","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"e_1_3_2_1_14_1","first-page":"1911","article-title":"Die graphische statik der starren systeme","author":"Henneberg L.","year":"1968","journal-title":"Johnson Reprint"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1997.5809"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01534980"},{"volume-title":"Discrete Mathematics, 2007","year":"2007","author":"Lee A.","key":"e_1_3_2_1_17_1"},{"volume-title":"Proceeding of the Canadian Conference of Computational Geometry. Windsor","year":"2005","author":"Lee A.","key":"e_1_3_2_1_18_1"},{"issue":"10","key":"e_1_3_2_1_19_1","article-title":"Graded sparse graphs and matroids","volume":"13","author":"Lee A.","year":"2007","journal-title":"Journal of Universal Computer Science"},{"volume-title":"Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG'07)","year":"2007","author":"Lee A.","key":"e_1_3_2_1_20_1"},{"volume-title":"North Holland","year":"1986","author":"Lov\u00e1sz L.","key":"e_1_3_2_1_21_1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0603009"},{"key":"e_1_3_2_1_23_1","unstructured":"L. Lov\u00e1sz. The matroid matching problem. Algebraic methods in graph theory 25:495--517 1978.  L. Lov\u00e1sz. The matroid matching problem. Algebraic methods in graph theory 25:495--517 1978."},{"key":"e_1_3_2_1_24_1","first-page":"208","article-title":"Matroid matching and some applications. Journal of Combinatorial Theory","volume":"28","author":"Lov\u00e1sz L.","year":"1980","journal-title":"Series (B)"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1080\/14786446408643668"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-39.1.12"},{"volume-title":"New York","year":"1992","author":"Oxley J. G.","key":"e_1_3_2_1_27_1"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90079-9"},{"key":"e_1_3_2_1_29_1","first-page":"480","volume-title":"Proc. of 17th Allerton Conference in Communications, Control, and Computing","author":"Saxe J. B.","year":"1979"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070488"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"I. Streinu and L. Theran. Combinatorial genericity and minimal rigidity. 2007. http:\/\/arxiv.org\/abs\/0712.0031.  I. Streinu and L. Theran. Combinatorial genericity and minimal rigidity. 2007. http:\/\/arxiv.org\/abs\/0712.0031.","DOI":"10.1145\/1377676.1377738"},{"key":"e_1_3_2_1_32_1","unstructured":"I. Streinu and L. Theran. Sparsity-certifying graph decompositions. http:\/\/arxiv.org\/abs\/0704.0002 2007.  I. Streinu and L. Theran. Sparsity-certifying graph decompositions. http:\/\/arxiv.org\/abs\/0704.0002 2007."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02988323"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-36.1.221"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0401025"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"W.\n       \n      Whiteley\n    .\n      \n  \n   \n  Some matroids from discrete applied geometry. In J. Bonin J. G. Oxley and B. Servatius editors Matroid Theory volume \n  197\n   of \n  Contemporary Mathematics pages \n  171\n  --\n  311\n  . \n  American Mathematical Society 1996\n  .  W. Whiteley. Some matroids from discrete applied geometry. In J. Bonin J. G. Oxley and B. Servatius editors Matroid Theory volume 197 of Contemporary Mathematics pages 171--311. American Mathematical Society 1996.","DOI":"10.1090\/conm\/197\/02540"},{"key":"e_1_3_2_1_37_1","first-page":"1327","volume-title":"J. E. Goodman and J. O'Rourke","author":"Whiteley W.","year":"2004"}],"event":{"name":"SoCG08: 24th Annual Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"College Park MD USA","acronym":"SoCG08"},"container-title":["Proceedings of the twenty-fourth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1377676.1377738","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1377676.1377738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:39Z","timestamp":1750254999000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1377676.1377738"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,9]]},"references-count":36,"alternative-id":["10.1145\/1377676.1377738","10.1145\/1377676"],"URL":"https:\/\/doi.org\/10.1145\/1377676.1377738","relation":{},"subject":[],"published":{"date-parts":[[2008,6,9]]},"assertion":[{"value":"2008-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}