Ge Xia

Citat de

	Toate	Din 2020
Referințe bibliografice	2785	882
h-index	22	13
i10-index	36	16

200

100

150

200420052006200720082009201020112012201320142015201620172018201920202021202220232024202512 33 67 81 77 110 124 121 129 189 132 164 165 161 159 148 162 176 170 169 174 31

Acces public

Afișați-le pe toate

3 articole

2 articole

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Jianer ChenProfessor of Computer Science, Texas A&M UniversityAdresă de e-mail confirmată pe cse.tamu.edu
Ljubomir PerkovićProfessor, School of Computing, DePaul UniversityAdresă de e-mail confirmată pe cs.depaul.edu
Fenghui ZhangGoogle Inc.Adresă de e-mail confirmată pe google.com
Luay NakhlehProfessor of Computer Science and Dean of Engineering and Computing, Rice UniversityAdresă de e-mail confirmată pe rice.edu
Benny ChorProfessor of Computer Science, Tel-Aviv UniversityAdresă de e-mail confirmată pe cs.tau.ac.il
David JuedesAssociate Dean for Academics, Russ College of Engineering and Technology, Ohio UniversityAdresă de e-mail confirmată pe ohio.edu
Cuong Van ThanAxonAdresă de e-mail confirmată pe rice.edu
Prosenjit BoseCarleton UniversityAdresă de e-mail confirmată pe scs.carleton.ca
André van RenssenUniversity of SydneyAdresă de e-mail confirmată pe sydney.edu.au
Sander VerdonschotShopifyAdresă de e-mail confirmată pe cg.scs.carleton.ca
Marcus SchaeferDePaul UniversityAdresă de e-mail confirmată pe cdm.depaul.edu
Shiliang (John) CuiProfessor of Operations and Analytics, McDonough School of Business, Georgetown UniversityAdresă de e-mail confirmată pe georgetown.edu
Guohui LinComputing Science, University of AlbertaAdresă de e-mail confirmată pe ualberta.ca
Yuri KalnishkanReader in Computer Science, Royal Holloway, University of LondonAdresă de e-mail confirmată pe rhul.ac.uk
Wah Loon Keng

Urmăriți

Ge Xia

Lafayette College

Adresă de e-mail confirmată pe lafayette.edu

theoretical computer science


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
Improved upper bounds for vertex cover J Chen, IA Kanj, G Xia Theoretical Computer Science 411 (40-42), 3736-3756, 2010	474	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	330	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	260	2005
Improved parameterized upper bounds for vertex cover J Chen, IA Kanj, G Xia Mathematical Foundations of Computer Science 2006: 31st International …, 2006	206	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	140	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	139	2004
The stretch factor of the Delaunay triangulation is less than 1.998 G Xia SIAM Journal on Computing 42 (4), 1620-1659, 2013	113	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	94	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	92	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	63	2011
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	59	2011
Simplicity is beauty: Improved upper bounds for vertex cover J Chen, IA Kanj, G Xia Manuscript communicated by email, 2005	59	2005
Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems J Chen, IA Kanj, G Xia Algorithmica 43, 245-273, 2005	56	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	52	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	52	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	47	2014
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	43	2006
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
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
Computing the flip distance between triangulations I Kanj, E Sedgwick, G Xia Discrete & Computational Geometry 58 (2), 313-344, 2017	28	2017

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori