Yoshio Sano

Orcid: 0000-0003-1225-0421

According to our database1, Yoshio Sano authored at least 47 papers between 2007 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Extended Random Assignment Mechanisms on a Family of Good Sets.
Oper. Res. Forum, 2021

Signed analogue of line graphs and their smallest eigenvalues.
J. Graph Theory, 2021

2019
On the minimum clique partitioning problem on weighted chordal graphs.
Theor. Comput. Sci., 2019

Submodular optimization views on the random assignment problem.
Math. Program., 2019

The partial order competition dimensions of bipartite graphs.
Discret. Appl. Math., 2019

2018
The Random Assignment Problem with Submodular Constraints on Goods.
ACM Trans. Economics and Comput., 2018

Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm.
Optim. Lett., 2018

2017
T-neighbor Systems and Travel Groupoids on a Graph.
Graphs Comb., 2017

On the phylogeny graphs of degree-bounded digraphs.
Discret. Appl. Math., 2017

On the partial order competition dimensions of chordal graphs.
Discret. Appl. Math., 2017

2016
The competition graphs of oriented complete bipartite graphs.
Discret. Appl. Math., 2016

On the competition graphs of d-partial orders.
Discret. Appl. Math., 2016

2015
Edge-signed graphs with smallest eigenvalue greater than -2.
J. Comb. Theory, Ser. B, 2015

The double competition multigraph of a digraph.
Discret. Math. Theor. Comput. Sci., 2015

On the hypercompetition numbers of hypergraphs with maximum degree at most two.
Discuss. Math. Graph Theory, 2015

The double competition hypergraph of a digraph.
Discret. Appl. Math., 2015

A generalization of Opsut's result on the competition numbers of line graphs.
Discret. Appl. Math., 2015

T-partition systems and travel groupoids on a graph.
CoRR, 2015

On the Competition Numbers of Diamond-Free Graphs.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014
The niche graphs of interval orders.
Discuss. Math. Graph Theory, 2014

Fat Hoffman graphs with smallest eigenvalue greater than -3.
Discret. Appl. Math., 2014

The competition hypergraphs of doubly partial orders.
Discret. Appl. Math., 2014

On the smallest eigenvalues of the line graphs of some trees.
CoRR, 2014

Fat Hoffman graphs with smallest eigenvalue at least -1 - τ.
Ars Math. Contemp., 2014

2013
A Generalization of Opsut's Lower Bounds for the Competition Number of a Graph.
Graphs Comb., 2013

The phylogeny graphs of double partial orders.
Discuss. Math. Graph Theory, 2013

The competition number of the complement of a cycle.
Discret. Appl. Math., 2013

The Double Multicompetition Number of a Multigraph.
Proceedings of the Discrete and Computational Geometry and Graphs, 2013

The Non-confusing Travel Groupoids on a Finite Connected Graph.
Proceedings of the Discrete and Computational Geometry and Graphs, 2013

2012
Graph Equation for Line Graphs and m-Step Graphs.
Graphs Comb., 2012

The competition number of a generalized line graph is at most two.
Discret. Math. Theor. Comput. Sci., 2012

The competition numbers of complete multipartite graphs with many partite sets.
Discret. Appl. Math., 2012

The competition number of a graph and the dimension of its hole space.
Appl. Math. Lett., 2012

Edge-disjoint Decompositions of Complete Multipartite Graphs into Gregarious Long Cycles.
Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

2011
On the rank functions of $\mathcal{H}$-matroids.
CoRR, 2011

On the hypercompetition numbers of hypergraphs.
Ars Comb., 2011

The competition numbers of ternary Hamming graphs.
Appl. Math. Lett., 2011

Graphs having many holes but with small competition numbers.
Appl. Math. Lett., 2011

2010
The competition numbers of Johnson graphs.
Discuss. Math. Graph Theory, 2010

The competition number of a graph whose holes do not overlap much.
Discret. Appl. Math., 2010

The competition number of a graph with exactly two holes.
Ars Comb., 2010

2009
The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares.
Discret. Math., 2009

Characterizations of competition multigraphs.
Discret. Appl. Math., 2009

2008
Rank functions of strict cg-matroids.
Discret. Math., 2008

The competition numbers of complete tripartite graphs.
Discret. Appl. Math., 2008

2007
The principal numbers of K. Saito for the types A<sub>l</sub>, D<sub>l</sub> and E<sub>l</sub>.
Discret. Math., 2007

Matroids on convex geometries (cg-matroids).
Discret. Math., 2007


  Loading...