Xia, Ge "Frank" - Department of Computer Science, Lafayette College

Advanced Search

Xia, Ge "Frank" - Department of Computer Science, Lafayette College

Genus Characterizes the Complexity of Certain Graph Problems: Some Tight Results
Separability and Topology Control of Quasi Unit Disk Graphs
June 8, 2007 11:58 WSPC -Proceedings Trim Size: 9in x 6in ws-draftfinalsubmission SEEING THE TREES AND THEIR BRANCHES
W -Hardness under Linear FPT-Reductions: Structural Properties and Further Applications
On the Effective Enumerability of NP Problems Jianer Chen
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-hard Problems
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-hard Problems
Improved Parameterized Upper Bounds for Vertex Cover
CCCG 2009, Vancouver, BC, August 1719, 2009 On the Dilation of Delaunay Triangulations of Points in Convex Position
!#"%$& !#"'()01(234"5 6701!98 @BA9C#D7EGFIHPC#Q#RTS UVRXW#Y`badcfehgdiperq#`#s#cutvpw x iycfC
Strong Computational Lower Bounds via Parameterized Complexity
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Local Algorithms for Constructing Spanners: Improved Bounds Iyad A. Kanj
On the Small Cycle Transversal of Planar Graphs We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
Linear FPT Reductions and Computational Lower Bounds Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, and Ge Xia
An Optimal Localized Approximation Scheme for Euclidean MST Iyad A. Kanj
Strictly Localized Construction of Planar Bounded-Degree Spanners of Unit Disk Graphs
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and