Arbitrary Area Filling in a Fast Procedure. - Dao-Ning Ying; Xing Feng (Comput. Graph. Forum, 1985)

Robust Adaptive Tracking Control of the Underwater Robot with Input Nonlinearity Using Neural Networks. - Mou Chen; Bin Jiang 001; Jie Zou; Xing Feng (Int. J. Comput. Intell. Syst., 2010)

Parallel k-Skyband Computation on Multicore Architecture. - Xing Feng; Yunjun Gao; Tao Jiang 013; Lu Chen 001; Xiaoye Miao; Qing Liu 008 (APWeb, 2013)

Probabilistic Top-k Dominating Query over Sliding Windows. - Xing Feng; Xiang Zhao 002; Yunjun Gao; Ying Zhang 001 (APWeb, 2013)

Object tracking with Kalman filter and discrete cosine transform. - Jun Wang; Dansong Cheng; Xing Feng; Guohua Zhang (ICMLC, 2013)

Probabilistic k-Skyband Operator over Sliding Windows. - Xing Feng; Wenjie Zhang 001; Xiang Zhao 002; Ying Zhang 001; Yunjun Gao (WAIM, 2013)

On Minimum Wiener Polarity Index of Unicyclic Graphs with Prescribed Maximum Degree. - Jianping Ou; Xing Feng; Saihua Liu (J. Appl. Math., 2014)

Computing Connected Components with linear communication cost in pregel-like systems. - Xing Feng; Lijun Chang; Xuemin Lin 001; Lu Qin 001; Wenjie Zhang 001 (ICDE, 2016)

Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes. - Mingzu Zhang; Lianzhu Zhang; Xing Feng (Theor. Comput. Sci., 2016)

Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation. - Lijun Chang; Xing Feng; Xuemin Lin 001; Lu Qin 001; Wenjie Zhang 001 (CoRR, 2017)

A Sufficient Condition for Pfaffian Graphs on the Torus. - Xing Feng; Lianzhu Zhang; Mingzu Zhang (Graphs Comb., 2017)

Efficiently computing graph similarity and graph connectivity. - Xing Feng (2017)

Enumeration of perfect matchings of lattice graphs by Pfaffians. - Xing Feng; Lianzhu Zhang; Mingzu Zhang (Appl. Math. Comput., 2018)

Distributed computing connected components with linear communication cost. - Xing Feng; Lijun Chang; Xuemin Lin 001; Lu Qin 001; Wenjie Zhang 001; Long Yuan 001 (Distributed Parallel Databases, 2018)

An O(|E(G)|2) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs. - Xing Feng; Lianzhu Zhang; Mingzu Zhang (J. Comb. Optim., 2018)

An O(log2(N)) Algorithm for Reliability Evaluation of h-Extra Edge-Connectivity of Folded Hypercubes. - Mingzu Zhang; Lianzhu Zhang; Xing Feng; Hong-Jian Lai (IEEE Trans. Reliab., 2018)

Efficient Parallel Computing of Graph Edit Distance. - Ran Wang 008; Yixiang Fang; Xing Feng (ICDE Workshops, 2019)

Disjoint Odd Cycles in Cubic Solid Bricks. - Guantao Chen; Xing Feng; Fuliang Lu; Lianzhu Zhang (SIAM J. Discret. Math., 2019)

Speeding Up GED Verification for Graph Similarity Search. - Lijun Chang; Xing Feng; Xuemin Lin 001; Lu Qin 001; Wenjie Zhang 001; Dian Ouyang (ICDE, 2020)

Fluorescence Molecular Tomography Reconstruction of Small Targets Using Stacked Auto-Encoder Neural Networks. - Huiquan Wang; Jianyu Gao; Zhe Zhao; Xing Feng; Wenjuan Ma; Jinhai Wang; Philip O. Ogunbona (IEEE Access, 2020)

b-Invariant Edges in Essentially 4-Edge-Connected Near-Bipartite Cubic Bricks. - Fuliang Lu; Xing Feng; Yan Wang (Electron. J. Comb., 2020)

