default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiming Xiong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j113]Xiaodong Chen, Jiayuan Zhang, Liming Xiong, Guifu Su:
Every 2-connected {claw, Z2}-free graph with minimum degree at least 4 contains two CISTs. Discret. Appl. Math. 360: 51-64 (2025)- [j112]Qiang Wang, Liming Xiong
:
Disconnected forbidden pairs force supereulerian graphs to be hamiltonian. Discret. Math. 348(2): 114301 (2025) - [j111]Lei Zhang, Liming Xiong:
Characterizing forbidden pairs for the existence of even factors. Discret. Math. 348(5): 114384 (2025) - 2024
- [j110]Panpan Wang, Liming Xiong:
Paw-Type Characterization of Hourglass-Free Hamilton-Connected Graphs. Axioms 13(1): 10 (2024) - [j109]Tao Tian, Haitze J. Broersma, Liming Xiong:
Edge degree conditions for dominating and spanning closed trails. Discuss. Math. Graph Theory 44(1): 363 (2024) - 2023
- [j108]Yibin Fang, Liming Xiong:
On the dominating (induced) cycles of iterated line graphs. Discret. Appl. Math. 325: 43-51 (2023) - [j107]Xiaojing Yang, Liming Xiong:
Forbidden subgraphs for existences of (connected) 2-factors of a graph. Discuss. Math. Graph Theory 43(1): 211-224 (2023) - [j106]Panpan Wang, Liming Xiong:
Forbidden Pairs for Connected Even Factors in Supereulerian Graphs. Graphs Comb. 39(4): 64 (2023) - [j105]Lei Zhang, Liming Xiong, Jianhua Tu:
Edge-Diameter of a Graph and Its Longest Cycles. Graphs Comb. 39(4): 89 (2023) - [j104]Xia Liu, Zdenek Ryjácek, Petr Vrána, Liming Xiong, Xiaojing Yang:
Hamilton-connected {claw, net}-free graphs, I. J. Graph Theory 102(1): 154-179 (2023) - [j103]Xia Liu, Zdenek Ryjácek, Petr Vrána, Liming Xiong, Xiaojing Yang:
Hamilton-connected {claw,net}-free graphs, II. J. Graph Theory 103(1): 119-138 (2023) - 2022
- [j102]Junfeng Du, Ziwen Huang, Liming Xiong:
Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree. Axioms 11(5): 219 (2022) - [j101]Wanpeng Lei, Liming Xiong, Jun Yin:
The Independence Number Conditions for 2-Factors of a Claw-Free Graph. Axioms 11(8): 417 (2022) - [j100]Yingmin Shangguan, Monica Mengyu Wang, Liming Xiong:
Edge Degree Conditions for 2-Iterated Line Graphs to Be Traceable. Axioms 11(10): 540 (2022) - [j99]Yingmin Shangguan, Liming Xiong:
Supereulerian line graphs. Discret. Math. 345(3): 112707 (2022) - [j98]Yibin Fang, Liming Xiong:
Characterizing forbidden pairs for relative length of longest paths and cycles. Discret. Math. 345(7): 112870 (2022) - [j97]Xia Liu, Liming Xiong:
A note on 3-connected hourglass-free claw-free Hamilton-connected graphs. Discret. Math. 345(8): 112910 (2022) - [j96]Xiaodong Chen, Mingchu Li, Liming Xiong:
Two completely independent spanning trees of claw-free graphs. Discret. Math. 345(12): 113080 (2022) - [j95]Xia Liu, Liming Xiong:
Forbidden subgraphs for collapsible graphs and supereulerian graphs. Discuss. Math. Graph Theory 42(2): 417-442 (2022) - [j94]Xiaojing Yang, Liming Xiong:
Hamiltonian extendable graphs. Discuss. Math. Graph Theory 42(3): 843-859 (2022) - [j93]Premysl Holub, Zdenek Ryjácek, Petr Vrána, Shipeng Wang, Liming Xiong:
Forbidden pairs of disconnected graphs for 2-factor of connected graphs. J. Graph Theory 100(2): 209-231 (2022) - [j92]Wanpeng Lei, Liming Xiong, Junfeng Du, Jun Yin:
Forbidden Pairs of Disconnected Graphs for Traceability of Block-Chains. Symmetry 14(6): 1221 (2022) - 2021
- [j91]Xiaojing Yang, Junfeng Du, Liming Xiong:
Forbidden subgraphs for supereulerian and hamiltonian graphs. Discret. Appl. Math. 288: 192-200 (2021) - [j90]Yibin Fang, Liming Xiong:
Circumference of a graph and its distance dominating longest cycles. Discret. Math. 344(2): 112196 (2021) - [j89]Xia Liu, Liming Xiong, Hong-Jian Lai:
Strongly Spanning Trailable Graphs with Small Circumference and Hamilton-Connected Claw-Free Graphs. Graphs Comb. 37(1): 65-85 (2021) - 2020
- [j88]Zhihao Hui, Junfeng Du, Shipeng Wang, Liming Xiong, Xiaojing Yang:
Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3. Discret. Math. 343(4): 111694 (2020) - [j87]Xia Liu, Liming Xiong:
Forbidden subgraphs on Hamiltonian index. Discret. Math. 343(6): 111841 (2020) - [j86]Tao Tian, Hajo Broersma, Liming Xiong:
On sufficient degree conditions for traceability of claw-free graphs. Discret. Math. 343(7): 111883 (2020) - [j85]Tian Tian, Liming Xiong:
2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices. Discuss. Math. Graph Theory 40(1): 85-106 (2020) - [j84]Zdenek Ryjácek, Petr Vrána, Liming Xiong:
A Note on Singular Edges and Hamiltonicity in Claw-Free Graphs with Locally Disconnected Vertices. Graphs Comb. 36(3): 665-677 (2020) - [j83]Xiaojing Yang, Liming Xiong:
Forbidden Subgraphs for a Graph to Have a Hamiltonian Path Square. Graphs Comb. 36(5): 1445-1456 (2020)
2010 – 2019
- 2019
- [j82]Win Min Aye, Tao Tian, Liming Xiong:
Number of vertices of degree three in spanning 3-trees in square graphs. Appl. Math. Comput. 357: 258-262 (2019) - [j81]Shipeng Wang, Liming Xiong:
Spanning Trails in a 2-Connected Graph. Electron. J. Comb. 26(3): 3 (2019) - [j80]Mingqiang An, Yinan Zhang, Kinkar Chandra Das, Liming Xiong:
Reciprocal degree distance and graph properties. Discret. Appl. Math. 258: 1-7 (2019) - [j79]Shipeng Wang, Liming Xiong:
On the independence number of traceable 2-connected claw-free graphs. Discuss. Math. Graph Theory 39(4): 925-937 (2019) - [j78]Binlong Li, Liming Xiong, Jun Yin:
Large degree vertices in longest cycles of graphs, II. Electron. J. Graph Theory Appl. 7(2): 277-299 (2019) - [j77]Shipeng Wang, Shoichi Tsuchiya, Liming Xiong:
Forbidden Pairs for Equality of Connectivity and Edge-Connectivity of Graphs. Graphs Comb. 35(2): 419-426 (2019) - [j76]Junfeng Du, Liming Xiong:
The Local Structure of Claw-Free Graphs Without Induced Generalized Bulls. Graphs Comb. 35(5): 1091-1103 (2019) - 2018
- [j75]Tao Tian, Liming Xiong:
Traceability on 2-connected line graphs. Appl. Math. Comput. 321: 463-471 (2018) - [j74]Shengmei Lv, Liming Xiong:
Erratum to "Forbidden pairs for spanning (closed) trails" [Discrete Math. 340 (2017) 1012-1018]. Discret. Math. 341(4): 1192-1193 (2018) - [j73]Roman Cada, Kenta Ozeki, Liming Xiong, Kiyoshi Yoshimoto:
Pairs of forbidden subgraphs and 2-connected supereulerian graphs. Discret. Math. 341(6): 1696-1707 (2018) - [j72]Zdenek Ryjácek, Petr Vrána, Liming Xiong:
Hamiltonian properties of 3-connected {claw, hourglass}-free graphs. Discret. Math. 341(6): 1806-1815 (2018) - [j71]Xia Liu, Houyuan Lin, Liming Xiong:
Forbidden Subgraphs and Weak Locally Connected Graphs. Graphs Comb. 34(6): 1671-1690 (2018) - [j70]Mingqiang An, Liming Xiong:
Some results on the inverse sum indeg index of a graph. Inf. Process. Lett. 134: 42-46 (2018) - [j69]Xiang Chen, Adrian Diaz, Liming Xiong, David L. McDowell, Youping Chen:
Passing waves from atomistic to continuum. J. Comput. Phys. 354: 393-402 (2018) - 2017
- [j68]Mingqiang An, Liming Xiong:
Extremal polyomino chains with respect to general sum-connectivity index. Ars Comb. 131: 255-271 (2017) - [j67]Jan Ekstein, Baoyindureng Wu, Liming Xiong:
Connected Even Factors in the Square of Essentially 2-Edge-connected Graph. Electron. J. Comb. 24(3): 3 (2017) - [j66]Liming Xiong:
Characterization of forbidden subgraphs for the existence of even factors in a graph. Discret. Appl. Math. 223: 135-139 (2017) - [j65]Shengmei Lv, Liming Xiong:
Forbidden pairs for spanning (closed) trails. Discret. Math. 340(5): 1012-1018 (2017) - [j64]Junfeng Du, Binlong Li, Liming Xiong:
Forbidden pairs of disconnected graphs for traceability in connected graphs. Discret. Math. 340(9): 2194-2199 (2017) - [j63]Shipeng Wang, Liming Xiong:
Forbidden set of induced subgraphs for 2-connected supereulerian graphs. Discret. Math. 340(12): 2792-2797 (2017) - [j62]Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong:
Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs. J. Comb. Theory B 122: 167-186 (2017) - 2016
- [j61]Binlong Li, Liming Xiong, Jun Yin:
Large degree vertices in longest cycles of graphs, I. Discuss. Math. Graph Theory 36(2): 363-382 (2016) - [j60]Akira Saito, Liming Xiong:
The Ryjáček closure and a forbidden subgraph. Discuss. Math. Graph Theory 36(3): 621-628 (2016) - [j59]Jun Yin, Liming Xiong, Haixing Zhao:
Hamiltonian Claw-Free Graphs and o-Heavy Graphs Involving Induced Cycles. Graphs Comb. 32(2): 823-833 (2016) - [j58]Guifu Su, Liming Xiong, Xiaofeng Su, Guojun Li:
Maximally edge-connected graphs and Zeroth-order general Randić index for α ≤ -1. J. Comb. Optim. 31(1): 182-195 (2016) - [j57]Mingqiang An, Liming Xiong:
Extremal polyomino chains with respect to general Randić index. J. Comb. Optim. 31(2): 635-647 (2016) - 2015
- [j56]Xiang Chen, Aleksandr Chernatynskiy, Liming Xiong, Youping Chen:
A coherent phonon pulse model for transient phonon thermal transport. Comput. Phys. Commun. 195: 112-116 (2015) - [j55]Runli Tian, Liming Xiong:
Hamiltonian claw-free graphs with locally disconnected vertices. Discret. Math. 338(11): 2042-2050 (2015) - [j54]Zhaohong Niu, Liming Xiong:
On Traceable Line Graphs. Graphs Comb. 31(1): 221-233 (2015) - [j53]Guantao Chen, Yinkui Li, Haicheng Ma, Tingzeng Wu, Liming Xiong:
An Extension of the Chvátal-Erdős Theorem: Counting the Number of Maximum Independent Sets. Graphs Comb. 31(4): 885-896 (2015) - [j52]Runli Tian, Liming Xiong:
The Chvátal-Erdős Condition for a Graph to Have a Spanning Trail. Graphs Comb. 31(5): 1739-1754 (2015) - [j51]Zdenek Ryjácek, Liming Xiong, Jun Yin:
Closure and Hamilton-Connected Claw-Free Hourglass-Free Graphs. Graphs Comb. 31(6): 2369-2376 (2015) - [j50]Guifu Su, Liming Xiong, Xiaofeng Su, Xianglian Chen:
Some results on the reciprocal sum-degree distance of graphs. J. Comb. Optim. 30(3): 435-446 (2015) - 2014
- [j49]Guifu Su, Liming Xiong, Xiaofeng Su:
Maximally edge-connected graphs and Zeroth-order general Randić index for 0<α<1. Discret. Appl. Math. 167: 261-268 (2014) - [j48]Zhaohong Niu, Liang Sun, Liming Xiong, Hong-Jian Lai, Huiya Yan:
On extremal k-supereulerian graphs. Discret. Math. 314: 50-60 (2014) - [j47]Liming Xiong:
Induced hourglass and the equivalence between hamiltonicity and supereulerianity in claw-free graphs. Discret. Math. 332: 15-22 (2014) - [j46]Runli Tian, Liming Xiong, Zhaohong Niu:
On Hamiltonicity of 3-Connected Claw-Free Graphs. Graphs Comb. 30(5): 1261-1269 (2014) - [j45]Qingning Wang, Liming Xiong:
Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs. Int. J. Comput. Math. 91(7): 1385-1396 (2014) - 2013
- [j44]Guifu Su, Liming Xiong, Lan Xu:
On the Co-PI and Laplacian Co-PI eigenvalues of a graph. Discret. Appl. Math. 161(1-2): 277-283 (2013) - [j43]Xiangwen Li, Chunxiang Wang, Qiong Fan, Zhaohong Niu, Liming Xiong:
Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs. Graphs Comb. 29(2): 275-280 (2013) - [j42]Guifu Su, Liming Xiong, Brian Yi Sun, Daobin Li:
Nordhaus-Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts. Theor. Comput. Sci. 471: 74-83 (2013) - 2012
- [j41]Guifu Su, Liming Xiong, Lan Xu:
The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs. Appl. Math. Lett. 25(11): 1701-1707 (2012) - [j40]Weihua Yang, Liming Xiong, Hong-Jian Lai, Xiaofeng Guo:
Hamiltonicity of 3-connected line graphs. Appl. Math. Lett. 25(11): 1835-1838 (2012) - [j39]Zhaohong Niu, Hong-Jian Lai, Liming Xiong:
Spanning subgraph with Eulerian components. Discret. Math. 312(5): 1013-1018 (2012) - [j38]Jan Ekstein, Premysl Holub, Tomás Kaiser, Liming Xiong, Shenggui Zhang:
Star subdivisions and connected even factors in the square of a graph. Discret. Math. 312(17): 2574-2578 (2012) - [j37]Runli Tian, Liming Xiong, Zhaohong Niu:
On 2-factors in claw-free graphs whose edges are in small cycles. Discret. Math. 312(21): 3140-3145 (2012) - 2011
- [j36]Liming Xiong:
2-factors with the bounded number of components in line graphs. Appl. Math. Lett. 24(5): 731-734 (2011) - [j35]Zdenek Ryjácek, Gerhard J. Woeginger, Liming Xiong:
Hamiltonian index is NP-complete. Discret. Appl. Math. 159(4): 246-250 (2011) - [j34]Liming Xiong:
Closure operation for even factors on claw-free graphs. Discret. Math. 311(16): 1714-1723 (2011) - 2010
- [j33]Zhaohong Niu, Liming Xiong:
Even factor of a graph with a bounded number of components. Australas. J Comb. 48: 269-280 (2010) - [j32]Hong-Jian Lai, Mingchu Li, Yehong Shao, Liming Xiong:
Spanning eulerian subgraphs in N2-locally connected claw-free graphs. Ars Comb. 94 (2010) - [j31]Liming Xiong, Mingchu Li:
Supereulerian index is stable under contractions and closures. Ars Comb. 97 (2010) - [j30]Zhaohong Niu, Liming Xiong:
Supereulerianity of k-edge-connected graphs with a restriction on small bonds. Discret. Appl. Math. 158(1): 37-43 (2010) - [j29]Zdenek Ryjácek, Liming Xiong, Kiyoshi Yoshimoto:
Closure concept for 2-factors in claw-free graphs. Discret. Math. 310(10-11): 1573-1579 (2010) - [j28]Longsheng Han, Hong-Jian Lai, Liming Xiong, Huiya Yan:
The Chvátal-Erdös condition for supereulerian graphs and the Hamiltonian index. Discret. Math. 310(15-16): 2082-2090 (2010) - [j27]Hong-Jian Lai, Liming Xiong, Huiya Yan, Jin Yan:
Every 3-connected claw-free Z8-free graph is Hamiltonian. J. Graph Theory 64(1): 1-11 (2010)
2000 – 2009
- 2009
- [j26]Liming Xiong, Mei Lu, Longsheng Han:
The structure of even factors in claw-free graphs. Discret. Math. 309(8): 2417-2423 (2009) - [j25]Premysl Holub, Liming Xiong:
On distance local connectivity and the hamiltonian index. Discret. Math. 309(9): 2798-2807 (2009) - [j24]Mingchu Li, Yongrui Cui, Liming Xiong, Yuan Tian, He Jiang, Xu Yuan:
Circumferences and minimum degrees in 3-connected claw-free graphs. Discret. Math. 309(11): 3580-3587 (2009) - [j23]Liming Xiong, Minmin Zong:
Traceability of line graphs. Discret. Math. 309(12): 3779-3785 (2009) - [j22]Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan, Mingquan Zhan:
Hamilton-connected indices of graphs. Discret. Math. 309(14): 4819-4827 (2009) - [j21]Akira Saito, Liming Xiong:
Closure, stability and iterated line graphs with a 2-factor. Discret. Math. 309(16): 5000-5010 (2009) - 2008
- [j20]Mingchu Li, Liming Xiong, Haitze J. Broersma:
Connected even factors in claw-free graphs. Discret. Math. 308(11): 2282-2284 (2008) - [j19]Liming Xiong, Qiuxin Wu, Mingchu Li:
Radius and subpancyclicity in line graphs. Discret. Math. 308(23): 5325-5333 (2008) - [j18]Liming Xiong:
The existence of even factors in iterated line graphs. Discret. Math. 308(23): 5891-5894 (2008) - [j17]Liming Xiong, Qiuxin Wu:
The hamiltonian index of a 2-connected graph. Discret. Math. 308(24): 6373-6382 (2008) - 2007
- [j16]Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto:
Toughness and hamiltonicity in k-trees. Discret. Math. 307(7-8): 832-838 (2007) - [j15]Mingchu Li, Cheng Guo, Liming Xiong, Dengxin Li, Hong-Jian Lai:
Quadrangularly connected claw-free graphs. Discret. Math. 307(9-10): 1205-1211 (2007) - [j14]Liming Xiong, Mingchu Li:
On the 2-factor index of a graph. Discret. Math. 307(21): 2478-2483 (2007) - [j13]Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, Shenggui Zhang:
The upper bound of the number of cycles in a 2-factor of a line graph. J. Graph Theory 55(1): 72-82 (2007) - [c2]Mingchu Li, Liming Xiong, Hong Liu:
Linear Polynomial-Time Algorithms To Construct 4-Connected 4-Regular Locally Connected Claw-Free Graphs. International Conference on Computational Science (3) 2007: 329-333 - [c1]Qiuxin Wu, Liming Xiong, Tingzeng Wu:
Even Factors with Degree at Most Four in Claw-Free Graphs. International Conference on Computational Science (3) 2007: 397-400 - 2006
- [j12]Liming Xiong, Hajo Broersma:
Subpancyclicity of line graphs and degree sums along paths. Discret. Appl. Math. 154(9): 1453-1463 (2006) - 2005
- [j11]Mingchu Li, Liming Xiong:
Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs. Electron. Notes Discret. Math. 22: 93-99 (2005) - [j10]Liming Xiong, Roman Kuzel:
A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs. Graphs Comb. 21(1): 137-144 (2005) - [j9]Tomás Kaiser, Mingchu Li, Zdenek Ryjácek, Liming Xiong:
Hourglasses and Hamilton cycles in 4-connected claw-free graphs. J. Graph Theory 48(4): 267-276 (2005) - [j8]Liming Xiong, Zdenek Ryjácek, Hajo Broersma:
On stability of the hamiltonian index under contractions and closures. J. Graph Theory 49(2): 104-115 (2005) - 2004
- [j7]Liming Xiong, Hajo Broersma, Xueliang Li, Mingchu Li:
The hamiltonian index of a graph and its branch-bonds. Discret. Math. 285(1-3): 279-288 (2004) - 2002
- [j6]Hajo Broersma, Liming Xiong:
A note on minimum degree conditions for supereulerian graphs. Discret. Appl. Math. 120(1-3): 35-43 (2002) - [j5]Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li:
Degree sums and subpancyclicity in line graphs. Discret. Math. 242(1-3): 255-267 (2002) - [j4]Liming Xiong, Zhanhong Liu:
Hamiltonian iterated line graphs. Discret. Math. 256(1-2): 407-422 (2002) - 2001
- [j3]Liming Xiong:
The Hamiltonian Index of a Graph. Graphs Comb. 17(4): 775-784 (2001)
1990 – 1999
- 1998
- [j2]Liming Xiong:
Edge degree conditions for subpancyclicity in line graphs. Discret. Math. 188(1-3): 225-232 (1998) - [j1]Liming Xiong:
On subpancyclic line graphs. J. Graph Theory 27(2): 67-74 (1998)
Coauthor Index
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 2025-01-21 00:20 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:
