Twenty Years of Progress of JCDCG3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\hbox {JCDCG}^3$$\end{document}

No abstract is available for this paper.

• Publication year

  2020

• Venue

  Graphs and Combinatorics

• Publication date

  2020-02-01

• Fields of study

  Mathematics, Physics, Computer Science

• Identifiers
  DOI 10.1007/s00373-020-02133-4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Algorithmic Puzzles

  2020cited by this paper
• Lessons in Play

  2019cited by this paper
• Convex decompositions of point sets in the plane

  2019influential reference
• Which Convex Polyhedra Can Be Made by Gluing Regular Hexagons?

  2019cited by this paper
• Polyhedral Characterization of Reversible Hinged Dissections

  2018cited by this paper
• Introduction to Reconfiguration

  2018cited by this paper
• Tree-Residue Vertex-Breaking: a new tool for proving hardness

  2017cited by this paper
• A simple proof that the $(n^2-1)$-puzzle is hard

  2017cited by this paper
• Planar 3-SAT with a Clause/Variable Cycle

  2017cited by this paper
• Folding and Punching Paper

  2017cited by this paper
• Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares

  2017cited by this paper
• On the Erdos-Szekeres convex polygon problem

  2016cited by this paper
• Computers And Intractability A Guide To The Theory Of Np Completeness

  2016cited by this paper
• Bust-a-Move/Puzzle Bobble Is NP-complete

  2015cited by this paper
• A Complete Classification of Tile-makers

  2015cited by this paper
• On the Erdős distinct distances problem in the plane

  2015cited by this paper
• A survey and recent results about commmon developments of two or more boxes

  2015cited by this paper
• Continuous Folding of Regular Dodecahedra

  2015cited by this paper
• Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces

  2015cited by this paper
• Reversible Nets of Polyhedra

  2015cited by this paper
• Treks into Intuitive Geometry

  2015cited by this paper
• Mario Kart Is Hard

  2015cited by this paper
• Beyond the Richter-Thomassen Conjecture

  2015cited by this paper
• Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract)

  2015cited by this paper
• A Note on the Number of General 4-holes in (Perturbed) Grids

  2015cited by this paper
• Continuous Flattening of Orthogonal Polyhedra

  2015cited by this paper
• Discrete and computational geometry and graphs : 16th Japanese Conference, JCDCGG 2013, Tokyo, Japan, September 17-19, 2013, revised selected papers

  2014cited by this paper
• Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane

  2013cited by this paper
• The Diameter of the Rubik's Cube Group Is Twenty

  2013cited by this paper
• Discrete and Computational Geometry and Graphs

  2013cited by this paper
• Puzzled

  2013cited by this paper
• Computational geometry and graphs : Thailand-Japan Joint Conference, TJJCCGG 2012, Bangkok, Thailand, December 6-8, 2012, revised selected papers

  2013cited by this paper
• A Characterization of Link-2 LR-visibility Polygons with Applications

  2013cited by this paper
• Planar Point Sets With Large Minimum Convex Decompositions

  2013cited by this paper
• Distinct distances on algebraic curves in the plane

  2013cited by this paper
• On Wrapping Spheres and Cubes with Rectangular Paper

  2013cited by this paper
• On Complexity of Flooding Games on Graphs with Interval Representations

  2012cited by this paper
• Colored Quadrangulations with Steiner Points

  2012cited by this paper
• How to Fold It: Index

  2011cited by this paper
• Computational geometry, graphs and applications : 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010 : revised selected papers

  2011cited by this paper
• Hinged Dissections Exist

  2011cited by this paper
• How to Fold It: The Mathematics of Linkages, Origami, and Polyhedra

  2011cited by this paper
• On Folding a Polygon to a Polyhedron

  2010cited by this paper
• Common Unfoldings of Polyominoes and Polycubes

  2010cited by this paper
• BALANCED CONVEX PARTITIONS OF MEASURES IN ℝ d

  2010cited by this paper
• Making Polygons by Simple Folds and One Straight Cut

  2010cited by this paper
• Determination of All Tessellation Polyhedra with Regular Polygonal Faces

  2010cited by this paper
