|
|
English
version
For å registrere i Cristin må du være vitenskapelig eller administrativt ansatt.
|
|
|
|
|
|
|
|
|
2024
|
1. |
Jana, Satyabrata; Saha, Souvik; Sahu, Abhishek; Saurabh, Saket; Verma, Shaily. Partitioning subclasses of chordal graphs with few deletions. Theoretical Computer Science 2024 ;Volum 983. s. - UiB
Untitled
|
2023
|
2. |
Agrawal, Akanksha; Knudsen, Kristine Vitting Klinkby; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav. The Parameterized Complexity of Guarding Almost Convex Polygons. Discrete & Computational Geometry 2023 ;Volum 71. s. 358-398 UiB
Untitled
|
|
3. |
Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav. Polynomial Kernel for Interval Vertex Deletion. ACM Transactions on Algorithms (TALG) 2023 ;Volum 19.(2) s. 1-68 UiB
Untitled
|
|
4. |
Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay Nitin; Saurabh, Saket; Zehavi, Meirav. Kernelization for Spreading Points. Leibniz International Proceedings in Informatics 2023 ;Volum 274. s. 48:1-48:16 UiB
Untitled
|
|
5. |
Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre; Sagunov, Danil; Saurabh, Saket; Simonov, Kirill. Detours in directed graphs. Journal of computer and system sciences 2023 ;Volum 137. s. 66-86 UiB
Untitled
|
|
6. |
Fomin, Fedor; Golovach, Petr; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket. Diverse collections in matroids and graphs. Mathematical programming 2023 ;Volum 204. s. 415-447 UiB
Untitled
|
|
7. |
Gupta, Sushmita; Jain, Pallavi; Saurabh, Saket; Talmon, Nimrod. Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. Algorithmica 2023 ;Volum 85. s. 3717-3740 UiB
Untitled
|
|
8. |
Kanesh, Lawqueen; Madathil, Jayakrishnan; Roy, Sanjukta; Sahu, Abhishek; Saurabh, Saket. Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. SIAM Journal on Discrete Mathematics 2023 ;Volum 37.(4) s. 2626-2669 UiB
Untitled
|
|
9. |
Sahu, Abhishek; Saurabh, Saket. Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. Theory of Computing Systems 2023 ;Volum 67. s. 221-233 UiB
Untitled
|
|
10. |
Saurabh, Saket; Zehavi, Meirav. Parameterized complexity of multi-node hubs. Journal of computer and system sciences 2023 ;Volum 131. s. 64-85 UiB
Untitled
|
2022
|
11. |
Agrawal, Akanksha; Kundu, Madhumita; Sahu, Abhishek; Saurabh, Saket; Tale, Prafullkumar. Parameterized Complexity of Maximum Edge Colorable Subgraph. Algorithmica 2022 ;Volum 84. s. 3075-3100 UiB
Untitled
|
|
12. |
Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav. Erdős–Pósa property of obstructions to interval graphs. Journal of Graph Theory 2022 ;Volum 102.(4) s. 702-727 UiB
Untitled
|
|
13. |
Agrawal, Akanksha; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket. Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. Algorithmica 2022 ;Volum 84.(9) s. 2622-2641 UiB
Untitled
|
|
14. |
Das, Avinandan; Kanesh, Lawqueen; Madathil, Jayakrishnan; Muluk, Komal; Purohit, Nidhi; Saurabh, Saket. On the complexity of singly connected vertex deletion. Theoretical Computer Science 2022 ;Volum 934. s. 47-64 UiB
Untitled
|
|
15. |
Derbisz, Jan; Kanesh, Lawqueen; Madathil, Jayakrishnan; Sahu, Abhishek; Saurabh, Saket; Verma, Shaily. A polynomial kernel for bipartite permutation vertex deletion. Algorithmica 2022 ;Volum 84.(11) s. 3246-3275 UiB
Untitled
|
|
16. |
Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay Nitin; Purohit, Nidhi; Saurabh, Saket. Exact Exponential Algorithms for Clustering Problems. Leibniz International Proceedings in Informatics 2022 ;Volum 249. s. 1-14 UiB
Untitled
|
|
17. |
Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre; Sagunov, Danil; Simonov, Kirill; Saurabh, Saket. Detours in Directed Graphs. Leibniz International Proceedings in Informatics 2022 ;Volum 219. s. 1-6 UiB
Untitled
|
|
18. |
Fomin, Fedor; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michal Pawel; Saurabh, Saket. Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. SIAM journal on computing (Print) 2022 ;Volum 51.(6) s. 1866-1930 UiB
Untitled
|
|
19. |
Fomin, Fedor; Panolan, Fahad; Ramanujan, M.S.; Saurabh, Saket. On the optimality of pseudo-polynomial algorithms for integer programming. Mathematical programming 2022 s. - UiB
Untitled
|
|
20. |
Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav. Resolute control: Forbidding candidates from winning an election is hard. Theoretical Computer Science 2022 ;Volum 915. s. 74-89 UiB
Untitled
|
|
21. |
Saurabh, Saket; Souza, Uéverton dos Santos; Tale, Prafullkumar. On the parameterized complexity of Grid Contraction. Journal of computer and system sciences 2022 ;Volum 129. s. 22-38 UiB
Untitled
|
|
22. |
Saurabh, Saket; Tale, Prafullkumar. On the Parameterized Complexity of Maximum Degree Contraction Problem. Algorithmica 2022 ;Volum 84.(2) s. 405-435 UiB
Untitled
|
2021
|
23. |
Agrawal, Akanksha; Kanesh, Lawqueen; Saurabh, Saket; Tale, Prafullkumar. Paths to trees and cacti. Theoretical Computer Science 2021 ;Volum 860. s. 98-116 UiB
Untitled
|
|
24. |
Agrawal, Akanksha; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav. Simultaneous Feedback Edge Set: A Parameterized Perspective. Algorithmica 2021 ;Volum 83.(2) s. 753-774 UiB
Untitled
|
|
25. |
Biswas, Arindam; Raman, Venkatesh; Saurabh, Saket. Approximation in (Poly-) Logarithmic Space. Algorithmica 2021 ;Volum 83.(7) s. 2303-2331 UiB
Untitled
|
|
26. |
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
|
|
27. |
Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre; Misra, Pranabendu; Saurabh, Saket; Sharma, Roohani. Parameterized Complexity of Directed Spanner Problems. Algorithmica 2021 s. - UiB
Untitled
|
|
28. |
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
|
|
29. |
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
|
|
30. |
Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav. ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. Journal of Computational Geometry 2021 ;Volum 12.(2) s. 126-148 UiB
Untitled
|
|
31. |
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. 1-40 UiB
Untitled
|
|
32. |
Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav. Balanced stable marriage: How close is close enough?. Theoretical Computer Science 2021 ;Volum 883. s. 19-43 UiB
Untitled
|
|
33. |
Kanesh, Lawqueen; Maity, Soumen; Muluk, Komal; Saurabh, Saket. Parameterized complexity of fair feedback vertex set problem. Theoretical Computer Science 2021 ;Volum 867. s. 1-12 UiB
Untitled
|
|
34. |
Knudsen, Kristine Vitting Klinkby; Misra, Pranabendu; Saurabh, Saket. Strong Connectivity Augmentation is FPT. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms 2021 s. 219-234 UiB
Untitled
|
|
35. |
Krithika, R.; Rai, Ashutosh; Saurabh, Saket; Tale, Prafullkumar. Parameterized and exact algorithms for class domination coloring. Discrete Applied Mathematics 2021 ;Volum 291. s. 286-299 UiB
Untitled
|
|
36. |
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. 822-839 UiB
Untitled
|
|
37. |
Lokshtanov, Daniel; Misra, Pranabendu; Mukherjee, Joydeep; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket. 2-Approximating Feedback Vertex Set in Tournaments. ACM Transactions on Algorithms (TALG) 2021 ;Volum 17.(2) s. 11:1-11:14 UiB
Untitled
|
|
38. |
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. 199-218 UiB
Untitled
|
|
39. |
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. 179-198 UiB
Untitled
|
2020
|
40. |
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
|
|
41. |
Agrawal, Akanksha; Jain, Pallavi; Kanesh, Lawqueen; Saurabh, Saket. Parameterized Complexity of Conflict-Free Matchings and Paths. Algorithmica 2020 ;Volum 82.(7) s. 1939-1965 UiB
Untitled
|
|
42. |
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
|
|
43. |
Agrawal, Akanksha; Kundu, Madhumita; Sahu, Abhishek; Saurabh, Saket; Tale, Prafullkumar. Parameterized Complexity of Maximum Edge Colorable Subgraph. Lecture Notes in Computer Science (LNCS) 2020 ;Volum 12273. s. 615-626 UiB
Untitled
|
|
44. |
Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav. Polylogarithmic Approximation Algorithms for Weighted-F-deletion Problems. ACM Transactions on Algorithms (TALG) 2020 ;Volum 16.(4) s. 1-38 UiB
Untitled
|
|
45. |
Banik, Aritra; Choudhary, Pratibha; Raman, Venkatesh; Saurabh, Saket. Fixed-parameter tractable algorithms for Tracking Shortest Paths. Theoretical Computer Science 2020 ;Volum 846. s. 1-13 UiB
Untitled
|
|
46. |
Biswas, Arindam; Raman, Venkatesh; Saurabh, Saket. Approximation in (poly-) logarithmic space. Leibniz International Proceedings in Informatics 2020 ;Volum 170. s. 16:1-16:15 UiB
Untitled
|
|
47. |
Das, Avinandan; Kanesh, Lawqueen; Madathil, Jayakrishnan; Muluk, Komal; Purohit, Nidhi; Saurabh, Saket. On the Complexity of Singly Connected Vertex Deletion. Lecture Notes in Computer Science (LNCS) 2020 ;Volum 12126. s. 237-250 UiB
Untitled
|
|
48. |
Eiben, Eduard; Lochet, William; Saurabh, Saket. A Polynomial Kernel for Paw-Free Editing. Leibniz International Proceedings in Informatics 2020 ;Volum 180. s. 10:1-10:15 UiB
Untitled
|
|
49. |
Fomin, Fedor; Golovach, Petr; Lochet, William; Misra, Pranabendu; Saurabh, Saket; Sharma, Roohani. Parameterized Complexity of Directed Spanner Problems. Leibniz International Proceedings in Informatics 2020 ;Volum 180. s. 12:1-12:11 UiB
Untitled
|
|
50. |
Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav. Going Far from Degeneracy. SIAM Journal on Discrete Mathematics 2020 ;Volum 34.(3) s. 1578-1601 UiB
Untitled
|
Vis neste liste
|