default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazuhiko Ushio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j22]Kazuhiko Ushio, Hideaki Fujimoto:
Balanced C4-Trefoil Decomposition of Complete Multi-Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1173-1180 (2006)- 2005
- [j21]Kazuhiko Ushio, Hideaki Fujimoto:
Balanced Quatrefoil Decomposition of Complete Multigraphs. IEICE Trans. Inf. Syst. 88-D(1): 17-22 (2005) - [j20]Kazuhiko Ushio, Hideaki Fujimoto:
Balanced C4-Bowtie Decomposition of Complete Multi-Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1148-1154 (2005) - 2003
- [j19]Kazuhiko Ushio, Hideaki Fujimoto:
Balanced Bowtie Decomposition of Complete Multigraphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(9): 2360-2365 (2003) - 2002
- [j18]Kazuhiko Ushio:
Evenly partite star-factorization of symmetric complete tripartite multi-digraphs. Electron. Notes Discret. Math. 11: 608-611 (2002) - 2001
- [j17]Kazuhiko Ushio, Yoshikazu Ohtsubo:
Kp, q-factorization of symmetric complete tripartite digraphs. Discret. Math. 231(1-3): 459-467 (2001) - 2000
- [j16]Kazuhiko Ushio:
Evenly partite bigraph-factorization of symmetric complete tripartite digraphs. Australas. J Comb. 21: 245-250 (2000) - [j15]Kazuhiko Ushio:
Sk-factorization of symmetric complete tripartite digraphs. Discret. Math. 211: 281-286 (2000) - [j14]Kazuhiko Ushio:
Star-factorization of symmetric complete bipartite multi-digraphs. Discret. Math. 215: 293-297 (2000) - [j13]Kazuhiko Ushio, Yoshikazu Ohtsubo:
Ck-factorization of symmetric complete bipartite and tripartite multi-digraphs. Discret. Math. 223(1-3): 393-397 (2000)
1990 – 1999
- 1999
- [j12]Kazuhiko Ushio:
Semi-evenly partite star-factorization of symmetric complete tripartite digraphs. Australas. J Comb. 20: 69-76 (1999) - [j11]Kazuhiko Ushio:
Bigraph-factorization of symmetric complete bipartite multi-digraphs. Australas. J Comb. 20: 261-266 (1999) - [j10]Kazuhiko Ushio:
Sk-factorization of symmetric complete tripartite digraphs. Discret. Math. 197-198: 791-797 (1999) - [j9]Kazuhiko Ushio:
Cycle-factorization of symmetric complete multipartite digraphs. Discret. Math. 199(1-3): 273-278 (1999) - 1997
- [j8]Kazuhiko Ushio:
Star-factorization of symmetric complete bipartite digraphs. Discret. Math. 167-168: 593-596 (1997) - 1993
- [j7]Kazuhiko Ushio:
G-designs and related designs. Discret. Math. 116(1-3): 299-311 (1993)
1980 – 1989
- 1989
- [j6]Kazuhiko Ushio, Reiji Tsuruno:
P3-factorization of complete multipartite graphs. Graphs Comb. 5(1): 385-387 (1989) - 1988
- [j5]Kazuhiko Ushio:
P3-Factorization of complete bipartite graphs. Discret. Math. 72(1-3): 361-366 (1988) - [j4]Hikoe Enomoto, Takashi Miyamoto, Kazuhiko Ushio:
Ck-factorization of complete bipartite graphs. Graphs Comb. 4(1): 111-113 (1988) - 1982
- [j3]Kazuhiko Ushio:
On balanced claw designs of complete multi-partite graphs. Discret. Math. 38(1): 117-119 (1982)
1970 – 1979
- 1979
- [j2]Sumiyasu Yamamoto, Shinsei Tazawa, Kazuhiko Ushio, Hideto Ikeda:
Design of a Balanced Multiple Valued File Organization Schema with the Least Redundancy. ACM Trans. Database Syst. 4(4): 518-530 (1979) - 1978
- [c2]Sumiyasu Yamamoto, Shinsei Tazawa, Kazuhiko Ushio, Hideto Ikeda:
Design of a Generalized Balanced Multiple-Valued File Organization Scheme of Order Two. SIGMOD Conference 1978: 47-51 - 1977
- [c1]Sumiyasu Yamamoto, Shinsei Tazawa, Kazuhiko Ushio, Hideto Ikeda:
Design of a Balanced Multiple Valued File Organization Schema with the Least Redundancy. VLDB 1977: 230 - 1975
- [j1]Sumiyasu Yamamoto, Hideto Ikeda, Shinsei Shige-eda, Kazuhiko Ushio, Noboru Hamada:
Design of a New Balanced File Organization Scheme With the Least Redundancy. Inf. Control. 28(2): 156-175 (1975)
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-24 22:55 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:
