×

zbMATH — the first resource for mathematics

Xia, Ge

Compute Distance To:
Author ID: xia.ge Recent zbMATH articles by "Xia, Ge"
Published as: Xia, Ge
External Links: MGP
Documents Indexed: 52 Publications since 2003

Publications by Year

Citations contained in zbMATH Open

40 Publications have been cited 438 times in 340 Documents Cited by Year
Improved upper bounds for vertex cover. Zbl 1205.05217
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
77
2010
Tight lower bounds for certain parameterized NP-hard problems. Zbl 1161.68476
Chen, Jianer; Chor, Benny; Fellows, Mike; Huang, Xiuzhen; Juedes, David; Kanj, Iyad A.; Xia, Ge
57
2005
Strong computational lower bounds via parameterized complexity. Zbl 1119.68092
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
45
2006
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. Zbl 1141.05075
Chen, Jianer; Fernau, Henning; Kanj, Iyad A.; Xia, Ge
42
2007
Linear FPT reductions and computational lower bounds. Zbl 1192.68313
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
27
2004
Seeing the trees and their branches in the network is hard. Zbl 1147.68059
Kanj, Iyad A.; Nakhleh, Luay; Than, Cuong; Xia, Ge
22
2008
Improved parameterized upper bounds for Vertex Cover. Zbl 1132.68421
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
21
2006
The stretch factor of the Delaunay triangulation is less than 1.998. Zbl 1302.65059
Xia, Ge
18
2013
Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems. Zbl 1086.68099
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
11
2005
On the computational hardness based on linear fpt-reductions. Zbl 1130.90064
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
10
2006
Computing the flip distance between triangulations. Zbl 1371.05063
Kanj, Iyad; Sedgwick, Eric; Xia, Ge
8
2017
On the induced matching problem. Zbl 1235.05114
Kanj, Iyad; Pelsmajer, Michael J.; Schaefer, Marcus; Xia, Ge
8
2011
New and improved spanning ratios for Yao graphs. Zbl 1395.68282
Barba, Luis; Bose, Prosenjit; Damian, Mirela; Fagerberg, Rolf; Keng, Wah Loon; O’Rourke, Joseph; van Renssen, André; Taslakian, Perouz; Verdonschot, Sander; Xia, Ge
7
2015
There are plane spanners of degree 4 and moderate stretch factor. Zbl 1314.05132
Bonichon, Nicolas; Kanj, Iyad; Perković, Ljubomir; Xia, Ge
7
2015
Polynomial time approximation schemes and parameterized complexity. Zbl 1109.68135
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
7
2007
Genus characterizes the complexity of certain graph problems: Some tight results. Zbl 1121.68086
Chen, Jianer; Kanj, Iyad A.; Perković, Ljubomir; Sedgwick, Eric; Xia, Ge
6
2007
On spanners and lightweight spanners of geometric graphs. Zbl 1221.05294
Kanj, Iyad A.; Perković, Ljubomir; Xia, Ge
6
2010
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. Zbl 1118.68506
Chen, Jianer; Fernau, Henning; Kanj, Iyad A.; Xia, Ge
5
2005
Polynomial time approximation schemes and parameterized complexity. Zbl 1096.68166
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
5
2004
On the stretch factor of Delaunay triangulations of points in convex position. Zbl 1217.65046
Cui, Shiliang; Kanj, Iyad A.; Xia, Ge
5
2011
On the induced matching problem. Zbl 1259.68095
Kanj, Iyad A.; Pelsmajer, Michael J.; Xia, Ge; Schaefer, Marcus
5
2008
Flip distance is in FPT time \(O(n+ k \cdot c^k)\). Zbl 1355.68280
Kanj, Iyad; Xia, Ge
4
2015
Improved upper bound on the stretch factor of Delaunay triangulations. Zbl 1283.68381
Xia, Ge
4
2011
On the small cycle transversal of planar graphs. Zbl 1217.68114
Xia, Ge; Zhang, Yong
4
2011
Kernelization for cycle transversal problems. Zbl 1286.05074
Xia, Ge; Zhang, Yong
3
2010
On the pseudo-achromatic number problem. Zbl 1162.68022
Chen, Jianer; Kanj, Iyad A.; Meng, Jie; Xia, Ge; Zhang, Fenghui
3
2009
Edge-disjoint packing of stars and cycles. Zbl 1344.68097
Jiang, Minghui; Xia, Ge; Zhang, Yong
2
2016
New and improved spanning ratios for Yao graphs. Zbl 1395.68283
Barba, Luis; Bose, Prosenjit; Damian, Mirela; Fagerberg, Rolf; Keng, Wah Loon; O’Rourke, Joseph; van Renssen, André; Taslakian, Perouz; Verdonschot, Sander; Xia, Ge
2
2014
\(W\)-hardness under linear FPT-reductions: Structural properties and further applications. Zbl 1128.68362
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
2
2005
Computing lightweight spanners locally. Zbl 1161.68342
Kanj, Iyad A.; Perković, Ljubomir; Xia, Ge
2
2008
On the effective enumerability of NP problems. Zbl 1154.68423
Chen, Jianer; Kanj, Iyad A.; Meng, Jie; Xia, Ge; Zhang, Fenghui
2
2006
On parameterized exponential time complexity. Zbl 1172.68023
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
2
2009
Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems. Zbl 1205.68530
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
2
2003
Improved parameterized and exact algorithms for cut problems on trees. Zbl 1333.05293
Kanj, Iyad; Lin, Guohui; Liu, Tian; Tong, Weitian; Xia, Ge; Xu, Jinhui; Yang, Boting; Zhang, Fenghui; Zhang, Peng; Zhu, Binhai
1
2015
Genus characterizes the complexity of graph problems: Some tight results. Zbl 1039.68092
Chen, Jianer; Kanj, Iyad A.; Perković, Ljubomir; Sedgwick, Eric; Xia, Ge
1
2003
Algorithms for cut problems on trees. Zbl 1409.05197
Kanj, Iyad; Lin, Guohui; Liu, Tian; Tong, Weitian; Xia, Ge; Xu, Jinhui; Yang, Boting; Zhang, Fenghui; Zhang, Peng; Zhu, Binhai
1
2014
Improved local algorithms for spanner construction. Zbl 1247.68019
Kanj, Iyad A.; Xia, Ge
1
2012
Kernelization for cycle transversal problems. Zbl 1242.05142
Xia, Ge; Zhang, Yong
1
2012
Reconstructing evolution of natural languages: complexity and parameterized algorithms. Zbl 1162.91536
Kanj, Iyad A.; Nakhleh, Luay; Xia, Ge
1
2006
Parameterized top-\(K\) algorithms. Zbl 1259.68078
Chen, Jianer; Kanj, Iyad A.; Meng, Jie; Xia, Ge; Zhang, Fenghui
1
2013
Computing the flip distance between triangulations. Zbl 1371.05063
Kanj, Iyad; Sedgwick, Eric; Xia, Ge
8
2017
Edge-disjoint packing of stars and cycles. Zbl 1344.68097
Jiang, Minghui; Xia, Ge; Zhang, Yong
2
2016
New and improved spanning ratios for Yao graphs. Zbl 1395.68282
Barba, Luis; Bose, Prosenjit; Damian, Mirela; Fagerberg, Rolf; Keng, Wah Loon; O’Rourke, Joseph; van Renssen, André; Taslakian, Perouz; Verdonschot, Sander; Xia, Ge
7
2015
There are plane spanners of degree 4 and moderate stretch factor. Zbl 1314.05132
Bonichon, Nicolas; Kanj, Iyad; Perković, Ljubomir; Xia, Ge
7
2015
Flip distance is in FPT time \(O(n+ k \cdot c^k)\). Zbl 1355.68280
Kanj, Iyad; Xia, Ge
4
2015
Improved parameterized and exact algorithms for cut problems on trees. Zbl 1333.05293
Kanj, Iyad; Lin, Guohui; Liu, Tian; Tong, Weitian; Xia, Ge; Xu, Jinhui; Yang, Boting; Zhang, Fenghui; Zhang, Peng; Zhu, Binhai
1
2015
New and improved spanning ratios for Yao graphs. Zbl 1395.68283
Barba, Luis; Bose, Prosenjit; Damian, Mirela; Fagerberg, Rolf; Keng, Wah Loon; O’Rourke, Joseph; van Renssen, André; Taslakian, Perouz; Verdonschot, Sander; Xia, Ge
2
2014
Algorithms for cut problems on trees. Zbl 1409.05197
Kanj, Iyad; Lin, Guohui; Liu, Tian; Tong, Weitian; Xia, Ge; Xu, Jinhui; Yang, Boting; Zhang, Fenghui; Zhang, Peng; Zhu, Binhai
1
2014
The stretch factor of the Delaunay triangulation is less than 1.998. Zbl 1302.65059
Xia, Ge
18
2013
Parameterized top-\(K\) algorithms. Zbl 1259.68078
Chen, Jianer; Kanj, Iyad A.; Meng, Jie; Xia, Ge; Zhang, Fenghui
1
2013
Improved local algorithms for spanner construction. Zbl 1247.68019
Kanj, Iyad A.; Xia, Ge
1
2012
Kernelization for cycle transversal problems. Zbl 1242.05142
Xia, Ge; Zhang, Yong
1
2012
On the induced matching problem. Zbl 1235.05114
Kanj, Iyad; Pelsmajer, Michael J.; Schaefer, Marcus; Xia, Ge
8
2011
On the stretch factor of Delaunay triangulations of points in convex position. Zbl 1217.65046
Cui, Shiliang; Kanj, Iyad A.; Xia, Ge
5
2011
Improved upper bound on the stretch factor of Delaunay triangulations. Zbl 1283.68381
Xia, Ge
4
2011
On the small cycle transversal of planar graphs. Zbl 1217.68114
Xia, Ge; Zhang, Yong
4
2011
Improved upper bounds for vertex cover. Zbl 1205.05217
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
77
2010
On spanners and lightweight spanners of geometric graphs. Zbl 1221.05294
Kanj, Iyad A.; Perković, Ljubomir; Xia, Ge
6
2010
Kernelization for cycle transversal problems. Zbl 1286.05074
Xia, Ge; Zhang, Yong
3
2010
On the pseudo-achromatic number problem. Zbl 1162.68022
Chen, Jianer; Kanj, Iyad A.; Meng, Jie; Xia, Ge; Zhang, Fenghui
3
2009
On parameterized exponential time complexity. Zbl 1172.68023
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
2
2009
Seeing the trees and their branches in the network is hard. Zbl 1147.68059
Kanj, Iyad A.; Nakhleh, Luay; Than, Cuong; Xia, Ge
22
2008
On the induced matching problem. Zbl 1259.68095
Kanj, Iyad A.; Pelsmajer, Michael J.; Xia, Ge; Schaefer, Marcus
5
2008
Computing lightweight spanners locally. Zbl 1161.68342
Kanj, Iyad A.; Perković, Ljubomir; Xia, Ge
2
2008
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. Zbl 1141.05075
Chen, Jianer; Fernau, Henning; Kanj, Iyad A.; Xia, Ge
42
2007
Polynomial time approximation schemes and parameterized complexity. Zbl 1109.68135
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
7
2007
Genus characterizes the complexity of certain graph problems: Some tight results. Zbl 1121.68086
Chen, Jianer; Kanj, Iyad A.; Perković, Ljubomir; Sedgwick, Eric; Xia, Ge
6
2007
Strong computational lower bounds via parameterized complexity. Zbl 1119.68092
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
45
2006
Improved parameterized upper bounds for Vertex Cover. Zbl 1132.68421
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
21
2006
On the computational hardness based on linear fpt-reductions. Zbl 1130.90064
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
10
2006
On the effective enumerability of NP problems. Zbl 1154.68423
Chen, Jianer; Kanj, Iyad A.; Meng, Jie; Xia, Ge; Zhang, Fenghui
2
2006
Reconstructing evolution of natural languages: complexity and parameterized algorithms. Zbl 1162.91536
Kanj, Iyad A.; Nakhleh, Luay; Xia, Ge
1
2006
Tight lower bounds for certain parameterized NP-hard problems. Zbl 1161.68476
Chen, Jianer; Chor, Benny; Fellows, Mike; Huang, Xiuzhen; Juedes, David; Kanj, Iyad A.; Xia, Ge
57
2005
Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems. Zbl 1086.68099
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
11
2005
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. Zbl 1118.68506
Chen, Jianer; Fernau, Henning; Kanj, Iyad A.; Xia, Ge
5
2005
\(W\)-hardness under linear FPT-reductions: Structural properties and further applications. Zbl 1128.68362
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
2
2005
Linear FPT reductions and computational lower bounds. Zbl 1192.68313
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
27
2004
Polynomial time approximation schemes and parameterized complexity. Zbl 1096.68166
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
5
2004
Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems. Zbl 1205.68530
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
2
2003
Genus characterizes the complexity of graph problems: Some tight results. Zbl 1039.68092
Chen, Jianer; Kanj, Iyad A.; Perković, Ljubomir; Sedgwick, Eric; Xia, Ge
1
2003
all top 5

