Skip to main content
SpringerLink
Log in

Extremal Kernelization: A Commemorative Paper

  • Conference paper
  • First Online:
Combinatorial Algorithms (IWOCA 2017)

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

Included in the following conference series:

Abstract

We try to describe in this paper how methods from extremal combinatorics play an important role in the development of parameterized algorithms, also sketching further venues how this influence could be even increased in order to obtain quick \(\mathcal {FPT}\) classification results. Conversely, we show how certain notions that have become of importance within parameterized algorithmics can be useful to keep in mind for combinatorialists. We hope that this account initiates fruitful future discussions between the different scientific sub-communities that usually comprise IWOCA and that make this event quite special.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Notes

  1. 1.

    For related results, we refer to P. Valtr’s paper in this proceedings.

  2. 2.

    Further examples can be found in the paper of V. Lozin in this proceedings.

References

  1. Abu-Khzam, F.N., Bazgan, C., Chopin, M., Fernau, H.: Data reductions and combinatorial bounds for improved approximation algorithms. J. Comput. Syst. Sci. 82(3), 503–520 (2016)

    Article  MathSciNet  Google Scholar 

  2. Abu-Khzam, F.N., Fernau, H.: Kernels: annotated, proper and induced. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 264–275. Springer, Heidelberg (2006). https://doi.org/10.1007/11847250_24

    Chapter  MATH  Google Scholar 

  3. Bermudo, S., Fernau, H.: Lower bounds on the differential of a graph. Discret. Math. 312, 3236–3250 (2012)

    Article  MathSciNet  Google Scholar 

  4. Bermudo, S., Fernau, H.: Combinatorics for smaller kernels: the differential of a graph. Theoret. Comput. Sci. 562, 330–345 (2015)

    Article  MathSciNet  Google Scholar 

  5. Bermudo, S., Fernau, H., Sigarreta, J.M.: The differential and the Roman domination number of a graph. Appl. Anal. Discret. Math. 8, 155–171 (2014)

    Article  MathSciNet  Google Scholar 

  6. Blank, M.: An estimate of the external stability number of a graph without suspended vertices. Prikl. Mat. i Programmirovanie Vyp. 10, 3–11 (1973). (in Russian)

    MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  8. Boyce, J.E., Dobkin, D.P., (Scot) Drysdale III, R.L., Guibas, L.J.: Finding extremal polygons. SIAM J. Comput. 14(1), 134–147 (1985)

    Article  MathSciNet  Google Scholar 

  9. Chambers, E.W., Kinnersley, B., Prince, N., West, D.B.: Extremal problems for Roman domination. SIAM J. Discret. Math. 23, 1575–1586 (2009)

    Article  MathSciNet  Google Scholar 

  10. Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: lower bounds and upper bounds on kernel size. SIAM J. Comput. 37, 1077–1108 (2007)

    Article  MathSciNet  Google Scholar 

  11. Chen, Y., Flum, J., Müller, M.: Lower bounds for kernelizations and other preprocessing procedures. Theory Comput. Syst. 48(4), 803–839 (2011)

    Article  MathSciNet  Google Scholar 

  12. Cockayne, E.J., Dreyer Jr., P.A., Hedetniemi, S.M., Hedetniemi, S.T.: Roman domination in graphs. Discret. Math. 278, 11–22 (2004)

    Article  MathSciNet  Google Scholar 

  13. Conde, J., Miller, M., Miret, J.M., Saurav, K.: On the nonexistence of almost Moore digraphs of degree four and five. Math. Comput. Sci. 9(2), 145–149 (2015)

    Article  MathSciNet  Google Scholar 

  14. Cygan, M., Fomin, F., Kowalik, Ł., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3

    Book  MATH  Google Scholar 

  15. Dabrowski, K.K., Demange, M., Lozin, V.V.: New results on maximum induced matchings in bipartite graphs and beyond. Theoret. Comput. Sci. 478, 33–40 (2013)

    Article  MathSciNet  Google Scholar 

  16. Dehne, F., Fellows, M., Fernau, H., Prieto, E., Rosamond, F.: Nonblocker: parameterized algorithmics for minimum dominating set. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 237–245. Springer, Heidelberg (2006). https://doi.org/10.1007/11611257_21

    Chapter  Google Scholar 

  17. Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013). https://doi.org/10.1007/978-1-4471-5559-1

    Book  MATH  Google Scholar 

  18. Eppstein, D., Overmars, M.H., Rote, G., Woeginger, G.J.: Finding minimum area \(k\)-gons. Discret. Comput. Geom. 7, 45–58 (1992)

    Article  MathSciNet  Google Scholar 

  19. Erdős, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Mathematica 2, 463–470 (1935)

    MathSciNet  MATH  Google Scholar 

  20. Fernau, H.: Roman domination: a parameterized perspective. Int. J. Comput. Math. 85, 25–38 (2008)

    Article  MathSciNet  Google Scholar 

  21. Fernau, H., Fluschnik, T., Hermelin, D., Krebs, A., Molter, H., Niedermeier, R.: Diminishable parameterized problems and strict polynomial kernelization. Technical report, Cornell University, arXiv:1611.03739 (2016)

  22. Fernau, H., Rodríguez, J.A., Sigarreta, S.M.: Offensive \(r\)-alliances in graphs. Discret. Appl. Math. 157, 177–182 (2009)

    Article  MathSciNet  Google Scholar 

  23. Fernau, H., Raible, D.: Alliances in graphs: a complexity-theoretic study. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F., Bieliková, M. (eds.) SOFSEM 2007, Proceedings, vol. II, pp. 61–70. Institute of Computer Science ASCR, Prague (2007)

    Google Scholar 

  24. Fernau, H., Rodríguez-Velázquez, J.A.: A survey on alliances and related parameters in graphs. Electron. J. Graph Theory Appl. 2(1), 70–86 (2014)

    Article  MathSciNet  Google Scholar 

  25. Fernau, H., Ryan, J.F., Sugeng, K.A.: A sum labelling for the generalised friendship graph. Discret. Math. 308, 734–740 (2008)

    Article  MathSciNet  Google Scholar 

  26. Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. In: Dwork, C. (ed.) ACM Symposium on Theory of Computing, STOC, pp. 133–142. ACM (2008)

    Google Scholar 

  27. Giannopoulos, P., Knauer, C., Werner, D.: On the computational complexity of Erdős-Szekeres and related problems in \(\mathbb{R}^{3}\). In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 541–552. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40450-4_46

    Chapter  Google Scholar 

  28. Gómez, J., Miller, M.: On the existence of radial Moore graphs for every radius and every degree. Eur. J. Comb. 47, 15–22 (2015)

    Article  MathSciNet  Google Scholar 

  29. Johnson, D.S.: The NP-completeness column: the many limits on approximation. ACM Trans. Algorithms 2, 473–489 (2006)

    Article  MathSciNet  Google Scholar 

  30. Kim, J.H.: The Ramsey number \(R(3, t)\) has order of magnitude \(t^2/\log t\). Random Struct. Algorithms 7(3), 173–208 (1995)

    Article  MathSciNet  Google Scholar 

  31. Mashburn, J.L., Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Slater, P.J.: Differentials in graphs. Utilitas Math. 69, 43–54 (2006)

    MathSciNet  MATH  Google Scholar 

  32. McCuaig, B., Shepherd, B.: Domination in graphs of minimum degree two. J. Graph Theory 13, 749–762 (1989)

    Article  MathSciNet  Google Scholar 

  33. Miller, M., Širáň, J.: Moore graphs and beyond: a survey of the degree/diameter problem. Electron. J. Comb. 1000, DS14 (2005)

    MATH  Google Scholar 

  34. Ore, O.: Theory of Graphs. Colloquium Publications, vol. XXXVIII. American Mathematical Society, Providence (1962)

    Google Scholar 

  35. Prieto, E.: Systematic kernelization in FPT algorithm design. Ph.D. thesis, The University of Newcastle, Australia (2005)

    Google Scholar 

  36. Reed, B.: Paths, stars, and the number three. Comb. Probab. Comput. 5, 277–295 (1996)

    Article  MathSciNet  Google Scholar 

  37. ReVelle, C.S., Rosing, K.E.: Defendens imperium Romanum: a classical problem in military strategy. Am. Math. Mon. 107, 585–594 (2000). http://www.jhu.edu/~jhumag/0497web/locate3.html

  38. Sigarreta, J.M., Bermudo, S., Fernau, H.: On the complement graph and defensive \(k\)-alliances. Discret. Appl. Math. 157, 1687–1695 (2009)

    Article  MathSciNet  Google Scholar 

  39. Slater, P.J.: Enclaveless sets and MK-systems. J. Res. Natl. Bur. Stand. 82(3), 197–202 (1977)

    Article  MathSciNet  Google Scholar 

  40. Sloper, C.: Techniques in parameterized algorithm design. Ph.D. thesis, University of Bergen, Norway (2005)

    Google Scholar 

Download references

Acknowledgements

This paper has profited a lot from discussions we had with many colleagues, in particular, with Faisal Abu-Khzam, Ljiljana Brankovic and Mike Fellows. Thanks to Frances Rosamond and Ulrike Stege for proofreading.

Author information

Authors and Affiliations

  1. Fachbereich 4, Informatikwissenschaften, CIRT, Universität Trier, Trier, Germany

    Henning Fernau

Authors
  1. Henning Fernau
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Henning Fernau .

Editor information

Editors and Affiliations

  1. University of Newcastle Australia, Callaghan, New South Wales, Australia

    Ljiljana Brankovic

  2. University of Newcastle Australia, Callaghan, New South Wales, Australia

    Joe Ryan

  3. McMaster University, Hamilton, Ontario, Canada

    William F. Smyth

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fernau, H. (2018). Extremal Kernelization: A Commemorative Paper. In: Brankovic, L., Ryan, J., Smyth, W. (eds) Combinatorial Algorithms. IWOCA 2017. Lecture Notes in Computer Science(), vol 10765. Springer, Cham. https://doi.org/10.1007/978-3-319-78825-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-78825-8_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-78824-1

  • Online ISBN: 978-3-319-78825-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation