Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph
- 作者Michael A. Henning; Anders Yeo
- 卷第23卷
- 期第6期
- 印刷ISSN0911-0119
- 电子ISSN1435-5914
- 文件大小106.50KB
- 发表时间2007-12
- DOI10.1007/s00373-007-0757-5
- 页码647-657
Unfolding Manhattan TowersMirela Damian; Robin Flatland; Joseph O'Rourke · 2008
Grid Vertex-Unfolding Orthogonal PolyhedraMirela Damian; Robin Flatland; Joseph O’Rourke · 2008
Connecting Polygonizations via Stretches and TwangsMirela Damian; Robin Flatland; Joseph O’Rourke; Suneeta Ramaswami · 2010
Unfolding Genus-2 Orthogonal Polyhedra with Linear RefinementDamian, Mirela; Demaine, Erik; Flatland, Robin; O’Rourke, Joseph · Graphs and Combinatorics · 2017
Linear reconfiguration of cube-style modular robotsGreg Aloupis; Sébastien Collette; Mirela Damian; Erik D. Demaine; Robin Flatland; Stefan Langerman; Joseph O'Rourke; Suneeta Ramaswami; Vera Sacristán; Stefanie Wuhrer · 2009
Efficient constant-velocity reconfiguration of crystalline robotsAloupis, Greg; Collette, Sébastien; Damian, Mirela; Demaine, Erik D.; Flatland, Robin; Langerman, Stefan; O'Rourke, Joseph; Pinciu, Val; Ramaswami, Suneeta; Sacristán, Vera; Wuhrer, Stefanie · Robotica · 2011