Hao Li 0002

VLDB 2026 Research / reviewers in the wild / expert

dblp:17/5705-2 · DBLP profile ↗

← Back

13ranked-venue papers

3as first author

2since 2021 · last 2021

—ORCID · conflict

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

Theory of computation · 12 · 3 first-author · 2 since 2021Computer networks · 1Databases, data management, data science and information retrieval · 1

Year	Publication	Venue	Position
2021	Vertex-disjoint stars in K1, r-free graphs Suyun Jiang, Hao Li 0002	Discret. Appl. Math.	2
2021	The generalized measure of edge fault tolerance in exchanged crossed cube Wantao Ning, Hao Li 0002	Theor. Comput. Sci.	2
2018	An implicit degree condition for k-connected 2-heavy graphs to be hamiltonian Junqing Cai, Hao Li 0002, Yuzhong Zhang	Inf. Process. Lett.	2
2017	Bondage number of the strong product of two trees Weisheng Zhao 0002, Fan Wang 0007, Xiaolu Gao, Hao Li 0002	Discret. Appl. Math.	4
2016	Locating sets of vertices on Hamiltonian cycles Ralph J. Faudree, Hao Li 0002, Kiyoshi Yoshimoto	Discret. Appl. Math.	2
2016	Vertex-distinguishing proper arc colorings of digraphs Hao Li 0002, Yandong Bai, Weihua He, Qiang Sun 0004	Discret. Appl. Math.	1
2016	Hamiltonian cycles in spanning subgraphs of line graphs Hao Li 0002, Weihua He, Weihua Yang, Yandong Bai	Discret. Appl. Math.	1
2014	A new sufficient condition for pancyclability of graphs Junqing Cai, Hao Li 0002	Discret. Appl. Math.	2
2010	Algorithm for two disjoint long paths in 2-connected graphs Hao Li 0002, Guanghui Wang 0002	Theor. Comput. Sci.	2
2008	Energy conservation in wireless sensor networks and connectivity of graphs Hao Li 0002, Huifang Miao, Li Liu 0001, Lian Li 0003, Heping Zhang	Theor. Comput. Sci.	1
2001	Partitioning vertices of 1-tough graphs into paths Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li 0002, Mariusz Wozniak	Theor. Comput. Sci.	3
1994	Hamiltonicity of Bipartite Biclaw-free Graphs Evelyne Flandrin, Jean-Luc Fouquet, Hao Li 0002	Discret. Appl. Math.	3
1994	Mengerian properties, hamiltonicity, and claw-free graphs abstract Abstract In relation to the Property Pd,m, we define two parameters generalizing the diameter and the independence number of a graph, study their behaviors, and find new conditions depending on those parameters for a claw‐free graph to be Hamiltonian. © 1994 by John Wiley & Sons, Inc. Evelyne Flandrin, Hao Li 0002	Networks	2