305 | -- | 306 | Hiro Ito. Preface |
307 | -- | 319 | Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam. Cutting a Convex Polyhedron Out of a Sphere |
321 | -- | 326 | Jin Akiyama, Hiro Ito, Midori Kobayashi, Gisaku Nakamura. Arrangements of ::::n:::: Points whose Incident-Line-Numbers are at most ::::n::::/2 |
327 | -- | 339 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian. Colorful Strips |
341 | -- | 351 | Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno. Algorithmic Folding Complexity |
353 | -- | 362 | L. Sunil Chandran, Mathew C. Francis, Rogers Mathew. Chordal Bipartite Graphs with High Boxicity |
363 | -- | 376 | Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O Rourke. Continuous Blooming of Convex Polyhedra |
377 | -- | 397 | Erik D. Demaine, Martin L. Demaine, Vi Hart, Gregory N. Price, Tomohiro Tachi. (Non)Existence of Pleated Folds: How Paper Folds Between Creases |
399 | -- | 411 | Adrian Dumitrescu, János Pach. Minimum Clique Partition in Unit Disk Graphs |
413 | -- | 418 | Mikio Kano, Hiroo Kishimoto. Spanning ::::k::::-Trees of ::::n::::-Connected Graphs |
419 | -- | 430 | Michael Kerber, Michael Sagraloff. A Note on the Complexity of Real Algebraic Hypersurfaces |
431 | -- | 439 | Hiroshi Koizumi, Kokichi Sugihara. Maximum Eigenvalue Problem for Escherization |
441 | -- | 450 | Takayasu Kuwata, Hiroshi Maehara. Lattice Points on Similar Figures and Conics |
451 | -- | 463 | Hiroshi Maehara, Norihide Tokushige. Classification of the Congruent Embeddings of a Tetrahedron into a Triangular Prism |
465 | -- | 473 | János Pach, Deniz Sariöz. On the Structure of Graphs with Low Obstacle Number |