default search action
Erfang Shan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j117]Wenrong Lyu, Erfang Shan
, Zeguang Cui:
Consistency of the Owen value for TU-games with coalition and graph structures. Ann. Oper. Res. 338(2): 991-1017 (2024) - [j116]Erfang Shan, Liying Kang
The Turán number of Berge hypergraphs with stable properties. Discret. Math. 347(1): 113737 (2024) - [j115]Daniel Li Li, Erfang Shan:
A new value for communication situations. Math. Methods Oper. Res. 100(2): 535-551 (2024) - 2023
- [j114]Erfang Shan
Union-wise egalitarian solutions in cooperative games with a coalition structure. 4OR 21(3): 533-545 (2023) - [j113]Erfang Shan
The efficient partition surplus Owen graph value. Ann. Oper. Res. 320(1): 379-392 (2023) - [j112]Liying Kang, Anna B. Khmelnitskaya
The two-step average tree value for graph and hypergraph games. Ann. Oper. Res. 323(1): 109-129 (2023) - [j111]Erfang Shan
Marginality and a Characterization of the Owen Graph value. Int. J. Game Theory 52(2): 451-461 (2023) - [j110]Tao Liu
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. 51(6): 723-727 (2023) - 2022
- [j109]Yisai Xue
Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs. Discret. Math. 345(4): 112782 (2022) - [j108]Liying Kang, Zhenyu Ni, Erfang Shan
The Turán number of Berge-matching in hypergraphs. Discret. Math. 345(8): 112901 (2022) - [j107]Jilei Shi, Lei Cai, Erfang Shan
A value for cooperative games with coalition and probabilistic graph structures. J. Comb. Optim. 43(3): 646-671 (2022) - [j106]Daniel Li Li, Erfang Shan
Safety of links with respect to the Myerson value for communication situations. Oper. Res. 22(3): 2121-2131 (2022) - [j105]Erfang Shan
Consistency and the graph Banzhaf value for communication graph games. Oper. Res. Lett. 50(2): 190-194 (2022) - 2021
- [j104]Jilei Shi, Erfang Shan
The Banzhaf value for generalized probabilistic communication situations. Ann. Oper. Res. 301(1): 225-244 (2021) - [j103]Liying Kang, Hui Zhu, Erfang Shan:
Extremal graphs for blow-ups of stars and paths. Discret. Appl. Math. 290: 79-85 (2021) - [j102]Liying Kang
Decomposing uniform hypergraphs into uniform hypertrees and single edges. Discret. Math. 344(8): 112454 (2021) - [j101]Min Zhao, Erfang Shan
On a Conjecture for Power Domination. Graphs Comb. 37(4): 1215-1228 (2021) - [j100]Daniel Li Li, Erfang Shan
Cooperative games with partial information. Int. J. Game Theory 50(1): 297-309 (2021) - [j99]Jing Wang, Liying Kang, Erfang Shan
The principal eigenvector to α-spectral radius of hypergraphs. J. Comb. Optim. 42(2): 258-275 (2021) - [j98]Liying Kang, Wei Zhang
The spectral radius and domination number in linear uniform hypergraphs. J. Comb. Optim. 42(3): 581-592 (2021) - [j97]Liying Kang, Anna B. Khmelnitskaya
The average tree value for hypergraph games. Math. Methods Oper. Res. 94(3): 437-460 (2021) - [j96]Daniel Li Li, Erfang Shan:
Egalitarian allocation and players of certain type. Oper. Res. Lett. 49(4): 492-495 (2021) - 2020
- [j95]Daniel Li Li, Erfang Shan
Efficient quotient extensions of the Myerson value. Ann. Oper. Res. 292(1): 171-181 (2020) - [j94]Zuosong Liang, Jianliang Wu
List-coloring clique-hypergraphs of K5-minor-free graphs strongly. Discret. Math. 343(4): 111777 (2020) - [j93]Liying Kang, Erfang Shan, Min Zhao:
Power domination in the generalized Petersen graphs. Discuss. Math. Graph Theory 40(3): 695-712 (2020) - [j92]Hui Zhu, Liying Kang, Erfang Shan:
Extremal Graphs for Odd-Ballooning of Paths and Cycles. Graphs Comb. 36(3): 755-766 (2020) - [j91]Zhenyu Ni, Liying Kang
Extremal Graphs for Blow-Ups of Keyrings. Graphs Comb. 36(6): 1827-1853 (2020) - [j90]Daniel Li Li, Erfang Shan
Marginal contributions and derivatives for set functions in cooperative games. J. Comb. Optim. 39(3): 849-858 (2020) - [j89]Daniel Li Li, Erfang Shan:
The Myerson value for directed graph games. Oper. Res. Lett. 48(2): 142-146 (2020) - [j88]Hui Zhu, Liying Kang
The Turán Number of Berge-K4 in 3-Uniform Hypergraphs. SIAM J. Discret. Math. 34(3): 1485-1492 (2020) - [c8]Erfang Shan, Jilei Shi, Wenrong Lv:
A Note on the Position Value for Hypergraph Communication Situations. Complexity and Approximation 2020: 230-237
2010 – 2019
- 2019
- [j87]Zhangqing Yu, Liying Kang
The extremal α-index of outerplanar and planar graphs. Appl. Math. Comput. 343: 90-99 (2019) - [j86]Daniel Li Li, Erfang Shan
The position value and the structures of graphs. Appl. Math. Comput. 356: 190-197 (2019) - [j85]Erfang Shan
Maximally connected p-partite uniform hypergraphs. Discret. Appl. Math. 264: 188-195 (2019) - [j84]Liying Kang, Lele Liu
The eigenvectors to the p-spectral radius of general hypergraphs. J. Comb. Optim. 38(2): 556-569 (2019) - [j83]Zuosong Liang, Erfang Shan
The clique-perfectness and clique-coloring of outer-planar graphs. J. Comb. Optim. 38(3): 794-807 (2019) - [j82]Qiannan Wang, Liying Kang, Erfang Shan
The α-spectral radius of uniform hypergraphs concerning degrees and domination number. J. Comb. Optim. 38(4): 1128-1142 (2019) - [j81]Zuosong Liang, Erfang Shan, Huiyu Xing, Chunsong Bai:
A linear-time algorithm for clique-coloring planar graphs. Oper. Res. Lett. 47(4): 241-243 (2019) - [j80]Erfang Shan, Jiayu Han, Jilei Shi:
The efficient proportional Myerson values. Oper. Res. Lett. 47(6): 574-578 (2019) - 2018
- [j79]Liying Kang, Lele Liu
Sharp Lower Bounds on the Spectral Radius of Uniform Hypergraphs Concerning Degrees. Electron. J. Comb. 25(2): 2 (2018) - [j78]Li Su, Liying Kang, Honghai Li, Erfang Shan:
The Matching Polynomials and Spectral Radii of Uniform Supertrees. Electron. J. Comb. 25(4): 4 (2018) - [j77]Erfang Shan, Yanxia Dong, Liying Kang
Extremal hypergraphs for matching number and domination number. Discret. Appl. Math. 236: 415-421 (2018) - [j76]Yanxia Dong, Erfang Shan, Liying Kang, Shan Li:
Domination in intersecting hypergraphs. Discret. Appl. Math. 251: 155-159 (2018) - [j75]Liying Kang, Erfang Shan:
Trees with unique least central subtrees. Discuss. Math. Graph Theory 38(3): 811-828 (2018) - [j74]Lele Liu
On the irregularity of uniform hypergraphs. Eur. J. Comb. 71: 22-32 (2018) - [j73]Shan Li, Liying Kang, Erfang Shan, Yanxia Dong:
The Finite Projective Plane and the 5-Uniform Linear Intersecting Hypergraphs with Domination Number Four. Graphs Comb. 34(5): 931-945 (2018) - [j72]Erfang Shan, Guang Zhang, Xiaokang Shan:
The degree value for games with communication structure. Int. J. Game Theory 47(3): 857-871 (2018) - [j71]Liying Kang, Jianjie Zhou, Erfang Shan:
Algorithms for connected p-centdian problem on block graphs. J. Comb. Optim. 36(1): 252-263 (2018) - [j70]Erfang Shan, Liying Kang:
The w-centroids and least w-central subtrees in weighted trees. J. Comb. Optim. 36(4): 1118-1127 (2018) - [j69]Chunsong Bai, Liying Kang, Erfang Shan:
The connected p-center problem on cactus graphs. Theor. Comput. Sci. 749: 59-65 (2018) - 2017
- [j68]Liying Kang, Yi Lin, Erfang Shan:
Asymptotic sharpness of bounds on hypertrees. Discuss. Math. Graph Theory 37(3): 789-795 (2017) - [j67]Zuosong Liang, Erfang Shan, Liying Kang:
The clique-transversal set problem in {claw, K4}-free planar graphs. Inf. Process. Lett. 118: 64-68 (2017) - [j66]Zuosong Liang, Erfang Shan, Yuzhong Zhang:
A linear-time algorithm for clique-coloring problem in circular-arc graphs. J. Comb. Optim. 33(1): 147-155 (2017) - [j65]Guang Zhang, Erfang Shan, Liying Kang, Yanxia Dong:
Two efficient values of cooperative games with graph structure based on τ-values. J. Comb. Optim. 34(2): 462-482 (2017) - [j64]Liying Kang, Shan Li, Yanxia Dong, Erfang Shan:
Matching and domination numbers in r-uniform hypergraphs. J. Comb. Optim. 34(2): 656-659 (2017) - [j63]Daniel Li Li, Erfang Shan:
Cost sharing on prices for games on graphs. J. Comb. Optim. 34(3): 676-688 (2017) - [c7]Liying Kang, Wei Zhang
The Spectral Radius and Domination Number of Uniform Hypergraphs. COCOA (2) 2017: 306-316 - 2016
- [j62]Xinguo Cao, Erfang Shan:
Paired-domination in claw-free graphs with minimum degree at least four. Ars Comb. 127: 401-408 (2016) - [j61]Zuosong Liang, Erfang Shan, Liying Kang:
Clique-Coloring Claw-Free Graphs. Graphs Comb. 32(4): 1473-1488 (2016) - [j60]Haichao Wang, Erfang Shan, Yancai Zhao:
3-Factor-Criticality in Double Domination Edge Critical Graphs. Graphs Comb. 32(4): 1599-1610 (2016) - [j59]Zuosong Liang, Erfang Shan, Liying Kang:
Clique-Perfectness of Claw-Free Planar Graphs. Graphs Comb. 32(6): 2551-2562 (2016) - [j58]Yancai Zhao, Erfang Shan:
An efficient algorithm for distance total domination in block graphs. J. Comb. Optim. 31(1): 372-381 (2016) - [j57]Qi Wei
Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties. J. Syst. Sci. Complex. 29(2): 478-498 (2016) - [j56]Erfang Shan, Guang Zhang, Yanxia Dong:
Component-wise proportional solutions for communication graph games. Math. Soc. Sci. 81: 22-28 (2016) - [c6]Erfang Shan, Liying Kang:
w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees. COCOA 2016: 693-701 - [c5]Chunsong Bai, Liying Kang, Erfang Shan:
The Connected p-Center Problem on Cactus Graphs. COCOA 2016: 718-725 - 2015
- [j55]Ligang Zhou, Erfang Shan, Yancai Zhao:
Upper signed k-domination number in graphs. Ars Comb. 122: 307-318 (2015) - [j54]Yanxia Dong, Erfang Shan, Liying Kang:
Constructing the minimum dominating sets of generalized de Bruijn digraphs. Discret. Math. 338(8): 1501-1508 (2015) - [j53]Erfang Shan, Yancai Zhao:
Signed mixed dominating functions in complete bipartite graphs. Int. J. Comput. Math. 92(4): 712-721 (2015) - [j52]Zuosong Liang, Erfang Shan:
The clique-transversal set problem in claw-free graphs with degree at most 4. Inf. Process. Lett. 115(2): 331-335 (2015) - [j51]Erfang Shan, Liying Kang
Coloring clique-hypergraphs of graphs with no subdivision of K5. Theor. Comput. Sci. 592: 166-175 (2015) - [j50]Jianjie Zhou, Liying Kang, Erfang Shan:
Two paths location of a tree with positive or negative weights. Theor. Comput. Sci. 607: 296-305 (2015) - [c4]Liying Kang, Jianjie Zhou, Erfang Shan:
The Connected p-Centdian Problem on Block Graphs. COCOA 2015: 510-520 - 2014
- [j49]Liying Kang
The 2-maxian problem on cactus graphs. Discret. Optim. 13: 16-22 (2014) - [j48]Liying Kang, Dingguo Wang, Erfang Shan:
Independent sets in {claw, K4}-free 4-regular graphs. Discret. Math. 332: 40-44 (2014) - [j47]Erfang Shan, Dingguo Wang:
On the numbers of cut-vertices and end-blocks in 4-regular graphs. Discuss. Math. Graph Theory 34(1): 127-136 (2014) - [j46]Erfang Shan, Zuosong Liang, Liying Kang:
Clique-transversal sets and clique-coloring in planar graphs. Eur. J. Comb. 36: 367-376 (2014) - [j45]Qi Wei
A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs. Theor. Comput. Sci. 524: 78-89 (2014) - [c3]Jianjie Zhou, Liying Kang, Erfang Shan:
Two Paths Location of a Tree with Positive or Negative Weights. COCOA 2014: 329-342 - 2013
- [j44]Yancai Zhao, Erfang Shan, Hossein Abdollahzadeh Ahangar:
Signed total domination on Kronecker products of two complete graphs. Australas. J Comb. 56: 95-102 (2013) - [j43]Haichao Wang, Erfang Shan:
Signed total k-domination in graphs. Ars Comb. 111: 37-52 (2013) - [j42]Shenwei Huang, Liying Kang, Erfang Shan:
Paired-Domination in Claw-Free Graphs. Graphs Comb. 29(6): 1777-1794 (2013) - 2012
- [j41]Erfang Shan, Yanxia Dong:
The k-tuple twin domination in generalized de Bruijn and Kautz networks. Comput. Math. Appl. 63(1): 222-227 (2012) - [j40]Dingguo Wang, Erfang Shan:
The signed maximum-clique transversal number of regular graphs. Int. J. Comput. Math. 89(6): 741-751 (2012) - [j39]Hechao Wang, Erfang Shan, Wei Wang
On the super connectivity of Kronecker products of graphs. Inf. Process. Lett. 112(10): 402-405 (2012) - [j38]Shenwei Huang, Erfang Shan, Liying Kang:
Perfect matchings in paired domination vertex critical graphs. J. Comb. Optim. 23(4): 507-518 (2012) - 2011
- [j37]Erfang Shan, Haichao Wang:
Claw-free cubic graphs with clique-transversal number half of their order. Appl. Math. Lett. 24(7): 1080-1083 (2011) - [j36]Mingjing Gao, Erfang Shan:
The Signed Total Domination Number of Graphs. Ars Comb. 98: 15-24 (2011) - [j35]Zuosong Liang, Erfang Shan:
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs. Inf. Process. Lett. 111(23-24): 1104-1107 (2011) - [j34]Shenwei Huang, Erfang Shan:
A note on the upper bound for the paired-domination number of a graph with minimum degree at least two. Networks 57(2): 115-116 (2011) - 2010
- [j33]Haichao Wang, Erfang Shan:
Some matching properties in 4-gamma×2-critical graphs. Comput. Math. Appl. 59(2): 694-699 (2010) - [j32]Erfang Shan, Yancai Zhao:
On characterization of uniquely 3-list colorable complete multipartite graphs. Discuss. Math. Graph Theory 30(1): 105-114 (2010) - [j31]Haichao Wang, Liying Kang, Erfang Shan:
Signed clique-transversal functions in graphs. Int. J. Comput. Math. 87(11): 2398-2407 (2010) - [j30]Lingye Wu, Erfang Shan, Zengrong Liu:
On the k-tuple domination of generalized de Brujin and Kautz digraphs. Inf. Sci. 180(22): 4430-4435 (2010)
2000 – 2009
- 2009
- [j29]Mingjing Gao, Erfang Shan:
An upper bound on the restrained domination number of graphs. Ars Comb. 91 (2009) - [j28]Haichao Wang, Erfang Shan:
Upper minus total domination of a 5-regular graph. Ars Comb. 91 (2009) - [j27]Min Zhao, Erfang Shan:
Minus Edge Domination in Graphs. Ars Comb. 93 (2009) - [j26]T. C. Edwin Cheng
A polynomial-time algorithm for the paired-domination problem on permutation graphs. Discret. Appl. Math. 157(2): 262-271 (2009) - [j25]Erfang Shan, T. C. Edwin Cheng
Upper bounds on the upper signed total domination number of graphs. Discret. Appl. Math. 157(5): 1098-1103 (2009) - [j24]Hongxing Jiang, Liying Kang, Erfang Shan:
Total Restrained Domination in Cubic Graphs. Graphs Comb. 25(3): 341-350 (2009) - [j23]Haichao Wang, Liying Kang, Erfang Shan:
Matching Properties in Total Domination Vertex Critical Graphs. Graphs Comb. 25(6): 851-861 (2009) - [j22]Erfang Shan, Yanxia Dong, Yukun Cheng:
The twin domination number in generalized de Bruijn digraphs. Inf. Process. Lett. 109(15): 856-860 (2009) - 2008
- [j21]Guangjun Xu, Liying Kang, Erfang Shan, Hong Yan
Proof of a conjecture on k-tuple domination in graphs. Appl. Math. Lett. 21(3): 287-290 (2008) - [j20]Erfang Shan, T. C. Edwin Cheng
An application of the Turán theorem to domination in graphs. Discret. Appl. Math. 156(14): 2712-2718 (2008) - [j19]Michael A. Henning, Liying Kang, Erfang Shan, Anders Yeo:
On matching and total domination in graphs. Discret. Math. 308(11): 2313-2318 (2008) - [j18]Erfang Shan, T. C. Edwin Cheng
Remarks on the minus (signed) total domination in graphs. Discret. Math. 308(15): 3373-3380 (2008) - [j17]Erfang Shan, Zuosong Liang, T. C. Edwin Cheng:
Clique-transversal Number in Cubic Graphs. Discret. Math. Theor. Comput. Sci. 10(2) (2008) - 2007
- [j16]Guangjun Xu, Erfang Shan, Liying Kang, T. C. Edwin Cheng
The algorithmic complexity of the minus clique-transversal problem. Appl. Math. Comput. 189(2): 1410-1418 (2007) - [j15]Erfang Shan, Liying Kang:
Bondage number in oriented graphs. Ars Comb. 84 (2007) - [j14]Hong Yan
Upper minus total domination in small-degree regular graphs. Discret. Math. 307(21): 2453-2463 (2007) - [j13]Erfang Shan, T. C. Edwin Cheng
Absorbant of generalized de Bruijn digraphs. Inf. Process. Lett. 105(1): 6-11 (2007) - [j12]Erfang Shan, Liying Kang, Michael A. Henning:
Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph". J. Graph Theory 54(4): 350-353 (2007) - [c2]Zuosong Liang, Erfang Shan, T. C. Edwin Cheng:
Clique-Transversal Sets in Cubic Graphs. ESCAPE 2007: 107-115 - 2006
- [j11]Liying Kang, Erfang Shan, Louis Caccetta:
Total minus domination in k-partite graphs. Discret. Math. 306(15): 1771-1775 (2006) - [j10]Guangjun Xu, Liying Kang, Erfang Shan:
Acyclic domination on bipartite permutation graphs. Inf. Process. Lett. 99(4): 139-144 (2006) - [j9]Guangjun Xu, Liying Kang, Erfang Shan, Min Zhao:
Power domination in block graphs. Theor. Comput. Sci. 359(1-3): 299-305 (2006) - 2005
- [j8]Yaojun Chen, T. C. Edwin Cheng
A note on domination and minus domination numbers in cubic graphs. Appl. Math. Lett. 18(9): 1062-1067 (2005) - 2004
- [j7]Erfang Shan, Liying Kang, Michael A. Henning:
A characterization of trees with equal total domination and paired-domination numbers. Australas. J Comb. 30: 31-40 (2004) - [j6]Erfang Shan, Chuangyin Dang
A note on Nordhaus-Gaddum inequalities for domination. Discret. Appl. Math. 136(1): 83-85 (2004) - [j5]Erfang Shan, Liying Kang:
A note on balance vertices in trees. Discret. Math. 280(1-3): 265-269 (2004) - 2003
- [j4]Erfang Shan, Moo Young Sohn, Liying Kang:
Upper bounds on signed 2-independence number of graphs. Ars Comb. 69 (2003) - [j3]Liying Kang, Hong Qiao, Erfang Shan, Ding-Zhu Du:
Lower bounds on the minus domination and k-subdomination numbers. Theor. Comput. Sci. 296(1): 89-98 (2003) - 2002
- [j2]Liying Kang, Chuangyin Dang, Mao-cheng Cai, Erfang Shan:
Upper bounds for the k-subdomination number of graphs. Discret. Math. 247(1-3): 229-234 (2002) - 2001
- [c1]Liying Kang, Hong Qiao, Erfang Shan, Ding-Zhu Du:
Lower Bounds on the Minus Domination and k-Subdomination Numbers. COCOON 2001: 375-383 - 2000
- [j1]Liying Kang, Erfang Shan:
Lower bounds on dominating functions in graphs. Ars Comb. 56 (2000)
Coauthor Index
[j116] [j112] [j109] [j108] [j103] [j102] [j101] [j99] [j98] [j97] [j93] [j92] [j91] [j88] [j87] [j85] [j84] [j83] [j82] [j79] [j78] [j77] [j76] [j75] [j74] [j73] [j71] [j70] [j69] [j68] [j67] [j65] [j64] [c7] [j61] [j59] [j57] [c6] [c5] [j54] [j51] [j50] [c4] [j49] [j48] [j46] [j45] [c3] [j42] [j38] [j31] [j26] [j24] [j23] [j21] [j20] [j19] [j16] [j15] [j13] [j12] [j11] [j10] [j9] [j7] [j6] [j5] [j4] [j3] [j2] [c1] [j1]
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 2024-10-30 20:27 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: