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:
Google Scholar Profile:
Most recent papers:
- ``An O(3.82^k) Time FPT Algorithm for Convex Flip Distance'' (with H. Li), Discrete and Computational Geometry, accepted.
- ``Near-Optimal Algorithms for Point-Line Covering Problems'' (with J. Chen, Q. Huang, and I. Kanj), STACS 2022.
- ``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)
|