Discrete and Computational Geometry, Graphs, and Games

CHF 124.60
Auf Lager
SKU
T4PATTRBQSD
Stock 1 Verfügbar
Geliefert zwischen Fr., 23.01.2026 und Mo., 26.01.2026

Details

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.


Inhalt

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.

Weitere Informationen

  • Allgemeine Informationen
    • GTIN 09783032002808
    • Genre Information Technology
    • Editor Jin Akiyama, Hiro Ito, Toshinori Sakai
    • Lesemotiv Verstehen
    • Anzahl Seiten 428
    • Größe H24mm x B155mm x T235mm
    • Jahr 2025
    • EAN 9783032002808
    • Format Kartonierter Einband
    • ISBN 978-3-032-00280-8
    • Titel Discrete and Computational Geometry, Graphs, and Games
    • Untertitel 24th Japanese Conference, JCDCGGG 2022, Virtual Event, September 9-11, 2022, Revised Selected Papers
    • Gewicht 663g
    • Herausgeber Springer
    • Sprache Englisch

Bewertungen

Schreiben Sie eine Bewertung
Nur registrierte Benutzer können Bewertungen schreiben. Bitte loggen Sie sich ein oder erstellen Sie ein Konto.
Made with ♥ in Switzerland | ©2025 Avento by Gametime AG
Gametime AG | Hohlstrasse 216 | 8004 Zürich | Schweiz | UID: CHE-112.967.470