Home
Lars Jaffke's picture

Lars Jaffke

Postdoctoral Fellow
  • E-mailLars.Jaffke@uib.no
  • Visitor Address
    HIB - Thormøhlens gate 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
  • Show author(s) 2020. Typical Sequences Revisited - Computing Width Parameters of Graphs. Leibniz International Proceedings in Informatics. 57:1-57:16.
  • Show author(s) 2020. Structural parameterizations of clique coloring. Leibniz International Proceedings in Informatics. 49:1-49:15.
  • Show author(s) 2020. Mim-Width II. The Feedback Vertex Set Problem. Algorithmica. 118-145.
  • Show author(s) 2020. Hedonic Seat Arrangement Problems. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS. 1777-1779.
  • Show author(s) 2020. Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. IJCAI International Joint Conference on Artificial Intelligence. 1119-1125.
  • Show author(s) 2020. Diverse Pairs of Matchings. Leibniz International Proceedings in Informatics. 26:1-26:12.
  • Show author(s) 2020. Compressing permutation groups into grammars and polytopes. A graph embedding approach. Leibniz International Proceedings in Informatics. 50:1-50:15.
  • Show author(s) 2020. A complexity dichotomy for critical values of the b-chromatic number of graphs. Theoretical Computer Science. 182-196.
  • Show author(s) 2019. Mim-Width III. Graph powers and generalized distance domination problems. Theoretical Computer Science. 216-236.
  • Show author(s) 2019. Mim-Width I. Induced Path Problems. Discrete Applied Mathematics.
  • Show author(s) 2019. FPT Algorithms for Diverse Collections of Hitting Sets. Algorithms. 18 pages.
  • Show author(s) 2019. A complexity dichotomy for critical values of the b-chromatic number of graphs. Leibniz International Proceedings in Informatics. 34:1-34:13.
  • Show author(s) 2018. What Is Known About Vertex Cover Kernelization? Lecture Notes in Computer Science (LNCS). 330-356.
  • Show author(s) 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.
  • Show author(s) 2018. On weak isomorphism of rooted vertex-colored graphs. Lecture Notes in Computer Science (LNCS). 266-278.
  • Show author(s) 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.
  • Show author(s) 2017. Fine-grained parameterized complexity analysis of graph coloring problems. Lecture Notes in Computer Science (LNCS). 345-356.
Academic lecture
  • Show author(s) 2021. Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory.
Academic chapter/article/Conference paper
  • Show author(s) 2020. Well-partitioned chordal graphs: obstruction set and disjoint paths. 13 pages.

More information in national current research information system (CRIStin)