Abstract is missing.
- A Note on the Number of General 4-holes in (Perturbed) GridsOswin Aichholzer, Thomas Hackl, Pavel Valtr, Birgit Vogtenhuber. 1-12 [doi]
- Reversible Nets of PolyhedraJin Akiyama, Stefan Langerman, Kiyoko Matsunaga. 13-23 [doi]
- Geometric p-Center Problems with Centers Constrained to Two LinesBinay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh. 24-36 [doi]
- Dissection with the Fewest Pieces is Hard, Even to ApproximateJeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee. 37-48 [doi]
- Mario Kart Is HardJeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Jayson Lynch, Erik Waingarten. 49-59 [doi]
- Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract)Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt 0001, Ryuhei Uehara, Yushi Uno, Aaron Williams. 60-72 [doi]
- Fitting Spherical Laguerre Voronoi Diagrams to Real-World Tessellations Using Planar Photographic ImagesSupanut Chaidee, Kokichi Sugihara. 73-84 [doi]
- Continuous Flattening of Orthogonal PolyhedraErik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Chie Nara. 85-93 [doi]
- Bust-a-Move/Puzzle Bobble Is NP-completeErik D. Demaine, Stefan Langerman. 94-104 [doi]
- Minimum Rectilinear Polygons for Given Angle SequencesWilliam S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff. 105-119 [doi]
- Continuous Folding of Regular DodecahedraTakashi Horiyama, Jin-ichi Itoh, Naoki Katoh, Yuki Kobayashi, Chie Nara. 120-131 [doi]
- Escher-like Tilings with WeightsShinji Imahori, Shizuka Kawade, Yoko Yamakata. 132-142 [doi]
- Number of Ties and Undefeated Signs in a Generalized JankenHiro Ito, Yoshinao Shiono. 143-154 [doi]
- \gamma -Labeling of a Cycle with One ChordSupaporn Saduakdee, Varanoot Khemmani. 155-166 [doi]
- Box Pleating is HardHugo Alves Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara. 167-179 [doi]
- Symmetric Assembly Puzzles are Hard, Beyond a Few PiecesErik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno. 180-192 [doi]
- Simultaneous Approximation of PolynomialsAndrei Kupavskii, János Pach. 193-203 [doi]
- Distance Geometry on the SphereLeo Liberti, Grzegorz Swirszcz, Carlile Lavor. 204-215 [doi]
- The Sigma Chromatic Number of the Circulant Graphs C_n(1, 2) , C_n(1, 3) , and C_2n(1, n)Paul Adrian D. Luzon, Mari-Jo P. Ruiz, Mark Anthony C. Tolentino. 216-227 [doi]
- A Polynomial-Space Exact Algorithm for TSP in Degree-6 GraphsNorhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi. 228-240 [doi]
- Topological Graph Layouts into a Triangular PrismMiki Miyauchi. 241-246 [doi]
- On the Competition Numbers of Diamond-Free GraphsYoshio Sano. 247-252 [doi]
- On Evasion Games on GraphsSatoshi Tayu, Shuichi Ueno. 253-264 [doi]
- Sudoku Colorings of a 16-Cell Pre-fractalHideki Tsuiki, Yasuyuki Tsukamoto. 265-276 [doi]
- The Mathematics of Ferran Hurtado: A Brief SurveyJorge Urrutia. 277-292 [doi]