No. Title Author Year
1 An 𝒪(3.82^k) Time FPT Algorithm for Convex Flip Distance Li, Haohong et al. 2023
2 Near-Optimal Algorithms for Point-Line Covering Problems Chen, Jianer et al. 2022
3 Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time Chen, Jianer et al. 2021
4 Flip Distance Is in FPT Time O(n+ k * c^k) Kanj, Iyad et al. 2015
5 On the Induced Matching Problem Kanj, Iyad A. et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 5


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI