JCDCG^2 2015 Accepted Talks

Jia-Jie Liu, Shun-Chieh Chang and Chiou-Jiun Lin. The 2-rainbow domination of Sierpinski graphs and extended Sierpinski graphs
Wongsakorn Charoenpanitseri. Results on $(k,t)$-choosability
Wong Tsai-Lien and Zhu Xuding. Total weighting of graphs by combinatorial nullstellensatz
Leo Liberti, Grzegorz Swirszcz and Carlile Lavor. Euclidean Distance Geometry on the Sphere
Adi Jarden, Vadim Levit and Eugen Mandrescu. Unions of Critical Independent Sets of a Graph
Jude Buot. Weight-Equitable Orthogonal Subdivisions of Red and Blue Points in the Plane Lattice
Ratinan Boonklurb, Authawich Narissayaporn and Sirirat Singhun. Super Edge-Magic Labeling of $m$-node $k$-Uniform Hyperpaths
Varanoot Khemmani and Supaporn Saduakdee. $\gamma$-Labeling of Cycles with One Chord
Kazuho Katsumata and Ryuhei Uehara. Convex Configurations of Dissection Puzzles with Seven Pieces
Photchchara Pisantechakool and Xuehou Tan. On the Cops and Robbers Game in a Polygonal Region with Holes
Erik Demaine, Martin Demaine, Jin-Ichi Itoh and Chie Nara. Continuous Flattening of Orthogonal Polyhedra
Takashi Horiyama, Jin-Ichi Itoh, Naoki Katoh, Yuki Kobayashi and Chie Nara. Continuous Folding of Regular Dodecahedra
Min Yan and Yohji Akama. Tiling of the Sphere by Congruent Equilateral Pentagons
Chapkit Charnsamorn, Ratinan Boonklurb and Sirirat Singhun. Pancyclicity and Panconnectedness of line graphs of trees, line graphs of unicyclic graphs, and square of line graphs of connected graphs
Xiao-Nan Lu. Graceful labeling of digraphs and related combinatorial designs
Supanut Chaidee and Kokichi Sugihara. Fitting Spherical Laguerre Voronoi Diagrams to Real World Tessellations Using Planar Photographic Images
Ky Vu, Pierre-Louis Poirion and Leo Liberti. Random projection for linear and integer programming
Narong Punnim. The Linear Forest Number in the Class of Regular Graphs
Andreas Holmsen and Seunghun Lee. Orthogonal colorings of the sphere
Kimiyuki Onaka and Masanori Sawa. WINNER OF GRAPH RAMSEY GAME FOR SMALL ORDERS
Nattawat Boonyoung, Ratinan Boonklurb and Sirirat Singhun. Line Graceful Labelings of $SF(n,m)$ Graphs
Michael Cruz-Rojas, David Flores and Jorge Urrutia. Blocking Minimum Spanning Trees and Nearest Neighbor Graphs
Béla Bollobás, Oliver Riordan, Erik Slivken and Paul Smith. The threshold for jigsaw percolation on random graphs
Miki Miyauchi. Topological graph layouts into a triangular prism
Katsuhisa Yamanaka, Takafumi Ohmori, Takashi Hirayama and Yasuaki Nishitani. (2.6n+2)-Bit Code of Slicing Floorplans
Jin Akiyama. Reversible Pairs of Tessellative Figures
Shinji Imahori, Shizuka Kawade and Yoko Yamakata. Escher-like tilings with weights
Erik D. Demaine and Stefan Langerman. Bust-a-Move/Puzzle Bobble is NP-Complete
Norhazwani Md Yunos, Aleksandar Shurbevski and Hiroshi Nagamochi. A Polynomial-space Exact Algorithm for TSP in Degree-6 Graphs
Hideki Tsuiki and Yasuyuki Tsukamoto. Sudoku Colorings of the 16-cell Imaginary Hypercube
Adiwijaya. A classification of the corona product of a complete graph with some graphs based on f-coloring
Jason S. Ku, Hugo Akitaya, Erik D. Demaine, Tom Hull, Kenneth C. Cheung, Takashi Horiyama, Tomohiro Tachi and Ryuhei Uehara. Box Pleating is Hard
Jason S. Ku, Erik D. Demaine, Matias Korman, Joseph Mitchell, Yota Otachi, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno and André van Renssen. Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces
Satoshi Tayu and Shuichi Ueno. On Evasion Games on Graphs
Kristīne Cīpola and Rusins Freivalds. Ultrametric algorithms and finite geometries
Kārlis Jēriņš and Rusins Freivalds. Cellular automata on finite graphs
Birgit Vogtenhuber, Oswin Aichholzer, Thomas Hackl and Pavel Valtr. A note on the number of general 4-holes in perturbed grids
Michael Biro, Tomohisa Hamamoto, Christiane Schmidt and Yushi Uno. Bounds on the number of hint squares for Shakashaka
Hiro Ito and Yoshinao Shiono. How many undefeated signs exist in an efficient generalized janken including ties?
Juan José Montellano-Ballesteros, Eduardo Rivera-Campo and Ricardo Strausz. On the number of heterochromatic spanning trees for certain edge colourings of complete graphs.
Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy and Anak Yodpinyanee. k-Piece Dissection is NP-hard
Steven Chaplick, Philipp Kindermann, Fabian Lipp and Alexander Wolff. Solving Optimization Problems on Orthogonal Ray Graphs
Sergey Bereg, Sandip Das, Binay Bhattacharya and Tsunehiko Kameda. Geometric k-Center Problem with Centers on Two Parallel Lines
Shohei Satake, Masanori Sawa and Masakazu Jimbo. Erdős–Rényi Theory for Asymmetric Digraphs
William Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin and Alexander Wolff. Minimum Rectilinear Polygons for Given Angle Sequences
Stefan Langerman and Andrew Winslow. Some Results on Tilemakers
Kyle Burke, Erik Demaine, Robert Hearn, Adam Hesterberg, Michael Hoffman, Hiro Ito, Irina Kostitsyna, Maarten Loffler, Yushi Uno, Christiane Schmidt, Ryuhei Uehara and Aaron Williams. Single-Player and Two-Player Buttons & Scissors Games
Jeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Jayson Lynch and Erik Waingarten. Mario Kart is Hard
Kazuya Sakata and Yushi Uno. Shortest spanning closed walks in extended theta graphs
João Thompson. On the generalized erdos-faber-lovász conjecture
Takashi Horiyama, Yoshio Okamoto and Ryuhei Uehara. Ls in L and Sphinxes in Sphinx
Yohji Akama. (An)isohedrality and skeleton of spherical monohedral polygonal tilings
Masanori Aratani. The First Round Choice of Minesweeper
Toshinori Sakai and Jorge Urrutia. On weights of islands of weighted point sets
Paul Adrian Luzon, Mark Anthony Tolentino and Mari-Jo Ruiz. On the Sigma Chromatic Number of the Circulant Graphs C_n(1,2) and C_{2k}(1,k)
Hidefumi Hiraishi and Sonoko Moriyama. Excluded Minors for $\mathbb{Q}$-Representable Matroids in Algebraic Extension
Takuma Matsuzawa and Hirotaka Ono. On the minimum longest monochromatic cycle in all two edge-colored complete graphs
Taisuke Izumi. Improving Lower Bound on Opaque Set for Regular Triangle
Yoshio Sano. On the competition numbers of diamond-free graphs
Wannee Lapchinda and Nittiya Pabhapote. GDDs with two associate classes and with one group of size 1 and m groups of size n