Equivalence classes in matching covered graphs. - Fuliang Lu; Nishad Kothari; Xing Feng; Lianzhu Zhang (Discret. Math., 2020)

The Chromatic Number of Graphs with No Induced Subdivision of K4. - Guantao Chen; Yuan Chen; Qing Cui; Xing Feng; Qinghai Liu (Graphs Comb., 2020)

A characterization of nonfeasible sets in matching covered graphs. - Qinghai Liu; Qing Cui; Xing Feng; Fuliang Lu (J. Graph Theory, 2020)

A conjecture on the lower bound of the signed edge domination number of 2-connected graphs. - Xing Feng; Jun Ge (Discret. Appl. Math., 2021)

Laminar tight cuts in matching covered graphs. - Guantao Chen; Xing Feng; Fuliang Lu; Cláudio Leonardo Lucchesi; Lianzhu Zhang (J. Comb. Theory B, 2021)

The chromatic number of { ISK4ISK4 ISK 4 , diamond, bowtie}-free graphs. - Guantao Chen; Yuan Chen; Qing Cui; Xing Feng; Qinghai Liu (J. Graph Theory, 2021)

On extremal nonsolid bricks. - Xing Feng; Fuliang Lu (J. Graph Theory, 2021)

Reliability measure of the n-th cartesian product of complete graph K4 on h-extra edge-connectivity. - Zhaoxia Tian; Mingzu Zhang; Xing Feng (Theor. Comput. Sci., 2022)

The influence of emotional experience on learning effect in blended learning in post-epidemic era. - Xing Feng; Ye Zhang (ICBDE, 2023)

Accelerating Graph Similarity Search via Efficient GED Computation. - Lijun Chang; Xing Feng; Kai Yao; Lu Qin 001; Wenjie Zhang 001 (IEEE Trans. Knowl. Data Eng., 2023)

Methods and Strategies for Improving the Novel View Synthesis Quality of Neural Radiation Field. - Shun Fang; Ming Cui; Xing Feng; Yanna Lv (IEEE Access, 2024)

Exploration and Improvement of Nerf-based 3D Scene Editing Techniques. - Shun Fang; Ming Cui; Xing Feng; Yanan Zhang (CoRR, 2024)

A real-time rendering method for high albedo anisotropic materials with multiple scattering. - Shun Fang; Xing Feng; Ming Cui (CoRR, 2024)

A concentration phenomenon for h-extra edge-connectivity reliability analysis of enhanced hypercubes Q_{n,2} with exponentially many faulty links. - Yali Sun; Mingzu Zhang; Xing Feng; Xing Yang (CoRR, 2024)

Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip. - Danyi Li; Xing Feng; Weigen Yan (Discret. Appl. Math., 2024)

Concentration phenomenon about h-extra edge-connectivity of the n-th cartesian product of complete graph K4 with large-scale faulty links. - Zhaoxia Tian; Mingzu Zhang; Xing Feng (J. Supercomput., 2024)

Enumeration of perfect matchings of the middle graph of a graph G with △(G)≤4. - Jingchao Lai; Weigen Yan; Xing Feng (Discret. Math., 2024)

Extremal numbers of leaves for trees with fixed diameter and maximum degree. - Xing Feng; Zejun Huang (Discret. Appl. Math., 2025)

On the number of perfect matchings of middle graphs. - Jingchao Lai; Weigen Yan; Xing Feng (Discret. Appl. Math., 2025)

K4-free planar minimal bricks with the maximum number of edges. - Jinqiu Zhou; Xing Feng; Weigen Yan (Discret. Appl. Math., 2025)

Time-lagged relation graph neural network for multivariate time series forecasting. - Xing Feng; Hongru Li; Yinghua Yang (Eng. Appl. Artif. Intell., 2025)

On a Norine-Thomas conjecture concerning minimal bricks. - Xing Feng (J. Graph Theory, 2025)

Claw-Free Solid Bricks. - Jinqiu Zhou; Xing Feng; Weigen Yan (Graphs Comb., 2025)