Author:
Gurski Frank,Rothe Irene,Rothe Jörg,Wanke Egon
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. G. Woeginger. Exact algorithms for NP-hard problems. In M.Jünger, G. Reinelt, and G. Rinaldi, editors, Combinatorical Optimization: “Eureka, you shrink!”, pages 185–207. Springer-Verlag Lecture Notes in Computer Science #2570, 2003.
2. R. Tarjan and A. Trojanowski. Finding a maximum independent set. SIAM Journal on Computing, 6(3):537–546, 1977.
3. V. Guruswami and S. Khanna. On the hardness of 4-coloring a 3-colorable graph. SIAM Journal on Discrete Mathematics, 18(1):30–40, 2004.
4. D. Eppstein. Quasiconvex analysis of backtracking algorithms. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 788–797. Society for Industrial and Applied Mathematics, January 2004.
5. I. Holyer. The NP-completeness of edge-coloring. SIAM Journal on Computing, 10(4):718–720, 1981.