JCDCG^2 2015 program --- ver. 2015.09.04

===
9/14 MON

09:00 The Clock Tower Open
09:00 Registration Desk Open
09:40 Opening Remark (by Naoki Katoh. International Conference Hall III)

09:45 -- 10:35: Session I1: Invited Talk 1: Janos Pach. The role of touch (Chair: Jin AKiyama. International Conference Hall III)

(30 min. coffee break)

11:05 -- 12:05: Session MA,MB,MC: Contributed Talks: 20min. x 3 talks x 3 parallel:

Session MA (chair: Chie Nara. International Conference Hall III)
1) Jin Akiyama. Reversible pairs of tessellative figures
2) Hideki Tsuiki and Yasuyuki Tsukamoto. Sudoku colorings of the 16-cell Imaginary hypercube
3) Andreas Holmsen and Seunghun Lee. Orthogonal colorings of the sphere

Session MB (chair: Yasuko Matsui. International Conference Hall II)
1) Jia-Jie Liu, Shun-Chieh Chang and Chiou-Jiun Lin. The 2-rainbow domination of Sierpinski graphs and extended Sierpinski graphs
2) Kristīne Cīpola and Rusins Freivalds. Ultrametric algorithms and finite geometries
3) Karlis Jerins and Rusins Freivalds. Cellular automata on finite graphs (withdrawn)

Session MC (chair: Matias Korman. International Conference Hall I)
1) Michael Biro, Tomohisa Hamamoto, Christiane Schmidt and Yushi Uno. Bounds on the number of hint squares for shakashaka
2) Kazuho Katsumata and Ryuhei Uehara. Convex configurations of dissection puzzles with seven pieces
3) Masanori Aratani. The first round choice of minesweeper

(1h25m lunch break)

13:30 -- 14:20: Session I2: Invited Talk 2: John Iacono. The geometry of data structures (Chair: Stefan Langerman. International Conference Hall III)

(15 min. break)

14:35 --- 17:35: Session S1: A session in honor of Prof. Katoh's change from Kyoto University to Kwansei Gakuin University (Organizer and Chair: Hiro Ito. International Conference Hall III):
(Including 30 min. coffee break)
1) Invited Talk 3: Toshihide Ibaraki. From my half-century of research life (50 min.)
2) Makoto Osaki. Optimization approach to design of link mechanism. (20 min.)
3) Naoyuki Kamiyama. What I learned from Professor Naoki Katoh. (20 min.)
4) Hiro Ito. Sublinear-time algorithms and a crest bigdata project. (20 min.)
5) Naoki Katoh. Combinatorial rigidity theory: recent developments. (40 min.)

===
9/15 TUE

09:00 The Clock Tower Open

09:15 -- 10:05: Session I4: Invited Talk 4: David Rappaport. Line segments and other objects (Chair: Mikio Kano. International Conference Hall III)

(30 min. coffee break)

10:35 -- 12:35: Session TA,TB,TC: Contributed Talks: 20min. x 6 talks x 3 parallel:

Session TA (chair: Chie Nara. International Conference Hall III)
1) Supanut Chaidee and Kokichi Sugihara. Fitting spherical laguerre Voronoi diagrams to real world tessellations using planar photographic images
2) Shinji Imahori, Shizuka Kawade and Yoko Yamakata. Escher-like tilings with weights
3) Min Yan and Yohji Akama. Tiling of the sphere by congruent equilateral pentagons
4) Yohji Akama. (An)isohedrality and skeleton of spherical monohedral polygonal tilings
5) Takashi Horiyama, Yoshio Okamoto and Ryuhei Uehara. Ls in L and sphinxes in sphinx
6) Katsuhisa Yamanaka, Takafumi Ohmori, Takashi Hirayama and Yasuaki Nishitani. (2.6n+2)-bit code of slicing floorplans

Session TB (chair: Ryuhei Uehara. International Conference Hall II)
1) Wong Tsai-Lien and Zhu Xuding. Total weighting of graphs by combinatorial nullstellensatz
2) Adi Jarden, Vadim Levit and Eugen Mandrescu. Unions of critical independent sets of a graph
3) Narong Punnim. The linear forest number in the class of regular graphs
4) Hidefumi Hiraishi and Sonoko Moriyama. Excluded minors for Q-representable matroids in algebraic extension
5) Adiwijaya. A classification of the corona product of a complete graph with some graphs based on f-coloring
6) Juan José Montellano-Ballesteros, Eduardo Rivera-Campo and Ricardo Strausz. On the number of heterochromatic spanning trees for certain edge colourings of complete graphs.

Session TC (chair: Matias Korman. International Conference Hall I)
1) Michael Cruz-Rojas, David Flores and Jorge Urrutia. Blocking minimum spanning trees and nearest neighbor graphs
2) Toshinori Sakai and Jorge Urrutia. On weights of islands of weighted point sets
3) Birgit Vogtenhuber, Oswin Aichholzer, Thomas Hackl and Pavel Valtr. A note on the number of general 4-holes in perturbed grids
4) Jude Buot. Weight-Equitable Orthogonal Subdivisions of red and blue points in the plane lattice
5) Taisuke Izumi. Improving lower bound on opaque set for regular triangle
6) Ky Vu, Pierre-Louis Poirion and Leo Liberti. Random projection for linear and integer programming

(1h25m lunch break)

14:00 -- 17:00: Session S2: Memorial Session of Ferran Hurtado (Organisers and chairs: Jin Akiyama and Matias Korman. International Conference Hall III):
(Including 30 min. coffee break)
1) Jorge Urrutia. The mathematics of Ferran Hurtado: A brief survey
2) Erik D. Demaine. Ferran plays pachinko
3) Prosenjit Bose. Ferran Hurtado: True renaissance man
4) Matias Korman. His creativity in designing open problems
5) Mikio Kano. Remembering Ferran Hurtado

18:30 --- Banquet (at Kyoto Royal Hotel & Spa)
http://www.ishinhotels.com/kyoto-royal/en/

===
9/16 WED

09:00 The Clock Tower Open

09:15 -- 10:05: Session I5: Invited Talk 5: Takeshi Tokuyama. Balancing location of points: Another application of the Borsuk-Ulam Theorem (Chair: Naoki Katoh. International Conference Hall III)

(30 min. coffee break)

10:35 -- 12:15: Session W1A,W1B,W1C: Contributed Talks: 20min. x 5 talks x 3 parallel:
Session W1A (chair: Yasuko Matsui. International Conference Hall III)
1) Ratinan Boonklurb, Authawich Narissayaporn and Sirirat Singhun. Super edge-magic labeling of m-node k-uniform hyperpaths
2) Varanoot Khemmani and Supaporn Saduakdee. $\gamma$-labeling of cycles with one chord
3) Nattawat Boonyoung, Ratinan Boonklurb and Sirirat Singhun. Line graceful labelings of SF(n,m) graphs
4) Xiao-Nan Lu. Graceful labeling of digraphs and related combinatorial designs (withdrawn)
4) Wannee Lapchinda and Nittiya Pabhapote. GDDs with two associate classes and with one group of size 1 and m groups of size n

Session W1B (chair: Takashi Horiyama. International Conference Hall II)
1) Erik Demaine, Martin Demaine, Jin-Ichi Itoh and Chie Nara. Continuous flattening of orthogonal polyhedra
2) Takashi Horiyama, Jin-Ichi Itoh, Naoki Katoh, Yuki Kobayashi and Chie Nara. Continuous folding of regular dodecahedra
3) Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy and Anak Yodpinyanee. k-piece dissection is NP-hard
4) Jason S. Ku, Hugo Akitaya, Erik D. Demaine, Tom Hull, Kenneth C. Cheung, Takashi Horiyama, Tomohiro Tachi and Ryuhei Uehara. Box pleating is hard
5) 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

Session W1C (chair: Toshinori Sakai. International Conference Hall I)
1) Sergey Bereg, Sandip Das, Binay Bhattacharya and Tsunehiko Kameda. Geometric k-center problem with centers on two parallel lines
2) Leo Liberti, Grzegorz Swirszcz and Carlile Lavor. Euclidean distance geometry on the sphere
3) Steven Chaplick, Philipp Kindermann, Fabian Lipp and Alexander Wolff. Solving optimization problems on orthogonal ray graphs
4) William Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin and Alexander Wolff. Minimum rectilinear polygons for given angle sequences
5) Norhazwani Md Yunos, Aleksandar Shurbevski and Hiroshi Nagamochi. A polynomial-space exact algorithm for TSP in degree-6 graphs

(1h15m lunch break)

13:30 -- 15:30: Session W2A,W2B,W2C: Contributed Talks: 20min. x 6 talks x 3 parallel:

Session W2A (chair: Takashi Horiyama. International Conference Hall III)
1) 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
2) Erik D. Demaine and Stefan Langerman. Bust-a-move/puzzle bobble is NP-complete
3) Jeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Jayson Lynch and Erik Waingarten. Mario kart is Hard
4) Stefan Langerman and Andrew Winslow. Some results on tilemakers
5) Béla Bollobás, Oliver Riordan, Erik Slivken and Paul Smith. The threshold for jigsaw percolation on random graphs
6) Hiro Ito and Yoshinao Shiono. How many undefeated signs exist in an efficient generalized janken including ties?

Session W2B (chair: Shuichi Miyazaki. International Conference Hall II)
1) Photchchara Pisantechakool and Xuehou Tan. On the cops and robbers game in a polygonal region with holes
2) Satoshi Tayu and Shuichi Ueno. On evasion games on graphs
3) Kimiyuki Onaka and Masanori Sawa. Winner of graph Ramsey geme for small orders
4) Yoshio Sano. On the competition numbers of diamond-free graphs
5) Miki Miyauchi. Topological graph layouts into a triangular prism
6) Shohei Satake, Masanori Sawa and Masakazu Jimbo. Erdos–Renyi Theory for Asymmetric Digraphs

Session W2C(chair: Toshinori Sakai. International Conference Hall I)
1) 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
2) João Thompson. On the generalized erdos-faber-lovász conjecture
3) 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)
4) Takuma Matsuzawa and Hirotaka Ono. On the minimum longest monochromatic cycle in all two edge-colored complete graphs
5) Kazuya Sakata and Yushi Uno. Shortest spanning closed walks in extended theta graphs

15:30 Closing Remark (International Conference Hall III)