Jianhua Tu

dblp:80/2333 · DBLP profile ↗

← Back

11ranked-venue papers

5as first author

3since 2021 · last 2026

0000-0002-7667-2116ORCID · verified

Theory of computation · 10 · 5 first-author · 3 since 2021Databases, data management, data science and information retrieval · 4 · 3 first-author

Year	Publication	Venue	Position
2026	The parameterized complexity of the properly colored spanning tree problem Shenggui Zhang, Yandong Bai, Jianhua Tu	Discret. Appl. Math.	4
2025	Bounds on the maximum modulus of dissociation roots Hongzhi Deng, Jianhua Tu, Wenke Zhou	Discret. Appl. Math.	3
2025	The minimum number of maximal independent sets in graphs with given order and independence number Yuting Tian, Jianhua Tu	Discret. Appl. Math.	2
2020	On graph entropy measures based on the number of independent sets and matchings Xinzhuang Chen, Jianhua Tu, Matthias Dehmer, Shenggui Zhang, Frank Emmert-Streib	Inf. Sci.	3
2019	On the complexity of k-rainbow cycle colouring problems Yongtang Shi, Jianhua Tu, Yan Zhao 0013	Discret. Appl. Math.	3
2016	An FPT algorithm for the vertex cover P4 problem Jianhua Tu, Zemin Jin	Discret. Appl. Math.	1
2015	The degree resistance distance of cacti Junfeng Du, Guifu Su, Jianhua Tu, Ivan Gutman	Discret. Appl. Math.	3
2015	A fixed-parameter algorithm for the vertex cover P3 problem Jianhua Tu	Inf. Process. Lett.	1
2013	The vertex cover P3P3 problem in cubic graphs Jianhua Tu, Fengmei Yang	Inf. Process. Lett.	1
2011	A factor 2 approximation algorithm for the vertex cover P3 problem Jianhua Tu	Inf. Process. Lett.	1
2011	A primal-dual approximation algorithm for the vertex cover P3 problem Jianhua Tu	Theor. Comput. Sci.	1