default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJin Akiyama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j42]Jin Akiyama, Yuan Zong, Naoki Shinada, Taro Suzuki
, Yoshiharu Amano:
High-Resolution Point Cloud Registration Method for Three-Dimensional Piping Measurements. J. Robotics Mechatronics 35(6): 1655-1662 (2023)- 2021
- [e11]Jin Akiyama, Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Yushi Uno:
Discrete and Computational Geometry, Graphs, and Games - 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018, Revised Selected Papers. Lecture Notes in Computer Science 13034, Springer 2021, ISBN 978-3-030-90047-2 [contents] - 2020
- [j41]Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno:
Twenty Years of Progress of ${JCDCG}^3$. Graphs Comb. 36(2): 181-203 (2020) - [j40]Jin Akiyama, Erik D. Demaine, Stefan Langerman:
Polyhedral Characterization of Reversible Hinged Dissections. Graphs Comb. 36(2): 221-229 (2020) - [j39]Jin Akiyama, Kiyoko Matsunaga:
An Algorithm for Folding a Conway Tile into an Isotetrahedron or a Rectangle Dihedron. J. Inf. Process. 28: 750-758 (2020)
2010 – 2019
- 2019
- [j38]Jin Akiyama, Kiyoko Matsunaga:
Unfoldings of an envelope. Eur. J. Comb. 80: 3-16 (2019) - 2018
- [i2]Jin Akiyama, Erik D. Demaine, Stefan Langerman:
Polyhedral Characterization of Reversible Hinged Dissections. CoRR abs/1803.01172 (2018) - 2017
- [j37]Jin Akiyama, Kiyoko Matsunaga:
Reversibility and foldability of Conway tiles. Comput. Geom. 64: 30-45 (2017) - [j36]Jin Akiyama, Kiyoko Matsunaga:
Generalization of Haberdasher's Puzzle. Discret. Comput. Geom. 58(1): 30-50 (2017) - [j35]Jin Akiyama, Sin Hitotumatu, Motonaga Ishii, Akihiro Matsuura, Ikuro Sato, Shun Toyoshima:
A recursive Algorithm for the k-face Numbers of Wythoffian-n-polytopes Constructed from Regular Polytopes. J. Inf. Process. 25: 528-536 (2017) - 2016
- [e10]Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno:
Discrete and Computational Geometry and Graphs - 18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9943, Springer 2016, ISBN 978-3-319-48531-7 [contents] - [i1]Jin Akiyama, Stefan Langerman, Kiyoko Matsunaga:
Reversible Nets of Polyhedra. CoRR abs/1607.00538 (2016) - 2015
- [j34]Jin Akiyama, Hyunwoo Seong:
A Criterion for a Pair of Convex Polygons to be Reversible. Graphs Comb. 31(2): 347-360 (2015) - [j33]Jin Akiyama, Hyunwoo Seong:
Pentadral Complices. J. Inf. Process. 23(3): 246-251 (2015) - [c23]Jin Akiyama, Stefan Langerman, Kiyoko Matsunaga:
Reversible Nets of Polyhedra. JCDCGG 2015: 13-23 - 2014
- [j32]Jin Akiyama, David Rappaport, Hyunwoo Seong:
A decision algorithm for reversible pairs of polygons. Discret. Appl. Math. 178: 19-26 (2014) - [e9]Jin Akiyama, Hiro Ito, Toshinori Sakai:
Discrete and Computational Geometry and Graphs - 16th Japanese Conference, JCDCGG 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8845, Springer 2014, ISBN 978-3-319-13286-0 [contents] - 2013
- [c22]Jin Akiyama, Hyunwoo Seong:
An Algorithm for Determining Whether a Pair of Polygons Is Reversible. FAW-AAIM 2013: 2-3 - [c21]Jin Akiyama, Ikuro Sato, Hyunwoo Seong:
Tessellabilities, Reversibilities, and Decomposabilities of Polytopes - (A Survey). GSI 2013: 215-223 - [e8]Jin Akiyama, Mikio Kano, Toshinori Sakai:
Computational Geometry and Graphs - Thailand-Japan Joint Conference, TJJCCGG 2012, Bangkok, Thailand, December 6-8, 2012, Revised Selected Papers. Lecture Notes in Computer Science 8296, Springer 2013, ISBN 978-3-642-45280-2 [contents] - 2012
- [c20]Jin Akiyama, Hyunwoo Seong:
Operators which Preserve Reversibility. TJJCCGG 2012: 1-19 - 2011
- [j31]Jin Akiyama, Hiro Ito, Midori Kobayashi, Gisaku Nakamura:
Arrangements of n Points whose Incident-Line-Numbers are at most n/2. Graphs Comb. 27(3): 321-326 (2011) - [c19]Jin Akiyama, Ikuro Sato, Hyunwoo Seong:
On Reversibility among Parallelohedra. EGC 2011: 14-28 - [e7]Jin Akiyama, Bo Jiang, Mikio Kano, Xuehou Tan:
Computational Geometry, Graphs and Applications - 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers. Lecture Notes in Computer Science 7033, Springer 2011, ISBN 978-3-642-24982-2 [contents] - 2010
- [c18]Jin Akiyama, Takayasu Kuwata, Stefan Langerman, Kenji Okawa, Ikuro Sato, Geoffrey C. Shephard:
Determination of All Tessellation Polyhedra with Regular Polygonal Faces. CGGA 2010: 1-11
2000 – 2009
- 2008
- [j30]Jin Akiyama, Hiroshi Fukuda, Chie Nara, Toshinori Sakai, Jorge Urrutia:
Universal Measuring Boxes with Triangular Bases. Am. Math. Mon. 115(3): 195-201 (2008) - 2007
- [j29]Jin Akiyama:
Tile-Makers and Semi-Tile-Makers. Am. Math. Mon. 114(7): 602-609 (2007) - [c17]Jin Akiyama, Midori Kobayashi, Gisaku Nakamura:
Dudeney Transformation of Normal Tiles. KyotoCGGT 2007: 1-13 - [c16]Jin Akiyama, Chie Nara:
Chromatic Numbers of Specified Isohedral Tilings. KyotoCGGT 2007: 14-24 - [e6]Jin Akiyama, William Y. C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu:
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. Lecture Notes in Computer Science 4381, Springer 2007, ISBN 978-3-540-70665-6 [contents] - 2006
- [j28]Jin Akiyama, Mikio Kano, Xuehou Tan:
Editorial. Comput. Geom. 34(1): 1 (2006) - [j27]Jin Akiyama, Koichi Hirata, Midori Kobayashi, Gisaku Nakamura:
Convex developments of a regular tetrahedron. Comput. Geom. 34(1): 2-10 (2006) - 2005
- [c15]Jin Akiyama, Hiroshi Fukuda, Hiro Ito, Gisaku Nakamura:
Infinite Series of Generalized Gosper Space Filling Curves. CJCDGCGT 2005: 1-9 - [e5]Jin Akiyama, Edy Tri Baskoro, Mikio Kano:
Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers. Lecture Notes in Computer Science 3330, Springer 2005, ISBN 3-540-24401-8 [contents] - [e4]Jin Akiyama, Mikio Kano, Xuehou Tan:
Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3742, Springer 2005, ISBN 3-540-30467-3 [contents] - 2004
- [j26]Jin Akiyama, Ferran Hurtado, Criel Merino, Jorge Urrutia:
A Problem on Hinged Dissections with Colours. Graphs Comb. 20(2): 145-159 (2004) - 2003
- [j25]Jin Akiyama, Gisaku Nakamura, Akihiro Nozaki, Ken'ichi Ozawa, Toshinori Sakai:
The optimality of a certain purely recursive dissection for a sequentially n-divisible square. Comput. Geom. 24(1): 27-39 (2003) - [j24]Jin Akiyama, Gisaku Nakamura:
Determination of All Convex Polygons which are Chameleons-Congruent Dudeney Dissections of Polygons-. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 978-986 (2003) - [c14]Jin Akiyama, Koichi Hirata:
On Convex Developments of a Doubly-Covered Square. IJCCGGT 2003: 1-13 - [c13]Jin Akiyama, Koichi Hirata, Mari-Jo P. Ruiz, Jorge Urrutia:
Flat 2-Foldings of Convex Polygons. IJCCGGT 2003: 14-24 - [c12]Jin Akiyama, Midori Kobayashi, Gisaku Nakamura:
Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph. IJCCGGT 2003: 25-33 - [e3]Jin Akiyama, Mikio Kano:
Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers. Lecture Notes in Computer Science 2866, Springer 2003, ISBN 3-540-20776-7 [contents] - 2002
- [j23]Midori Kobayashi, Jin Akiyama, Gisaku Nakamura:
On Dudeney's Round Table Problem for p + 2. Ars Comb. 62 (2002) - [j22]Jin Akiyama, Gisaku Nakamura:
Congruent Dudeney Dissections of Polygons I: All the Hinge Points are Vertices of the Polygon. Electron. Notes Discret. Math. 11: 12-19 (2002) - [j21]Jin Akiyama, Kiyoshi Ando, Yoshimi Egawa:
Graphs G for which both G and G- are Contraction Critically k-Connected. Graphs Comb. 18(4): 693-708 (2002) - [c11]Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura:
Universal Measuring Devices with Rectangular Base. JCDCG 2002: 1-8 - [c10]Jin Akiyama, Rika Mochizuki, Nobuaki Mutoh, Gisaku Nakamura:
Maximin Distance for n Points in a Unit Square or a Unit Circle. JCDCG 2002: 9-13 - [c9]Jin Akiyama, Gisaku Nakamura:
Congruent Dudeney Dissections of Polygons: All the Hinge Points on Vertices of the Polygon. JCDCG 2002: 14-21 - 2001
- [e2]Jin Akiyama, Mikio Kano, Masatsugu Urabe:
Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers. Lecture Notes in Computer Science 2098, Springer 2001, ISBN 3-540-42306-0 [contents] - 2000
- [c8]Jin Akiyama, Gisaku Nakamura:
Dudeney Dissections of Polygons and Polyhedrons - A Survey. JCDCG 2000: 1-30 - [c7]Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura, Toshinori Sakai, Jorge Urrutia, Carlos Zamora-Cura:
Universal Measuring Devices without Gradations. JCDCG 2000: 31-40 - [c6]Jin Akiyama, Gisaku Nakamura, Akihiro Nozaki, Ken'ichi Ozawa:
A Note on the Purely Recursive Dissection for a Sequentially n-Divisible Square. JCDCG 2000: 41-52 - [c5]Jin Akiyama, Toshinori Sakai, Jorge Urrutia:
Sequentially Divisible Dissections of Simple Polygons. JCDCG 2000: 53-66 - [e1]Jin Akiyama, Mikio Kano, Masatsugu Urabe:
Discrete and Computational Geometry, Japanese Conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, Revised Papers. Lecture Notes in Computer Science 1763, Springer 2000, ISBN 3-540-67181-1 [contents]
1990 – 1999
- 1998
- [c4]Jin Akiyama, Gisaku Nakamura, Eduardo Rivera-Campo, Jorge Urrutia:
Perfect divisions of a cake. CCCG 1998 - [c3]Jin Akiyama, Atsushi Kaneko, Mikio Kano, Gisaku Nakamura, Eduardo Rivera-Campo, Shin-ichi Tokunaga, Jorge Urrutia:
Radial Perfect Partitions of Convex Sets in the Plane. JCDCG 1998: 1-13 - [c2]Jin Akiyama, Gisaku Nakamura:
Dudeney Dissection of Polygons. JCDCG 1998: 14-29 - 1996
- [j20]Jin Akiyama, Y. Ishigami, Masatsugu Urabe, Jorge Urrutia:
On circles containing the maximum number of points. Discret. Math. 151(1-3): 15-18 (1996) - 1993
- [j19]Jin Akiyama, Kiyoshi Hosono, Masatsugu Urabe:
Some combinatorial problems. Discret. Math. 116(1-3): 291-298 (1993) - [j18]Jin Akiyama:
From the managing editor. Graphs Comb. 9(1): 1 (1993) - 1990
- [j17]Jin Akiyama, Jorge Urrutia:
A note on balanced colourings for lattice points. Discret. Math. 83(1): 123-126 (1990) - [j16]Jin Akiyama, Jorge Urrutia:
Simple alternating path problem. Discret. Math. 84(1): 101-103 (1990) - [j15]Jin Akiyama, Vasek Chvátal:
Packing paths perfectly. Discret. Math. 85(3): 247-255 (1990)
1980 – 1989
- 1989
- [j14]Jin Akiyama, Fumi Nakada, Sinichi Tokunaga:
Packing smaller graphs into a graph. Discret. Math. 75(1-3): 7-9 (1989) - [j13]Jin Akiyama, Hiroshi Era, Severino Villanueva Gervacio, Mamoru Watanabe:
Path chromatic numbers of graphs. J. Graph Theory 13(5): 571-573 (1989) - 1988
- [j12]Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto:
Preface. Discret. Math. 72(1-3): 1-2 (1988) - 1987
- [j11]Jin Akiyama, Mamoru Watanabe:
Maximum induced forests of planar graphs. Graphs Comb. 3(1): 201-202 (1987) - 1985
- [j10]Jin Akiyama, Kiyoshi Ando, David Avis:
Eccentric graphs. Discret. Math. 56(1): 1-6 (1985) - [j9]Jin Akiyama, Mikio Kano:
Factors and factorizations of graphs - a survey. J. Graph Theory 9(1): 1-42 (1985) - [j8]Jin Akiyama, Mikio Kano:
Almost-regular factorization of graphs. J. Graph Theory 9(1): 123-128 (1985) - [j7]Jin Akiyama, Peter Frankl:
On the size of graphs with complete-factors. J. Graph Theory 9(1): 197-201 (1985) - 1981
- [j6]Jin Akiyama, David Avis, Vasek Chvátal, Hiroshi Era:
Balancing signed graphs. Discret. Appl. Math. 3(4): 227-233 (1981) - [j5]Jin Akiyama, Hiroshi Era, Geoffrey Exoo:
Further results on graph equations for line graphs and n-th power graphs. Discret. Math. 34(3): 209-218 (1981) - [j4]Jin Akiyama, Frank Harary:
A graph and its complement with specified properties. IV. Counting self-complementary blocks. J. Graph Theory 5(1): 103-107 (1981) - [j3]Jin Akiyama, Frank Boesch, Hiroshi Era, Frank Harary, Ralph Tindell:
The cohesiveness of a point of a graph. Networks 11(1): 65-68 (1981) - [j2]Jin Akiyama, Geoffrey Exoo, Frank Harary:
Covering and packing in graphs IV: Linear arboricity. Networks 11(1): 69-72 (1981) - 1980
- [c1]Jin Akiyama:
A status on the linear arboricity. Graph Theory and Algorithms 1980: 38-44
1970 – 1979
- 1979
- [j1]Jin Akiyama, Takashi Hamada:
The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests. Discret. Math. 26(3): 203-208 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 20:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
