Baoyindureng Wu

VLDB 2026 Research / reviewers in the wild / expert

dblp:05/6097 · also Baoyingdureng Wu · DBLP profile ↗

← Back

33ranked-venue papers

3as first author

19since 2021 · last 2026

0000-0001-7164-3116ORCID · corroborated

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

Theory of computation · 32 · 2 first-author · 19 since 2021Databases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 1 · 1 first-author

Year	Publication	Venue	Position
2026	The number of odd spanning trees in the complete graphs Yong-De Feng, Baoyindureng Wu	Discret. Appl. Math.	3
2026	Improved bounds of r-hued colorings of planar graphs abstract For integers k , r > 0 , a ( k , r ) -coloring of a graph G is a proper k -coloring such that for any vertex v , there are at least min { r , d G ( v ) } different colors in its neighbors. Such a coloring is also called an r -hued coloring. The r -hued chromatic number χ r ( G ) of graph G is the least k such that there exists a ( k , r ) -coloring of G . In this paper, we show that χ r ( G ) ≤ 2 r + 7 for any integer r ≥ 9 and any planar graph G . This improves a result of Hu, Kong, Wang and Yang (a note on the r -hued coloring of planar graphs, Discrete Math. 349 (2026) 114829) saying that χ r ( G ) ≤ 2 r + 8 if G is a planar graph with r ≥ 8 . This extends a result of Bousquet, Deschamps, de Meyer and Pierron (Improved square coloring of planar graphs, Discrete Math. 346 (2023) 113288.) saying χ ( G 2 ) ≤ 2 Δ + 7 for every planar graph G with Δ ≥ 9 . Chunqiang Guo, Baoyindureng Wu	Discret. Appl. Math.	2
2026	Cycle isolation in graphs Yanfang Liang, Baoyindureng Wu	Discret. Appl. Math.	2
2026	Regular graphs with equal weakly connected domination number and matching number Baoyindureng Wu, Shenggui Zhang	Discret. Appl. Math.	3
2026	A minimum degree condition for a 2-connected graph containing all possible orders of 2-connected subgraphs Qianlong Yin, Baoyindureng Wu	Discret. Appl. Math.	2
2025	Minimum degree and size conditions for the graphs of proper connection number 2 Baoyindureng Wu	Discret. Appl. Math.	2
2024	On some conjectures on biclique graphs Yanfang Liang, Baoyindureng Wu	Discret. Appl. Math.	2
2024	k-isolation in graphs Baoyindureng Wu	Discret. Appl. Math.	2
2023	Harmonic index of a line graph Tao Wang 0177, Baoyindureng Wu, Taishan Wang	Discret. Appl. Math.	2
2023	Disproof of a conjecture on the rainbow triangles in arc-colored digraphs Baoyindureng Wu	Discret. Appl. Math.	2
2023	On packing S-colorings of subcubic graphs Baoyindureng Wu	Discret. Appl. Math.	2
2022	Decomposition of graphs with constraint on minimum degree Xiang Qin, Baoyindureng Wu	Discret. Appl. Math.	2
2022	The size of graphs with given feedback vertex number Tao Wang 0177, Baoyindureng Wu	Discret. Appl. Math.	2
2022	Disproofs of three conjectures on the power domination of graphs Baoyindureng Wu	Discret. Appl. Math.	2
2022	Extremal graphs with respect to two distance-based topological indices Wanping Zhang, Jixiang Meng, Baoyindureng Wu	Discret. Appl. Math.	3
2022	Graphs G in which G-N[v] has a prescribed property for each vertex v Baoyindureng Wu	Discret. Appl. Math.	2
2021	Disproofs of two conjectures on no hole anti-n-labeling of graphs Fangxia Wang, Baoyindureng Wu	Discret. Appl. Math.	2
2021	Proof of a conjecture on the strong chromatic index of Halin graphs Baoyindureng Wu	Discret. Appl. Math.	2
2021	K1, 2-isolation in graphs Baoyindureng Wu	Discret. Appl. Math.	2
2020	The κk-connectivity of line graphs Hengzhe Li, Baoyindureng Wu, Ankang Wei	Discret. Appl. Math.	3
2019	On the geometric-arithmetic index of a graph Baoyindureng Wu	Discret. Appl. Math.	2
2017	A -decomposition of tournaments and bipartite digraphs Fangxia Wang, Baoyindureng Wu, Xinhui An	Discret. Appl. Math.	2
2017	Upper bounds for the achromatic and coloring numbers of a graph Baoyindureng Wu, C. H. Elphick	Discret. Appl. Math.	1
2016	Remoteness and distance eigenvalues of a graph Huiqiu Lin, Kinkar Chandra Das, Baoyindureng Wu	Discret. Appl. Math.	3
2016	Proof of a conjecture on the zero forcing number of a graph Leihao Lu, Baoyindureng Wu, Zixing Tang	Discret. Appl. Math.	2
2016	Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs Xiaoling Ma, Hong-Jian Lai, Wei Xiong 0002, Baoyindureng Wu, Xinhui An	Discret. Appl. Math.	4
2015	Domination of maximal K4-minor free graphs and maximal K2, 3-minor free graphs, and disproofs of two conjectures on planar graphs Baoyindureng Wu	Discret. Appl. Math.	2
2014	Randić index and coloring number of a graph Baoyindureng Wu, Xiaojing Yang	Discret. Appl. Math.	1
2014	[1, 2]-domination in graphs Xiaojing Yang, Baoyindureng Wu	Discret. Appl. Math.	2
2014	The hub number, girth and Mycielski graphs Zhilan Dang, Baoyindureng Wu	Inf. Process. Lett.	3
2012	Proximity and average eccentricity of a graph Beibei Ma, Baoyindureng Wu, Wanping Zhang	Inf. Process. Lett.	2
2011	Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts Daobin Li, Baoyindureng Wu, Xunuan Yang, Xinhui An	Discret. Appl. Math.	2
2009	A Note on Edge Choosability and Degeneracy of Planar Graphs Baoyindureng Wu, Xinhui An	COCOA	1