The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jin Akiyama: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jin Akiyama, Gisaku Nakamura, Eduardo Rivera-Campo, Jorge Urrutia
    Perfect divisions of a cake. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  2. Jin Akiyama
    A status on the linear arboricity. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:38-44 [Conf]
  3. Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura
    Universal Measuring Devices with Rectangular Base. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:1-8 [Conf]
  4. Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura, Toshinori Sakai, Jorge Urrutia, Carlos Zamora-Cura
    Universal Measuring Devices without Gradations. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:31-40 [Conf]
  5. Jin Akiyama, Koichi Hirata
    On Convex Developments of a Doubly-Covered Square. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:1-13 [Conf]
  6. Jin Akiyama, Koichi Hirata, Mari-Jo P. Ruiz, Jorge Urrutia
    Flat 2-Foldings of Convex Polygons. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:14-24 [Conf]
  7. 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. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:1-13 [Conf]
  8. Jin Akiyama, Midori Kobayashi, Gisaku Nakamura
    Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:25-33 [Conf]
  9. Jin Akiyama, Rika Mochizuki, Nobuaki Mutoh, Gisaku Nakamura
    Maximin Distance for n Points in a Unit Square or a Unit Circle. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:9-13 [Conf]
  10. Jin Akiyama, Gisaku Nakamura
    Dudeney Dissections of Polygons and Polyhedrons - A Survey. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:1-30 [Conf]
  11. Jin Akiyama, Gisaku Nakamura
    Congruent Dudeney Dissections of Polygons: All the Hinge Points on Vertices of the Polygon. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:14-21 [Conf]
  12. Jin Akiyama, Gisaku Nakamura
    Dudeney Dissection of Polygons. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:14-29 [Conf]
  13. Jin Akiyama, Gisaku Nakamura, Akihiro Nozaki, Ken'ichi Ozawa
    A Note on the Purely Recursive Dissection for a Sequentially n-Divisible Square. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:41-52 [Conf]
  14. Jin Akiyama, Toshinori Sakai, Jorge Urrutia
    Sequentially Divisible Dissections of Simple Polygons. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:53-66 [Conf]
  15. Midori Kobayashi, Jin Akiyama, Gisaku Nakamura
    On Dudeney's Round Table Problem for p + 2. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:62, n:, pp:- [Journal]
  16. Jin Akiyama, Koichi Hirata, Midori Kobayashi, Gisaku Nakamura
    Convex developments of a regular tetrahedron. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:1, pp:2-10 [Journal]
  17. Jin Akiyama, Mikio Kano, Xuehou Tan
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:1, pp:1- [Journal]
  18. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:1, pp:27-39 [Journal]
  19. Jin Akiyama, Kiyoshi Ando, Yoshimi Egawa
    Graphs G for which both G and G- are Contraction Critically k-Connected. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:4, pp:693-708 [Journal]
  20. Jin Akiyama, Ferran Hurtado, Criel Merino, Jorge Urrutia
    A Problem on Hinged Dissections with Colours. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:2, pp:145-159 [Journal]
  21. Jin Akiyama, Hiroshi Fukuda, Hiro Ito, Gisaku Nakamura
    Infinite Series of Generalized Gosper Space Filling Curves. [Citation Graph (0, 0)][DBLP]
    CJCDGCGT, 2005, pp:1-9 [Conf]
  22. Jin Akiyama, Hiroshi Era, Geoffrey Exoo
    Further results on graph equations for line graphs and n-th power graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:209-218 [Journal]
  23. Jin Akiyama, Kiyoshi Ando, David Avis
    Eccentric graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:56, n:1, pp:1-6 [Journal]
  24. Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:1-2 [Journal]
  25. Jin Akiyama, Fumi Nakada, Sinichi Tokunaga
    Packing smaller graphs into a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:7-9 [Journal]
  26. Jin Akiyama, Jorge Urrutia
    A note on balanced colourings for lattice points. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:83, n:1, pp:123-126 [Journal]
  27. Jin Akiyama, Jorge Urrutia
    Simple alternating path problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:1, pp:101-103 [Journal]
  28. Jin Akiyama, Vasek Chvátal
    Packing paths perfectly. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:3, pp:247-255 [Journal]
  29. Jin Akiyama, Kiyoshi Hosono, Masatsugu Urabe
    Some combinatorial problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:116, n:1-3, pp:291-298 [Journal]
  30. Jin Akiyama, Y. Ishigami, Masatsugu Urabe, Jorge Urrutia
    On circles containing the maximum number of points. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:15-18 [Journal]

Search in 0.019secs, Finished in 0.021secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002