Discrete and Computational Geometry, Graphs, and Games - 24th Japanese Conference, JCDCGGG 2022, Virtual Event, September 9-11, 2022, Revised Selected Papers

This book, LNCS 14364, constitutes the refereed proceedings of the 24th Japanese Conference on Discrete and Computational Geometry and Graphs, JCDCGGG 2022, held virtually during September 9-11, 2022.
The 22 full papers included in this volume were carefully reviewed and selected from 35 submissions. The papers feature advances made in the field of computational geometry and focus on emerging technologies, new methodology and applications, graph theory and dynamics.

Sommario

Memorial for Mari-Jo P. Ruiz ---A Colleague and Friend in Art and Math.- Mari-Jo P. Ruiz: Mathematician, Mentor, Leader.- Mari-Jo P. Ruiz and Graph Theory.- This Game Is Not Going To Analyze Itself.- Unveil the secret hidden in the Haberdasher's puzzle -Survey on Reversibility.- Multipartite Ramsey Numbers of Double Stars.- Counting $2$-factors of $4$-regular bipartite graphs is $#P$-complete.- The Two-Squirrel Problem and Its Relatives.- A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs.- Complexity of Solo Chess with Unlimited Moves.- Stars in Forbidden Triples Generating a Finite Set of 4-connected Graphs.- Geodesic Paths Passing Through All Faces on A Polyhedron.- Partitions of complete twisted graphs into plane spanning trees.- The Edge-Intersection Graph of Induced Paths in a Graph.- All Paths Lead to Rome.- Numerically balanced dice on convex isohedra.- Nonrealizable Planar and Spherical Occlusion Diagrams.- Maximum numbers of rigid faces and edges in continuous flattening of regular polyhedra.- Find Routes on a Doughnut.- Previous Player's Positions in Impartial Three-Dimensional Chocolate-Bar Games with Constrained Chocolate Size.- Algorithms for Burning Schedule Reconfiguration Problem on Path Forests.- Continuous Folding of the Surface of a Hypercube onto one of its Facets.- Weights of Convex Quadrilaterals and Empty Triangles in Weighted Point Sets.- New Formulation for Coloring Circle Graphs.- On the Computational Complexity of Pushing Machine.

Dettagli sul prodotto

• Con la collaborazione di: Jin Akiyama (Editore), Hiro Ito (Editore), Toshinori Sakai (Editore)
• Editore: Springer, Berlin
• Lingue: Inglese
• Formato: Tascabile
• Pubblicazione: 08.09.2025
• EAN: 9783032002808
• ISBN: 978-3-0-3200280-8
• Pagine: 423
• Illustrazioni: IX, 423 p. 262 illus.
• Serie: Lecture Notes in Computer Science
• Categorie: Scienze naturali, medicina, informatica, tecnica > Informatica, EDP > Software applicativo; Geometrie, Algorithmen und Datenstrukturen, Diskrete Mathematik, Informationstheorie, Theoretische Informatik, Mathematik für Informatiker, Computer Graphics, Data Structures and Information Theory, Discrete Mathematics in Computer Science, Discrete geometry, Convex and Discrete Geometry, Design and Analysis of Algorithms, Graph Theory, computational geometry, Graph algorithms, winning strategies of puzzles and games, algorithms on geometric problems, complexity of graph problems, complexity of geometric problems, complexity of puzzles and games, combinatorial game theory