default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiying Kang
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
[j113]Jiadong Wu, Jing Wang, Liying Kang
:
Spectral conditions for matching extension. Appl. Math. Comput. 483: 128982 (2024)- [j112]Zhenyu Ni, Lele Liu, Liying Kang:
Spectral Turán-Type Problems on Cancellative Hypergraphs. Electron. J. Comb. 31(2) (2024) - [j111]Erfang Shan, Liying Kang, Yisai Xue:
The Turán number of Berge hypergraphs with stable properties. Discret. Math. 347(1): 113737 (2024) - [j110]Yuanpei Wang, Zhenyu Ni, Yichong Liu, Liying Kang:
Generalized Turán results for edge blow-up of star forests. Discret. Math. 347(1): 114149 (2024) - [j109]Yichong Liu, Liying Kang:
Extremal graphs without long paths and a given graph. Discret. Math. 347(7): 113988 (2024) - [j108]Jing Wang, Zhenyu Ni, Liying Kang, Yi-zheng Fan:
Spectral extremal graphs for edge blow-up of star forests. Discret. Math. 347(10): 114141 (2024) - [j107]Yisai Xue, Yichong Liu, Liying Kang:
Stability of Generalized Turán Number for Linear Forests. Graphs Comb. 40(3): 52 (2024) - [c10]Peiyan Zhang, Yuchen Yan, Xi Zhang, Liying Kang, Chaozhuo Li, Feiran Huang, Senzhang Wang, Sunghun Kim:
GPT4Rec: Graph Prompt Tuning for Streaming Recommendation. SIGIR 2024: 1774-1784 - [c9]Peiyan Zhang, Chaozhuo Li, Liying Kang, Feiran Huang, Senzhang Wang, Xing Xie, Sunghun Kim:
High-Frequency-aware Hierarchical Contrastive Selective Coding for Representation Learning on Text Attributed Graphs. WWW 2024: 4316-4327 - [i2]Peiyan Zhang, Chaozhuo Li, Liying Kang, Feiran Huang, Senzhang Wang, Xing Xie, Sunghun Kim:
High-Frequency-aware Hierarchical Contrastive Selective Coding for Representation Learning on Text-attributed Graphs. CoRR abs/2402.16240 (2024) - [i1]Peiyan Zhang, Yuchen Yan, Xi Zhang, Liying Kang, Chaozhuo Li, Feiran Huang, Senzhang Wang, Sunghun Kim:
GPT4Rec: Graph Prompt Tuning for Streaming Recommendation. CoRR abs/2406.08229 (2024) - 2023
- [j106]Liying Kang, Anna B. Khmelnitskaya, Erfang Shan, Dolf Talman, Guang Zhang:
The two-step average tree value for graph and hypergraph games. Ann. Oper. Res. 323(1): 109-129 (2023) - [j105]Zhenyu Ni, Jing Wang, Liying Kang:
Spectral Extremal Graphs for Disjoint Cliques. Electron. J. Comb. 30(1) (2023) - [j104]Jiadong Wu, Yisai Xue, Liying Kang:
Some sufficient conditions for graphs being k-leaf-connected. Discret. Appl. Math. 339: 11-20 (2023) - [j103]Jing Wang, Liying Kang, Yisai Xue:
On a conjecture of spectral extremal problems. J. Comb. Theory B 159: 20-41 (2023) - 2022
- [j102]Yisai Xue, Erfang Shan, Liying Kang:
Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs. Discret. Math. 345(4): 112782 (2022) - [j101]Liying Kang, Zhenyu Ni, Erfang Shan:
The Turán number of Berge-matching in hypergraphs. Discret. Math. 345(8): 112901 (2022) - [j100]Mao-cheng Cai, Liying Kang:
Solution to a Forcible Version of a Graphic Sequence Problem. Graphs Comb. 38(3): 97 (2022) - 2021
- [j99]Liying Kang, Hui Zhu, Erfang Shan:
Extremal graphs for blow-ups of stars and paths. Discret. Appl. Math. 290: 79-85 (2021) - [j98]Liying Kang, Zhenyu Ni, Erfang Shan:
Decomposing uniform hypergraphs into uniform hypertrees and single edges. Discret. Math. 344(8): 112454 (2021) - [j97]Min Zhao, Erfang Shan, Liying Kang:
On a Conjecture for Power Domination. Graphs Comb. 37(4): 1215-1228 (2021) - [j96]Jing Wang, Liying Kang, Erfang Shan:
The principal eigenvector to α-spectral radius of hypergraphs. J. Comb. Optim. 42(2): 258-275 (2021) - [j95]Liying Kang, Wei Zhang, Erfang Shan:
The spectral radius and domination number in linear uniform hypergraphs. J. Comb. Optim. 42(3): 581-592 (2021) - [j94]Liying Kang, Anna B. Khmelnitskaya, Erfang Shan, Dolf Talman, Guang Zhang:
The average tree value for hypergraph games. Math. Methods Oper. Res. 94(3): 437-460 (2021) - 2020
- [j93]Lele Liu, Changxiang He, Liying Kang:
Saturation Number of Berge Stars in Random Hypergraphs. Electron. J. Comb. 27(4): 4 (2020) - [j92]Liying Kang, Erfang Shan, Min Zhao:
Power domination in the generalized Petersen graphs. Discuss. Math. Graph Theory 40(3): 695-712 (2020) - [j91]Hui Zhu, Liying Kang, Erfang Shan:
Extremal Graphs for Odd-Ballooning of Paths and Cycles. Graphs Comb. 36(3): 755-766 (2020) - [j90]Zhenyu Ni, Liying Kang, Erfang Shan, Hui Zhu:
Extremal Graphs for Blow-Ups of Keyrings. Graphs Comb. 36(6): 1827-1853 (2020) - [j89]Hui Zhu, Liying Kang, Zhenyu Ni, Erfang Shan:
The Turán Number of Berge-K4 in 3-Uniform Hypergraphs. SIAM J. Discret. Math. 34(3): 1485-1492 (2020)
2010 – 2019
- 2019
- [j88]Zhangqing Yu, Liying Kang, Lele Liu, Erfang Shan:
The extremal α-index of outerplanar and planar graphs. Appl. Math. Comput. 343: 90-99 (2019) - [j87]Lele Liu, Liying Kang, Shuliang Bai:
Bounds on the spectral radius of uniform hypergraphs. Discret. Appl. Math. 259: 160-169 (2019) - [j86]Erfang Shan, Jing Zhao, Liying Kang:
Maximally connected p-partite uniform hypergraphs. Discret. Appl. Math. 264: 188-195 (2019) - [j85]Liying Kang, Lele Liu, Erfang Shan:
The eigenvectors to the p-spectral radius of general hypergraphs. J. Comb. Optim. 38(2): 556-569 (2019) - [j84]Zuosong Liang, Erfang Shan, Liying Kang:
The clique-perfectness and clique-coloring of outer-planar graphs. J. Comb. Optim. 38(3): 794-807 (2019) - [j83]Qiannan Wang, Liying Kang, Erfang Shan, Zuosong Liang:
The α-spectral radius of uniform hypergraphs concerning degrees and domination number. J. Comb. Optim. 38(4): 1128-1142 (2019) - 2018
- [j82]Liying Kang, Lele Liu, Liqun Qi, Xi-Ying Yuan:
Spectral radii of two kinds of uniform hypergraphs. Appl. Math. Comput. 338: 661-668 (2018) - [j81]Liying Kang, Lele Liu, Erfang Shan:
Sharp Lower Bounds on the Spectral Radius of Uniform Hypergraphs Concerning Degrees. Electron. J. Comb. 25(2): 2 (2018) - [j80]Li Su, Liying Kang, Honghai Li, Erfang Shan:
The Matching Polynomials and Spectral Radii of Uniform Supertrees. Electron. J. Comb. 25(4): 4 (2018) - [j79]Erfang Shan, Yanxia Dong, Liying Kang, Shan Li:
Extremal hypergraphs for matching number and domination number. Discret. Appl. Math. 236: 415-421 (2018) - [j78]Yanxia Dong, Erfang Shan, Liying Kang, Shan Li:
Domination in intersecting hypergraphs. Discret. Appl. Math. 251: 155-159 (2018) - [j77]Liying Kang, Erfang Shan:
Trees with unique least central subtrees. Discuss. Math. Graph Theory 38(3): 811-828 (2018) - [j76]Lele Liu, Liying Kang, Erfang Shan:
On the irregularity of uniform hypergraphs. Eur. J. Comb. 71: 22-32 (2018) - [j75]Liying Kang, Weihua Lu, Yezhou Wu, Dong Ye, Cun-Quan Zhang:
Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs. Graphs Comb. 34(2): 365-372 (2018) - [j74]Mao-cheng Cai, Liying Kang:
A Characterization of Box-bounded Degree Sequences of Graphs. Graphs Comb. 34(4): 599-606 (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]Liying Kang, Jianjie Zhou, Erfang Shan:
Algorithms for connected p-centdian problem on block graphs. J. Comb. Optim. 36(1): 252-263 (2018) - [j71]Erfang Shan, Liying Kang:
The w-centroids and least w-central subtrees in weighted trees. J. Comb. Optim. 36(4): 1118-1127 (2018) - [j70]Chunsong Bai, Liying Kang, Erfang Shan:
The connected p-center problem on cactus graphs. Theor. Comput. Sci. 749: 59-65 (2018) - 2017
- [j69]Liying Kang, Yi Lin, Erfang Shan:
Asymptotic sharpness of bounds on hypertrees. Discuss. Math. Graph Theory 37(3): 789-795 (2017) - [j68]Zuosong Liang, Erfang Shan, Liying Kang:
The clique-transversal set problem in {claw, K4}-free planar graphs. Inf. Process. Lett. 118: 64-68 (2017) - [j67]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) - [j66]Liying Kang, Shan Li, Yanxia Dong, Erfang Shan:
Matching and domination numbers in r-uniform hypergraphs. J. Comb. Optim. 34(2): 656-659 (2017) - [j65]Liying Kang, Nicholas C. Wormald:
Minimum Power Dominating Sets of Random Cubic Graphs. J. Graph Theory 85(1): 152-171 (2017) - [c8]Chunsong Bai, Liying Kang:
The 2-Median Problem on Cactus Graphs with Positive and Negative Weights. COCOA (1) 2017: 278-285 - [c7]Liying Kang, Wei Zhang, Erfang Shan:
The Spectral Radius and Domination Number of Uniform Hypergraphs. COCOA (2) 2017: 306-316 - 2016
- [j64]Zuosong Liang, Erfang Shan, Liying Kang:
Clique-Coloring Claw-Free Graphs. Graphs Comb. 32(4): 1473-1488 (2016) - [j63]Zuosong Liang, Erfang Shan, Liying Kang:
Clique-Perfectness of Claw-Free Planar Graphs. Graphs Comb. 32(6): 2551-2562 (2016) - [j62]Hongzhuan Wang, Liying Kang:
Further properties on the degree distance of graphs. J. Comb. Optim. 31(1): 427-446 (2016) - [j61]Qi Wei, Liying Kang, Erfang Shan:
Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties. J. Syst. Sci. Complex. 29(2): 478-498 (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
- [j60]Na Yin, Liying Kang:
Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration. Asia Pac. J. Oper. Res. 32(6): 1550050:1-1550050:12 (2015) - [j59]Yanxia Dong, Erfang Shan, Liying Kang:
Constructing the minimum dominating sets of generalized de Bruijn digraphs. Discret. Math. 338(8): 1501-1508 (2015) - [j58]Yanmei Hong, Liying Kang, Xingxing Yu:
Nonseparating Cycles Avoiding Specific Vertices. J. Graph Theory 80(4): 253-267 (2015) - [j57]Erfang Shan, Liying Kang:
Coloring clique-hypergraphs of graphs with no subdivision of K5. Theor. Comput. Sci. 592: 166-175 (2015) - [j56]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
- [j55]Liying Kang, Vladimir Nikiforov:
Extremal Problems for the p-Spectral Radius of Graphs. Electron. J. Comb. 21(3): 3 (2014) - [j54]Liying Kang, Chunsong Bai, Erfang Shan, Kien Nguyen:
The 2-maxian problem on cactus graphs. Discret. Optim. 13: 16-22 (2014) - [j53]Liying Kang, Dingguo Wang, Erfang Shan:
Independent sets in {claw, K4}-free 4-regular graphs. Discret. Math. 332: 40-44 (2014) - [j52]Erfang Shan, Zuosong Liang, Liying Kang:
Clique-transversal sets and clique-coloring in planar graphs. Eur. J. Comb. 36: 367-376 (2014) - [j51]Na Yin, Liying Kang, Ping Ji, Ji-Bo Wang:
Single machine scheduling with sum-of-logarithm-processing-times based deterioration. Inf. Sci. 274: 303-309 (2014) - [j50]Qi Wei, Erfang Shan, Liying Kang:
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
- [j49]Shenwei Huang, Liying Kang, Erfang Shan:
Paired-Domination in Claw-Free Graphs. Graphs Comb. 29(6): 1777-1794 (2013) - [j48]Shouwei Guo, Liying Kang:
Online scheduling of parallel jobs with preemption on two identical machines. Oper. Res. Lett. 41(2): 207-209 (2013) - 2012
- [j47]Shenwei Huang, Erfang Shan, Liying Kang:
Perfect matchings in paired domination vertex critical graphs. J. Comb. Optim. 23(4): 507-518 (2012) - [j46]Li-ying Hou, Liying Kang:
Online scheduling on uniform machines with two hierarchies. J. Comb. Optim. 24(4): 593-612 (2012) - [j45]Yanmei Hong, Liying Kang:
Backup 2-center on interval graphs. Theor. Comput. Sci. 445: 25-35 (2012) - 2011
- [j44]Guangjun Xu, Liying Kang:
On the power domination number of the generalized Petersen graphs. J. Comb. Optim. 22(2): 282-291 (2011) - [j43]Li-ying Hou, Liying Kang:
Online and semi-online hierarchical scheduling for load balancing on uniform machines. Theor. Comput. Sci. 412(12-14): 1092-1098 (2011) - [j42]Yancai Zhao, Liying Kang, Moo Young Sohn:
The algorithmic complexity of mixed domination in graphs. Theor. Comput. Sci. 412(22): 2387-2392 (2011) - 2010
- [j41]Xiaoqin Zhang, Liying Kang, Yukun Cheng:
The pos/neg-weighted median problem on block graphs with subgraph-shaped customers. Computing 88(3-4): 97-110 (2010) - [j40]Yukun Cheng, Liying Kang:
The p-maxian problem on interval graphs. Discret. Appl. Math. 158(18): 1986-1993 (2010) - [j39]Haichao Wang, Liying Kang:
Matching Properties in Double domination Edge Critical Graphs. Discret. Math. Algorithms Appl. 2(2): 151-160 (2010) - [j38]Shouwei Guo, Liying Kang:
Online scheduling of malleable parallel jobs with setup times on two identical machines. Eur. J. Oper. Res. 206(3): 555-561 (2010) - [j37]Haichao Wang, Liying Kang, Erfang Shan:
Signed clique-transversal functions in graphs. Int. J. Comput. Math. 87(11): 2398-2407 (2010) - [j36]Hongxing Jiang, Liying Kang:
Total restrained domination in claw-free graphs. J. Comb. Optim. 19(1): 60-68 (2010) - [j35]Liying Kang, Yukun Cheng:
The p-maxian problem on block graphs. J. Comb. Optim. 20(2): 131-141 (2010) - [j34]Yukun Cheng, Liying Kang, Changhong Lu:
The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers. Theor. Comput. Sci. 411(7-9): 1038-1044 (2010)
2000 – 2009
- 2009
- [j33]T. C. Edwin Cheng, Liying Kang, Erfang Shan:
A polynomial-time algorithm for the paired-domination problem on permutation graphs. Discret. Appl. Math. 157(2): 262-271 (2009) - [j32]Hong Yan, Liying Kang, Guangjun Xu:
The exact domination number of the generalized Petersen graphs. Discret. Math. 309(8): 2596-2607 (2009) - [j31]Hongxing Jiang, Liying Kang, Erfang Shan:
Total Restrained Domination in Cubic Graphs. Graphs Comb. 25(3): 341-350 (2009) - [j30]Haichao Wang, Liying Kang, Erfang Shan:
Matching Properties in Total Domination Vertex Critical Graphs. Graphs Comb. 25(6): 851-861 (2009) - 2008
- [j29]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) - [j28]Erfang Shan, T. C. Edwin Cheng, Liying Kang:
An application of the Turán theorem to domination in graphs. Discret. Appl. Math. 156(14): 2712-2718 (2008) - [j27]Michael A. Henning, Liying Kang, Erfang Shan, Anders Yeo:
On matching and total domination in graphs. Discret. Math. 308(11): 2313-2318 (2008) - 2007
- [j26]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) - [j25]Erfang Shan, Liying Kang:
Bondage number in oriented graphs. Ars Comb. 84 (2007) - [j24]T. C. Edwin Cheng, Liying Kang, C. T. Ng:
An improved algorithm for the p-center problem on interval graphs with unit lengths. Comput. Oper. Res. 34(8): 2215-2222 (2007) - [j23]T. C. Edwin Cheng, Liying Kang, C. T. Ng:
Paired domination on interval and circular-arc graphs. Discret. Appl. Math. 155(16): 2077-2086 (2007) - [j22]Erfang Shan, T. C. Edwin Cheng, Liying Kang:
Absorbant of generalized de Bruijn digraphs. Inf. Process. Lett. 105(1): 6-11 (2007) - [j21]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) - 2006
- [j20]Liying Kang, Erfang Shan, Louis Caccetta:
Total minus domination in k-partite graphs. Discret. Math. 306(15): 1771-1775 (2006) - [j19]Min Zhao, Liying Kang, Gerard J. Chang:
Power domination in graphs. Discret. Math. 306(15): 1812-1816 (2006) - [j18]Guangjun Xu, Liying Kang, Erfang Shan:
Acyclic domination on bipartite permutation graphs. Inf. Process. Lett. 99(4): 139-144 (2006) - [j17]Guangjun Xu, Liying Kang, Erfang Shan, Min Zhao:
Power domination in block graphs. Theor. Comput. Sci. 359(1-3): 299-305 (2006) - 2005
- [j16]Liying Kang, Moo Young Sohn, Hye Kyung Kim:
Bondage number of the discrete torus Cn×C4. Discret. Math. 303(1-3): 80-86 (2005) - [c2]Liying Kang, T. C. Edwin Cheng, C. T. Ng, Min Zhao:
Scheduling to Minimize Makespan with Time-Dependent Processing Times. ISAAC 2005: 925-933 - 2004
- [j15]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) - [j14]Erfang Shan, Chuangyin Dang, Liying Kang:
A note on Nordhaus-Gaddum inequalities for domination. Discret. Appl. Math. 136(1): 83-85 (2004) - [j13]Liying Kang, Hye Kyung Kim, Moo Young Sohn:
Minus domination number in k-partite graphs. Discret. Math. 277(1-3): 295-300 (2004) - [j12]Erfang Shan, Liying Kang:
A note on balance vertices in trees. Discret. Math. 280(1-3): 265-269 (2004) - [j11]Chuangyin Dang, Liying Kang:
Batch-Processing Scheduling with Setup Times. J. Comb. Optim. 8(2): 137-146 (2004) - [j10]T. C. E. Cheng, Liying Kang, C. T. Ng:
Due-date assignment and single machine scheduling with deteriorating jobs. J. Oper. Res. Soc. 55(2): 198-203 (2004) - [j9]Liying Kang, Moo Young Sohn, T. C. Edwin Cheng:
Paired-domination in inflated graphs. Theor. Comput. Sci. 320(2-3): 485-494 (2004) - 2003
- [j8]Erfang Shan, Moo Young Sohn, Liying Kang:
Upper bounds on signed 2-independence number of graphs. Ars Comb. 69 (2003) - [j7]Hong Qiao, Liying Kang, Mihaela Cardei, Ding-Zhu Du:
Paired-domination of Trees. J. Glob. Optim. 25(1): 43-54 (2003) - [j6]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
- [j5]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
- [j4]Liying Kang, Erfang Shan:
Lower bounds on dominating functions in graphs. Ars Comb. 56 (2000) - [j3]Liying Kang, Mao-cheng Cai:
Upper minus domination in regular graphs. Discret. Math. 219(1-3): 135-144 (2000) - [j2]Liying Kang, Jinjiang Yuan:
Bondage number of planar graphs. Discret. Math. 222(1-3): 191-198 (2000) - [j1]Xudong Yuan, Liying Kang, Mao-cheng Cai:
The number of vertices of degree k in a minimally k-edge-connected digraph. J. Graph Theory 33(2): 94-108 (2000)
Coauthor Index
[j111] [j106] [j102] [j101] [j99] [j98] [j97] [j96] [j95] [j94] [j92] [j91] [j90] [j89] [j88] [j86] [j85] [j84] [j83] [j81] [j80] [j79] [j78] [j77] [j76] [j73] [j72] [j71] [j70] [j69] [j68] [j67] [j66] [c7] [j64] [j63] [j61] [c6] [c5] [j59] [j57] [j56] [c4] [j54] [j53] [j52] [j50] [c3] [j49] [j47] [j37] [j33] [j31] [j30] [j29] [j28] [j27] [j26] [j25] [j22] [j21] [j20] [j18] [j17] [j15] [j14] [j12] [j8] [j6] [j5] [c1] [j4]
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-07 21:22 CEST 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:
