Current Research Information SysTem In Norway
 
 

 English version


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


Viser treff 1-7 av 7

2021
1 Arrighi, Emmanuel Jean Paul Pierre; Fernau, Henning; Lokshtanov, Daniel; Oliveira, Mateus De Oliveira; Wolf, Petra.
Diversity in Kemeny Rank Aggregation: A Parameterized Approach. IJCAI International Joint Conference on Artificial Intelligence 2021
UiB Untitled
 
2 Crespelle, Christophe; Lokshtanov, Daniel; Phan, Thi Ha Duong; Thierry, Eric.
Faster and enhanced inclusion-minimal cograph completion. Discrete Applied Mathematics 2021 ;Volum 288. s. 138-151
UiB Untitled
 
3 Gunda, Spoorthy; Jain, Pallavi; Lokshtanov, Daniel; Saurabh, Saket; Tale, Prafullkumar.
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. ACM Transactions on Computation Theory 2021 ;Volum 13.(4) s. -
UiB Untitled
 
4 Jaffke, Lars; Lima, Paloma Thome de; Lokshtanov, Daniel.
b-Coloring Parameterized by Clique-Width. Leibniz International Proceedings in Informatics 2021 ;Volum 187. s. 43:1-43:15
UiB Untitled
 
5 Kumar, Neeraj; Lokshtanov, Daniel; Saurabh, Saket; Suri, Subhash.
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms 2021 s. -
UiB Untitled
 
6 Lokshtanov, Daniel; Misra, Pranabendu; Ramanujan, M.S.; Saurabh, Saket; Zehavi, Meirav.
FPT-approximation for FPT Problems. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms 2021 s. -
UiB Untitled
 
7 Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav.
Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms 2021 s. -
UiB Untitled