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

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