Current Research Information SysTem In Norway
 
 

 English version


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


Viser treff 1-14 av 14

2021
1 Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr; Simonov, Kirill.
Parameterized Complexity of Feature Selection for Categorical Data Clustering. Leibniz International Proceedings in Informatics 2021 ;Volum 202. s. 14:1-14:14
UiB Untitled
 
2 Chaplick, Steven; Fomin, Fedor; Golovach, Petr; Knop, Dušan; Zeman, Peter.
Kernelization of Graph Hamiltonicity: Proper H-Graphs. SIAM Journal on Discrete Mathematics 2021 ;Volum 35.(2) s. 840-892
UiB Untitled
 
3 Eiben, Eduard; Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre; Panolan, Fahad; Simonov, Kirill.
EPTAS for k-means Clustering of Affine Subspaces. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms 2021 s. 2649-2659
UiB Untitled
 
4 Fomin, Fedor; Fraigniaud, Pierre; Golovach, Petr.
Present-Biased Optimization. Proceedings of the AAAI Conference on Artificial Intelligence 2021 ;Volum 35.(6) s. 5415-5422
UiB Untitled
 
5 Fomin, Fedor; Golovach, Petr.
Kernelization of Whitney Switches. SIAM Journal on Discrete Mathematics 2021 ;Volum 35.(2) s. 1298-1336
UiB Untitled
 
6 Fomin, Fedor; Golovach, Petr.
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. Algorithmica 2021 ;Volum 83.(7) s. 2170-2214
UiB Untitled
 
7 Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay Nitin; Saurabh, Saket.
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. Leibniz International Proceedings in Informatics 2021 ;Volum 213. s. 21:1-21:16
UiB Untitled
 
8 Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre; Misra, Pranabendu; Saurabh, Saket; Sharma, Roohani.
Parameterized Complexity of Directed Spanner Problems. Algorithmica 2021 s. -
UiB Untitled
 
9 Fomin, Fedor; Golovach, Petr; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket.
Diverse Collections in Matroids and Graphs. Leibniz International Proceedings in Informatics 2021 ;Volum 187. s. 31:1-31:14
UiB Untitled
 
10 Fomin, Fedor; Golovach, Petr; Purohit, Nidhi.
Parameterized Complexity of Categorical Clustering with Size Constraints. Lecture Notes in Computer Science (LNCS) 2021 ;Volum 12808. s. 385-398
UiB Untitled
 
11 Fomin, Fedor; Golovach, Petr; Simonov, Kirill.
Parameterized k-Clustering: Tractability island. Journal of computer and system sciences 2021 ;Volum 117. s. 50-74
UiB Untitled
 
12 Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M..
Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. Lecture Notes in Computer Science (LNCS) 2021 ;Volum 12911. s. 308-320
UiB Untitled
 
13 Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M..
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. Logic in Computer Science 2021 s. 1-13
UiB Untitled
 
14 Fomin, Fedor; Lokshtanov, Daniel; Mihajlin, Ivan; Saurabh, Saket; Zehavi, Meirav.
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ACM Transactions on Computation Theory 2021 ;Volum 13.(2) s. 10:1-10:25
UiB Untitled