Hjem
Lars Jaffkes bilde
  • E-postLars.Jaffke@uib.no
  • Besøksadresse
    HIB - Thormøhlensgt. 55
  • Postadresse
    Postboks 7803
    5020 Bergen
Tidsskriftartikler
  • Jaffke, Lars; Lima, Paloma T. 2019. A complexity dichotomy for critical values of the b-chromatic number of graphs. Leibniz International Proceedings in Informatics. 138: 34:1-34:13. doi: 10.4230/LIPIcs.MFCS.2019.34
  • Jaffke, Lars; De Oliveira Oliveira, Mateus. 2018. On weak isomorphism of rooted vertex-colored graphs. Lecture Notes in Computer Science. 11159 LNCS: 266-278. doi: 10.1007/978-3-030-00256-5_22
  • 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. 89: 1-13. doi: 10.4230/LIPIcs.IPEC.2017.21
  • 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. 96: 42:1-42:14. doi: 10.4230/LIPIcs.STACS.2018.42
  • Jaffke, Lars; Jansen, Bart M.P. 2017. Fine-grained parameterized complexity analysis of graph coloring problems. Lecture Notes in Computer Science. 10236 LNCS: 345-356. doi: 10.1007/978-3-319-57586-5_29

Se fullstendig oversikt over publikasjoner i CRIStin.