Teaching

• CS202: Analysis of Algorithms, Fall 2024 (2 sections), Lafayette College.
• List of previous courses

Research

My current research interests are in theoretical computer science. The two main areas I have worked on include (1) parameterized complexity and algorithms of NP-hard problems, including their applications in bioinformatics, and (2) computational geometry and its applications in mobile computing.

A list of my publications:

• List of publications (DBLP)

Google Scholar Profile:

• Google Scholar: Ge Xia

Most recent papers:

• ``Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data'' (with J. Chen, Q. Huang, and I. Kanj), Algorithmica 86(8): 2448-2478 (2024).
  
  
• ``An O(3.82^k) Time FPT Algorithm for Convex Flip Distance'' (with H. Li), Discrete and Computational Geometry, 44:1-44:14 (2023).
  
  
• ``Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time'' (with J. Chen, Q. Huang, and I. Kanj), ISAAC 2021.
  
  
• ``On the Problem of Covering a 3-D Terrain'' (With E. Eiben, I.S. Godage, and I. Kanj), AAAI 2020.
  
  
• ``The Complexity of Tree Partitioning (With Zhao An, Qilong Feng, and Iyad A. Kanj), Algorithmica 82(9): 2606-2643 (2020)