Current Research Information SysTem In Norway
 
 

 English version


 
Hovedside
Forskningsresultater/NVI
Forskere
Prosjekter
Forskningsenheter
Logg inn
Om Cristin
 
 
   
Eksporter til


Viser treff 1-12 av 12

2020
1 Bodlaender, Hans L.; Jaffke, Lars; Telle, Jan Arne.
Typical Sequences Revisited - Computing Width Parameters of Graphs. Leibniz International Proceedings in Informatics 2020 ;Volum 154. s. 57:1-57:16
UiB Untitled
 
2 Jaffke, Lars; Kwon, O-Joung; Telle, Jan Arne.
Mim-Width II. The Feedback Vertex Set Problem. Algorithmica 2020 ;Volum 82. s. 118-145
UiB Untitled
 
3 Lima, Paloma T.; Jaffke, Lars.
A complexity dichotomy for critical values of the b-chromatic number of graphs. Theoretical Computer Science 2020
UiB Untitled
 
2019
4 Baste, Julien; Jaffke, Lars; Masařík, Tomáš; Philip, Geevarghese; Rote, Günter.
FPT Algorithms for Diverse Collections of Hitting Sets. Algorithms 2019 ;Volum 12.(12) s. -
UiB Untitled
 
5 Jaffke, Lars; Kwon, O-Joung; Strømme, Torstein J. F.; Telle, Jan Arne.
Mim-Width III. Graph powers and generalized distance domination problems. Theoretical Computer Science 2019 ;Volum 796. s. 216-236
UiB Untitled
 
6 Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne.
Mim-Width I. Induced Path Problems. Discrete Applied Mathematics 2019
UiB Untitled
 
7 Jaffke, Lars; Lima, Paloma T..
A complexity dichotomy for critical values of the b-chromatic number of graphs. Leibniz International Proceedings in Informatics 2019 ;Volum 138. s. 34:1-34:13
UiB Untitled
 
2018
8 Fellows, Michael R.; Jaffke, Lars; Király, Aliz Izabella; Rosamond, Frances; Weller, Mathias.
What Is Known About Vertex Cover Kernelization?. Lecture Notes in Computer Science (LNCS) 2018 ;Volum 11011. s. 330-356
UiB Untitled
 
9 Jaffke, Lars; De Oliveira Oliveira, Mateus.
On weak isomorphism of rooted vertex-colored graphs. Lecture Notes in Computer Science (LNCS) 2018 ;Volum 11159 LNCS. s. 266-278
UiB Untitled
 
10 Jaffke, Lars; Kwon, O-Joung; Telle, Jan Arne.
A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. Leibniz International Proceedings in Informatics 2018 ;Volum 96. s. 42:1-42:14
UiB Untitled
 
11 Jaffke, Lars; Kwon, O-Joung; Telle, Jan Arne.
Polynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-width. Leibniz International Proceedings in Informatics 2018 ;Volum 89. s. 1-13
UiB Untitled
 
2017
12 Jaffke, Lars; Jansen, Bart M.P..
Fine-grained parameterized complexity analysis of graph coloring problems. Lecture Notes in Computer Science (LNCS) 2017 ;Volum 10236 LNCS. s. 345-356
UiB Untitled