Home
Lars Jaffke's picture
  • E-mailLars.Jaffke@uib.no
  • Visitor Address
    HIB - Thormøhlensgt. 55
  • Postal Address
    Postboks 7803
    5020 Bergen

Most of my research lies in the intersection of algorithmic graph theory --- with a focus on graph decompositions and width paramters --- and parameterized algorithms and complexity.

Academic article
  • Jaffke, Lars; Lima, Paloma T. 2019. A complexity dichotomy for critical values of the b-chromatic number of graphs. Leibniz International Proceedings in Informatics. 34:1-34:13.
  • Jaffke, Lars; Kwon, O-Joung; Telle, Jan Arne. 2018. Polynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-width. Leibniz International Proceedings in Informatics. 1-13.
  • Jaffke, Lars; De Oliveira Oliveira, Mateus. 2018. On weak isomorphism of rooted vertex-colored graphs. Lecture Notes in Computer Science (LNCS). 266-278.
  • Jaffke, Lars; Kwon, O-Joung; Telle, Jan Arne. 2018. A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. Leibniz International Proceedings in Informatics. 42:1-42:14.
  • Jaffke, Lars; Jansen, Bart M.P. 2017. Fine-grained parameterized complexity analysis of graph coloring problems. Lecture Notes in Computer Science (LNCS). 345-356.

More information in national current research information system (CRIStin)