Ge Xia
Ge Xia
Dirección de correo verificada de lafayette.edu
TítuloCitado porAño
Improved upper bounds for vertex cover
J Chen, IA Kanj, G Xia
Theoretical Computer Science 411 (40-42), 3736-3756, 2010
2802010
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
1892006
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
1862005
Improved parameterized upper bounds for vertex cover
J Chen, IA Kanj, G Xia
International symposium on mathematical foundations of computer science, 238-249, 2006
1452006
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
1302007
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
1182004
Seeing the trees and their branches in the network is hard
IA Kanj, L Nakhleh, C Than, G Xia
Theoretical Computer Science, 82-93, 2007
732007
Simplicity is beauty: Improved upper bounds for vertex cover
J Chen, IA Kanj, G Xia
Manuscript communicated by email, 2005
582005
The stretch factor of the Delaunay triangulation is less than 1.998
G Xia
SIAM Journal on Computing 42 (4), 1620-1659, 2013
532013
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
502005
Separability and topology control of quasi unit disk graphs
J Chen, AA Jiang, IA Kanj, G Xia, F Zhang
Wireless Networks 17 (1), 53-67, 2011
482011
Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems
J Chen, IA Kanj, G Xia
Algorithmica 43 (4), 245-273, 2005
472005
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
452015
On the induced matching problem
I Kanj, MJ Pelsmajer, M Schaefer, G Xia
Journal of Computer and System Sciences 77 (6), 1058-1070, 2011
432011
Improved upper bound on the stretch factor of delaunay triangulations
G Xia
Proceedings of the twenty-seventh annual symposium on Computational geometry …, 2011
352011
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
332011
On the computational hardness based on linear FPT-reductions
J Chen, X Huang, IA Kanj, G Xia
Journal of Combinatorial Optimization 11 (2), 231-247, 2006
332006
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
312014
Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems
J Chen, IA Kanj, G Xia
International Symposium on Algorithms and Computation, 148-157, 2003
302003
Polynomial time approximation schemes and parameterized complexity
J Chen, X Huang, IA Kanj, G Xia
Discrete Applied Mathematics 155 (2), 180-193, 2007
202007
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20