Ge Xia - RankMe

84 papers A* 6A 7B 9C 6Misc 1Journal 47Unranked 7

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	An 풪(3.82 Discret. Comput. Geom. HaoHong Li, Ge Xia
2024	J	`jnl`	Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data. Algorithmica Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
2023	A	`conf`	An 𝒪(3.82 STACS HaoHong Li, Ge Xia
2023	J	`jnl`	Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. CoRR Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia
2022	J	`jnl`	An $O(3.82^k)$ Time FPT Algorithm for Convex Flip Distance. CoRR HaoHong Li, Ge Xia
2022	A	`conf`	Near-Optimal Algorithms for Point-Line Covering Problems. STACS Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
2022	J	`jnl`	Near-optimal algorithms for point-line fitting problems. J. Comput. Geom. Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
2021	J	`jnl`	Optimal Streaming Algorithms for Graph Matching. CoRR Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
2021	B	`conf`	Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. ISAAC Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia
2020	J	`jnl`	Near-Optimal Algorithms for Point-Line Covering Problems. CoRR Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
2020	A*	`conf`	On the Problem of Covering a 3-D Terrain. AAAI Eduard Eiben, Isuru S. Godage, Iyad Kanj, Ge Xia
2020	J	`jnl`	The Complexity of Tree Partitioning. Algorithmica Zhao An, Qilong Feng, Iyad Kanj, Ge Xia
2017	J	`jnl`	Computing the Flip Distance Between Triangulations. Discret. Comput. Geom. Iyad A. Kanj, Eric Sedgwick, Ge Xia
2017	J	`jnl`	On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. Inf. Comput. Iyad A. Kanj, Dimitrios M. Thilikos, Ge Xia
2017	B	`conf`	The Complexity of Tree Partitioning. WADS Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia
2017	J	`jnl`	The Complexity of Tree Partitioning. CoRR Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia
2016	J	`jnl`	A contour-line color layer separation algorithm based on fuzzy clustering and region growing. Comput. Geosci. Tiange Liu, Qiguang Miao, Pengfei Xu, Yubing Tong, Jianfeng Song, Ge Xia, Yun Yang, Xiaojie Zhai
2016	J	`jnl`	Edge-disjoint packing of stars and cycles. Theor. Comput. Sci. Minghui Jiang, Ge Xia, Yong Zhang
2016	J	`jnl`	RBoost: Label Noise-Robust Boosting Algorithm Based on a Nonconvex Loss Function and the Numerically Stable Base Learners. IEEE Trans. Neural Networks Learn. Syst. Qiguang Miao, Ying Cao, Ge Xia, Maoguo Gong, Jiachen Liu, Jianfeng Song
2015	C	`conf`	Edge-Disjoint Packing of Stars and Cycles. COCOA Minghui Jiang, Ge Xia, Yong Zhang
2015	A	`conf`	Flip Distance Is in FPT Time O(n+ k * c^k). STACS Iyad A. Kanj, Ge Xia
2015	J	`jnl`	Improved parameterized and exact algorithms for cut problems on trees. Theor. Comput. Sci. Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
2015	J	`jnl`	New and improved spanning ratios for Yao graphs. J. Comput. Geom. Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia
2015	J	`jnl`	There are Plane Spanners of Degree 4 and Moderate Stretch Factor. Discret. Comput. Geom. Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2014	C	`conf`	Algorithms for Cut Problems on Trees. COCOA Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
2014	J	`jnl`	Flip Distance is in FPT time $O(n+ k \cdot c^k)$. CoRR Iyad A. Kanj, Ge Xia
2014	A*	`conf`	New and Improved Spanning Ratios for Yao Graphs. SoCG Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia
2014	J	`jnl`	On certain geometric properties of the Yao-Yao graphs. J. Comb. Optim. Iyad A. Kanj, Ge Xia
2014	A*	`conf`	There are Plane Spanners of Maximum Degree 4. SoCG Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2014	J	`jnl`	There are Plane Spanners of Maximum Degree 4. CoRR Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2013	J	`jnl`	Algorithms for Cut Problems on Trees CoRR Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
2013	J	`jnl`	Parameterized top- Theor. Comput. Sci. Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
2013	—	`conf`	The Radiation Hybrid Map Construction Problem Is FPT. ISBRA Iyad A. Kanj, Ge Xia, Binhai Zhu
2013	J	`jnl`	The Stretch Factor of the Delaunay Triangulation Is Less than 1.998. SIAM J. Comput. Ge Xia
2013	J	`jnl`	The Yao Graph $Y_5$ is a Spanner. CoRR Wah Loon Keng, Ge Xia
2013	B	`conf`	When Is Weighted Satisfiability FPT? WADS Iyad A. Kanj, Ge Xia
2012	J	`jnl`	Improved local algorithms for spanner construction. Theor. Comput. Sci. Iyad A. Kanj, Ge Xia
2012	J	`jnl`	Kernelization for cycle transversal problems. Discret. Appl. Math. Ge Xia, Yong Zhang
2012	J	`jnl`	Local Construction of Spanners in the 3D Space. IEEE Trans. Mob. Comput. Jonathan P. Jenkins, Iyad A. Kanj, Ge Xia, Fenghui Zhang
2012	C	`conf`	On Certain Geometric Properties of the Yao-Yao Graphs. COCOA Iyad A. Kanj, Ge Xia
2011	—	`conf`	Improved upper bound on the stretch factor of delaunay triangulations. SCG Ge Xia
2011	J	`jnl`	On the induced matching problem. J. Comput. Syst. Sci. Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia
2011	J	`jnl`	On the small cycle transversal of planar graphs. Theor. Comput. Sci. Ge Xia, Yong Zhang
2011	J	`jnl`	On the stretch factor of Delaunay triangulations of points in convex position. Comput. Geom. Shiliang Cui, Iyad A. Kanj, Ge Xia
2011	J	`jnl`	Separability and topology control of quasi unit disk graphs. Wirel. Networks Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang
2011	J	`jnl`	The Stretch Factor of the Delaunay Triangulation Is Less Than 1.998 CoRR Ge Xia
2011	—	`conf`	Toward the Tight Bound of the Stretch Factor of Delaunay Triangulations. CCCG Ge Xia, Liang Zhang
2011	J	`jnl`	What makes normalized weighted satisfiability tractable CoRR Iyad A. Kanj, Ge Xia
2010	C	`conf`	Improved Local Algorithms for Spanner Construction. ALGOSENSORS Iyad A. Kanj, Ge Xia
2010	J	`jnl`	Improved upper bounds for vertex cover. Theor. Comput. Sci. Jianer Chen, Iyad A. Kanj, Ge Xia
2010	C	`conf`	Kernelization for Cycle Transversal Problems. AAIM Ge Xia, Yong Zhang
2010	J	`jnl`	On Spanners and Lightweight Spanners of Geometric Graphs. SIAM J. Comput. Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2010	B	`conf`	On the Small Cycle Transversal of Planar Graphs. WG Ge Xia, Yong Zhang
2009	J	`jnl`	Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks. IEEE Trans. Mob. Comput. Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2009	B	`conf`	Local Construction of Spanners in the 3-D Space. DCOSS Iyad A. Kanj, Ge Xia, Fenghui Zhang
2009	C	`conf`	On Parameterized Exponential Time Complexity. TAMC Jianer Chen, Iyad A. Kanj, Ge Xia
2009	J	`jnl`	On parameterized exponential time complexity. Theor. Comput. Sci. Jianer Chen, Iyad A. Kanj, Ge Xia
2009	—	`conf`	On the Dilation of Delaunay Triangulations of Points in Convex Position. CCCG Shiliang Cui, Iyad A. Kanj, Ge Xia
2009	J	`jnl`	On the pseudo-achromatic number problem. Theor. Comput. Sci. Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
2008	A	`conf`	Computing Lightweight Spanners Locally. DISC Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2008	A	`conf`	On the Induced Matching Problem. STACS Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer
2008	B	`conf`	On the Pseudo-achromatic Number Problem. WG Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
2008	J	`jnl`	Seeing the trees and their branches in the network is hard. Theor. Comput. Sci. Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia
2008	J	`jnl`	The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. Algorithmica Iyad A. Kanj, Luay Nakhleh, Ge Xia
2007	J	`jnl`	Genus characterizes the complexity of certain graph problems: Some tight results. J. Comput. Syst. Sci. Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia
2007	J	`jnl`	Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. SIAM J. Comput. Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia
2007	J	`jnl`	Polynomial time approximation schemes and parameterized complexity. Discret. Appl. Math. Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
2007	—	`conf`	Seeing the Trees and Their Branches in the Forest is Hard. ICTCS Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia
2007	A*	`conf`	Separability and Topology Control of Quasi Unit Disk Graphs. INFOCOM Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang
2007	—	`conf`	Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. DIALM-POMC Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2006	B	`conf`	Improved Parameterized Upper Bounds for Vertex Cover. MFCS Jianer Chen, Iyad A. Kanj, Ge Xia
2006	—	`conf`	On the Effective Enumerability of NP Problems. IWPEC Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
2006	J	`jnl`	On the computational hardness based on linear FPT-reductions. J. Comb. Optim. Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
2006	Misc	`conf`	Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. COCOON Iyad A. Kanj, Luay Nakhleh, Ge Xia
2006	J	`jnl`	Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
2005	J	`jnl`	Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. Algorithmica Jianer Chen, Iyad A. Kanj, Ge Xia
2005	—	`—`	Parameterized algorithms and computational lower bounds: a structural approach. Ge Xia
2005	A	`conf`	Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. STACS Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia
2005	J	`jnl`	Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia
2004	A*	`conf`	Linear FPT reductions and computational lower bounds. STOC Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
2004	B	`conf`	Polynomial Time Approximation Schemes and Parameterized Complexity. MFCS Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
2004	A	`conf`	Tight Lower Bounds for Certain Parameterized NP-Hard Problems. CCC Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia
2003	A*	`conf`	Genus Characterizes the Complexity of Graph Problems: Some Tight Results. ICALP Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia
2003	B	`conf`	Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. ISAAC Jianer Chen, Iyad A. Kanj, Ge Xia