Cited by 500 Authors

24 Kanj, Iyad A.
21 Xia, Ge
18 Fernau, Henning
17 Chen, Jian-er
17 Saurabh, Saket
16 Bose, Prosenjit K.
15 Fomin, Fedor V.
11 Lokshtanov, Daniel
10 Niedermeier, Rolf
10 van Renssen, André
9 Guo, Jiong
9 Wang, Jianxin
8 Fellows, Michael Ralph
8 Golovach, Petr A.
8 Paschos, Vangelis Th.
8 Szeider, Stefan
8 Thilikos, Dimitrios M.
7 Bazgan, Cristina
7 Kratsch, Stefan
7 Lampis, Michael
7 van Iersel, Leo
6 Abu-Khzam, Faisal N.
6 de Carufel, Jean-Lou
6 Feng, Qilong
6 Gaspers, Serge
6 Hermelin, Danny
6 Komusiewicz, Christian
6 Liedloff, Mathieu
6 Perković, Ljubomir
6 Raman, Venkatesh
6 Semple, Charles
6 Villanger, Yngve
6 Xiao, Mingyu
6 Zhang, Fenghui
5 Bonichon, Nicolas
5 Bonnet, Edouard
5 Branković, Ljiljana
5 Escoffier, Bruno
5 Kelk, Steven
5 Kowalik, Łukasz
5 Marx, Dániel
5 Rosamond, Frances A.
5 Sau, Ignasi
5 Sikora, Florian
5 Tale, Prafullkumar
5 Verdonschot, Sander
5 Wahlström, Magnus
5 Zhu, Binhai
4 Casel, Katrin
4 Chitnis, Rajesh Hemant
4 Cygan, Marek
4 Damaschke, Peter
4 Damian, Mirela
4 Downey, Rodney Graham
4 Dumitrescu, Adrian
4 Gambette, Philippe
4 Ghosh, Anirban
4 Hartung, Sepp
4 Huang, Xiuzhen
4 Jansen, Klaus
4 Knauer, Christian
4 Krithika, R.
4 Linz, Simone
4 Mnich, Matthias
4 Paulusma, Daniël
4 Shachnai, Hadas
4 Song, Yinglei
4 Sorge, Manuel
4 Suchý, Ondřej
4 Zehavi, Meirav
4 Zhukovskiĭ, Maksim Evgen’evich
3 Baste, Julien
3 Binkele-Raible, Daniel
3 Bodlaender, Hans L.
3 Chen, Yijia
3 Fagerberg, Rolf
3 Feldmann, Andreas Emil
3 Giannopoulos, Panos
3 Giroudeau, Rodolphe
3 Izadi, Mohammad A.
3 Jansen, Bart M. P.
3 Jonsson, Peter A.
3 Li, Shouwei
3 Markarian, Christine
3 Meier, Arne
3 Meyer auf der Heide, Friedhelm
3 Misra, Neeldhara
3 Monnot, Jérôme
3 Moser, Hannes
3 Panolan, Fahad
3 Podlipyan, Pavel
3 Ramanujan, M. S.
3 Roth, Marc
3 Sattari, Sattar
3 Scornavacca, Celine
3 Tong, Weitian
3 Tóth, Csaba D.
3 van Bevern, René
3 van ’t Hof, Pim
3 Weller, Mathias
...and 400 more Authors
all top 5

Cited in 55 Serials

61 Theoretical Computer Science
34 Algorithmica
19 Discrete Applied Mathematics
18 Information Processing Letters
16 Journal of Computer and System Sciences
15 Computational Geometry
12 Theory of Computing Systems
12 Journal of Combinatorial Optimization
10 SIAM Journal on Discrete Mathematics
9 SIAM Journal on Computing
6 Discrete & Computational Geometry
6 Information and Computation
6 Journal of Discrete Algorithms
4 Bulletin of Mathematical Biology
4 Discrete Optimization
3 Artificial Intelligence
3 Journal of Mathematical Biology
3 International Journal of Computational Geometry & Applications
3 Discrete Mathematics, Algorithms and Applications
3 Algorithms
2 Acta Informatica
2 Discrete Mathematics
2 Operations Research Letters
2 European Journal of Operational Research
2 Journal of Graph Algorithms and Applications
2 ACM Transactions on Computational Logic
2 Computer Science Review
1 Advances in Applied Probability
1 Computing
1 Journal of Combinatorial Theory. Series A
1 Networks
1 Operations Research
1 European Journal of Combinatorics
1 Advances in Applied Mathematics
1 Graphs and Combinatorics
1 Journal of Complexity
1 Journal of Computer Science and Technology
1 Journal of Automated Reasoning
1 Annals of Operations Research
1 Random Structures & Algorithms
1 MSCS. Mathematical Structures in Computer Science
1 Journal of Global Optimization
1 International Journal of Computer Mathematics
1 Proceedings of the National Academy of Sciences of the United States of America
1 Computational Complexity
1 The Electronic Journal of Combinatorics
1 Annals of Mathematics and Artificial Intelligence
1 Sbornik: Mathematics
1 Constraints
1 Doklady Mathematics
1 Bulletin of the Malaysian Mathematical Sciences Society. Second Series
1 Optimization Letters
1 Logical Methods in Computer Science
1 Journal of Theoretical Biology
1 Bulletin of the Hellenic Mathematical Society

Citations by Year