Jin Akiyama

Takako Kodate

Electron. J. Graph Theory Appl., 2024

2023

High-Resolution Point Cloud Registration Method for Three-Dimensional Piping Measurements.

[BibT_eX]

[DOI]

J. Robotics Mechatronics, December, 2023

2020

An Algorithm for Folding a Conway Tile into an Isotetrahedron or a Rectangle Dihedron.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

Twenty Years of Progress of ${JCDCG}^3$.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Polyhedral Characterization of Reversible Hinged Dissections.

[BibT_eX]

[DOI]

Erik D. Demaine

Stefan Langerman

Graphs Comb., 2020

2019

Unfoldings of an envelope.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

2017

A recursive Algorithm for the k-face Numbers of Wythoffian-n-polytopes Constructed from Regular Polytopes.

[BibT_eX]

[DOI]

J. Inf. Process., 2017

Generalization of Haberdasher's Puzzle.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Reversibility and foldability of Conway tiles.

[BibT_eX]

[DOI]

Comput. Geom., 2017

2015

Pentadral Complices.

[BibT_eX]

[DOI]

J. Inf. Process., 2015

A Criterion for a Pair of Convex Polygons to be Reversible.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Reversible Nets of Polyhedra.

[BibT_eX]

[DOI]

Stefan Langerman

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014

A decision algorithm for reversible pairs of polygons.

[BibT_eX]

[DOI]

David Rappaport

Discret. Appl. Math., 2014

2013

Tessellabilities, Reversibilities, and Decomposabilities of Polytopes - (A Survey).

[BibT_eX]

[DOI]

Ikuro Sato

Proceedings of the Geometric Science of Information - First International Conference, 2013

An Algorithm for Determining Whether a Pair of Polygons Is Reversible.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2013

2012

Operators which Preserve Reversibility.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

2011

Arrangements of n Points whose Incident-Line-Numbers are at most n/2.

[BibT_eX]

[DOI]

Graphs Comb., 2011

On Reversibility among Parallelohedra.

[BibT_eX]

[DOI]

Ikuro Sato

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010

Determination of All Tessellation Polyhedra with Regular Polygonal Faces.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry, Graphs and Applications, 2010

2008

Universal Measuring Boxes with Triangular Bases.

[BibT_eX]

[DOI]

Am. Math. Mon., 2008

2007

Tile-Makers and Semi-Tile-Makers.

[BibT_eX]

[DOI]

Am. Math. Mon., 2007

Chromatic Numbers of Specified Isohedral Tilings.

[BibT_eX]

[DOI]

Chie Nara

Proceedings of the Computational Geometry and Graph Theory, 2007

Dudeney Transformation of Normal Tiles.

[BibT_eX]

[DOI]

Midori Kobayashi

Proceedings of the Computational Geometry and Graph Theory, 2007

2006

Editorial.

[BibT_eX]

[DOI]

Mikio Kano

Xuehou Tan

Comput. Geom., 2006

Convex developments of a regular tetrahedron.

[BibT_eX]

[DOI]

Comput. Geom., 2006

2005

Infinite Series of Generalized Gosper Space Filling Curves.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry, 2005

2004

A Problem on Hinged Dissections with Colours.

[BibT_eX]

[DOI]

Graphs Comb., 2004

2003

Determination of All Convex Polygons which are Chameleons-Congruent Dudeney Dissections of Polygons-.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

The optimality of a certain purely recursive dissection for a sequentially n-divisible square.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph.

[BibT_eX]

[DOI]

Midori Kobayashi

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

Flat 2-Foldings of Convex Polygons.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

On Convex Developments of a Doubly-Covered Square.

[BibT_eX]

[DOI]

Koichi Hirata

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

2002

Graphs G for which both G and G- are Contraction Critically k-Connected.

[BibT_eX]

[DOI]

Kiyoshi Ando

Yoshimi Egawa

Graphs Comb., 2002

Congruent Dudeney Dissections of Polygons I: All the Hinge Points are Vertices of the Polygon.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2002

On Dudeney's Round Table Problem for p + 2.

[BibT_eX]

Midori Kobayashi

Ars Comb., 2002

Congruent Dudeney Dissections of Polygons: All the Hinge Points on Vertices of the Polygon.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Maximin Distance for n Points in a Unit Square or a Unit Circle.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Universal Measuring Devices with Rectangular Base.

[BibT_eX]

[DOI]

Hiroshi Fukuda

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2000

Sequentially Divisible Dissections of Simple Polygons.

[BibT_eX]

[DOI]

Toshinori Sakai

Jorge Urrutia

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

A Note on the Purely Recursive Dissection for a Sequentially n-Divisible Square.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Dudeney Dissections of Polygons and Polyhedrons - A Survey.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Universal Measuring Devices without Gradations.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1998

Dudeney Dissection of Polygons.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Radial Perfect Partitions of Convex Sets in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Perfect divisions of a cake.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1996

On circles containing the maximum number of points.

[BibT_eX]

[DOI]

Discret. Math., 1996

1993

From the managing editor.

[BibT_eX]

[DOI]

Graphs Comb., 1993

Some combinatorial problems.

[BibT_eX]

[DOI]

Kiyoshi Hosono

Masatsugu Urabe

Discret. Math., 1993

1990

Simple alternating path problem.

[BibT_eX]

[DOI]

Jorge Urrutia

Discret. Math., 1990

A note on balanced colourings for lattice points.

[BibT_eX]

[DOI]

Jorge Urrutia

Discret. Math., 1990

Packing paths perfectly.

[BibT_eX]

[DOI]

Vasek Chvátal

Discret. Math., 1990

1989

Path chromatic numbers of graphs.

[BibT_eX]

[DOI]

Severino Villanueva Gervacio

Hiroshi Era

Mamoru Watanabe

J. Graph Theory, 1989

Packing smaller graphs into a graph.

[BibT_eX]

[DOI]

Fumi Nakada

Sinichi Tokunaga

Discret. Math., 1989

1988

Preface.

[BibT_eX]

[DOI]

Yoshimi Egawa

Hikoe Enomoto

Discret. Math., 1988

1987

Maximum induced forests of planar graphs.

[BibT_eX]

[DOI]

Mamoru Watanabe

Graphs Comb., 1987

1985

Almost-regular factorization of graphs.

[BibT_eX]

[DOI]

Mikio Kano

J. Graph Theory, 1985

Factors and factorizations of graphs - a survey.

[BibT_eX]

[DOI]

Mikio Kano

J. Graph Theory, 1985

On the size of graphs with complete-factors.

[BibT_eX]

[DOI]

Peter Frankl

J. Graph Theory, 1985

Eccentric graphs.

[BibT_eX]

[DOI]

Kiyoshi Ando

David Avis

Discret. Math., 1985

1981

Covering and packing in graphs IV: Linear arboricity.

[BibT_eX]

[DOI]

Geoffrey Exoo

Frank Harary

Networks, 1981

The cohesiveness of a point of a graph.

[BibT_eX]

[DOI]

Networks, 1981

A graph and its complement with specified properties. IV. Counting self-complementary blocks.

[BibT_eX]

[DOI]

Frank Harary

J. Graph Theory, 1981

Further results on graph equations for line graphs and n-th power graphs.

[BibT_eX]

[DOI]

Hiroshi Era

Geoffrey Exoo

Discret. Math., 1981

Balancing signed graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1981

1980

A status on the linear arboricity.

[BibT_eX]

[DOI]

Proceedings of the Graph Theory and Algorithms, 1980

1979

The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests.

[BibT_eX]

[DOI]