Abstract
In this report, I start with a historic view of how, the two problems Vertex Cover and Dominating Set that were influential to the birth of the area of parameterized complexity, also led me to this area and introduced me to Mike Fellows. I also discuss early research and meetings in Parameterized Complexity, Mike’s influence in community building and some personal anecdotes with Mike. I conclude with some recent results on these two problems and also discuss open problems in the area.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balasubramanian, R., Fellows, M., Raman, V.: An improved fixed parameter algorithm for Vertex Cover. Information Processing Letters 65, 163–168 (1998)
Bar-Noy, A., Naor, J.: Sorting, minimal feedback sets, and Hamiltonial paths in Tournaments. SIAM J. Discrete Mathematics 3(1), 7–20 (1990)
Cai, L., Juedes, D.: On the existence of subexponential parameterized algorithms. Journal of Computer and Systems Sciences 67(4), 789–807 (2003); preliminary version in ICALP 2001
Downey, R., Fellows, M.: Parameterized Computational Feasibility. In: Clote, P., Remmel, J. (eds.) Proceedings of the Second Cornell Workshop on Feasible Mathematics, Feasible Mathematics II, pp. 219–244. Birkhauser, Boston (1995)
Downey, R., Fellows, M.R., Raman, V.: The complexity of irredundant sets parameterized by size. Discrete Applied Mathematics 100, 155–167 (2000)
Graham, R.L., Spencer, J.H.: A constructive solution to a tournament problem. Canadian Mathematics Bulletin 14, 45–48 (1971)
Philip, G., Raman, V., Sikdar, S.: A polynomial kernel for dominating set in Ki,j-free and d-degenerate graphs. To appear in ACM Transactions on Algorithms; a preliminary version in Proceedings of ESA 2009
Khot, S., Raman, V.: The Parameterized complexity of findng subgraphs with hereditary properties. Theoretical Computer Science 289, 997–1008 (2002); a preliminary version appeared in Proceedings of COCOON 2000
Mahajan, M., Raman, V.: Parameterizing above the guarantee: maxsat and maxcut. Journal of Algorithms 31, 335–354 (1999)
Megiddo, N., Vishkin, U.: On finding a minimum dominating set in a tournament (Note). Theoretical Computer Science 61(2-3), 307–316 (1988)
Lokshtanov, D., Narayanaswamy, N.S., Raman, V., Ramanujan, M.S., Saurabh, S.: Faster Parameterized Algorithms using Linear Programming, http://arXiv.org/abs/1203.0833 ; preliminary version appeared as LP can be a cure for parameterized algorithms. In: The Proceedings of STACS 2012
Table of FPT races, http://fpt.wikidot.com/fpt-races
Papadimitriou, C.H., Yannakakis, M.: On Limited non-determinism and the complexity of the V-C Dimension. Journal of Computer and Systems Sciences 53(2), 161–170 (1996)
Raman, V.: Some hard problems in (weighted) tournaments. In: Proceedings of the Fifth National Seminar on Theoretical Computer Science, Bombay, pp. 115–122 (1995)
Raman, V.: Parameterized Complexity. In: Proceedings of the Seventh National Seminar on Theoretical Computer Science, Chennai, pp. I1–I18 (June 1997)
Raman, V., Saurabh, S.: Short cycles make W-hard problems hard; FPT algorithms for hard problems in graphs with no short cycles. Algorithmica 52(2), 203–225 (2008); preliminary version in the Proceedings of SWAT 2006
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Raman, V. (2012). Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds) The Multivariate Algorithmic Revolution and Beyond. Lecture Notes in Computer Science, vol 7370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30891-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-30891-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30890-1
Online ISBN: 978-3-642-30891-8
eBook Packages: Computer ScienceComputer Science (R0)