Abstract
We conclude with a number of open problems. Some of them are of a fundamental nature and some of them can serve as starting points for newcomers in the field.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
References
Williams, R.: Improving exhaustive search implies superpolynomial lower bounds. In: Proceedings of 42th ACM Symposium on Theory of Computing (STOC 2010), pp. 231–240. ACM (2010)
Björklund, A.: Determinant sums for undirected hamiltonicity. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), to appear. IEEE (2010)
Razgon, I.: Computing minimum directed feedback vertex set in O(1.9977n). In: Proceedings of the 10th Italian Conference on Theoretical Computer Science, (ICTCS 2007), pp. 70–81. World Scientific (2007)
Fomin, F.V., Grandoni, F., Pyatkin, A.V., Stepanov, A.: Bounding the number of minimal dominating sets: a measure and conquer approach. In: Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), Lecture Notes in Comput. Sci., vol. 3827, pp. 573–582. Springer (2005)
Fomin, F.V., Gaspers, S., Pyatkin, A.V., Razgon, I.: On the minimum feedback vertex set problem: Exact and enumeration algorithms. Algorithmica 52(2), 293–307 (2008).
Moon, J.W.: On maximal transitive subtournaments. Proc. Edinburgh Math. Soc. (2) 17, 345–349 (1971)
Gaspers, S., Mnich, M.: On feedback vertex sets in tournaments. In: Proceedings of the 18th European Sympsium on Algorithms (ESA 2010), Lecture Notes in Comput. Sci., vol. 6346, pp. 267–277. Springer (2010)
Fomin, F.V., Villanger, Y.: Treewidth computation and extremal combinatorics. In: Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP 2008), Lecture Notes in Comput. Sci., vol. 5125, pp. 210–221. Springer (2008)
Fomin, F.V., Villanger, Y.: Finding induced subgraphs via minimal triangulations. In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), Leibniz International Proceedings in Informatics, vol. 5, pp. 383–394. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (2010)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fomin, F.V., Kratsch, D. (2010). Conclusions, Open Problems and Further Directions. In: Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16533-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-16533-7_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16532-0
Online ISBN: 978-3-642-16533-7
eBook Packages: Computer ScienceComputer Science (R0)