Current Research Information SysTem In Norway
 
 

 English version


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


Viser treff 1-50 av 177 << Forrige 1 2 3 4    Neste >>

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
 
2020
8 Agrawal, Akanksha; Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Tale, Prafullkumar.
Path contraction faster than $2^n$. SIAM Journal on Discrete Mathematics 2020 ;Volum 34. s. 1302-1325
UiB Untitled
 
9 Agrawal, Akanksha; Knudsen, Kristine Vitting Klinkby; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav.
The Parameterized Complexity of Guarding Almost Convex Polygons. Leibniz International Proceedings in Informatics 2020 ;Volum 164. s. 3:1-3:16
UiB Untitled
 
10 Blair, Jean R S; Heggernes, Pinar; Lima, Paloma T.; Lokshtanov, Daniel.
On the maximum number of edges in chordal graphs of bounded degree and matching number. Lecture Notes in Computer Science (LNCS) 2020 ;Volum 12118. s. 600-612
UiB Untitled
 
11 Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav.
Parameterization Above a Multiplicative Guarantee. Leibniz International Proceedings in Informatics 2020 ;Volum 151. s. 39:1-39:13
UiB Untitled
 
12 Fomin, Fedor; Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket.
Subexponential algorithms for rectilinear Steiner tree and arborescence problems. ACM Transactions on Algorithms (TALG) 2020 ;Volum 16. s. -
UiB Untitled
 
13 Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav.
ETH-tight algorithms for long path and cycle on unit disk graphs. Leibniz International Proceedings in Informatics 2020 ;Volum 164. s. 44:1-44:18
UiB Untitled
 
14 Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav.
Hitting Topological Minors Is FPT. Proceedings of the Annual ACM Symposium on Theory of Computing 2020 s. 1317-1326
UiB Untitled
 
15 Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios.
Bidimensionality and Kernels. SIAM journal on computing (Print) 2020 ;Volum 49. s. 1397-1422
UiB Untitled
 
16 Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav.
Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms 2020 s. 2299-2318
UiB Untitled
 
17 Lochet, William; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav.
Fault tolerant subgraphs with applications in kernelization. Leibniz International Proceedings in Informatics 2020 ;Volum 151. s. 47:1-47:22
UiB Untitled
 
18 Lokshtanov, Daniel; Misra, Pranabendu; Mukherjee, Joydeep; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket.
2-Approximating Feedback Vertex Set in Tournaments. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms 2020 s. 1010-1018
UiB Untitled
 
19 Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket.
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. Leibniz International Proceedings in Informatics 2020 ;Volum 168. s. 80:1-80:16
UiB Untitled
 
20 Lokshtanov, Daniel; Ramanujan, M.S.; Saurabh, Saket; Zehavi, Meirav.
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms 2020 s. -
UiB Untitled
 
2019
21 Agrawal, Akanksha; Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Tale, Prafullkumar.
Path Contraction Faster Than 2n. Leibniz International Proceedings in Informatics 2019 ;Volum 132. s. 11:1-11:13
UiB Untitled
 
22 Agrawal, Akanksha; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav.
Split contraction: The untold story. ACM Transactions on Computation Theory 2019 ;Volum 11.(3)
UiB Untitled
 
23 Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michal; Saurabh, Saket.
Minimum Bisection Is Fixed-Parameter Tractable. SIAM journal on computing (Print) 2019 ;Volum 48.(2) s. 417-450
UiB Untitled
 
24 Fomin, Fedor; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket.
Exact algorithms via monotone local search. Journal of the ACM 2019 ;Volum 66.(2) s. 8:1-8:23
UiB Untitled
 
25 Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav.
Going Far From Degeneracy. Leibniz International Proceedings in Informatics 2019 ;Volum 144. s. 47:1-47:14
UiB Untitled
 
26 Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Saurabh, Saket.
Spanning circuits in regular matroids. ACM Transactions on Algorithms (TALG) 2019 ;Volum 15.(4)
UiB Untitled
 
27 Fomin, Fedor; Le, Tien-Nam; Lokshtanov, Daniel; Saurabh, Saket; Thomasse, Stephan; Zehavi, Meirav.
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Transactions on Algorithms (TALG) 2019 ;Volum 15.(1) s. -
UiB Untitled
 
28 Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav.
Decomposition of map graphs with applications. Leibniz International Proceedings in Informatics 2019 ;Volum 132. s. 60:1-60:15
UiB Untitled
 
29 Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav.
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discrete & Computational Geometry 2019 ;Volum 62.(4) s. 879-911
UiB Untitled
 
