Skip to main content
SpringerLink
Log in

Algorithms, Complexity, and Hans

  • Chapter
  • First Online:
Treewidth, Kernels, and Algorithms

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

  • 750 Accesses

Abstract

In this essay on the occasion of Hans Bodlaender’s 60th birthday, we recount some of the early developments in the field in which Hans made his mark and of their context at Utrecht University.

“The study of algorithms is at the very heart of computer science”

Aho, Hopcroft, Ullman, [1], 1974, p. iii

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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

References

  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, Reading (1974)

    MATH  Google Scholar 

  2. Bodlaender, H.L.: Distributed computing: structure and complexity. Ph.D. thesis, Utrecht University (1986). CWI Tract 43. CWI, Amsterdam (1987)

    Google Scholar 

  3. Bodlaender, H.L., van Leeuwen, J.: Simulations of large networks on smaller networks. Inf. Control 71, 143–180 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bodlaender, H.L.: Classes of graphs of bounded tree-width. Technical report RUU-CS-86-22, Department of Computer Science, Utrecht University, December 1986

    Google Scholar 

  5. Bodlaender, H.L.: Dynamic programming on graphs with bounded treewidth. Technical report MIT/LCS/TR-394, Laboratory for Computer Science, MIT, Cambridge (1987). Automata, Languages and Programming. In: Proceedings of 15th International Colloquium (ICALP 1988). LNCS, vol. 317, pp. 105–118. Springer, Berlin (1988)

    Google Scholar 

  6. Bodlaender, H.L.: NC-algorithms for graphs with small treewidth. In: van Leeuwen, J. (ed.) Graph-Theoretic Concepts in Computer Science, WG 1988. LNCS, vol. 344, pp. 1–10. Springer, Berlin (1989)

    Chapter  Google Scholar 

  7. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC 1993), pp. 226–234. ACM Press (1993). SIAM J. Comput. 25(6), 1305–1317 (1996)

    Google Scholar 

  8. Bodlaender, H.L., van Leeuwen, J., Tan, R., Thilikos, D.M.: On interval routing schemes and treewidth. Inf. Comput. 139(1), 92–109 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423–434 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)

    Book  MATH  Google Scholar 

  11. Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77(1), 91–106 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  12. Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. J. Comb. Theory Ser. B 35(1), 39–61 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  13. Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7(3), 309–322 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  14. Schoone, A.S., Bodlaender, H.L., van Leeuwen, J.: Diameter increase caused by edge deletion. J. Graph Theory 11, 409–427 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  15. Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (1994)

    Book  MATH  Google Scholar 

  16. van Leeuwen, J.: A fascinating science. In: Bodlaender, H.L., Duivesteijn, W., Nijenhuis, C.J. (eds.) Fascinating for computation - 25 jaar opleiding informatica. Department of Information and Computing Sciences, Utrecht University, pp. 33–45 (2008). http://www.cs.uu.nl/groups/AD/fasc.pdf

Download references

Acknowledgment

I thank Gerard Tel for useful comments on a preliminary version of this essay.

Author information

Authors and Affiliations

  1. Department of Information and Computing Sciences, Utrecht University, Princetonplein 5, 3584 CC, Utrecht, The Netherlands

    Jan van Leeuwen

Authors
  1. Jan van Leeuwen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jan van Leeuwen .

Editor information

Editors and Affiliations

  1. University of Bergen, Bergen, Norway

    Fedor V. Fomin

  2. Humboldt-University, Berlin, Germany

    Stefan Kratsch

  3. Utrecht University, Utrecht, The Netherlands

    Erik Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

van Leeuwen, J. (2020). Algorithms, Complexity, and Hans. In: Fomin, F.V., Kratsch, S., van Leeuwen, E.J. (eds) Treewidth, Kernels, and Algorithms. Lecture Notes in Computer Science(), vol 12160. Springer, Cham. https://doi.org/10.1007/978-3-030-42071-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-42071-0_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-42070-3

  • Online ISBN: 978-3-030-42071-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation