My Account Log in

1 option

Discrete and Computational Geometry, Graphs, and Games : 24th Japanese Conference, JCDCGGG 2022, Virtual Event, September 9–11, 2022, Revised Selected Papers / edited by Jin Akiyama, Hiro Ito, Toshinori Sakai.

Springer Nature - Springer Computer Science eBooks 2026 English International Available online

View online
Format:
Book
Author/Creator:
Akiyama, J.
Contributor:
Ito, Hiro.
Sakai, Toshinori.
Series:
Lecture Notes in Computer Science, 1611-3349 ; 14364
Language:
English
Subjects (All):
Computer graphics.
Computer science--Mathematics.
Computer science.
Discrete mathematics.
Algorithms.
Data structures (Computer science).
Information theory.
Convex geometry.
Discrete geometry.
Computer Graphics.
Discrete Mathematics in Computer Science.
Design and Analysis of Algorithms.
Data Structures and Information Theory.
Convex and Discrete Geometry.
Local Subjects:
Computer Graphics.
Discrete Mathematics in Computer Science.
Design and Analysis of Algorithms.
Data Structures and Information Theory.
Convex and Discrete Geometry.
Physical Description:
1 online resource (664 pages)
Edition:
1st ed. 2026.
Place of Publication:
Cham : Springer Nature Switzerland : Imprint: Springer, 2026.
Summary:
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.
Contents:
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.
Notes:
Description based on publisher supplied metadata and other sources.
ISBN:
3-032-00281-8
OCLC:
1531974055

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account