Twenty years of progress of \(\mathrm{JCDCG}^3\)
From MaRDI portal
Publication:2308489
DOI10.1007/s00373-020-02133-4OpenAlexW3004285752MaRDI QIDQ2308489
Yushi Uno, Hiro Ito, Toshinori Sakai, Jin Akiyama
Publication date: 3 April 2020
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-020-02133-4
graph theorydiscrete geometryreversibilitycomputational geometryunfoldingfoldingdissectiongames and puzzlesJCDCGGG
Related Items (1)
Cites Work
- Planar point sets with large minimum convex decompositions
- Computational geometry and graphs. Thailand-Japan joint conference, TJJCCGG 2012, Bangkok, Thailand, December 6--8, 2012. Revised selected papers
- On the Erdős distinct distances problem in the plane
- Problem-solving through problems
- Computational geometry, graphs and applications. 9th international conference, CGGA 2010, Dalian, China, November 3--6, 2010. Revised selected papers
- On plane spanning trees and cycles of multicolored point sets with few intersections
- Simple alternating path problem
- The \((n^ 2-1)\)-puzzle and related relocation problems
- Computational geometry and graph theory. International conference, KyotoCGGT 2007, Kyoto, Japan, June 11--15, 2007. Revised selected papers
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- Economical triangle-square dissection
- A short proof of Chvatal's Watchman Theorem
- On the complexity of some two-person perfect-information games
- Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
- Balanced convex partitions of measures in \(\mathbb R^{2}\)
- Quasi-planar graphs have a linear number of edges
- A combinatorial theorem in plane geometry
- Discrete and computational geometry. Japanese conference, JCDCG 2002, Tokyo, Japan, December 6--9, 2002. Revised papers
- Generalizing ham sandwich cuts to equitable subdivisions
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard
- Combinatorial geometry and graph theory. Indonesia-Japan joint conference, IJCCGGT 2003, Bandung, Indonesia, September 13--16, 2003. Revised selected papers.
- Balanced partitions of two sets of points in the plane
- Isosceles triangles determined by a planar point set
- On the development of the intersection of a plane with a polytope
- Efficient algorithms for the minimum diameter bridge problem
- The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square
- Small strictly convex quadrilateral meshes of point sets
- Discrete and computational geometry. Japanese conference, JCDCG '98. Tokyo, Japan, December 9--12, 1998. Proceedings
- Polyhedral characterization of reversible hinged dissections
- Introduction to reconfiguration
- Discrete geometry, combinatorics and graph theory. 7th China-Japan conference, CJCDGCGT 2005, Tianjin, China, November 18--20, 2005, Xi'an, China, November 22--24, 2005. Revised selected papers.
- Discrete and computational geometry. Japanese conference, JCDCG 2004, Tokyo, Japan, October 8--11, 2004
- Unexpected twists in geometric dissections
- Reduction for 3-connected graphs of minimum degree at least four
- Recent progress on combinatorics and algorithms for low discrepancy roundings
- On the number of plane geometric graphs
- Bichromatic quadrangulations with Steiner points
- Covering the convex quadrilaterals of point sets
- Nearly equal distances and Szemerédi's regularity lemma
- Equitable subdivisions within polygonal regions
- Colored Quadrangulations with Steiner Points
- On Complexity of Flooding Games on Graphs with Interval Representations
- On Wrapping Spheres and Cubes with Rectangular Paper
- Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane
- A Characterization of Link-2 LR-visibility Polygons with Applications
- A Note on the Number of General 4-holes in (Perturbed) Grids
- Reversible Nets of Polyhedra
- Mario Kart Is Hard
- Single-Player and Two-Player Buttons & Scissors Games
- Continuous Flattening of Orthogonal Polyhedra
- Bust-a-Move/Puzzle Bobble Is NP-complete
- Continuous Folding of Regular Dodecahedra
- Number of Ties and Undefeated Signs in a Generalized Janken
- Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces
- Tetris is Hard, Even to Approximate
- Determination of All Tessellation Polyhedra with Regular Polygonal Faces
- Making Polygons by Simple Folds and One Straight Cut
- Common Unfoldings of Polyominoes and Polycubes
- Continuous Flattening of Platonic Polyhedra
- Treks into Intuitive Geometry
- Computer solution to the 17-point Erdős-Szekeres problem
- How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position?
- Reconfirmation of Two Results on Disjoint Empty Convex Polygons
- General Balanced Subdivision of Two Sets of Points in the Plane
- On Convex Quadrangulations of Point Sets on the Plane
- Crossing-Free Subgraphs
- Convex polytopes with convex nets
- Curvature and Creases: A Primer on Paper
- A Combinatorial Problem Which Is Complete in Polynomial Space
- Beyond the Richter-Thomassen Conjecture
- Distinct distances on algebraic curves in the plane
- Convex Polyhedra
- A survey and recent results about commmon developments of two or more boxes
- On the Erdős-Szekeres convex polygon problem
- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets
- Computer-Aided Creation of Impossible Objects and Impossible Motions
- Forbidden patterns and unit distances
- Tile-Makers and Semi-Tile-Makers
- Weighted Ham-Sandwich Cuts
- Crossing Stars in Topological Graphs
- Combinatorial Geometry and Graph Theory
- Combinatorial Geometry and Graph Theory
- Combinatorial Geometry and Graph Theory
- On Sets of Distances of n Points
- The Diameter of the Rubik's Cube Group Is Twenty
- Hinged dissections exist
- Discrete and Computational Geometry
- Discrete and Computational Geometry
- Discrete and Computational Geometry
- Discrete and Computational Geometry
- Discrete and Computational Geometry
- Discrete and Computational Geometry
- Discrete and Computational Geometry
- Discrete and Computational Geometry
- Discrete and Computational Geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Twenty years of progress of \(\mathrm{JCDCG}^3\)
