Author:
Binkele-Raible Daniel,Fernau Henning,Gaspers Serge,Liedloff Mathieu
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference47 articles.
1. Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65(1–3), 21–46 (1996)
2. Bellman, R.: Dynamic programming treatment of the Travelling Salesman Problem. J. Assoc. Comput. Mach. 9, 61–63 (1962)
3. Binkele-Raible, D.: Amortized analysis of exponential time- and parameterized algorithms: Measure & Conquer and Reference Search Trees. Ph.D. Thesis, Universität Trier, Germany (2010)
4. Binkele-Raible, D., Brankovic, L., Cygan, M., Fernau, H., Kneis, J., Kratsch, D., Langer, A., Liedloff, M., Pilipczuk, M., Rossmanith, P., Wojtaszczyk, J.O.: Breaking the 2 n -barrier for Irredundance: two lines of attack. J. Discrete Algorithms 9, 214–230 (2011)
5. Lecture Notes in Computer Science;D. Binkele-Raible,2010
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献