Robin Flatland
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Robin Flatland has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Mirela Damian
Villanova University
23 shared publications - Erik D. Demaine
Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, USA
7 shared publications - Joseph O'Rourke
Smith College
7 shared publications - Suneeta Ramaswami
Rutgers University
5 shared publications - Vera Sacristán
Universitat Politecnica de Catalunya, Barcelona, Spain
5 shared publications - James Matthews
Siena College, Loudonville, NY, USA
4 shared publications
Latest Publications
- Open Access
- 12 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 749-755
How a Small College Can Make a Big Impact on High School CS
At SIGCSE 2022 we reported on a grant funded CSforAll project to develop comprehensive and sustained college-high school partnerships focused on building computer science (CS) teacher capacity and broadening participation in high school CS classrooms. The partnerships involve a wide range of districts including high-needs and small rural ones. In this paper we first provide an update on this distinctive and successful project. Grant funding ended in 2022, however the project continues to grow and evolve. Led by faculty at a small liberal arts college, some of the results are stunning and demonstrate the impact a small college can have. For example, in the last three years the number of partner school districts has increased from 23 to 54. The teacher retention rate is 95%, with the most veteran teachers belonging to the partnership for almost ten years. This update includes two additional years of data on student experiences in their CS classes. Second, we provide suggestions and encouragement for replicating this work. The project provides a model that can be used by other colleges and universities for building long-term partnerships with schools to improve CS education. Important components of this model include summer and school year professional development, curriculum and support for four CS courses, a dual-enrollment program, teacher CS certification pathways, and a professional learning community. We offer suggestions and identify opportunities and challenges for those interested in developing a similar program.
- 12 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 749-755
Open AccessHow a Small College Can Make a Big Impact on High School CS
At SIGCSE 2022 we reported on a grant funded CSforAll project to develop comprehensive and sustained college-high school partnerships focused on building computer science (CS) teacher capacity and broadening participation in high school CS classrooms. The partnerships involve a wide range of districts including high-needs and small rural ones. In this paper we first provide an update on this distinctive and successful project. Grant funding ended in 2022, however the project continues to grow and evolve. Led by faculty at a small liberal arts college, some of the results are stunning and demonstrate the impact a small college can have. For example, in the last three years the number of partner school districts has increased from 23 to 54. The teacher retention rate is 95%, with the most veteran teachers belonging to the partnership for almost ten years. This update includes two additional years of data on student experiences in their CS classes. Second, we provide suggestions and encouragement for replicating this work. The project provides a model that can be used by other colleges and universities for building long-term partnerships with schools to improve CS education. Important components of this model include summer and school year professional development, curriculum and support for four CS courses, a dual-enrollment program, teacher CS certification pathways, and a professional learning community. We offer suggestions and identify opportunities and challenges for those interested in developing a similar program.
- Open Access
- 14 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 1855-1856
Discovering Computer Science: A High School CS Course Co-developed by College & High School Teachers
- 14 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 1855-1856
Open AccessDiscovering Computer Science: A High School CS Course Co-developed by College & High School Teachers
- Open Access
- 2 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 680-686
"I Can Do That Too"
- 2 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 680-686
Open Access"I Can Do That Too"
- 14 September 2022
- Published by Elsevier in Computational Geometry
- Vol. 109, 101944
Unfolding 3-separated polycube graphs of arbitrary genus
- 14 September 2022
- Published by Elsevier in Computational Geometry
- Vol. 109, 101944
Unfolding 3-separated polycube graphs of arbitrary genus
- 1 October 2021
- Published by Elsevier in Computational Geometry
- Vol. 98
Unfolding polycube trees with constant refinement
- 1 October 2021
- Published by Elsevier in Computational Geometry
- Vol. 98
Unfolding polycube trees with constant refinement
- Open Access
Unfolding Polycube Trees with Constant Refinement
We show that every polycube tree can be unfolded with a 4x4 refinement of the grid faces. This is the first constant refinement unfolding result for polycube trees that are not required to be well-separated.
Open AccessUnfolding Polycube Trees with Constant Refinement
We show that every polycube tree can be unfolded with a 4x4 refinement of the grid faces. This is the first constant refinement unfolding result for polycube trees that are not required to be well-separated.
- 2 January 2021
- Published by Springer Nature in Algorithmica
- Vol. 83 (5) , 1316-1351
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
- 2 January 2021
- Published by Springer Nature in Algorithmica
- Vol. 83 (5) , 1316-1351
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
- Open AccessUniversal Reconfiguration of Facet-Connected Modular Robots by Pivots: The $O(1)$ MusketeersWe present the first universal reconfiguration algorithm for transforming a modular robot between any two facet-connected square-grid configurations using pivot moves. More precisely, we show that five extra "helper" modules ("musketeers") suffice to reconfigure the remaining $n$ modules between any two given configurations. Our algorithm uses $O(n^2)$ pivot moves, which is worst-case optimal. Previous reconfiguration algorithms either require less restrictive "sliding" moves, do not preserve facet-connectivity, or for the setting we consider, could only handle a small subset of configurations defined by a local forbidden pattern. Configurations with the forbidden pattern do have disconnected reconfiguration graphs (discrete configuration spaces), and indeed we show that they can have an exponential number of connected components. But forbidding the local pattern throughout the configuration is far from necessary, as we show that just a constant number of added modules (placed to be freely reconfigurable) suffice for universal reconfigurability. We also classify three different models of natural pivot moves that preserve facet-connectivity, and show separations between these models.Open AccessUniversal Reconfiguration of Facet-Connected Modular Robots by Pivots: The $O(1)$ MusketeersWe present the first universal reconfiguration algorithm for transforming a modular robot between any two facet-connected square-grid configurations using pivot moves. More precisely, we show that five extra "helper" modules ("musketeers") suffice to reconfigure the remaining $n$ modules between any two given configurations. Our algorithm uses $O(n^2)$ pivot moves, which is worst-case optimal. Previous reconfiguration algorithms either require less restrictive "sliding" moves, do not preserve facet-connectivity, or for the setting we consider, could only handle a small subset of configurations defined by a local forbidden pattern. Configurations with the forbidden pattern do have disconnected reconfiguration graphs (discrete configuration spaces), and indeed we show that they can have an exponential number of connected components. But forbidding the local pattern throughout the configuration is far from necessary, as we show that just a constant number of added modules (placed to be freely reconfigurable) suffice for universal reconfigurability. We also classify three different models of natural pivot moves that preserve facet-connectivity, and show separations between these models.
- Open Access
- 21 February 2018
- Published by Association for Computing Machinery (ACM)
- p. 467-472
A Summer Program to Attract Potential Computer Science Majors
Computer Science (CS) is not taught in enough high schools thus many students arrive at college or university knowing little about it and often do not consider taking a CS course during their first year. At the same time, we encounter many college or university juniors and seniors who, while taking their first CS course, discover an aptitude and interest, at which point it is too late. We describe an innovative one-week residential summer program designed to educate non-computer science majors, before their second year of college or university, about the field's many areas and long-term prospects. The program has succeeded at encouraging undecided students to major or minor in CS and thus somewhat ameliorates the lack of CS in K-12 education and furthers the conference goal of "CS For All".
- 21 February 2018
- Published by Association for Computing Machinery (ACM)
- p. 467-472
Open AccessA Summer Program to Attract Potential Computer Science Majors
Computer Science (CS) is not taught in enough high schools thus many students arrive at college or university knowing little about it and often do not consider taking a CS course during their first year. At the same time, we encounter many college or university juniors and seniors who, while taking their first CS course, discover an aptitude and interest, at which point it is too late. We describe an innovative one-week residential summer program designed to educate non-computer science majors, before their second year of college or university, about the field's many areas and long-term prospects. The program has succeeded at encouraging undecided students to major or minor in CS and thus somewhat ameliorates the lack of CS in K-12 education and furthers the conference goal of "CS For All".
- Open Access
Minimal forcing sets for 1D origami
This paper addresses the problem of finding minimum forcing sets in origami. The origami material folds flat along straight lines called creases that can be labeled as mountains or valleys. A forcing set is a subset of creases that force all the other creases to fold according to their labels. The result is a flat folding of the origami material. In this paper we develop a linear time algorithm that finds minimum forcing sets in one dimensional origami.
Open AccessMinimal forcing sets for 1D origami
This paper addresses the problem of finding minimum forcing sets in origami. The origami material folds flat along straight lines called creases that can be labeled as mountains or valleys. A forcing set is a subset of creases that force all the other creases to fold according to their labels. The result is a flat folding of the origami material. In this paper we develop a linear time algorithm that finds minimum forcing sets in one dimensional origami.