Abstract is missing.
- On Geometric Graphs on Point Sets in the PlaneJorge Urrutia. 1-17 [doi]
- The Two-Distance Sets in Dimension FourFerenc Szöllösi. 18-27 [doi]
- Negative Instance for the Edge Patrolling Beacon ProblemZachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jason S. Ku, Jayson Lynch. 28-35 [doi]
- Global Location-Domination in the Join and Cartesian Product of GraphsAnalen Malnegro, Gina Malacas. 36-42 [doi]
- The Metric Dimension of the Join of Paths and CyclesIan June L. Garces, Jose B. Rosario. 43-58 [doi]
- kP Complexity ClassesRobert D. Barish, Akira Suyama. 59-73 [doi]
- Hamiltonicity of Graphs on Surfaces in Terms of Toughness and Scattering Number - A SurveyKenta Ozeki. 74-95 [doi]
- On Structural Parameterizations of Node KaylesYasuaki Kobayashi. 96-105 [doi]
- Robustness in Power-Law Kinetic Systems with Reactant-Determined InteractionsNoel Fortun, Angelyn Lao, Luis F. Razon, Eduardo R. Mendoza. 106-121 [doi]
- Toward Unfolding Doubly Covered n-StarsHugo A. Akitaya, Brad Ballinger, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Irina Kostitsyna, Jason S. Ku, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara. 122-135 [doi]
- Crystallographic Flat Origami from n-Uniform TilingsMa. Louise Antonette De Las Penas, Eduard C. Taganap. 136-151 [doi]
- Packing Cube Nets into Rectangles with O(1) HolesErik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Yushi Uno, Andrew Winslow. 152-164 [doi]
- On the Complexity of Jelly-no-PuzzleChao Yang 0003. 165-174 [doi]
- Computational Complexity of Two Pencil Puzzles: Kurotto and JuosanChuzo Iwamoto, Tatsuaki Ibusuki. 175-185 [doi]