Skip to main content
SpringerLink
Log in

Collaborating with Hans: Some Remaining Wonderments

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

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

Abstract

This paper celebrates some family adventures, three concrete open problems and several research directions that have developed over our long collaboration.

The Norwegian NFR Toppforsk PCPC Project, The Bergen (BFS) Toppforsk.

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

Notes

  1. 1.

    We have been honoured to have the following scientists, and more, visit our informal research center in Australia: Andreas Pfandler, Bart Jansen, Benny Chor, Christian Komusiewicz, Christian Sloper, D’aniel Marx, Danny Hermelin, David Juedes, Dorothea Baumeister, Faisal Abu-Khzam, Frank Dehne, Frank Neumann, Falk Hüffner, Gábor Erdélyi, Hadas Shachnai, Henning Fernau, Jens Gramm, Jochen Alber, John Plaice, Jorg Rothe, Kim Stevens, Leo Brueggeman, Ljiljana Brankovic, Marike Bodlaender, Mark Jones, Martin Lackner, Mathias Weller, Matthew Suderman, Mattias Mnich, Michael Langston, Moritz Mueller, Nathanial Watt, Noy Rotbart, Peter Rosmanith, Peter Shaw, Ralph Bottesch, René Van Bevern, Rolf Neidermeier, Ronald DeHaan, Rudiger Reischuk, Rudolph Fleischer, Sagi Snir, Saket Saurabh, Serge Gaspers, Stephan Szeider, Ulrike Stege, Venkatesh Raman, Vlad Estivill-Castro, Yiannis Koutis.

References

  1. Downey, R.-G., Estivill-Castro, V., Fellows, M.-R., Prieto-Rodriguez, E., Rosamond, F.: Cutting up is hard to do: the parameterized complexity of k-cut and related problems. Electr. Notes Theor. Comput. Sci. 78, 209–222 (2003)

    Article  MATH  Google Scholar 

  2. Barefoot, C., Clark, H., Douthett, J., Entringer, R., Fellows, M.: Length 0 modulo 3 in graphs. Ann. Discret. Math. 87–101 (1991)

    Google Scholar 

  3. Edouard, B., Bousquet, N., Thomassé, S., Watrigant, R.: When maximum stable set can be solved in FPT time. In: 30th International Symposium on Algorithms and Computation (ISAAC), Article no. 49(22), pp. 1–49. Schloss Dagstuhl Leibniz Zentrum for Informatiks (2019)

    Google Scholar 

  4. Cai, L., Ye, J.: Parameterized complexity of connected induced subgraph problems. In: Gu, Q., Hell, P., Yang, B. (eds.) AAIM 2014. LNCS, vol. 8546, pp. 219–230. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-07956-1_20

    Chapter  Google Scholar 

  5. Dabrowski, K., Lozin, V., Müller, H., Rautenbach, D.: Parameterized algorithms for the independent set problem in some hereditary graph classes. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol. 6460, pp. 1–9. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19222-7_1

    Chapter  MATH  Google Scholar 

  6. Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS. Springer, London (2013). https://doi.org/10.1007/978-1-4471-5559-1

    Book  MATH  Google Scholar 

  7. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monograph in Computer Science. Springer, New York (1999). https://doi.org/10.1007/978-1-4612-0515-9

    Book  MATH  Google Scholar 

  8. Cattell, K., Dinneen, M., Downey, R., Fellows, M., Langston, M.: On computing graph minor obstruction sets. Theor. Comput. Sci. 233(1–2), 107–127 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fellows, M.R., Jaffke, L., Király, A.I., Rosamond, F.A., Weller, M.: What is known about vertex cover kernelization? In: Böckenhauer, H.-J., Komm, D., Unger, W. (eds.) Adventures Between Lower Bounds and Higher Altitudes. LNCS, vol. 11011, pp. 330–356. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-98355-4_19

    Chapter  Google Scholar 

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

    MATH  Google Scholar 

  11. de Berg, M., Bodlaender, H., Fellows, M., Knauer, C. (Scientific Organizers): Fixed-parameter computational geometry. In: Leiden Workshop, Lorentz Center (2016)

    Google Scholar 

  12. Downey, R., Fellows, M., Niedermeier, R., Rossmanith, P. (Scientific Organizers): Parameterized complexity. Dagstuhl Seminar 01311, Dagstuh (2001)

    Google Scholar 

  13. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. Assoc. Comput. Mach. 42(4), 844–856 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  14. Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 3–2(1), 326–336 (1952)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Bergen, 5020, Bergen, Norway

    Michael R. Fellows & Frances A. Rosamond

Authors
  1. Michael R. Fellows
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frances A. Rosamond
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Frances A. Rosamond .

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

Fellows, M.R., Rosamond, F.A. (2020). Collaborating with Hans: Some Remaining Wonderments. 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_2

Download citation

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

  • 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