The 27th China-Japan Conference on Discrete and Computational Geometry, Graphs, and Games
(CJCDCG3 2025)
Home | Committees | Venue | Plenary Speakers | CFP | Accepted Talks | Registration | Visa | Accommodation | Schedule | Photos | Post-conference Proceedings

List of Accepted Talks (Extended Abstracts)

PDF version: accepted_talks.pdf

Jin Akiyama, Erik Demaine, Stefan Langerman and Kiyoko Matsunaga. The Dudeney pair is the only one reversible pair among ones of regular polygons
Zan-Bo Zhang, Wenhao Wu and Weihua He. Cycles of lengths 3 and n − 1 in digraphs under a Bang-Jensen-Gutin-Li type conditon
Ryohei Miyadera, Ryuuto Hara, Akihiro Hamada, Eisuke Shimizu and Hikaru Manabe. Silver Dollar Game with a Pass
Ryohei Miyadera, Aoi Murakami, Kahori Komaki and Akito Tsujii. A Variant of Wythoff's Game and Hofstadter¡¯s G-sequence
Ryouhei Miyadera, Enchong Li, Akito Tsujii, Hikaru Manabe and Kahori Komaki. Variants of Silver Dollar Game
Ryouhei Miyadera, Enchong Li, Ryuuto Hara, Akihiro Hamada, Eisuke Shimizu, Shoei Takahashi and Aoi Murakami. Restricted Nim with a Pass and a Forced Pass
Min Yan, Erxiao Wang and Ze Zhu. Hexagonal Tiling of the Plane
Haofang Sun. Edge - to - edge tiling of the sphere by congruent curvilinear quadrilaterals
Yixi Liao, Junjie Shu and Erxiao Wang. Tilings of the sphere by congruent pentagons IV: Edge combination a4b with general angles
Jinjin Liang, Yixi Liao, Wenchuan Hu and Erxiao Wang. Tilings of the sphere by congruent pentagons V : edge combination a4b with rational angles
Ryouhei Miyadera, Hikaru Manabe, Enchong Li, Akito Tsujii, Aoi Murakami and Kahori Komaki. Combinatorial Games with a Pass
Nanako Omiya, Ryo Yoshinaka and Ayumi Shinohara. Misere Greedy Nim and Misere Bounded Greedy Nim
Wen Chen, Jinjin Liang and Erxiao Wang. Non-side-to-side tilings of the sphere by congruent triangles with any irrational angle
Ryouhei Miyadera, Ryuuto Hara, Akihiro Hamada, Eisuke Shimizu and Hikaru Manabe. Variants of Nim with a Forced Pass
Sitta Alief Farihati, A.N.M. Salman and Pritta Etriana Putri. Rainbow Connection Numbers of Two s-Overlapping r-Uniform Hypercyclics with Size t Classes
Praewa Thongtawee, Awika Kaewniam, Thamon Pandam and Pinkaew Siriwong. Strategies for Solving the Net Puzzle
Xuehou Tan and Rong Chen. A new approach to the two-center problem for pairs of points
Chie Nara and Joseph O'Rourke. Quasigeodesics on the Regular Icosahedron
Yanqiu Tan, Tonan Kamata and Ryuhei Uehara. Computational Complexity on Hexa Gravity Puzzles
Rahmat Al Kafi and Pawat Paksaranuwat. The Extended Partial-Geometric Distribution: Characteristics and Applications
Yiyang Jia and Jun Mitani. Combinatorics and Algebra of 1 ¡Á n Cyclic Stamp Folding
Chuzo Iwamoto and Aoi Shibata. Nuritwin is NP-complete
Hiro Ito and Kotaro Kabutoishi. Masyu (pearl puzzle) is constant-time testable
Te Ba and Ze Zhou. A gradient descent algorithm for computing circle patterns
Chao Yang and Zhujun Zhang. Multifold Polyominoes with Polynomial Sizes
Jie Wu and Chunlin Li. Tilings of genus two surfaces by one or two congruent polygons
Chunlin Li and Jie Wu. Tilings of genus-two surfaces by twelve congruent heptagons
Phapaengmuang Sukkasem, Supanut Chaidee and Aekawit Kittiya. Geometric Strategy Analysis for Magnetic Chess Game
Sigit Pancahayani, Rinovia Simanjuntak and Saladin Uttunggadewa. Ascending subgraph decomposition of complete bipartite graphs and their antimagic labelings
Tomoaki Abuku, Hiroki Inazu, Shun-Ichi Kimura, Koki Suetsugu, Kosaku Watanabe and Takahiro Yamashita. Combinatorial games and the golden ratio on digraphs
Shun-Ichi Kimura, Koki Suetsugu, Kosaku Watanabe and Takahiro Yamashita. Triangular nim with S-Wythoff twist
Shun-Ichi Kimura, Hiyu Inoue and Shin-Nosuke Kadowaki. A very short history of Ending Partizan Games ~ A new playing ground for game researchers~
Muhammad Rafif Fajri, Hilda Assiyatun, Edy Tri Baskoro and Erma Suwastika. An Introduction to Inverse Ramsey-Minimal Graphs for Matchings in Regular Graphs
Liping Tang and Michiko Ogaku. Linguistic indirectness in public cheap talk games
Kanae Yoshiwatari. Bicolored Arc Kayles with mis¨¨re play is PSPACE-complete
Princess Gonzales, Allyssa Keith Galindo, Emmanuel Philip David and Mark Caay. Independent Equitable Rings Domination in Some Graphs
Robert Barish and Tetsuo Shibuya. Cubic Planar Positive $1$-in-$3$ Satisfiability and the complexity of tiling finite simply connected regions
Hiroki Inazu. Ending Partizan Quotient
Benjamin Rin and Daniël Andel. Hive is PSPACE-Hard
Benjamin Rin, Marius Drop and Finn van der Velde. Quoridor is PSPACE-Complete
Yu Fujiwara, Tatsuya Gima, Yasuaki Kobayashi and Yota Otachi. Computing the edge-cut width of a graph
Zerui Sun, Eunju Park, Dennis Wong and Zuling Chang. A simple greedy k-ary de Bruijn sequence construction
Atsuki Nagao and Karin Umebayashi. Pre-assignment Unification for Hamiltonian Cycle Problem on 4-Regular Planar Graph.
Wei Wang and Da Zhao. Graph isomorphism and multivariate graph spectrum
Korina Ernjulie Manaloto and Rovin Santos. Prime labeling of some graphs using Eisenstein integers
Ivan Hal Sudborough, Zooey Baker, Sergey Bereg and Zevi Miller. On Finding Optimum Permutation Arrays for Chebyshev Distances
Dumplings The Cat, Viet Pham and Penying Rochanakul. Purring for Points: A Strategic Guide to Maximizing Scores in Calico
Yasuko Matsui. Enumerate All Minimum Cost Edge-Colorings of Trees
Toshinori Sakai. Embedding of Cycles into the Plane Containing Given Point Sets with Many Self-Crossings
Piyashat Sripratak. Connectedness of the Graph from $(n^2-1)$-puzzle with 1 Fixed Cell
Atsuki Nagao, Nanari Sano, Ayako Satomi and Mei Sekiguchi. Card-Based Physical Zero-Knowledge Proofs for Distance-Aware and Arithmetic Puzzles.