Publisher
Springer Berlin Heidelberg
Reference34 articles.
1. Lecture Notes in Computer Science;J. Alber,2002
2. Lecture Notes in Computer Science;J. Alber,2001
3. Abu-Khzam, F., Langston, M.A., Shanbhag, P., Symons, C.T.: High Performance Tools for Fixed-Parameter Tractable Implementations. In: WADS 2003 Workshop Presentation (2003)
4. Lecture Notes in Computer Science;J. Alber,2002
5. Arora, S.: Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems. In: Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (1996), pp. 2–12 (1996)
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set;Graph-Theoretic Concepts in Computer Science;2021
3. Hamiltonicity Below Dirac’s Condition;Graph-Theoretic Concepts in Computer Science;2019
4. Kernelization for $$P_2$$ -Packing: A Gerrymandering Approach;Frontiers in Algorithmics;2018
5. What Is Known About Vertex Cover Kernelization?;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2018