Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7370))

Abstract

Many of the foundational parameterized tenets discussed in this festschrift actually predate by over a decade the first systematic treatments of fixed-parameter tractability. In this frank, firsthand account I will, to the best of my recollection, describe some of the earliest research avenues Mike Fellows and I pursued that would turn out later to be highly relevant to parameterized complexity. Although we did not know it at the time, these were the origins and formative years of this burgeoning new field. Readers unfamiliar with the history of fixed-parameter tractability may be surprised to learn that its initial motivations arose from, of all things, automation and optimization for integrated circuit design.

Prehistory (from the Latin, with præ meaning before, and historia meaning story) is often defined as the period before a story is recorded. And that is what this tale is all about. It is an account of the genesis of fixed-parameter tractability, before the field had its terminology or even its name.

This narrative account was made possible in part by the National Science Foundation under grants MIP-8703879 and MIP-8919312, and by the Office of Naval Research under contract N00014-90-J-1855.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chen, J., Kanj, I.A., Xia, G.: Simplicity is beauty: Improved upper bounds for vertex cover. Technical Report TR05-008, DePaul University, Chicago, Illinois (2005)

    Google Scholar 

  2. Deo, N., Krishnamoorthy, M.S., Langston, M.A.: Exact and approximate solutions for the gate matrix layout problem. IEEE Transactions on Computer Aided Design 6, 79–84 (1987)

    Article  Google Scholar 

  3. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)

    Google Scholar 

  4. Fellows, M.R., Langston, M.A.: Nonconstructive advances in polynomial-time complexity. Information Processing Letters 26, 157–162 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fellows, M.R., Langston, M.A.: Nonconstructive tools for proving polynomial-time decidability. Journal of the ACM 35, 727–739 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fellows, M.R., Langston, M.A.: On search, decision and the efficiency of polynomial-time algorithms. In: Proceedings of ACM Symposium on Theory of Computing, pp. 501–512 (1989)

    Google Scholar 

  7. Fellows, M.R., Langston, M.A.: On well-partial-order theory and its application to combinatorial problems of VLSI design. SIAM Journal on Discrete Mathematics 5, 117–126 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  8. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of \(\cal NP\)-Completeness. W.H. Freeman and Company, New York (1979)

    MATH  Google Scholar 

  9. Kashiwabara, T., Fujisawa, T.: An \(\cal NP\)-complete problem on interval graphs. In: Proceedings of IEEE Symposium on Circuits and Systems, pp. 657–660 (1979)

    Google Scholar 

  10. Kinnersley, N.G.: The vertex separation of a graph equals its path-width. Information Processing Letters 42, 345–350 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kinnersley, N.G., Langston, M.A.: Obstruction set isolation for the gate matrix layout problem. Discrete Applied Mathematics 54, 169–213 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kuratowski, K.: Sur le problème des courbes gaushes en topologie. Fundamenta Mathematicae (French) 15, 271–283 (1930)

    MATH  Google Scholar 

  13. Levin, L.A.: Universal enumeration problems. Problemic Peredaci Informacii (Russian) 3, 115–116 (1972)

    Google Scholar 

  14. Lopez, A.D., Law, H.-F.S.: A dense gate matrix layout method for MOS VLSI. IEEE Transactions on Electron Devices 27, 1671–1675 (1980)

    Article  Google Scholar 

  15. Robertson, N., Seymour, P.D.: Disjoint paths - a survey. Journal of Algebraic and Discrete Methods 6, 300–305 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  16. Robertson, N., Seymour, P.D.: Graph minors IV. Tree-width and well-quasi-ordering. Journal of Combinatorial Theory, Series B 48, 227–254 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  17. Robertson, N., Seymour, P.D.: Graph minors XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B 63, 65–110 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  18. Robertson, N., Seymour, P.D.: Graph minors XX. Wagner’s conjecture. Journal of Combinatorial Theory, Series B 92, 325–357 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Langston, M.A. (2012). Fixed-Parameter Tractability, A Prehistory,. 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_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30891-8_1

  • 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)

Publish with us

Policies and ethics