default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoshio Sano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j40]Alexander L. Gavrilyuk
, Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Signed analogue of line graphs and their smallest eigenvalues. J. Graph Theory 98(2): 309-325 (2021)- [j39]Yoshio Sano, Ping Zhan:
Extended Random Assignment Mechanisms on a Family of Good Sets. Oper. Res. Forum 2(4) (2021)
2010 – 2019
- 2019
- [j38]Jihoon Choi, Soogang Eoh, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
The partial order competition dimensions of bipartite graphs. Discret. Appl. Math. 254: 47-55 (2019) - [j37]Satoru Fujishige, Yoshio Sano, Ping Zhan:
Submodular optimization views on the random assignment problem. Math. Program. 178(1-2): 485-501 (2019) - [j36]Changseong Jo, Jihoon Choi, Suh-Ryung Kim, Yoshio Sano:
On the minimum clique partitioning problem on weighted chordal graphs. Theor. Comput. Sci. 791: 1-9 (2019) - 2018
- [j35]Takahito Kuno, Yoshio Sano, Takahiro Tsuruda:
Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm. Optim. Lett. 12(5): 933-943 (2018) - [j34]Satoru Fujishige, Yoshio Sano, Ping Zhan:
The Random Assignment Problem with Submodular Constraints on Goods. ACM Trans. Economics and Comput. 6(1): 3:1-3:28 (2018) - 2017
- [j33]Jihoon Choi, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
On the partial order competition dimensions of chordal graphs. Discret. Appl. Math. 222: 89-96 (2017) - [j32]Seung Chul Lee, Jihoon Choi, Suh-Ryung Kim, Yoshio Sano:
On the phylogeny graphs of degree-bounded digraphs. Discret. Appl. Math. 233: 83-93 (2017) - [j31]Jung Rae Cho, Jeongmi Park, Yoshio Sano:
T-neighbor Systems and Travel Groupoids on a Graph. Graphs Comb. 33(6): 1521-1529 (2017) - 2016
- [j30]Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano:
The competition graphs of oriented complete bipartite graphs. Discret. Appl. Math. 201: 182-190 (2016) - [j29]Jihoon Choi, Kyeong Seok Kim, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
On the competition graphs of d-partial orders. Discret. Appl. Math. 204: 29-37 (2016) - 2015
- [j28]Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano:
A generalization of Opsut's result on the competition numbers of line graphs. Discret. Appl. Math. 181: 152-159 (2015) - [j27]Jeongmi Park, Yoshio Sano:
The double competition hypergraph of a digraph. Discret. Appl. Math. 195: 110-113 (2015) - [j26]Yoshio Sano:
On the hypercompetition numbers of hypergraphs with maximum degree at most two. Discuss. Math. Graph Theory 35(3): 595-598 (2015) - [j25]Jeongmi Park, Yoshio Sano:
The double competition multigraph of a digraph. Discret. Math. Theor. Comput. Sci. 17(2): 303-310 (2015) - [j24]Gary R. W. Greaves, Jack H. Koolen, Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Edge-signed graphs with smallest eigenvalue greater than -2. J. Comb. Theory B 110: 90-111 (2015) - [c4]Yoshio Sano:
On the Competition Numbers of Diamond-Free Graphs. JCDCGG 2015: 247-252 - [i7]Jung Rae Cho, Jeongmi Park, Yoshio Sano:
T-partition systems and travel groupoids on a graph. CoRR abs/1512.00363 (2015) - 2014
- [j23]Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Fat Hoffman graphs with smallest eigenvalue at least -1 - τ. Ars Math. Contemp. 7(1): 247-262 (2014) - [j22]Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano:
The competition hypergraphs of doubly partial orders. Discret. Appl. Math. 165: 185-191 (2014) - [j21]Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Fat Hoffman graphs with smallest eigenvalue greater than -3. Discret. Appl. Math. 176: 78-88 (2014) - [j20]Jeongmi Park, Yoshio Sano:
The niche graphs of interval orders. Discuss. Math. Graph Theory 34(2): 353-359 (2014) - [i6]Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
On the smallest eigenvalues of the line graphs of some trees. CoRR abs/1405.3475 (2014) - 2013
- [j19]Suh-Ryung Kim, Boram Park, Yoshio Sano:
The competition number of the complement of a cycle. Discret. Appl. Math. 161(12): 1755-1760 (2013) - [j18]Boram Park, Yoshio Sano:
The phylogeny graphs of double partial orders. Discuss. Math. Graph Theory 33(4): 657-664 (2013) - [j17]Yoshio Sano:
A Generalization of Opsut's Lower Bounds for the Competition Number of a Graph. Graphs Comb. 29(5): 1543-1547 (2013) - [c3]Jung Rae Cho, Jeongmi Park, Yoshio Sano:
The Non-confusing Travel Groupoids on a Finite Connected Graph. JCDCGG 2013: 14-17 - [c2]Jeongmi Park, Yoshio Sano:
The Double Multicompetition Number of a Multigraph. JCDCGG 2013: 138-144 - [i5]Jeongmi Park, Yoshio Sano:
The niche graphs of interval orders. CoRR abs/1304.5476 (2013) - [i4]Jeongmi Park, Yoshio Sano:
The double competition multigraph of a digraph. CoRR abs/1307.5509 (2013) - 2012
- [j16]Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano:
The competition number of a graph and the dimension of its hole space. Appl. Math. Lett. 25(3): 638-642 (2012) - [j15]Suh-Ryung Kim, Boram Park, Yoshio Sano:
The competition numbers of complete multipartite graphs with many partite sets. Discret. Appl. Math. 160(7-8): 1176-1182 (2012) - [j14]Boram Park, Yoshio Sano:
The competition number of a generalized line graph is at most two. Discret. Math. Theor. Comput. Sci. 14(2): 1-10 (2012) - [j13]Seog-Jin Kim, Suh-Ryung Kim, Jung Yeun Lee, Won-Jin Park, Yoshio Sano:
Graph Equation for Line Graphs and m-Step Graphs. Graphs Comb. 28(6): 831-842 (2012) - [c1]Jung Rae Cho, Jeongmi Park, Yoshio Sano:
Edge-disjoint Decompositions of Complete Multipartite Graphs into Gregarious Long Cycles. TJJCCGG 2012: 57-63 - [i3]Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Fat Hoffman graphs with smallest eigenvalue greater than -3. CoRR abs/1211.3929 (2012) - 2011
- [j12]Jung Yeun Lee, Suh-Ryung Kim, Seog-Jin Kim, Yoshio Sano:
Graphs having many holes but with small competition numbers. Appl. Math. Lett. 24(8): 1331-1335 (2011) - [j11]Boram Park, Yoshio Sano:
The competition numbers of ternary Hamming graphs. Appl. Math. Lett. 24(9): 1608-1613 (2011) - [j10]Boram Park, Yoshio Sano:
On the hypercompetition numbers of hypergraphs. Ars Comb. 100: 151-159 (2011) - [i2]Yoshio Sano:
On the rank functions of $\mathcal{H}$-matroids. CoRR abs/1111.2642 (2011) - [i1]Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Fat Hoffman graphs with smallest eigenvalue at least $-1-τ$. CoRR abs/1111.7284 (2011) - 2010
- [j9]Jung Yeun Lee, Suh-Ryung Kim, Seog-Jin Kim, Yoshio Sano:
The competition number of a graph with exactly two holes. Ars Comb. 95 (2010) - [j8]Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
The competition number of a graph whose holes do not overlap much. Discret. Appl. Math. 158(13): 1456-1460 (2010) - [j7]Suh-Ryung Kim, Boram Park, Yoshio Sano:
The competition numbers of Johnson graphs. Discuss. Math. Graph Theory 30(3): 449-459 (2010)
2000 – 2009
- 2009
- [j6]Yoshio Sano:
Characterizations of competition multigraphs. Discret. Appl. Math. 157(13): 2978-2982 (2009) - [j5]Boram Park, Suh-Ryung Kim, Yoshio Sano:
The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares. Discret. Math. 309(23-24): 6464-6469 (2009) - 2008
- [j4]Suh-Ryung Kim, Yoshio Sano:
The competition numbers of complete tripartite graphs. Discret. Appl. Math. 156(18): 3522-3524 (2008) - [j3]Yoshio Sano:
Rank functions of strict cg-matroids. Discret. Math. 308(20): 4734-4744 (2008) - 2007
- [j2]Satoru Fujishige, Gleb A. Koshevoy, Yoshio Sano:
Matroids on convex geometries (cg-matroids). Discret. Math. 307(15): 1936-1950 (2007) - [j1]Yoshio Sano:
The principal numbers of K. Saito for the types Al, Dl and El. Discret. Math. 307(21): 2636-2642 (2007)
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 2025-01-21 00:15 CET 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:
