default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGe Xia
Publications
- 2024
[j35]Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data. Algorithmica 86(8): 2448-2478 (2024)- 2023
- [i11]Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia:
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. CoRR abs/2310.10815 (2023) - 2022
- [j34]Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Near-optimal algorithms for point-line fitting problems. J. Comput. Geom. 13(1) (2022) - [c36]Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Near-Optimal Algorithms for Point-Line Covering Problems. STACS 2022: 21:1-21:18 - 2021
- [c35]Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia:
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. ISAAC 2021: 48:1-48:17 - [i9]Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Optimal Streaming Algorithms for Graph Matching. CoRR abs/2102.06939 (2021) - 2020
- [j33]Zhao An, Qilong Feng, Iyad Kanj, Ge Xia:
The Complexity of Tree Partitioning. Algorithmica 82(9): 2606-2643 (2020) - [c34]Eduard Eiben, Isuru S. Godage, Iyad Kanj, Ge Xia:
On the Problem of Covering a 3-D Terrain. AAAI 2020: 10361-10368 - [i8]Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Near-Optimal Algorithms for Point-Line Covering Problems. CoRR abs/2012.02363 (2020) - 2017
- [j32]Iyad A. Kanj, Eric Sedgwick, Ge Xia:
Computing the Flip Distance Between Triangulations. Discret. Comput. Geom. 58(2): 313-344 (2017) - [j31]Iyad A. Kanj, Dimitrios M. Thilikos, Ge Xia:
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. Inf. Comput. 257: 139-156 (2017) - [c33]Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia:
The Complexity of Tree Partitioning. WADS 2017: 37-48 - [i7]Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia:
The Complexity of Tree Partitioning. CoRR abs/1704.05896 (2017) - 2015
- [j27]Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
There are Plane Spanners of Degree 4 and Moderate Stretch Factor. Discret. Comput. Geom. 53(3): 514-546 (2015) - [j25]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong
, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu:
Improved parameterized and exact algorithms for cut problems on trees. Theor. Comput. Sci. 607: 455-470 (2015) - [c31]Iyad A. Kanj, Ge Xia:
Flip Distance Is in FPT Time O(n+ k * c^k). STACS 2015: 500-512 - 2014
- [j24]Iyad A. Kanj, Ge Xia:
On certain geometric properties of the Yao-Yao graphs. J. Comb. Optim. 27(1): 78-87 (2014) - [c30]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu:
Algorithms for Cut Problems on Trees. COCOA 2014: 283-298 - [c29]Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
There are Plane Spanners of Maximum Degree 4. SoCG 2014: 20 - [i6]Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
There are Plane Spanners of Maximum Degree 4. CoRR abs/1403.5350 (2014) - [i5]Iyad A. Kanj, Ge Xia:
Flip Distance is in FPT time $O(n+ k \cdot c^k)$. CoRR abs/1407.1525 (2014) - 2013
- [j22]Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang:
Parameterized top-K algorithms. Theor. Comput. Sci. 470: 105-119 (2013) - [c27]Iyad A. Kanj, Ge Xia, Binhai Zhu:
The Radiation Hybrid Map Construction Problem Is FPT. ISBRA 2013: 5-16 - [c26]Iyad A. Kanj, Ge Xia:
When Is Weighted Satisfiability FPT? WADS 2013: 451-462 - [i4]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu:
Algorithms for Cut Problems on Trees. CoRR abs/1304.3653 (2013) - 2012
- [j20]Iyad A. Kanj, Ge Xia:
Improved local algorithms for spanner construction. Theor. Comput. Sci. 453: 54-64 (2012) - [j19]Jonathan P. Jenkins, Iyad A. Kanj, Ge Xia, Fenghui Zhang:
Local Construction of Spanners in the 3D Space. IEEE Trans. Mob. Comput. 11(7): 1140-1150 (2012) - [c25]Iyad A. Kanj, Ge Xia:
On Certain Geometric Properties of the Yao-Yao Graphs. COCOA 2012: 223-233 - 2011
- [j18]Shiliang Cui, Iyad A. Kanj, Ge Xia:
On the stretch factor of Delaunay triangulations of points in convex position. Comput. Geom. 44(2): 104-109 (2011) - [j17]Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia:
On the induced matching problem. J. Comput. Syst. Sci. 77(6): 1058-1070 (2011) - [j15]Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang:
Separability and topology control of quasi unit disk graphs. Wirel. Networks 17(1): 53-67 (2011) - [i1]Iyad A. Kanj, Ge Xia:
What makes normalized weighted satisfiability tractable. CoRR abs/1112.1040 (2011) - 2010
- [j14]Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
On Spanners and Lightweight Spanners of Geometric Graphs. SIAM J. Comput. 39(6): 2132-2161 (2010) - [j13]Jianer Chen, Iyad A. Kanj, Ge Xia:
Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40-42): 3736-3756 (2010) - [c21]Iyad A. Kanj, Ge Xia:
Improved Local Algorithms for Spanner Construction. ALGOSENSORS 2010: 1-15 - 2009
- [j12]Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang:
On the pseudo-achromatic number problem. Theor. Comput. Sci. 410(8-10): 818-829 (2009) - [j11]Jianer Chen, Iyad A. Kanj, Ge Xia:
On parameterized exponential time complexity. Theor. Comput. Sci. 410(27-29): 2641-2648 (2009) - [j10]Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks. IEEE Trans. Mob. Comput. 8(4): 460-474 (2009) - [c19]Shiliang Cui, Iyad A. Kanj, Ge Xia:
On the Dilation of Delaunay Triangulations of Points in Convex Position. CCCG 2009: 161-164 - [c18]Iyad A. Kanj, Ge Xia, Fenghui Zhang:
Local Construction of Spanners in the 3-D Space. DCOSS 2009: 315-328 - [c17]Jianer Chen, Iyad A. Kanj, Ge Xia:
On Parameterized Exponential Time Complexity. TAMC 2009: 168-177 - 2008
- [j9]Iyad A. Kanj, Luay Nakhleh, Ge Xia:
The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. Algorithmica 51(2): 99-128 (2008) - [j8]Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia:
Seeing the trees and their branches in the network is hard. Theor. Comput. Sci. 401(1-3): 153-164 (2008) - [c16]Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer:
On the Induced Matching Problem. STACS 2008: 397-408 - [c15]Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
Computing Lightweight Spanners Locally. DISC 2008: 365-378 - [c14]Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang:
On the Pseudo-achromatic Number Problem. WG 2008: 78-89 - 2007
- [j7]Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
Polynomial time approximation schemes and parameterized complexity. Discret. Appl. Math. 155(2): 180-193 (2007) - [j6]Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia:
Genus characterizes the complexity of certain graph problems: Some tight results. J. Comput. Syst. Sci. 73(6): 892-907 (2007) - [j5]Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia:
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. SIAM J. Comput. 37(4): 1077-1106 (2007) - [c13]Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. DIALM-POMC 2007 - [c12]Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia:
Seeing the Trees and Their Branches in the Forest is Hard. ICTCS 2007: 82-93 - [c11]Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang:
Separability and Topology Control of Quasi Unit Disk Graphs. INFOCOM 2007: 2225-2233 - 2006
- [j4]Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
On the computational hardness based on linear FPT-reductions. J. Comb. Optim. 11(2): 231-247 (2006) - [j3]Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72(8): 1346-1367 (2006) - [c10]Iyad A. Kanj, Luay Nakhleh, Ge Xia:
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. COCOON 2006: 299-308 - [c9]Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang:
On the Effective Enumerability of NP Problems. IWPEC 2006: 215-226 - [c8]Jianer Chen, Iyad A. Kanj, Ge Xia:
Improved Parameterized Upper Bounds for Vertex Cover. MFCS 2006: 238-249 - 2005
- [j2]Jianer Chen, Iyad A. Kanj, Ge Xia:
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. Algorithmica 43(4): 245-273 (2005) - [j1]Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia:
Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. 201(2): 216-231 (2005) - [c7]Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. COCOON 2005: 975-984 - [c6]Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia:
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. STACS 2005: 269-280 - 2004
- [c5]Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia:
Tight Lower Bounds for Certain Parameterized NP-Hard Problems. CCC 2004: 150-160 - [c4]Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
Polynomial Time Approximation Schemes and Parameterized Complexity. MFCS 2004: 500-512 - [c3]Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
Linear FPT reductions and computational lower bounds. STOC 2004: 212-221 - 2003
- [c2]Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia:
Genus Characterizes the Complexity of Graph Problems: Some Tight Results. ICALP 2003: 845-856 - [c1]Jianer Chen, Iyad A. Kanj, Ge Xia:
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. ISAAC 2003: 148-157
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-31 20:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
