Robin Y. Flatland

Comput. Geom., 2023

"I Can Do That Too": Factors Influencing a Sense of Belonging for Females in Computer Science Classrooms.

[BibT_eX]

[DOI]

Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 1, 2023

2022

Building CS Teacher Capacity Through Comprehensive College/High School Partnerships.

[BibT_eX]

[DOI]

Proceedings of the SIGCSE 2022: The 53rd ACM Technical Symposium on Computer Science Education, 2022

2021

Unfolding polycube trees with constant refinement.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers.

[BibT_eX]

[DOI]

Algorithmica, 2021

Unfolding a New Class of Orthographs of Arbitrary Genus.

[BibT_eX]

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2018

Unfolding Orthotrees with Constant Refinement.

[BibT_eX]

[DOI]

CoRR, 2018

A Summer Program to Attract Potential Computer Science Majors.

[BibT_eX]

[DOI]

Proceedings of the 49th ACM Technical Symposium on Computer Science Education, 2018

Catch 'em Early: Internship and Assistantship CS Mentoring Programs for Underclassmen.

[BibT_eX]

[DOI]

Proceedings of the 49th ACM Technical Symposium on Computer Science Education, 2018

Connecting Colleges/Universities and Local High Schools: A New Model for High School CS Teacher Development.

[BibT_eX]

[DOI]

Proceedings of the 49th ACM Technical Symposium on Computer Science Education, 2018

Toward Unfolding Doubly Covered n-Stars.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Unfolding Low-Degree Orthotrees with Constant Refinement.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement.

[BibT_eX]

[DOI]

Graphs Comb., 2017

Minimal forcing sets for 1D origami.

[BibT_eX]

[DOI]

CoRR, 2017

2015

Minimum Forcing Sets for Miura Folding Patterns.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Supporting CS10K: A New Computer Science Methods Course for Mathematics Education Students.

[BibT_eX]

[DOI]

Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 2015

Squeeze-free Hamiltonian Paths in Grid Graphs.

[BibT_eX]

[DOI]

Alexandru Damian

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm.

[BibT_eX]

[DOI]

Erik D. Demaine

Graphs Comb., 2014

Switching to Directional Antennas with Constant Increase in Radius and Hop Distance.

[BibT_eX]

[DOI]

Algorithmica, 2014

2013

Coverage with k-transmitters in the presence of obstacles.

[BibT_eX]

[DOI]

Diane L. Souvaine

Ryuhei Uehara

J. Comb. Optim., 2013

Spanning Properties of graphs induced by Directional Antennas.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2013

Unfolding Orthogrids with Constant Refinement.

[BibT_eX]

[DOI]

Erik D. Demaine

CoRR, 2013

Establishing strong connectivity using optimal radius half-disk antennas.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Efficient reconfiguration of lattice-based modular robots.

[BibT_eX]

[DOI]

Comput. Geom., 2013

2011

Efficient constant-velocity reconfiguration of crystalline robots.

[BibT_eX]

[DOI]

Robotica, 2011

Collective Construction of 2D Block Structures with Holes

[BibT_eX]

[DOI]

Zachary Fitzsimmons

CoRR, 2011

2010

Connecting Polygonizations via Stretches and Twangs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Connectivity of Graphs Induced by Directional Antennas

[BibT_eX]

[DOI]

CoRR, 2010

Shape Replication through Self-Assembly and RNase Enzymes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Coverage with <i>k</i>-Transmitters in the Presence of Obstacles.

[BibT_eX]

[DOI]

Diane L. Souvaine

Ryuhei Uehara

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Linear reconfiguration of cube-style modular robots.

[BibT_eX]

[DOI]

Stefanie Wuhrer

Comput. Geom., 2009

Using modes of inquiry and engaging problems to link computer science and mathematics.

[BibT_eX]

[DOI]

James R. Matthews

Proceedings of the 40th SIGCSE Technical Symposium on Computer Science Education, 2009

2008

Grid Vertex-Unfolding Orthogonal Polyhedra.

[BibT_eX]

[DOI]

Joseph O'Rourke

Discret. Comput. Geom., 2008

Unfolding Manhattan Towers.

[BibT_eX]

[DOI]

Joseph O'Rourke

Comput. Geom., 2008

Realistic Reconfiguration of Crystalline (and Telecube) Robots.

[BibT_eX]

[DOI]

Stefanie Wuhrer

Proceedings of the Algorithmic Foundation of Robotics VIII, 2008

2007

Epsilon-Unfolding Orthogonal Polyhedra.

[BibT_eX]

[DOI]

Joseph O'Rourke

Graphs Comb., 2007

A New Lower Bound on Guard Placement for Wireless Localization

[BibT_eX]

[DOI]

CoRR, 2007

Vertex Pops and Popturns.

[BibT_eX]

[DOI]

Godfried T. Toussaint

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Curves in the Sand: Algorithmic Drawing.

[BibT_eX]

[DOI]

Godfried T. Toussaint

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2004

On sequential triangulations of simple polygons.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2000

Extending range queries and nearest neighbors.

[BibT_eX]

[DOI]

Charles V. Stewart

Comput. Geom., 2000

Maintaining Valid Topology with Active Contours: Theory and Application.

[BibT_eX]

[DOI]

Proceedings of the 2000 Conference on Computer Vision and Pattern Recognition (CVPR 2000), 2000

1996

Geometric constraints and stereo disparity computation.

[BibT_eX]

[DOI]

Charles V. Stewart

Kishore Bubna

Int. J. Comput. Vis., 1996

Extending Rectangular Range Reporting with Query Sensitive Analysis.

[BibT_eX]

[DOI]