Image from Google Jackets

Discrete and Computational Geometry and Graphs [electronic resource] : 16th Japanese Conference, JCDCGG 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected Papers / edited by Jin Akiyama, Hiro Ito, Toshinori Sakai.

Contributor(s): Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science ; 8845Publication details: Cham : Springer International Publishing, 2014.Description: 1 online resource (VIII, 191 p. 104 ill.)ISBN:
  • 9783319132877
Subject(s): Online resources:
Contents:
Covering Partial Cubes with Zones -- The Non-confusing Travel Groupoids on a Finite Connected Graph -- Decomposing Octilinear Polygons into Triangles and Rectangles -- On Wrapping Spheres and Cubes with Rectangular Paper -- On Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case -- Online Weight Balancing on the Unit Circle -- Transformability and Reversibility of Unfoldings of Doubly-Covered Polyhedra -- Computational Complexity of the r-visibility Guard Set Problem for Polyominoes -- Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane -- Generating Polygons with Triangles -- Cross-Intersecting Families of Vectors -- The Double Multicompetition Number of a Multigraph -- Computational Geometry in the Human Brain -- A Characterization of Link-2 LR-visibility Polygons with Applications -- Imaginary Hypercubes -- More Results on Clique-chromatic Numbers of Graphs with No Long Path.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Materials specified Status Date due Barcode Item holds
Books Books National Library of India Available EBK000024799ENG
Total holds: 0

Covering Partial Cubes with Zones -- The Non-confusing Travel Groupoids on a Finite Connected Graph -- Decomposing Octilinear Polygons into Triangles and Rectangles -- On Wrapping Spheres and Cubes with Rectangular Paper -- On Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case -- Online Weight Balancing on the Unit Circle -- Transformability and Reversibility of Unfoldings of Doubly-Covered Polyhedra -- Computational Complexity of the r-visibility Guard Set Problem for Polyominoes -- Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane -- Generating Polygons with Triangles -- Cross-Intersecting Families of Vectors -- The Double Multicompetition Number of a Multigraph -- Computational Geometry in the Human Brain -- A Characterization of Link-2 LR-visibility Polygons with Applications -- Imaginary Hypercubes -- More Results on Clique-chromatic Numbers of Graphs with No Long Path.

There are no comments on this title.

to post a comment.
                                                                           
web counter

Copyright ©2020 The National Library of India, Govt. of India ↔ Hosted by NVLI, MOC ↔ Technology and Design by National Library of India, Ministry of Culture, Govt. of India