Xingxing Yu

ORCID

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 54

Top Venues

J. Comb. Theory, Ser. B

J. Graph Theory

SIAM J. Discret. Math.

Graphs Comb.

Publications

Yuzhenni Wang, Xingxing Yu, Xiao-Dong Zhang
A class of trees determined by their chromatic symmetric functions. Discret. Math. 347 (9) (2024)
Xiying Du, Yanjia Li, Shijie Xie, Xingxing Yu
Linkages and removable paths avoiding vertices. J. Comb. Theory B 169 (2024)
Hongliang Lu, Yan Wang, Xingxing Yu
A better bound on the size of rainbow matchings. J. Comb. Theory, Ser. A 195 (2023)
Xingxing Yu, Ying Zhu, Yan Cao, Juan Xiong
Time-Domain Numerical Simulation and Experimental Study on Pulsed Eddy Current Inspection of Tubing and Casing. Sensors 23 (3) (2023)
Michael C. Wigal, Xingxing Yu
Tutte paths and long cycles in circuit graphs. J. Comb. Theory, Ser. B 158 (Part) (2023)
Hongliang Lu, Yan Wang, Xingxing Yu
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs. J. Comb. Theory, Ser. B 163 (2023)
Xiaonan Liu, Joshua Schroeder, Zhiyu Wang, Xingxing Yu
-broom-free graphs. J. Comb. Theory, Ser. B 162 (2023)
Michael C. Wigal, Youngho Yoo, Xingxing Yu
Approximating TSP walks in subcubic graphs. J. Comb. Theory, Ser. B 158 (Part) (2023)
Jianping Li, Junran Lichen, Wencheng Wang, Jean Yeh, Yeong-Nan Yeh, Xingxing Yu, Yujie Zheng
1-line minimum rectilinear steiner trees and related problems. J. Comb. Optim. 44 (4) (2022)
Hongliang Lu, Xingxing Yu
A Note on Exact Minimum Degree Threshold for Fractional Perfect Matchings. Graphs Comb. 38 (3) (2022)
Qiqin Xie, Shijie Xie, Xingxing Yu, Xiaofan Yuan
4-Separations in Hajós graphs. J. Graph Theory 99 (3) (2022)
Xiaonan Liu, Zhiyu Wang, Xingxing Yu
Counting Hamiltonian cycles in planar triangulations. J. Comb. Theory, Ser. B 155 (2022)
Junran Lichen, Jianping Li, Ko-Wei Lih, Xingxing Yu
Approximation algorithms for constructing required subgraphs using stock pieces of fixed length. J. Comb. Optim. 44 (3) (2022)
Hongliang Lu, Yan Wang, Xingxing Yu
Rainbow Perfect Matchings for 4-Uniform Hypergraphs. SIAM J. Discret. Math. 36 (3) (2022)
Guanwu Liu, Xingxing Yu
Partitioning digraphs with outdegree at least 4. J. Graph Theory 98 (4) (2021)
Qiqin Xie, Shijie Xie, Xingxing Yu, Xiaofan Yuan
Wheels in planar graphs and Hajós graphs. J. Graph Theory 98 (2) (2021)
Hongliang Lu, Xingxing Yu, Xiaofan Yuan
Rainbow matchings for 3-uniform hypergraphs. J. Comb. Theory, Ser. A 183 (2021)
Xiaonan Liu, Xingxing Yu
Number of Hamiltonian Cycles in Planar Triangulations. SIAM J. Discret. Math. 35 (2) (2021)
Hongliang Lu, Xingxing Yu, Xiaofan Yuan
Nearly Perfect Matchings in Uniform Hypergraphs. SIAM J. Discret. Math. 35 (2) (2021)
Michael C. Wigal, Youngho Yoo, Xingxing Yu
Approximating TSP walks in subcubic graphs. CoRR (2021)
Zhao Chen, Xingxing Yu
A Novel Tensor Network for Tropical Cyclone Intensity Estimation. IEEE Trans. Geosci. Remote. Sens. 59 (4) (2021)
Dawei He, Yan Wang, Xingxing Yu
The Kelmans-Seymour conjecture III: 3-vertices in K4-. J. Comb. Theory, Ser. B 144 (2020)
Dawei He, Yan Wang, Xingxing Yu
The Kelmans-Seymour conjecture II: 2-Vertices in K4-. J. Comb. Theory, Ser. B 144 (2020)
Rose McCarty, Yan Wang, Xingxing Yu
7-Connected graphs are 4-ordered. J. Comb. Theory, Ser. B 141 (2020)
Dawei He, Yan Wang, Xingxing Yu
The Kelmans-Seymour conjecture IV: A proof. J. Comb. Theory, Ser. B 144 (2020)
Jie Ma, Tianyun Tang, Xingxing Yu
Monochromatic Subgraphs in Iterated Triangulations. Electron. J. Comb. 27 (4) (2020)
Junran Lichen, Jianping Li, Wencheng Wang, Jean Yeh, Yeong-Nan Yeh, Xingxing Yu, Yujie Zheng
On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane $\mathbb {R}^2$. AAIM (2020)
Xingxing Yu, Zhao Chen, He Zhang, Yuxin Zheng
A Novel Deep Learning Framework for Tropical Cyclone Intensity Estimation Using FY-4 Satellite Imagery. ICIAI (2020)
Dawei He, Yan Wang, Xingxing Yu
The Kelmans-Seymour conjecture I: Special separations. J. Comb. Theory, Ser. B 144 (2020)
Zhao Chen, Xingxing Yu, Feng Zhou, Bin Yang
A Regularized Tensor Network for Cyclone Wind Speed Estimation. IGARSS (2020)
Hongliang Lu, Yan Wang, Xingxing Yu
Minimum codegree condition for perfect matchings in k-partite k-graphs. J. Graph Theory 92 (3) (2019)
Mingxia Liu, Xiaoming You, Xingxing Yu, Sheng Liu
KL Divergence-Based Pheromone Fusion for Heterogeneous Multi-Colony Ant Optimization. IEEE Access 7 (2019)
Xingxing Yu, Zhao Chen, Guangchen Chen, He Zhang, Junfeng Zhou
A Tensor Network for Tropical Cyclone Wind Speed Estimation. IGARSS (2019)
Guangchen Chen, Zhao Chen, Feng Zhou, Xingxing Yu, He Zhang, Lingyun Zhu
A Semisupervised Deep Learning Framework for Tropical Cyclone Intensity Estimation. MultiTemp (2019)
Yuliang Ji, Jie Ma, Juan Yan, Xingxing Yu
On problems about judicious bipartitions of graphs. J. Comb. Theory, Ser. B 139 (2019)
Junran Lichen, Jianping Li, Ko-Wei Lih, Xingxing Yu
On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length. AAIM (2019)
Le Liang, Shijie Xie, Geoffrey Ye Li, Zhi Ding, Xingxing Yu
Graph-Based Radio Resource Management for Vehicular Networks. ICC (2018)
Lu Lu, Dawei He, Qiqin Xie, Geoffrey Ye Li, Xingxing Yu
Graph-Based Path Selection and Power Allocation for DF Relay-Aided Transmission. IEEE Wirel. Commun. Lett. 7 (1) (2018)
Le Liang, Shijie Xie, Geoffrey Ye Li, Zhi Ding, Xingxing Yu
Graph-Based Resource Sharing in Vehicular Communication. IEEE Trans. Wirel. Commun. 17 (7) (2018)
Le Liang, Shijie Xie, Geoffrey Ye Li, Zhi Ding, Xingxing Yu
Graph-Based Radio Resource Management for Vehicular Networks. CoRR (2018)
Hongliang Lu, Yan Wang, Xingxing Yu
Almost Perfect Matchings in k-Partite k-Graphs. SIAM J. Discret. Math. 32 (1) (2018)
Hongliang Lu, Xingxing Yu
On Rainbow Matchings for Hypergraphs. SIAM J. Discret. Math. 32 (1) (2018)
Genghua Fan, Jianfeng Hou, Xingxing Yu
Bisections of Graphs Without Short Cycles. Comb. Probab. Comput. 27 (1) (2018)
Hongliang Lu, Xingxing Yu, Li Zhang
Disjoint perfect matchings in 3-uniform hypergraphs. J. Graph Theory 88 (2) (2018)
Qinghai Liu, Xingxing Yu, Zhao Zhang
Circumference of 3-connected cubic graphs. J. Comb. Theory, Ser. B 128 (2018)
Lu Lu, Dawei He, Qiqin Xie, Geoffrey Ye Li, Xingxing Yu
Graph-based path selection and power allocation for relay-aided transmission. WCNC (2016)
Jie Ma, Qiqin Xie, Xingxing Yu
. J. Graph Theory 82 (2) (2016)
Jie Ma, Xingxing Yu
On judicious bipartitions of graphs. Comb. 36 (5) (2016)
Yuqin Sun, Xingxing Yu
On a Coloring Conjecture of Hajós. Graphs Comb. 32 (1) (2016)
Binglei Wang, Xingxing Yu, Ran Wei, Chenxing Yuan, Xiaoyu Li, Chun-Hou Zheng
System Prediction of Drug-Drug Interactions Through the Integration of Drug Phenotypic, Therapeutic, Structural, and Genomic Similarities. ICIC (1) (2016)
Lu Lu, Dawei He, Geoffrey Ye Li, Xingxing Yu
Graph-Based Robust Resource Allocation for Cognitive Radio Networks. IEEE Trans. Signal Process. 63 (14) (2015)
Ken-ichi Kawarabayashi, Jie Ma, Xingxing Yu
. J. Comb. Theory, Ser. B 113 (2015)
Yanmei Hong, Liying Kang, Xingxing Yu
Nonseparating Cycles Avoiding Specific Vertices. J. Graph Theory 80 (4) (2015)
Changhong Lu, Kan Wang, Xingxing Yu
On Tight Components and Anti-Tight Components. Graphs Comb. 31 (6) (2015)
Lu Lu, Dawei He, Xingxing Yu, Geoffrey Ye Li
Graph-based robust resource allocation for cognitive radio networks. ICASSP (2014)
Genghua Fan, Baogang Xu, Tianjun Ye, Xingxing Yu
Forbidden Subgraphs and 3-Colorings. SIAM J. Discret. Math. 28 (3) (2014)
Baogang Xu, Xingxing Yu
On judicious bisections of graphs. J. Comb. Theory, Ser. B 106 (2014)
Jie Ma, Xingxing Yu, Wenan Zang
Approximate min-max relations on plane graphs. J. Comb. Optim. 26 (1) (2013)
Lu Lu, Dawei He, Xingxing Yu, Geoffrey Ye Li
Energy-efficient resource allocation for cognitive radio networks. GLOBECOM (2013)
Jie Ma, Xingxing Yu
. J. Comb. Theory, Ser. B 103 (6) (2013)
Guantao Chen, Xingxing Yu, Wenan Zang
-minor, II. J. Comb. Theory, Ser. B 102 (6) (2012)
Genghua Fan, Baogang Xu, Xingxing Yu, Chuixiang Zhou
Upper bounds on minimum balanced bipartitions. Discret. Math. 312 (6) (2012)
Jie Ma, Xingxing Yu
Partitioning 3-uniform hypergraphs. J. Comb. Theory, Ser. B 102 (1) (2012)
Xujin Chen, Guoli Ding, Xingxing Yu, Wenan Zang
Bonds with parity constraints. J. Comb. Theory, Ser. B 102 (3) (2012)
Baogang Xu, Xingxing Yu
Maximum Directed Cuts in Graphs with Degree Constraints. Graphs Comb. 28 (4) (2012)
Baogang Xu, Xingxing Yu
-Partitions of Graphs. Comb. Probab. Comput. 20 (4) (2011)
Guantao Chen, Xingxing Yu, Wenan Zang
Approximating the chromatic index of multigraphs. J. Comb. Optim. 21 (2) (2011)
Mark Bilinski, Bill Jackson, Jie Ma, Xingxing Yu
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs. J. Comb. Theory, Ser. B 101 (4) (2011)
Jie Ma, Pei-Lan Yen, Xingxing Yu
On several partitioning problems of Bollobás and Scott. J. Comb. Theory, Ser. B 100 (6) (2010)
Jie Ma, Xingxing Yu
Bounds for pairs in partitions of graphs. Discret. Math. 310 (15-16) (2010)
Jie Ma, Xingxing Yu
-subdivisions. J. Comb. Theory, Ser. B 100 (6) (2010)
Baogang Xu, Juan Yan, Xingxing Yu
A note on balanced bipartitions. Discret. Math. 310 (20) (2010)
Baogang Xu, Juan Yan, Xingxing Yu
Balanced judicious bipartitions of graphs. J. Graph Theory 63 (3) (2010)
Baogang Xu, Xingxing Yu
On a bipartition problem of Bollobás and Scott. Comb. 29 (5) (2009)
Baogang Xu, Xingxing Yu
Judicious k-partitions of graphs. J. Comb. Theory, Ser. B 99 (2) (2009)
Qing Cui, Jian Wang, Xingxing Yu
Hamilton circles in infinite planar graphs. J. Comb. Theory, Ser. B 99 (1) (2009)
Guantao Chen, Xingxing Yu, Wenan Zang
Preface. Discret. Math. 309 (5) (2009)
Baogang Xu, Xingxing Yu
Triangle-free subcubic graphs with minimum bipartite density. J. Comb. Theory, Ser. B 98 (3) (2008)
Xingxing Yu
Infinite paths in planar graphs V, 3-indivisible graphs. J. Graph Theory 57 (4) (2008)
Henning Bruhn, Xingxing Yu
Hamilton Cycles in Planar Locally Finite Graphs. SIAM J. Discret. Math. 22 (4) (2008)
Zemin Jin, Xingxing Yu, Xiaoyan Zhang
-connected graphs. J. Graph Theory 55 (2) (2007)
Mark Bilinski, Young Soo Kwon, Xingxing Yu
On the reconstruction of planar graphs. J. Comb. Theory, Ser. B 97 (5) (2007)
Wen Jiang, Geoffrey Ye Li, Xingxing Yu
Truncation for Low-Complexity MIMO Signal Detection. IEEE Trans. Inf. Theory 53 (4) (2007)
Xingxing Yu
Infinite paths in planar graphs IV, dividing cycles. J. Graph Theory 53 (3) (2006)
Xingxing Yu, Florian Zickfeld
Reducing Hajós' 4-coloring conjecture to 4-connected graphs. J. Comb. Theory, Ser. B 96 (4) (2006)
Zhicheng Gao, R. Bruce Richter, Xingxing Yu
Erratum to 2-walks in 3-connected planar graphs. Australas. J Comb. 36 (2006)
Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang
Approximating Longest Cycles in Graphs with Bounded Degrees. SIAM J. Comput. 36 (3) (2006)
Xingxing Yu
Infinite paths in planar graphs III, 1-way infinite paths. J. Graph Theory 51 (3) (2006)
Xiaolong Huang, Zemin Jin, Xingxing Yu, Xiaoyan Zhang
-Connected Graphs. Graphs Comb. 22 (3) (2006)
Guantao Chen, Laura Sheppardson, Xingxing Yu, Wenan Zang
-minor. J. Comb. Theory, Ser. B 96 (6) (2006)
Sean Curran, Orlando Lee, Xingxing Yu
Finding Four Independent Trees . SIAM J. Comput. 35 (5) (2006)
József Balogh, Martin Kochol, András Pluhár, Xingxing Yu
Covering planar graphs with forests. J. Comb. Theory, Ser. B 94 (1) (2005)
Sean Curran, Orlando Lee, Xingxing Yu
Nonseparating Planar Chains in 4-Connected Graphs. SIAM J. Discret. Math. 19 (2) (2005)
Sean Curran, Orlando Lee, Xingxing Yu
Chain Decompositions of 4-Connected Graphs. SIAM J. Discret. Math. 19 (4) (2005)
Xingxing Yu
Infinite paths in planar graphs II, structures and ladder nets. J. Graph Theory 48 (4) (2005)
Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang
Approximating the Longest Cycle Problem on Graphs with Bounded Degree. COCOON (2005)
Robin Thomas, Xingxing Yu, Wenan Zang
Hamilton paths in toroidal graphs. J. Comb. Theory, Ser. B 94 (2) (2005)
Guantao Chen, Jun Xu, Xingxing Yu
Circumference of Graphs with Bounded Degree. SIAM J. Comput. 33 (5) (2004)
Abhishek Kumar, Shashidhar Merugu, Jun (Jim) Xu, Ellen W. Zegura, Xingxing Yu
Ulysses: a robust, low-diameter, low-latency peer-to-peer network. Eur. Trans. Telecommun. 15 (6) (2004)
Jun (Jim) Xu, Abhishek Kumar, Xingxing Yu
On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. IEEE J. Sel. Areas Commun. 22 (1) (2004)

Xingxing Yu.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Xingxing Yu