Home
Lars Jaffke's picture

Lars Jaffke

Postdoctoral fellow
  • 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
  • 2020. Typical Sequences Revisited - Computing Width Parameters of Graphs. Leibniz International Proceedings in Informatics. 57:1-57:16.
  • 2020. Structural parameterizations of clique coloring. Leibniz International Proceedings in Informatics. 1-15.
  • 2020. Mim-Width II. The Feedback Vertex Set Problem. Algorithmica. 118-145.
  • 2020. Compressing permutation groups into grammars and polytopes. A graph embedding approach. Leibniz International Proceedings in Informatics. 1-15.
  • 2020. A complexity dichotomy for critical values of the b-chromatic number of graphs. Theoretical Computer Science.
  • 2019. Mim-Width III. Graph powers and generalized distance domination problems. Theoretical Computer Science. 216-236.
  • 2019. Mim-Width I. Induced Path Problems. Discrete Applied Mathematics.
  • 2019. FPT Algorithms for Diverse Collections of Hitting Sets. Algorithms. 18 pages.
  • 2019. A complexity dichotomy for critical values of the b-chromatic number of graphs. Leibniz International Proceedings in Informatics. 34:1-34:13.
  • 2018. What Is Known About Vertex Cover Kernelization? Lecture Notes in Computer Science (LNCS). 330-356.
  • 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.
  • 2018. On weak isomorphism of rooted vertex-colored graphs. Lecture Notes in Computer Science (LNCS). 266-278.
  • 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.
  • 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)