tag:blogger.com,1999:blog-89912800915196640422008-02-17T13:36:03.257-08:00LinKaGeBlogger1125tag:blogger.com,1999:blog-8991280091519664042.post-89561239708180042972007-03-15T21:53:00.000-07:002008-02-13T23:44:04.843-08:00<ul><li><strong>Audrey Lee</strong> and <strong>Ileana Streinu</strong>.<br /><span style="color: rgb(102, 0, 0);"><strong><span style="color: rgb(204, 102, 0);"><em>Pebble Game Algorithms and Sparse Graphs</em>.</span><br /></strong></span><strong><span style="color: rgb(153, 0, 0);">Discrete Mathematics</span></strong>, <span style="font-weight: bold;">308</span>(8):1425-1437, 2008.<br />Abstract presented at EuroComb ’05.<br />[ <a href="http://dx.doi.org/10.1016/j.disc.2007.07.104">DOI</a><a href="http://dx.doi.org/10.1016/j.disc.2007.07.104">:10.1016/j.disc.2007.07.104</a> | <a href="http://arxiv.org/abs/math.CO/0702129">arXiv:</a><a href="http://arxiv.org/abs/math.CO/0702129">math.CO/0702129</a> | <a href="http://linkage.cs.umass.edu/publications/pebblegame.bib">.bib</a> ]</li><li><span style="font-weight: bold;">Ileana Streinu</span> and <span style="font-weight: bold;">Louis Theran</span>.<br /><span style="font-weight: bold; font-style: italic; color: rgb(204, 102, 0);">Combinatorial Genericity and Minimal Rigidity.</span><a href="http://arxiv.org/abs/0712.0031"><br /></a>[ <a href="http://arxiv.org/abs/0712.0031">arXiv</a><a href="http://arxiv.org/abs/0712.0031">:</a><a href="http://arxiv.org/abs/0712.0031">0712.0031</a> | <a href="http://linkage.cs.umass.edu/publications/genericity.bib">.bib</a> ]<br /></li><li><span style="font-weight: bold;">Günter Rote</span>, <span style="font-weight: bold;">Francisco Santos</span> and <span style="font-weight: bold;">Ileana Streinu</span><br /><span style="font-weight: bold; font-style: italic; color: rgb(204, 102, 0);">Pseudo-Triangulations - a Survey.</span><br />in Proc. <span style="font-weight: bold; color: rgb(0, 153, 0);">Joint Summer Research Conference on Discrete and Computational Geometry</span>, 2007.<a href="http://arxiv.org/abs/math/0612672"><br /></a>[ <a href="http://arxiv.org/abs/math/0612672">arXiv</a><a href="http://arxiv.org/abs/math/0612672">:</a><a href="http://arxiv.org/abs/math/0612672">math/0612672</a> | <a href="http://linkage.cs.umass.edu/publications/ptsurvey.bib">.bib</a> ]<br /></li><li><span style="font-weight: bold;">Audrey Lee</span>, <span style="font-weight: bold;">Ileana Streinu</span> and <span style="font-weight: bold;">Louis Theran</span><br /><span style="font-weight: bold; font-style: italic; color: rgb(204, 102, 0);">Graded Sparse Graphs and Matroids.</span><br /><span style="font-weight: bold; color: rgb(153, 0, 0);">Journal of Universal Computer Science</span>, <span style="font-weight: bold;">13</span>(10), 2007.<a href="http://arxiv.org/abs/0711.2838"><br /></a>[ <a href="http://arxiv.org/abs/0711.2838">arXiv:</a><a href="http://arxiv.org/abs/0711.2838">0711.2838</a> | <a href="http://linkage.cs.umass.edu/publications/graded.bib">.bib</a> ]<br /></li><li><strong>Audrey Lee, Ileana Streinu</strong> and <strong>Louis Theran</strong>.<br /><span style="color: rgb(102, 0, 0);"><strong><span style="color: rgb(204, 102, 0);"><em>The Slider-pinning Problem</em>.<br /></span></strong></span>in <a href="http://2007.cccg.ca/">Proc.</a> <strong><span style="color: rgb(0, 153, 0);">19th Canadian Conference on Computational Geometry</span></strong> Carelton University, Ottawa, Ontario, Canada, Aug. 20-22, 2007.<br />[ <a href="http://linkage.cs.umass.edu/publications/sliders-cccg.pdf">.pdf</a> | <a href="http://linkage.cs.umass.edu/publications/sliders.bib">.bib</a> ]<br /></li><li><strong>Ileana Streinu</strong> and <strong>Louis Theran</strong>.<br /><span style="color: rgb(102, 0, 0);"><strong><span style="color: rgb(204, 102, 0);"><em>Sparsity-certifying graph decompositions</em>.</span></strong></span><br />[ <a href="http://arxiv.org/abs/0704.0002">arXiv:</a><a href="http://arxiv.org/abs/0704.0002">0704.0002</a> | <a href="http://linkage.cs.umass.edu/publications/colors.bib">.bib</a> ]<br /></li><li><strong>Ileana Streinu</strong> and <strong>Louis Theran</strong>.<br /><span style="color: rgb(102, 0, 0);"><strong><span style="color: rgb(204, 102, 0);"><em>Sparse Hypergraphs and Pebble Game Algorithms</em>.<br /></span></strong></span>To appear in <span style="font-weight: bold; color: rgb(153, 0, 0);">European Journal of Combinatorics</span>, special issue for the <span style="font-style: italic;">Proceedings of Oriented Matroids (OM'05) </span>(2007).<br />[ <a href="http://arxiv.org/abs/math/0703921">arXiv:</a><a href="http://arxiv.org/abs/math/0703921">math/0703921</a> | <a href="http://linkage.cs.umass.edu/publications/hypergraphs.bib">.bib</a> ]</li><li><strong>Ruth Haas</strong>, <strong>Audrey Lee</strong>, <strong>Ileana Streinu</strong> and <strong>Louis Theran</strong>.<br /><strong><span style="color: rgb(204, 102, 0);"><em>Characterizing Sparse Graphs by Map Decompositions</em>.</span></strong><br /><strong><span style="color: rgb(153, 0, 0);">Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC) </span></strong>, vol. 62, 2007, 3–11.<a href="http://arxiv.org/abs/0704.3843"><br /></a>[ <a href="http://arxiv.org/abs/0704.3843">arXiv:</a><a href="http://arxiv.org/abs/0704.3843">0704.3843</a> | <a href="http://linkage.cs.umass.edu/publications/maps.bib">.bib</a> ]<br /></li><li><strong>Audrey Lee</strong>, <strong>Ileana Streinu</strong> and <strong>Oliver Brock</strong><strong>. </strong><br /><strong><span style="color: rgb(204, 102, 0);"><em>A Methodology for Efficiently Sampling the Conformation Space of Molecular Structures</em>.</span></strong><br />In <a href="http://www.iop.org/EJ/journal/physbio"><strong><span style="color: rgb(153, 0, 0);">Physical Biology 2</span></strong></a>, SPECIAL FOCUS: Flexibility in biomolecules, Nov. 2005, S108-S115.<a href="http://www.iop.org/EJ/abstract/1478-3975/2/4/S05"><br /></a>[ <a href="http://www.iop.org/EJ/abstract/1478-3975/2/4/S05">DOI</a><a href="http://www.iop.org/EJ/abstract/1478-3975/2/4/S05">:</a><a href="http://www.iop.org/EJ/abstract/1478-3975/2/4/S05">10.1088/1478-3975/2/4/S05</a> | <a href="http://linkage.cs.umass.edu/publications/sampling.pdf">.pdf</a> | <a href="http://linkage.cs.umass.edu/publications/sampling.bib">.bib</a> ]<a href="http://www.iop.org/EJ/abstract/1478-3975/2/4/S05"><br /></a></li><li><strong>Audrey Lee</strong>, <strong>Ileana Streinu</strong> and <strong>Louis Theran</strong>.<br /><strong><em><span style="color: rgb(204, 102, 0);">Finding and Maintaining Rigid Components.</span></em><br /></strong>in <a href="http://www.cccg.ca/proceedings/2005/">Proc.</a> <strong><span style="color: rgb(0, 153, 0);">17th Canadian Conference on Computational Geometry</span></strong> Univ. of Windsor, Ontario, Canada, Aug. 10-12, 2005.<br />[ <a href="http://www.cccg.ca/proceedings/2005/72.pdf">.pdf</a> | <a href="http://linkage.cs.umass.edu/publications/components.bib">.bib</a> ]<br /></li></ul>LinKaGe