Linked e-resources
Details
Table of 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.
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.