Erfang Shan

131 papers C 4Misc 1Journal 123Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Fair link contributions for values of network cooperative games.
Discret. Appl. Math.
Daniel Li Li, Erfang Shan
2026 J jnl
Tripartite strategies of intelligent assistants in shared accommodation considering privacy risks: an evolutionary game analysis.
J. Inf. Technol. Tour.
Xiyin Deng, Erfang Shan
2025 J jnl
Mutually dependent, balanced contributions, and the priority value.
J. Comb. Optim.
Songtao He, Erfang Shan, Yuxin Sun
2025 J jnl
New axiomatizations of the Priority value for cooperative games with priority structure.
Oper. Res. Lett.
Songtao He, Erfang Shan, Yuxin Sun
2025 J jnl
Pseudo-Shapley value for weak games of threats.
J. Comb. Optim.
Daniel Li Li, Erfang Shan
2025 J jnl
Solidarity Value for Graph Games.
J. Optim. Theory Appl.
Daniel Li, Erfang Shan
2024 J jnl
A new value for communication situations.
Math. Methods Oper. Res.
Daniel Li Li, Erfang Shan
2024 J jnl
Consistency of the Owen value for TU-games with coalition and graph structures.
Ann. Oper. Res.
Wenrong Lyu, Erfang Shan, Zeguang Cui
2024 J jnl
The Turán number of Berge hypergraphs with stable properties.
Discret. Math.
Erfang Shan, Liying Kang, Yisai Xue
2023 J jnl
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.
Tao Liu, Wenrong Lyu, Xun-Feng Hu, Erfang Shan
2023 J jnl
Marginality and a Characterization of the Owen Graph value.
Int. J. Game Theory
Erfang Shan
2023 J jnl
The efficient partition surplus Owen graph value.
Ann. Oper. Res.
Erfang Shan, Jilei Shi, Wenrong Lyu
2023 J jnl
The two-step average tree value for graph and hypergraph games.
Ann. Oper. Res.
Liying Kang, Anna B. Khmelnitskaya, Erfang Shan, Dolf Talman, Guang Zhang
2023 J jnl
Union-wise egalitarian solutions in cooperative games with a coalition structure.
4OR
Erfang Shan, Zhiqiang Yu, Wenrong Lyu
2022 J jnl
A value for cooperative games with coalition and probabilistic graph structures.
J. Comb. Optim.
Jilei Shi, Lei Cai, Erfang Shan, Wenrong Lyu
2022 J jnl
Anti-Ramsey number of matchings in
Discret. Math.
Yisai Xue, Erfang Shan, Liying Kang
2022 J jnl
Consistency and the graph Banzhaf value for communication graph games.
Oper. Res. Lett.
Erfang Shan, Wenrong Lyu, Jilei Shi, Shanshan Nie
2022 J jnl
Safety of links with respect to the Myerson value for communication situations.
Oper. Res.
Daniel Li Li, Erfang Shan
2022 J jnl
The Turán number of Berge-matching in hypergraphs.
Discret. Math.
Liying Kang, Zhenyu Ni, Erfang Shan
2021 J jnl
Cooperative games with partial information.
Int. J. Game Theory
Daniel Li Li, Erfang Shan
2021 J jnl
Decomposing uniform hypergraphs into uniform hypertrees and single edges.
Discret. Math.
Liying Kang, Zhenyu Ni, Erfang Shan
2021 J jnl
Egalitarian allocation and players of certain type.
Oper. Res. Lett.
Daniel Li Li, Erfang Shan
2021 J jnl
Extremal graphs for blow-ups of stars and paths.
Discret. Appl. Math.
Liying Kang, Hui Zhu, Erfang Shan
2021 J jnl
On a Conjecture for Power Domination.
Graphs Comb.
Min Zhao, Erfang Shan, Liying Kang
2021 J jnl
The Banzhaf value for generalized probabilistic communication situations.
Ann. Oper. Res.
Jilei Shi, Erfang Shan
2021 J jnl
The average tree value for hypergraph games.
Math. Methods Oper. Res.
Liying Kang, Anna B. Khmelnitskaya, Erfang Shan, Dolf Talman, Guang Zhang
2021 J jnl
The principal eigenvector to α-spectral radius of hypergraphs.
J. Comb. Optim.
Jing Wang, Liying Kang, Erfang Shan
2021 J jnl
The spectral radius and domination number in linear uniform hypergraphs.
J. Comb. Optim.
Liying Kang, Wei Zhang, Erfang Shan
2020 — conf
A Note on the Position Value for Hypergraph Communication Situations.
Complexity and Approximation
Erfang Shan, Jilei Shi, Wenrong Lv
2020 J jnl
Efficient quotient extensions of the Myerson value.
Ann. Oper. Res.
Daniel Li Li, Erfang Shan
2020 J jnl
Extremal Graphs for Blow-Ups of Keyrings.
Graphs Comb.
Zhenyu Ni, Liying Kang, Erfang Shan, Hui Zhu
2020 J jnl
Extremal Graphs for Odd-Ballooning of Paths and Cycles.
Graphs Comb.
Hui Zhu, Liying Kang, Erfang Shan
2020 J jnl
List-coloring clique-hypergraphs of K5-minor-free graphs strongly.
Discret. Math.
Zuosong Liang, Jianliang Wu, Erfang Shan
2020 J jnl
Marginal contributions and derivatives for set functions in cooperative games.
J. Comb. Optim.
Daniel Li Li, Erfang Shan
2020 J jnl
Power domination in the generalized Petersen graphs.
Discuss. Math. Graph Theory
Liying Kang, Erfang Shan, Min Zhao
2020 J jnl
The Myerson value for directed graph games.
Oper. Res. Lett.
Daniel Li Li, Erfang Shan
2020 J jnl
The Turán Number of Berge-K
SIAM J. Discret. Math.
Hui Zhu, Liying Kang, Zhenyu Ni, Erfang Shan
2019 J jnl
A linear-time algorithm for clique-coloring planar graphs.
Oper. Res. Lett.
Zuosong Liang, Erfang Shan, Huiyu Xing, Chunsong Bai
2019 J jnl
Maximally connected p-partite uniform hypergraphs.
Discret. Appl. Math.
Erfang Shan, Jing Zhao, Liying Kang
2019 J jnl
The clique-perfectness and clique-coloring of outer-planar graphs.
J. Comb. Optim.
Zuosong Liang, Erfang Shan, Liying Kang
2019 J jnl
The efficient proportional Myerson values.
Oper. Res. Lett.
Erfang Shan, Jiayu Han, Jilei Shi
2019 J jnl
The eigenvectors to the p-spectral radius of general hypergraphs.
J. Comb. Optim.
Liying Kang, Lele Liu, Erfang Shan
2019 J jnl
The extremal
Appl. Math. Comput.
Zhangqing Yu, Liying Kang, Lele Liu, Erfang Shan
2019 J jnl
The position value and the structures of graphs.
Appl. Math. Comput.
Daniel Li Li, Erfang Shan
2019 J jnl
The α-spectral radius of uniform hypergraphs concerning degrees and domination number.
J. Comb. Optim.
Qiannan Wang, Liying Kang, Erfang Shan, Zuosong Liang
2018 J jnl
Algorithms for connected p-centdian problem on block graphs.
J. Comb. Optim.
Liying Kang, Jianjie Zhou, Erfang Shan
2018 J jnl
Domination in intersecting hypergraphs.
Discret. Appl. Math.
Yanxia Dong, Erfang Shan, Liying Kang, Shan Li
2018 J jnl
Extremal hypergraphs for matching number and domination number.
Discret. Appl. Math.
Erfang Shan, Yanxia Dong, Liying Kang, Shan Li
2018 J jnl
On the irregularity of uniform hypergraphs.
Eur. J. Comb.
Lele Liu, Liying Kang, Erfang Shan
2018 J jnl
Sharp Lower Bounds on the Spectral Radius of Uniform Hypergraphs Concerning Degrees.
Electron. J. Comb.
Liying Kang, Lele Liu, Erfang Shan
2018 J jnl
The Finite Projective Plane and the 5-Uniform Linear Intersecting Hypergraphs with Domination Number Four.
Graphs Comb.
Shan Li, Liying Kang, Erfang Shan, Yanxia Dong
2018 J jnl
The Matching Polynomials and Spectral Radii of Uniform Supertrees.
Electron. J. Comb.
Li Su, Liying Kang, Honghai Li, Erfang Shan
2018 J jnl
The connected
Theor. Comput. Sci.
Chunsong Bai, Liying Kang, Erfang Shan
2018 J jnl
The degree value for games with communication structure.
Int. J. Game Theory
Erfang Shan, Guang Zhang, Xiaokang Shan
2018 J jnl
The w-centroids and least w-central subtrees in weighted trees.
J. Comb. Optim.
Erfang Shan, Liying Kang
2018 J jnl
Trees with unique least central subtrees.
Discuss. Math. Graph Theory
Liying Kang, Erfang Shan
2017 J jnl
A linear-time algorithm for clique-coloring problem in circular-arc graphs.
J. Comb. Optim.
Zuosong Liang, Erfang Shan, Yuzhong Zhang
2017 J jnl
Asymptotic sharpness of bounds on hypertrees.
Discuss. Math. Graph Theory
Liying Kang, Yi Lin, Erfang Shan
2017 J jnl
Cost sharing on prices for games on graphs.
J. Comb. Optim.
Daniel Li Li, Erfang Shan
2017 J jnl
Matching and domination numbers in r-uniform hypergraphs.
J. Comb. Optim.
Liying Kang, Shan Li, Yanxia Dong, Erfang Shan
2017 — conf
The Spectral Radius and Domination Number of Uniform Hypergraphs.
COCOA (2)
Liying Kang, Wei Zhang, Erfang Shan
2017 J jnl
The clique-transversal set problem in {claw, K
Inf. Process. Lett.
Zuosong Liang, Erfang Shan, Liying Kang
2017 J jnl
Two efficient values of cooperative games with graph structure based on τ-values.
J. Comb. Optim.
Guang Zhang, Erfang Shan, Liying Kang, Yanxia Dong
2016 J jnl
3-Factor-Criticality in Double Domination Edge Critical Graphs.
Graphs Comb.
Haichao Wang, Erfang Shan, Yancai Zhao
2016 J jnl
An efficient algorithm for distance total domination in block graphs.
J. Comb. Optim.
Yancai Zhao, Erfang Shan
2016 J jnl
Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties.
J. Syst. Sci. Complex.
Qi Wei, Liying Kang, Erfang Shan
2016 J jnl
Clique-Coloring Claw-Free Graphs.
Graphs Comb.
Zuosong Liang, Erfang Shan, Liying Kang
2016 J jnl
Clique-Perfectness of Claw-Free Planar Graphs.
Graphs Comb.
Zuosong Liang, Erfang Shan, Liying Kang
2016 J jnl
Component-wise proportional solutions for communication graph games.
Math. Soc. Sci.
Erfang Shan, Guang Zhang, Yanxia Dong
2016 J jnl
Paired-domination in claw-free graphs with minimum degree at least four.
Ars Comb.
Xinguo Cao, Erfang Shan
2016 C conf
The Connected p-Center Problem on Cactus Graphs.
COCOA
Chunsong Bai, Liying Kang, Erfang Shan
2016 C conf
w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees.
COCOA
Erfang Shan, Liying Kang
2015 J jnl
Coloring clique-hypergraphs of graphs with no subdivision of
Theor. Comput. Sci.
Erfang Shan, Liying Kang
2015 J jnl
Constructing the minimum dominating sets of generalized de Bruijn digraphs.
Discret. Math.
Yanxia Dong, Erfang Shan, Liying Kang
2015 J jnl
Signed mixed dominating functions in complete bipartite graphs.
Int. J. Comput. Math.
Erfang Shan, Yancai Zhao
2015 C conf
The Connected p-Centdian Problem on Block Graphs.
COCOA
Liying Kang, Jianjie Zhou, Erfang Shan
2015 J jnl
The clique-transversal set problem in claw-free graphs with degree at most 4.
Inf. Process. Lett.
Zuosong Liang, Erfang Shan
2015 J jnl
Two paths location of a tree with positive or negative weights.
Theor. Comput. Sci.
Jianjie Zhou, Liying Kang, Erfang Shan
2015 J jnl
Upper signed k-domination number in graphs.
Ars Comb.
Ligang Zhou, Erfang Shan, Yancai Zhao
2014 J jnl
A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs.
Theor. Comput. Sci.
Qi Wei, Erfang Shan, Liying Kang
2014 J jnl
Clique-transversal sets and clique-coloring in planar graphs.
Eur. J. Comb.
Erfang Shan, Zuosong Liang, Liying Kang
2014 J jnl
Independent sets in {claw, K
Discret. Math.
Liying Kang, Dingguo Wang, Erfang Shan
2014 J jnl
On the numbers of cut-vertices and end-blocks in 4-regular graphs.
Discuss. Math. Graph Theory
Erfang Shan, Dingguo Wang
2014 J jnl
The 2-maxian problem on cactus graphs.
Discret. Optim.
Liying Kang, Chunsong Bai, Erfang Shan, Kien Nguyen
2014 C conf
Two Paths Location of a Tree with Positive or Negative Weights.
COCOA
Jianjie Zhou, Liying Kang, Erfang Shan
2013 J jnl
Paired-Domination in Claw-Free Graphs.
Graphs Comb.
Shenwei Huang, Liying Kang, Erfang Shan
2013 J jnl
Signed total domination on Kronecker products of two complete graphs.
Australas. J Comb.
Yancai Zhao, Erfang Shan, Hossein Abdollahzadeh Ahangar
2013 J jnl
Signed total k-domination in graphs.
Ars Comb.
Haichao Wang, Erfang Shan
2012 J jnl
On the super connectivity of Kronecker products of graphs.
Inf. Process. Lett.
Hechao Wang, Erfang Shan, Wei Wang
2012 J jnl
Perfect matchings in paired domination vertex critical graphs.
J. Comb. Optim.
Shenwei Huang, Erfang Shan, Liying Kang
2012 J jnl
The k-tuple twin domination in generalized de Bruijn and Kautz networks.
Comput. Math. Appl.
Erfang Shan, Yanxia Dong
2012 J jnl
The signed maximum-clique transversal number of regular graphs.
Int. J. Comput. Math.
Dingguo Wang, Erfang Shan
2011 J jnl
A note on the upper bound for the paired-domination number of a graph with minimum degree at least two.
Networks
Shenwei Huang, Erfang Shan
2011 J jnl
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs.
Inf. Process. Lett.
Zuosong Liang, Erfang Shan
2011 J jnl
Claw-free cubic graphs with clique-transversal number half of their order.
Appl. Math. Lett.
Erfang Shan, Haichao Wang
2011 J jnl
The Signed Total Domination Number of Graphs.
Ars Comb.
Mingjing Gao, Erfang Shan
2010 J jnl
On characterization of uniquely 3-list colorable complete multipartite graphs.
Discuss. Math. Graph Theory
Erfang Shan, Yancai Zhao
2010 J jnl
On the k-tuple domination of generalized de Brujin and Kautz digraphs.
Inf. Sci.
Lingye Wu, Erfang Shan, Zengrong Liu
2010 J jnl
Signed clique-transversal functions in graphs.
Int. J. Comput. Math.
Haichao Wang, Liying Kang, Erfang Shan
2010 J jnl
Some matching properties in 4-gamma
Comput. Math. Appl.
Haichao Wang, Erfang Shan
2009 J jnl
A polynomial-time algorithm for the paired-domination problem on permutation graphs.
Discret. Appl. Math.
T. C. Edwin Cheng, Liying Kang, Erfang Shan
2009 J jnl
An upper bound on the restrained domination number of graphs.
Ars Comb.
Mingjing Gao, Erfang Shan
2009 J jnl
Matching Properties in Total Domination Vertex Critical Graphs.
Graphs Comb.
Haichao Wang, Liying Kang, Erfang Shan
2009 J jnl
Minus Edge Domination in Graphs.
Ars Comb.
Min Zhao, Erfang Shan
2009 J jnl
The twin domination number in generalized de Bruijn digraphs.
Inf. Process. Lett.
Erfang Shan, Yanxia Dong, Yukun Cheng
2009 J jnl
Total Restrained Domination in Cubic Graphs.
Graphs Comb.
Hongxing Jiang, Liying Kang, Erfang Shan
2009 J jnl
Upper bounds on the upper signed total domination number of graphs.
Discret. Appl. Math.
Erfang Shan, T. C. Edwin Cheng
2009 J jnl
Upper minus total domination of a 5-regular graph.
Ars Comb.
Haichao Wang, Erfang Shan
2008 J jnl
An application of the Turán theorem to domination in graphs.
Discret. Appl. Math.
Erfang Shan, T. C. Edwin Cheng, Liying Kang
2008 J jnl
Clique-transversal Number in Cubic Graphs.
Discret. Math. Theor. Comput. Sci.
Erfang Shan, Zuosong Liang, T. C. Edwin Cheng
2008 J jnl
On matching and total domination in graphs.
Discret. Math.
Michael A. Henning, Liying Kang, Erfang Shan, Anders Yeo
2008 J jnl
Proof of a conjecture on k-tuple domination in graphs.
Appl. Math. Lett.
Guangjun Xu, Liying Kang, Erfang Shan, Hong Yan
2008 J jnl
Remarks on the minus (signed) total domination in graphs.
Discret. Math.
Erfang Shan, T. C. Edwin Cheng
2007 J jnl
Absorbant of generalized de Bruijn digraphs.
Inf. Process. Lett.
Erfang Shan, T. C. Edwin Cheng, Liying Kang
2007 J jnl
Bondage number in oriented graphs.
Ars Comb.
Erfang Shan, Liying Kang
2007 — conf
Clique-Transversal Sets in Cubic Graphs.
ESCAPE
Zuosong Liang, Erfang Shan, T. C. Edwin Cheng
2007 J jnl
Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph".
J. Graph Theory
Erfang Shan, Liying Kang, Michael A. Henning
2007 J jnl
The algorithmic complexity of the minus clique-transversal problem.
Appl. Math. Comput.
Guangjun Xu, Erfang Shan, Liying Kang, T. C. Edwin Cheng
2007 J jnl
Upper minus total domination in small-degree regular graphs.
Discret. Math.
Hong Yan, Xiaoqi Yang, Erfang Shan
2006 J jnl
Acyclic domination on bipartite permutation graphs.
Inf. Process. Lett.
Guangjun Xu, Liying Kang, Erfang Shan
2006 J jnl
Power domination in block graphs.
Theor. Comput. Sci.
Guangjun Xu, Liying Kang, Erfang Shan, Min Zhao
2006 J jnl
Total minus domination in k-partite graphs.
Discret. Math.
Liying Kang, Erfang Shan, Louis Caccetta
2005 J jnl
A note on domination and minus domination numbers in cubic graphs.
Appl. Math. Lett.
Yaojun Chen, T. C. Edwin Cheng, C. T. Ng, Erfang Shan
2004 J jnl
A characterization of trees with equal total domination and paired-domination numbers.
Australas. J Comb.
Erfang Shan, Liying Kang, Michael A. Henning
2004 J jnl
A note on Nordhaus-Gaddum inequalities for domination.
Discret. Appl. Math.
Erfang Shan, Chuangyin Dang, Liying Kang
2004 J jnl
A note on balance vertices in trees.
Discret. Math.
Erfang Shan, Liying Kang
2003 J jnl
Lower bounds on the minus domination and k-subdomination numbers.
Theor. Comput. Sci.
Liying Kang, Hong Qiao, Erfang Shan, Ding-Zhu Du
2003 J jnl
Upper bounds on signed 2-independence number of graphs.
Ars Comb.
Erfang Shan, Moo Young Sohn, Liying Kang
2002 J jnl
Upper bounds for the
Discret. Math.
Liying Kang, Chuangyin Dang, Mao-cheng Cai, Erfang Shan
2001 Misc conf
Lower Bounds on the Minus Domination and k-Subdomination Numbers.
COCOON
Liying Kang, Hong Qiao, Erfang Shan, Ding-Zhu Du
2000 J jnl
Lower bounds on dominating functions in graphs.
Ars Comb.
Liying Kang, Erfang Shan