|
|
English
version
For å registrere i Cristin må du være vitenskapelig eller administrativt ansatt.
|
|
|
|
|
|
|
|
|
2018
|
1. |
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
|
|
2. |
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
|
|
3. |
Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne. Maximum matching width: New characterizations and a fast algorithm for dominating set. Discrete Applied Mathematics 2018 ;Volum 248. s. 114-124 UiB
Untitled
|
|
4. |
Telle, Jan Arne; Villanger, Yngve. FPT algorithms for domination in sparse graphs and beyond. Theoretical Computer Science 2018 s. 1-7 UiB
Untitled
|
|