| Improved upper bounds for vertex cover J Chen, IA Kanj, G Xia Theoretical Computer Science 411 (40-42), 3736-3756, 2010 | 477 | 2010 |
| Strong computational lower bounds via parameterized complexity J Chen, X Huang, IA Kanj, G Xia Journal of Computer and System Sciences 72 (8), 1346-1367, 2006 | 329 | 2006 |
| Tight lower bounds for certain parameterized NP-hard problems J Chen, B Chor, M Fellows, X Huang, D Juedes, IA Kanj, G Xia Information and Computation 201 (2), 216-231, 2005 | 259 | 2005 |
| Improved parameterized upper bounds for vertex cover J Chen, IA Kanj, G Xia Mathematical Foundations of Computer Science 2006: 31st International …, 2006 | 212 | 2006 |
| Parametric duality and kernelization: Lower bounds and upper bounds on kernel size J Chen, H Fernau, IA Kanj, G Xia SIAM Journal on Computing 37 (4), 1077-1106, 2007 | 139 | 2007 |
| Linear FPT reductions and computational lower bounds J Chen, X Huang, IA Kanj, G Xia Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 138 | 2004 |
| The stretch factor of the Delaunay triangulation is less than 1.998 G Xia SIAM Journal on Computing 42 (4), 1620-1659, 2013 | 112 | 2013 |
| RBoost: Label noise-robust boosting algorithm based on a nonconvex loss function and the numerically stable base learners Q Miao, Y Cao, G Xia, M Gong, J Liu, J Song IEEE transactions on neural networks and learning systems 27 (11), 2216-2228, 2015 | 93 | 2015 |
| Seeing the trees and their branches in the network is hard IA Kanj, L Nakhleh, C Than, G Xia Theoretical Computer Science 401 (1-3), 153-164, 2008 | 93 | 2008 |
| On the induced matching problem I Kanj, MJ Pelsmajer, M Schaefer, G Xia Journal of Computer and System Sciences 77 (6), 1058-1070, 2011 | 62 | 2011 |
| Simplicity is beauty: Improved upper bounds for vertex cover J Chen, IA Kanj, G Xia Manuscript communicated by email, 2005 | 61 | 2005 |
| Separability and topology control of quasi unit disk graphs J Chen, A Jiang, IA Kanj, G Xia, F Zhang Wireless Networks 17, 53-67, 2011 | 57 | 2011 |
| Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems J Chen, IA Kanj, G Xia Algorithmica 43, 245-273, 2005 | 57 | 2005 |
| Toward the tight bound of the stretch factor of Delaunay triangulations G Xia, L Zhang CCCG 2011: Proceedings of the 23rd Canadian Conference on Computational Geometry, 2011 | 53 | 2011 |
| Parametric duality and kernelization: Lower bounds and upper bounds on kernel size J Chen, H Fernau, IA Kanj, G Xia Annual Symposium on Theoretical Aspects of Computer Science, 269-280, 2005 | 51 | 2005 |
| New and improved spanning ratios for Yao graphs L Barba, P Bose, M Damian, R Fagerberg, WL Keng, J O'Rourke, ... Proceedings of the thirtieth annual symposium on Computational geometry, 30-39, 2014 | 49 | 2014 |
| Improved upper bound on the stretch factor of Delaunay triangulations G Xia Proceedings of the twenty-seventh annual symposium on Computational geometry …, 2011 | 42 | 2011 |
| On the computational hardness based on linear FPT-reductions J Chen, X Huang, IA Kanj, G Xia Journal of Combinatorial Optimization 11, 231-247, 2006 | 42 | 2006 |
| Computing the flip distance between triangulations I Kanj, E Sedgwick, G Xia Discrete & Computational Geometry 58 (2), 313-344, 2017 | 30 | 2017 |
| Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems J Chen, IA Kanj, G Xia Algorithms and Computation: 14th International Symposium, ISAAC 2003, Kyoto …, 2003 | 30 | 2003 |
Jianer ChenProfessor of Computer Science, Texas A&M UniversityE-mailová adresa ověřena na: cse.tamu.edu
