default search action
JCDCGG 2015: Kyoto, Japan
- Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno:
Discrete and Computational Geometry and Graphs - 18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9943, Springer 2016, ISBN 978-3-319-48531-7 - Oswin Aichholzer
, Thomas Hackl, Pavel Valtr, Birgit Vogtenhuber:
A Note on the Number of General 4-holes in (Perturbed) Grids. 1-12 - Jin Akiyama, Stefan Langerman, Kiyoko Matsunaga:
Reversible Nets of Polyhedra. 13-23 - Binay Bhattacharya, Ante Custic
Geometric p-Center Problems with Centers Constrained to Two Lines. 24-36 - Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee:
Dissection with the Fewest Pieces is Hard, Even to Approximate. 37-48 - Jeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Jayson Lynch, Erik Waingarten
Mario Kart Is Hard. 49-59 - Kyle Burke
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). 60-72 - Supanut Chaidee
Fitting Spherical Laguerre Voronoi Diagrams to Real-World Tessellations Using Planar Photographic Images. 73-84 - Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Chie Nara:
Continuous Flattening of Orthogonal Polyhedra. 85-93 - Erik D. Demaine, Stefan Langerman:
Bust-a-Move/Puzzle Bobble Is NP-complete. 94-104 - William S. Evans, Krzysztof Fleszar, Philipp Kindermann
Minimum Rectilinear Polygons for Given Angle Sequences. 105-119 - Takashi Horiyama, Jin-ichi Itoh, Naoki Katoh, Yuki Kobayashi, Chie Nara:
Continuous Folding of Regular Dodecahedra. 120-131 - Shinji Imahori, Shizuka Kawade, Yoko Yamakata:
Escher-like Tilings with Weights. 132-142 - Hiro Ito, Yoshinao Shiono:
Number of Ties and Undefeated Signs in a Generalized Janken. 143-154 - Supaporn Saduakdee, Varanoot Khemmani
\gamma -Labeling of a Cycle with One Chord. 155-166 - Hugo A. Akitaya
Box Pleating is Hard. 167-179 - Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. 180-192 - Andrei Kupavskii, János Pach:
Simultaneous Approximation of Polynomials. 193-203 - Leo Liberti, Grzegorz Swirszcz, Carlile Lavor
Distance Geometry on the Sphere. 204-215 - Paul Adrian D. Luzon, Mari-Jo P. Ruiz, Mark Anthony C. Tolentino
The Sigma Chromatic Number of the Circulant Graphs C_n(1, 2) , C_n(1, 3) , and C_2n(1, n). 216-227 - Norhazwani Md Yunos, Aleksandar Shurbevski
A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs. 228-240 - Miki Miyauchi:
Topological Graph Layouts into a Triangular Prism. 241-246 - Yoshio Sano:
On the Competition Numbers of Diamond-Free Graphs. 247-252 - Satoshi Tayu, Shuichi Ueno:
On Evasion Games on Graphs. 253-264 - Hideki Tsuiki, Yasuyuki Tsukamoto:
Sudoku Colorings of a 16-Cell Pre-fractal. 265-276 - Jorge Urrutia:
The Mathematics of Ferran Hurtado: A Brief Survey. 277-292
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-14 22:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: