Matroids on convex geometries (cg-matroids). - Satoru Fujishige; Gleb A. Koshevoy; Yoshio Sano (Discret. Math., 2007)

The principal numbers of K. Saito for the types Al, Dl and El. - Yoshio Sano (Discret. Math., 2007)

The competition numbers of complete tripartite graphs. - Suh-Ryung Kim; Yoshio Sano (Discret. Appl. Math., 2008)

Rank functions of strict cg-matroids. - Yoshio Sano (Discret. Math., 2008)

Characterizations of competition multigraphs. - Yoshio Sano (Discret. Appl. Math., 2009)

The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares. - Boram Park; Suh-Ryung Kim; Yoshio Sano (Discret. Math., 2009)

The competition number of a graph with exactly two holes. - Jung Yeun Lee; Suh-Ryung Kim; Seog-Jin Kim; Yoshio Sano (Ars Comb., 2010)

The competition number of a graph whose holes do not overlap much. - Suh-Ryung Kim; Jung Yeun Lee; Yoshio Sano (Discret. Appl. Math., 2010)

The competition numbers of Johnson graphs. - Suh-Ryung Kim; Boram Park; Yoshio Sano (Discuss. Math. Graph Theory, 2010)

Graphs having many holes but with small competition numbers. - Jung Yeun Lee; Suh-Ryung Kim; Seog-Jin Kim; Yoshio Sano (Appl. Math. Lett., 2011)

The competition numbers of ternary Hamming graphs. - Boram Park; Yoshio Sano (Appl. Math. Lett., 2011)

On the hypercompetition numbers of hypergraphs. - Boram Park; Yoshio Sano (Ars Comb., 2011)

On the rank functions of $ mathcal{H}$-matroids. - Yoshio Sano (CoRR, 2011)

Edge-disjoint Decompositions of Complete Multipartite Graphs into Gregarious Long Cycles. - Jung Rae Cho; Jeongmi Park; Yoshio Sano (TJJCCGG, 2012)

The competition number of a graph and the dimension of its hole space. - Suh-Ryung Kim; Jung Yeun Lee; Boram Park; Yoshio Sano (Appl. Math. Lett., 2012)

The competition numbers of complete multipartite graphs with many partite sets. - Suh-Ryung Kim; Boram Park; Yoshio Sano (Discret. Appl. Math., 2012)

The competition number of a generalized line graph is at most two. - Boram Park; Yoshio Sano (Discret. Math. Theor. Comput. Sci., 2012)

Graph Equation for Line Graphs and m-Step Graphs. - Seog-Jin Kim; Suh-Ryung Kim; Jung Yeun Lee; Won-Jin Park; Yoshio Sano (Graphs Comb., 2012)

The Non-confusing Travel Groupoids on a Finite Connected Graph. - Jung Rae Cho; Jeongmi Park; Yoshio Sano (JCDCGG, 2013)

The Double Multicompetition Number of a Multigraph. - Jeongmi Park; Yoshio Sano (JCDCGG, 2013)

The competition number of the complement of a cycle. - Suh-Ryung Kim; Boram Park; Yoshio Sano (Discret. Appl. Math., 2013)

The phylogeny graphs of double partial orders. - Boram Park; Yoshio Sano (Discuss. Math. Graph Theory, 2013)

A Generalization of Opsut's Lower Bounds for the Competition Number of a Graph. - Yoshio Sano (Graphs Comb., 2013)

Fat Hoffman graphs with smallest eigenvalue at least -1 - τ. - Akihiro Munemasa; Yoshio Sano; Tetsuji Taniguchi (Ars Math. Contemp., 2014)

On the smallest eigenvalues of the line graphs of some trees. - Akihiro Munemasa; Yoshio Sano; Tetsuji Taniguchi (CoRR, 2014)

The competition hypergraphs of doubly partial orders. - Suh-Ryung Kim; Jung Yeun Lee; Boram Park; Yoshio Sano (Discret. Appl. Math., 2014)

Fat Hoffman graphs with smallest eigenvalue greater than -3. - Akihiro Munemasa; Yoshio Sano; Tetsuji Taniguchi (Discret. Appl. Math., 2014)

The niche graphs of interval orders. - Jeongmi Park; Yoshio Sano (Discuss. Math. Graph Theory, 2014)

On the Competition Numbers of Diamond-Free Graphs. - Yoshio Sano (JCDCGG, 2015)

T-partition systems and travel groupoids on a graph. - Jung Rae Cho; Jeongmi Park; Yoshio Sano (CoRR, 2015)

A generalization of Opsut's result on the competition numbers of line graphs. - Suh-Ryung Kim; Jung Yeun Lee; Boram Park; Yoshio Sano (Discret. Appl. Math., 2015)

The double competition hypergraph of a digraph. - Jeongmi Park; Yoshio Sano (Discret. Appl. Math., 2015)

On the hypercompetition numbers of hypergraphs with maximum degree at most two. - Yoshio Sano (Discuss. Math. Graph Theory, 2015)

The double competition multigraph of a digraph. - Jeongmi Park; Yoshio Sano (Discret. Math. Theor. Comput. Sci., 2015)

Edge-signed graphs with smallest eigenvalue greater than -2. - Gary R. W. Greaves; Jack H. Koolen; Akihiro Munemasa; Yoshio Sano; Tetsuji Taniguchi (J. Comb. Theory B, 2015)

On the competition graphs of d-partial orders. - Jihoon Choi; Kyeong Seok Kim; Suh-Ryung Kim; Jung Yeun Lee; Yoshio Sano (Discret. Appl. Math., 2016)

The competition graphs of oriented complete bipartite graphs. - Suh-Ryung Kim; Jung Yeun Lee; Boram Park; Yoshio Sano (Discret. Appl. Math., 2016)

On the partial order competition dimensions of chordal graphs. - Jihoon Choi; Suh-Ryung Kim; Jung Yeun Lee; Yoshio Sano (Discret. Appl. Math., 2017)

On the phylogeny graphs of degree-bounded digraphs. - Seung Chul Lee; Jihoon Choi; Suh-Ryung Kim; Yoshio Sano (Discret. Appl. Math., 2017)

T-neighbor Systems and Travel Groupoids on a Graph. - Jung Rae Cho; Jeongmi Park; Yoshio Sano (Graphs Comb., 2017)

Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm. - Takahito Kuno; Yoshio Sano; Takahiro Tsuruda (Optim. Lett., 2018)

The Random Assignment Problem with Submodular Constraints on Goods. - Satoru Fujishige; Yoshio Sano; Ping Zhan (ACM Trans. Economics and Comput., 2018)

The partial order competition dimensions of bipartite graphs. - Jihoon Choi; Soogang Eoh; Suh-Ryung Kim; Jung Yeun Lee; Yoshio Sano (Discret. Appl. Math., 2019)

Submodular optimization views on the random assignment problem. - Satoru Fujishige; Yoshio Sano; Ping Zhan (Math. Program., 2019)

On the minimum clique partitioning problem on weighted chordal graphs. - Changseong Jo; Jihoon Choi; Suh-Ryung Kim; Yoshio Sano (Theor. Comput. Sci., 2019)

Signed analogue of line graphs and their smallest eigenvalues. - Alexander L. Gavrilyuk; Akihiro Munemasa; Yoshio Sano; Tetsuji Taniguchi (J. Graph Theory, 2021)

Extended Random Assignment Mechanisms on a Family of Good Sets. - Yoshio Sano; Ping Zhan (Oper. Res. Forum, 2021)