default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGisaku Nakamura
Person information
- affiliation: University of Shizuoka, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j28]Midori Kobayashi, Keiko Kotani, Nobuaki Mutoh, Gisaku Nakamura:
Uniform coverings of 2-paths with 4-cycles. AKCE Int. J. Graphs Comb. 12(1): 70-73 (2015)- 2013
- [j27]Midori Kobayashi, Brendan D. McKay, Nobuaki Mutoh, Gisaku Nakamura, Chie Nara:
3-Perfect hamiltonian decomposition of the complete graph. Australas. J Comb. 56: 219-224 (2013) - 2011
- [j26]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) - [j25]Hiroshi Fukuda, Chiaki Kanomata, Nobuaki Mutoh, Gisaku Nakamura, Doris Schattschneider:
Polyominoes and Polyiamonds as Fundamental Domains for Isohedral Tilings of Crystal Class D2. Symmetry 3(2): 325-364 (2011) - [j24]Hiroshi Fukuda, Chiaki Kanomata, Nobuaki Mutoh, Gisaku Nakamura, Doris Schattschneider:
Polyominoes and Polyiamonds as Fundamental Domains of Isohedral Tilings with Rotational Symmetry. Symmetry 3(4): 828-851 (2011) - 2010
- [i1]Hiroshi Fukuda, Chiaki Kanomata, Nobuaki Mutoh, Gisaku Nakamura, Doris Schattschneider:
Polyominoes and Polyiamonds as Fundamental Domains of Isohedral Tilings with Rotational Symmetry. CoRR abs/1007.2460 (2010)
2000 – 2009
- 2007
- [j23]Hiroshi Fukuda, Nobuaki Mutoh, Gisaku Nakamura, Doris Schattschneider:
A Method to Generate Polyominoes and Polyiamonds for Tilings with Rotational Symmetry. Graphs Comb. 23(Supplement-1): 259-267 (2007) - [j22]Hiro Ito, Midori Kobayashi, Gisaku Nakamura:
Semi-Distance Codes and Steiner Systems. Graphs Comb. 23(Supplement-1): 283-290 (2007) - [j21]Hiro Ito, Gisaku Nakamura, Satoshi Takata:
Winning Ways of Weighted Poset Games. Graphs Comb. 23(Supplement-1): 291-306 (2007) - [c16]Jin Akiyama, Midori Kobayashi, Gisaku Nakamura:
Dudeney Transformation of Normal Tiles. KyotoCGGT 2007: 1-13 - [c15]Hiroshi Fukuda, Nobuaki Mutoh, Gisaku Nakamura, Doris Schattschneider:
Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry. KyotoCGGT 2007: 68-78 - 2006
- [j20]Midori Kobayashi, Gisaku Nakamura:
Uniform coverings of 2-paths with 6-cycles in the complete graph. Australas. J Comb. 34: 299-304 (2006) - [j19]Jin Akiyama, Koichi Hirata, Midori Kobayashi, Gisaku Nakamura:
Convex developments of a regular tetrahedron. Comput. Geom. 34(1): 2-10 (2006) - 2005
- [j18]Midori Kobayashi, Gisaku Nakamura, Chie Nara:
Uniform coverings of 2-paths with 5-paths in the complete graph. Discret. Math. 299(1-3): 154-161 (2005) - [c14]Jin Akiyama, Hiroshi Fukuda, Hiro Ito, Gisaku Nakamura:
Infinite Series of Generalized Gosper Space Filling Curves. CJCDGCGT 2005: 1-9 - 2003
- [j17]Midori Kobayashi, Gisaku Nakamura, Chie Nara:
Uniform coverings of 2-paths with 5-paths in K2n. Australas. J Comb. 27: 247-252 (2003) - [j16]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) - [j15]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) - [c13]Jin Akiyama, Midori Kobayashi, Gisaku Nakamura:
Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph. IJCCGGT 2003: 25-33 - 2002
- [j14]Midori Kobayashi, Nobuaki Mutoh, Kiyasu-Zen'iti, Gisaku Nakamura:
Double Dudeney sets for an odd number of vertices. Australas. J Comb. 26: 65-84 (2002) - [j13]Midori Kobayashi, Jin Akiyama, Gisaku Nakamura:
On Dudeney's Round Table Problem for p + 2. Ars Comb. 62 (2002) - [j12]Midori Kobayashi, Nobuaki Mutoh, Kiyasu-Zen'iti, Gisaku Nakamura:
New Series of Dudeney Sets for p + 2 Vertices. Ars Comb. 65 (2002) - [j11]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) - [j10]Midori Kobayashi, Gisaku Nakamura:
Resolvable Coverings of 2-Paths by Cycles. Graphs Comb. 18(4): 739-744 (2002) - [c12]Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura:
Universal Measuring Devices with Rectangular Base. JCDCG 2002: 1-8 - [c11]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 - [c10]Jin Akiyama, Gisaku Nakamura:
Congruent Dudeney Dissections of Polygons: All the Hinge Points on Vertices of the Polygon. JCDCG 2002: 14-21 - 2001
- [j9]Midori Kobayashi, Gisaku Nakamura:
Uniform coverings of 2-paths by 4-paths. Australas. J Comb. 24: 301-304 (2001) - 2000
- [j8]Midori Kobayashi, Nobuaki Mutoh, Gisaku Nakamura:
New infinite classes of 1-factorizations of complete graphs. Australas. J Comb. 21: 257-270 (2000) - [c9]Jin Akiyama, Gisaku Nakamura:
Dudeney Dissections of Polygons and Polyhedrons - A Survey. JCDCG 2000: 1-30 - [c8]Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura, Toshinori Sakai, Jorge Urrutia, Carlos Zamora-Cura:
Universal Measuring Devices without Gradations. JCDCG 2000: 31-40 - [c7]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 - [c6]Michio Shimizu, Hiroshi Fukuda, Gisaku Nakamura:
A Thinning Algorithm for Digital Figures of Characters. SSIAI 2000: 83-87
1990 – 1999
- 1998
- [c5]Jin Akiyama, Gisaku Nakamura, Eduardo Rivera-Campo, Jorge Urrutia:
Perfect divisions of a cake. CCCG 1998 - [c4]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 - [c3]Jin Akiyama, Gisaku Nakamura:
Dudeney Dissection of Polygons. JCDCG 1998: 14-29 - [c2]Nobuaki Mutoh, Gisaku Nakamura:
Visibility of Disks on the Lattice Points. JCDCG 1998: 201-206 - 1996
- [j7]Katherine Heinrich, Midori Kobayashi, Gisaku Nakamura:
A solution of Dudeney's round table problem for p^eq^f + 1. Ars Comb. 43 (1996) - 1994
- [j6]Midori Kobayashi, Gisaku Nakamura:
On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs. Graphs Comb. 10(1): 53-59 (1994) - 1993
- [j5]Midori Kobayashi, Kiyasu-Zen'iti, Gisaku Nakamura:
A Solution of Dudeney's Round Table Problem for an Even Number of People. J. Comb. Theory A 63(1): 26-42 (1993) - 1992
- [j4]Midori Kobayashi, Gisaku Nakamura:
Resolvable Coverings of 2-Paths by 4-Cycles. J. Comb. Theory A 60(2): 295-297 (1992) - [j3]Midori Kobayashi, Gisaku Nakamura:
Exact Coverings of 2-Paths by Hamilton Cycles. J. Comb. Theory A 60(2): 298-304 (1992) - 1991
- [j2]Katherine Heinrich, Midori Kobayashi, Gisaku Nakamura:
Dudeney's round table problem. Discret. Math. 92(1-3): 107-125 (1991)
1980 – 1989
- 1989
- [j1]Midori Kobayashi, Hitoshi Awoki, Yoshimi Nakazaki, Gisaku Nakamura:
A perfect one-factorization ofK36. Graphs Comb. 5(1): 243-244 (1989)
1970 – 1979
- 1971
- [c1]Gisaku Nakamura:
A feedback queueing model for an interactive computer system. AFIPS Fall Joint Computing Conference 1971: 57-64
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 21:33 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:
