Author:
Hansen Kristoffer Arnsfelt,Hansen Thomas Dueholm,Miltersen Peter Bro,Sørensen Troels Bjerre
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Borgs, C., Chayes, J., Immorlica, N., Kalai, A.T., Mirrokni, V., Papadimitriou, C.: The myth of the folk theorem. In: Proceedings of the 40th annual ACM Symposium on Theory of Computing (STOC 2008), pp. 365–372 (2008)
2. Buss, J.F., Islam, T.: Simplifying the weft hierarchy. Theoretical Computer Science 351(3), 303–313 (2006)
3. Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D.W., Kanj, I.A., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems. Information and Computation 201(2), 216–231 (2005)
4. Chen, X., Teng, S.-H., Valiant, P.: The approximation complexity of win-lose games. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 159–168 (2007)
5. Chen, Y., Flum, J., Grohe, M.: Machine-based methods in parameterized complexity theory. Theoretical Computer Science 339(2–3), 167–199 (2005)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献