default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNobuaki Mutoh
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
- 2016
[c6]Arief Maulana, Kazumi Saito, Tetsuo Ikeda, Hiroaki Yuze, Takayuki Watanabe, Seiya Okubo, Nobuaki Mutoh:
Characterizing Similarity Structure of Spatial Networks Based on Degree Mixing Patterns. AINA 2016: 9-16- 2015
- [j8]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
- [j7]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
- [j6]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) - [j5]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
- 2008
- [c5]Kazumi Saito, Nobuaki Mutoh, Tetsuo Ikeda, Toshinao Goda, Kazuki Mochizuki:
Improving Search Efficiency of Incremental Variable Selection by Using Second-Order Optimal Criterion. KES (3) 2008: 41-49 - 2007
- [j4]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) - [c4]Hiroshi Fukuda, Nobuaki Mutoh, Gisaku Nakamura, Doris Schattschneider:
Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry. KyotoCGGT 2007: 68-78 - 2002
- [j3]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) - [j2]Midori Kobayashi, Nobuaki Mutoh, Kiyasu-Zen'iti, Gisaku Nakamura:
New Series of Dudeney Sets for p + 2 Vertices. Ars Comb. 65 (2002) - [c3]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 - [c2]Nobuaki Mutoh:
The Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Sphere. JCDCG 2002: 204-214 - 2000
- [j1]Midori Kobayashi, Nobuaki Mutoh, Gisaku Nakamura:
New infinite classes of 1-factorizations of complete graphs. Australas. J Comb. 21: 257-270 (2000)
1990 – 1999
- 1998
- [c1]Nobuaki Mutoh, Gisaku Nakamura:
Visibility of Disks on the Lattice Points. JCDCG 1998: 201-206
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-04-25 05: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:
