Discrete and computational geometry, graphs, and games : 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018 : revised selected papers
Author(s)
Bibliographic Information
Discrete and computational geometry, graphs, and games : 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018 : revised selected papers
（Lecture notes in computer science, 13034 . LNCS sublibrary ; SL1 . Theoretical computer science and general issues）
Springer, c2021
Available at / 2 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||13034200043175887
-
No Libraries matched.
- Remove all filters.
Note
Other editors: Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Yushi Uno
Includes bibliographical references and author index
Description and Table of Contents
Description
This book constitutes the thoroughly refereed post-conference proceedings of the 21st Japanese Conference on Discrete and Computational Geometry and Graphs, JCDCGGG 2018, held in Quezon City, Philippines, in September 2018.
The total of 14 papers included in this volume was carefully reviewed and selected from 25 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.
Table of Contents
On Geometric Graphs on Point Sets in the Plane.- The Two-distance Sets in Dimension Four.- Negative Instance for the Edge Patrolling Beacon Problem.- Global Location-Domination in the Join and Cartesian Product of Graphs.- The Metric Dimension of the Join of Paths and Cycles.- Barnette's Conjecture Through the Lens of the ModkP Complexity Classes.- Amiltonicity of graphs on surfaces in terms of toughness and scattering number - A survey.- On Structural Parameterizations of Node Kayles.- Robustness in power-law kinetic systems with reactant-determined interactions.- Toward Unfolding Doubly Covered n-Stars.- Crystallographic Flat Origami from n-Uniform Tilings.- Packing Cube Nets into Rectangles with O(1) Holes.- On the Complexity of Jelly-no-Puzzle.- Computational Complexity of Two Pencil Puzzles.
by "Nielsen BookData"
