Jing Li 0048

VLDB 2026 Research / reviewers in the wild / expert

dblp:181/2820-48 · DBLP profile ↗

← Back

23ranked-venue papers

6as first author

4since 2021 · last 2021

0000-0001-7185-8440ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 16 · 4 first-author · 3 since 2021Databases, data management, data science and information retrieval · 7 · 3 first-author · 1 since 2021Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1Computer networks · 1

Year	Publication	Venue	Position
2021	On g-good-neighbor conditional connectivity and diagnosability of hierarchical star networks Aixia Liu, Jun Yuan 0001, Jing Li 0048	Discret. Appl. Math.	4
2021	Super spanning connectivity of split-star networks Jing Li 0048, Xujing Li, Eddie Cheng 0001	Inf. Process. Lett.	1
2021	Hybrid fault-tolerant prescribed hyper-hamiltonian laceability of hypercubes Yuxing Yang, Jing Li 0048	Theor. Comput. Sci.	2
2021	Structure fault tolerance of balanced hypercubes Yuxing Yang, Jing Li 0048	J. Supercomput.	3
2019	Embedding fault-free hamiltonian paths with prescribed linear forests into faulty ternary n-cubes Yuxing Yang, Jing Li 0048	Theor. Comput. Sci.	2
2017	Embedding various cycles with prescribed paths into k-ary n-cubes Yuxing Yang, Jing Li 0048	Discret. Appl. Math.	2
2017	Paired 2-disjoint path covers of multi-dimensional torus networks with 2n - 3 faulty edges Jing Li 0048, Guoren Wang, Lichao Chen	Theor. Comput. Sci.	1
2017	On g-extra conditional diagnosability of hypercubes and folded hypercubes Aixia Liu, Jun Yuan 0001, Jing Li 0048	Theor. Comput. Sci.	4
2016	g-Good-neighbor conditional diagnosability measures for 3-ary n-cube networks Jun Yuan 0001, Aixia Liu, Xiao Qin 0001, Jifu Zhang, Jing Li 0048	Theor. Comput. Sci.	5
2015	Subnetwork preclusion for bubble-sort networks Yuxing Yang, Jing Li 0048	Inf. Process. Lett.	3
2014	Conditional connectivity of recursive interconnection networks respect to embedding restriction Yuxing Yang, Jing Li 0048	Inf. Sci.	3
2013	Panconnectivity of n-dimensional torus networks with faulty vertices and edges Jun Yuan 0001, Aixia Liu, Hongmei Wu, Jing Li 0048	Discret. Appl. Math.	4
2013	Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes Jing Li 0048, Shangwei Lin 0002, Ruixia Wang	Inf. Comput.	2
2012	Pancyclicity of k-ary n-cube networks with faulty vertices and edges Jing Li 0048, Di Liu 0008, Jun Yuan 0001	Discret. Appl. Math.	1
2012	k-Pancyclicity of k-ary n-Cube Networks under the Conditional Fault Model abstract The k-ary n-cube is one of the most popular interconnection networks for parallel and distributed systems. We prove that a k-ary n-cube with at most 4n-5 faulty edges but where every vertex is incident with at least two healthy edges is k-pancyclic and bipancyclic for n\ge 3 and odd k\ge 3. Jing Li 0048, Di Liu 0008	IEEE Trans. Parallel Distributed Syst.	1
2011	Hamiltonian cycles passing through linear forests in k-ary n-cubes Yuxing Yang, Jing Li 0048, Shangwei Lin 0002	Discret. Appl. Math.	3
2011	Pancyclicity of ternary n-cube networks under the conditional fault model Jing Li 0048, Di Liu 0008	Inf. Process. Lett.	1
2011	Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges Jing Li 0048, Di Liu 0008, Shangwei Lin 0002	Inf. Sci.	1
2011	Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube Jing Li 0048, Ruixia Wang	Inf. Sci.	2
2010	Matching preclusion for k-ary n-cubes Ruixia Wang, Shangwei Lin 0002, Jing Li 0048	Discret. Appl. Math.	4
2010	Many-to-many n-disjoint path covers in n-dimensional hypercubes Di Liu 0008, Jing Li 0048	Inf. Process. Lett.	2
2010	Neighborhood conditions for graphs to be super restricted edge connected abstract Abstract Restricted edge connectivity is a more refined network reliability index than edge connectivity. For a connected graph G = (V, E), an edge set S ⊆ E is a restricted edge cut if G − S is disconnected and every component of G − S has at least two vertices. The restricted edge connectivity of G is defined as the cardinality of a minimum restricted edge cut. G is super restricted edge connected if every minimum restricted edge cut of G isolates one edge. In this article, we present several neighborhood conditions for a graph to be super restricted edge connected. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010 Jing Li 0048, Lihong Wu, Shangwei Lin 0002	Networks	2
2007	Attribute Reduction Based on Bi-directional Distance Correlation and Radial Basis Network Li-Chao Chen, Ying-Jun Angela Zhang, Lihu Pan 0001, Jing Li 0048	ISNN (2)	6