• Open Problem Session

  2009cited by this paper
• A combinatorial problem in geometry

  2009cited by this paper
• Games, puzzles and computation

  2009influential reference
• Understanding geometry for a changing world

  2009cited by this paper
• Computer-Aided Creation of Impossible Objects and Impossible Motions

  2008cited by this paper
• A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets

  2008cited by this paper
• Combinatorial Geometry and Graph Theory

  2008cited by this paper
• Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers

  2008cited by this paper
• Bichromatic Quadrangulations with Steiner Points

  2007cited by this paper
• Geometric Folding Algorithms: Linkages

  2007cited by this paper
• 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

  2007cited by this paper
• Recent Progress on Combinatorics and Algorithms for Low Discrepancy Roundings

  2007cited by this paper
• Geometric Folding Algorithms: Linkages, Origami, Polyhedra

  2007cited by this paper
• Mathematical Mind-Benders

  2007cited by this paper
• Covering the Convex Quadrilaterals of Point Sets

  2007cited by this paper
• Lessons in Play: An Introduction to Combinatorial Game Theory

  2007cited by this paper
• Hinged Dissections Exist

  2007cited by this paper
• Discrete Geometry, Combinatorics and Graph Theory

  2007cited by this paper
• Tile-Makers and Semi-Tile-Makers

  2007cited by this paper
• On the Number of Plane Geometric Graphs

  2007cited by this paper
• Unexpected Twists in Geometric Dissections

  2007cited by this paper
• Reduction for 3-Connected Graphs of Minimum Degree at Least Four

  2007cited by this paper
• Editorial

  2006cited by this paper
• On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges

  2006cited by this paper
• Nearly equal distances and Szemerédi's regularity lemma

  2006cited by this paper
• Project Origami: Activities for Exploring Mathematics

  2006cited by this paper
• Equitable subdivisions within polygonal regions

  2006cited by this paper
• On some extremum problems in elementary geometry

  2006cited by this paper
• Piano-Hinged Dissections: Time to Fold!

  2006cited by this paper
• Computer solution to the 17-point Erdős-Szekeres problem

  2006cited by this paper
• Forbidden patterns and unit distances

  2005cited by this paper
• Reconfirmation of Two Results on Disjoint Empty Convex Polygons

  2005cited by this paper
• Origami design secrets: mathematical methods for an ancient art

  2005cited by this paper
• On plane spanning trees and cycles of multicolored point sets with few intersections

  2005cited by this paper
• On Convex Quadrangulations of Point Sets on the Plane

  2005cited by this paper
• Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers

  2005cited by this paper
• General Balanced Subdivision of Two Sets of Points in the Plane

  2005cited by this paper
• Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers

  2005cited by this paper
• Hinged dissections: swinging and twisting

  2004cited by this paper
• Weighted Ham-Sandwich Cuts

  2004cited by this paper
• Crossing Stars in Topological Graphs

  2004cited by this paper
• Discrete and Computational Geometry: Japanese Conference, Jcdcg 2002, Tokyo, Japan, December 6-9, 2002: Revised Papers (Lecture Notes in Computer Science, 2866)

  2004cited by this paper
• Winning Ways for Your Mathematical Plays, Volume 4

  2004cited by this paper
• How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position?

  2003cited by this paper
• Winning Ways for Your Mathematical Plays, Volume 3

  2003cited by this paper
• Foldings of regular polygons to convex polyhedra i: equilateral triangles

  2003cited by this paper
• Mathematical Puzzles: A Connoisseur's Collection

  2003cited by this paper
• Spanning Trees of Multicoloured Point Sets with Few Intersections

  2003cited by this paper
• Disjoint Edges in Topological Graphs

  2003cited by this paper
• The optimality of a certain purely recursive dissection for a sequentially n-divisible square

  2003cited by this paper
• Partitioning a Planar Point Set into Empty Convex Polygons

  2002cited by this paper
• Discrete and Computational Geometry

  2002cited by this paper
• Constrained Equitable 3-Cuttings

  2002cited by this paper

• All Paths Lead to Rome

  2022cites this paper