30 Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav.
Kernelization. Theory of Parameterized Preprocessing. Cambridge University Press 2019 (ISBN 9781107415157) 490 s.
UiB Untitled
 
31 Lokshtanov, Daniel; Mouawad, Amer E.; Saurabh, Saket; Zehavi, Meirav.
Packing cycles faster than Erdos-Posa. SIAM Journal on Discrete Mathematics 2019 ;Volum 33.(3) s. 1194-1215
UiB Untitled
 
32 Lokshtanov, Daniel; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav.
Balanced judicious bipartition is fixed-parameter tractable. SIAM Journal on Discrete Mathematics 2019 ;Volum 33.(4) s. 1878-1911
UiB Untitled
 
2018
33 Agrawal, Akanksha; Jain, Pallavi; Kanesh, Lawqueen; Lokshtanov, Daniel; Saurabh, Saket.
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. Leibniz International Proceedings in Informatics 2018 ;Volum 117. s. 53:1-53:15
UiB Untitled
 
34 Agrawal, Akanksha; Krithika, R; Lokshtanov, Daniel; Mouawad, Amer E.; Ramanujan, MS.
On the parameterized complexity of simultaneous deletion problems. Leibniz International Proceedings in Informatics 2018 ;Volum 93. s. 9:1-9:14
UiB Untitled
 
35 Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav.
Erdos-Posa property of obstructions to interval graphs. Leibniz International Proceedings in Informatics 2018 ;Volum 96. s. 1-15
UiB Untitled
 
36 Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav.
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. ACM Transactions on Algorithms (TALG) 2018 ;Volum 15.(1) s. -
UiB Untitled
 
37 Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav.
Polylogarithmic approximation algorithms for weighted-F-Deletion problems. Leibniz International Proceedings in Informatics 2018 ;Volum 116. s. 1:1-1:15
UiB Untitled
 
38 Agrawal, Akanksha; Lokshtanov, Daniel; Mouawad, Amer E.; Saurabh, Saket.
Simultaneous feedback vertex set: A parameterized perspective. ACM Transactions on Computation Theory 2018 ;Volum 10.(4)
UiB Untitled
 
39 Bacso, Gabor; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Tuza, Zsolt; van Leeuwen, Erik Jan.
Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs. Algorithmica 2018 ;Volum 81.(2) s. 421-438
UiB Untitled
 
40 Banik, Aritra; Choudhary, Pratibha; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket.
A polynomial sized kernel for tracking paths problem. Lecture Notes in Computer Science (LNCS) 2018 ;Volum 10807 LNCS. s. 94-107
UiB Untitled
 
41 Carpenter, Timothy; Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Sidiropoulos, Anastasios.
Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. Leibniz International Proceedings in Informatics 2018 ;Volum 99. s. 21:1-21:14
UiB Untitled
 
42 Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Saurabh, Saket.
Covering Vectors by Spaces: Regular Matroids. SIAM Journal on Discrete Mathematics 2018 ;Volum 32.(4) s. 2512-2565
UiB Untitled
 
43 Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav.
Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. ACM Transactions on Algorithms (TALG) 2018 ;Volum 15.(1) s. -
UiB Untitled
 
44 Fomin, Fedor; Lokshtanov, Daniel; Meesum, Syed Mohammad; Saurabh, Saket; Zehavi, Meirav.
Matrix rigidity from the viewpoint of parameterized complexity. SIAM Journal on Discrete Mathematics 2018 ;Volum 32.(2) s. 966-985
UiB Untitled
 
45 Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav.
Long directed (s,t)-path: FPT algorithm. Information Processing Letters 2018 ;Volum 140. s. 8-12
UiB Untitled
 
46 Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket.
Excluded grid minors and efficient polynomial-time approximation schemes. Journal of the ACM 2018 ;Volum 65.(2) s. 1-44
UiB Untitled
 
47 Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Pilipczuk, Michal; Wrochna, Marcin.
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. ACM Transactions on Algorithms (TALG) 2018 ;Volum 14.(3)
UiB Untitled
 
48 Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M.
Kernels for (Connected) dominating set on graphs with excluded topological minors. ACM Transactions on Algorithms (TALG) 2018 ;Volum 14.(1)
UiB Untitled
 
49 Golovach, Petr; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav.
Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms 2018 s. 262-273
UiB Untitled
 
50 Lokshtanov, Daniel; Maadapuzhi Shridharan, Ramanujan; Saurabh, Saket.
Linear time parameterized algorithms for subset feedback vertex set. ACM Transactions on Algorithms (TALG) 2018 ;Volum 14.(1) s. -
UiB Untitled
 
    Vis neste liste