Erfang Shan
Orcid: 0000-0001-6127-6383
According to our database1,
Erfang Shan
authored at least 123 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
0
5
10
3
5
5
9
8
8
11
6
7
6
5
3
4
4
4
8
5
5
3
1
3
2
1
1
1
1
2
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
On csauthors.net:
Bibliography
2024
Ann. Oper. Res., July, 2024
Discret. Math., January, 2024
2023
Corrigendum to "A new axiomatization of the Shapley-solidarity value for games with a coalition structure" [Oper. Res. Lett. 46 (2018) 163-167].
Oper. Res. Lett., November, 2023
4OR, September, 2023
Int. J. Game Theory, June, 2023
Ann. Oper. Res., April, 2023
2022
Oper. Res. Lett., 2022
Oper. Res., 2022
J. Comb. Optim., 2022
Discret. Math., 2022
2021
J. Comb. Optim., 2021
Discret. Math., 2021
Ann. Oper. Res., 2021
2020
SIAM J. Discret. Math., 2020
J. Comb. Optim., 2020
Discuss. Math. Graph Theory, 2020
Discret. Math., 2020
Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020
2019
The α-spectral radius of uniform hypergraphs concerning degrees and domination number.
J. Comb. Optim., 2019
J. Comb. Optim., 2019
J. Comb. Optim., 2019
Appl. Math. Comput., 2019
2018
J. Comb. Optim., 2018
The Finite Projective Plane and the 5-Uniform Linear Intersecting Hypergraphs with Domination Number Four.
Graphs Comb., 2018
Discret. Appl. Math., 2018
Electron. J. Comb., 2018
Electron. J. Comb., 2018
2017
J. Comb. Optim., 2017
J. Comb. Optim., 2017
Inf. Process. Lett., 2017
Proceedings of the Combinatorial Optimization and Applications, 2017
2016
Math. Soc. Sci., 2016
Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties.
J. Syst. Sci. Complex., 2016
J. Comb. Optim., 2016
Paired-domination in claw-free graphs with minimum degree at least four.
Ars Comb., 2016
Proceedings of the Combinatorial Optimization and Applications, 2016
Proceedings of the Combinatorial Optimization and Applications, 2016
2015
Theor. Comput. Sci., 2015
Coloring clique-hypergraphs of graphs with no subdivision of <sub>K</sub><sub>5</sub>.
Theor. Comput. Sci., 2015
Inf. Process. Lett., 2015
Int. J. Comput. Math., 2015
Discret. Math., 2015
Upper signed k-domination number in graphs.
Ars Comb., 2015
Proceedings of the Combinatorial Optimization and Applications, 2015
2014
A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs.
Theor. Comput. Sci., 2014
Discuss. Math. Graph Theory, 2014
Discret. Math., 2014
2013
Signed total k-domination in graphs.
Ars Comb., 2013
Australas. J Comb., 2013
2012
Int. J. Comput. Math., 2012
Comput. Math. Appl., 2012
2011
A note on the upper bound for the paired-domination number of a graph with minimum degree at least two.
Networks, 2011
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs.
Inf. Process. Lett., 2011
The Signed Total Domination Number of Graphs.
Ars Comb., 2011
Appl. Math. Lett., 2011
2010
Inf. Sci., 2010
Discuss. Math. Graph Theory, 2010
Comput. Math. Appl., 2010
2009
Inf. Process. Lett., 2009
Discret. Appl. Math., 2009
Discret. Appl. Math., 2009
Minus Edge Domination in Graphs.
Ars Comb., 2009
Upper minus total domination of a 5-regular graph.
Ars Comb., 2009
An upper bound on the restrained domination number of graphs.
Ars Comb., 2009
2008
Clique-transversal Number in Cubic Graphs.
Discret. Math. Theor. Comput. Sci., 2008
Discret. Appl. Math., 2008
2007
Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph".
J. Graph Theory, 2007
Bondage number in oriented graphs.
Ars Comb., 2007
Appl. Math. Comput., 2007
2006
2005
Appl. Math. Lett., 2005
2004
A characterization of trees with equal total domination and paired-domination numbers.
Australas. J Comb., 2004
2003
Theor. Comput. Sci., 2003
Upper bounds on signed 2-independence number of graphs.
Ars Comb., 2003
2002
2000
Lower bounds on dominating functions in graphs.
Ars Comb., 2000