Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Article
|
2-Approximating Feedback Vertex Set in TournamentsLokshtanov, Daniel ; Misra, Pranabendu ; Mukherjee, Joydeep ; Panolan, Fahad ; Philip, Geevarghese ; Saurabh, SaketACM transactions on algorithms, 2021-06, Vol.17 (2), p.1-14 [Peer Reviewed Journal]Full text available |
|
2 |
Material Type: Article
|
Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial SpaceLokshtanov, Daniel ; BjÖrklund, Andreas ; Saurabh, Saket ; Zehavi, MeiravACM transactions on algorithms, 2021-08, Vol.17 (3), p.1-44 [Peer Reviewed Journal]Full text available |
|
3 |
Material Type: Article
|
Approximation Schemes for Low-rank Binary Matrix Approximation ProblemsFomin, Fedor ; Golovach, Petr ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, SaketACM transactions on algorithms, 2020-01, Vol.16 (1), p.1-39 [Peer Reviewed Journal]ACMFull text available |
|
4 |
Material Type: Article
|
Clique-width III: Hamiltonian Cycle and the Odd Case of Graph ColoringFomin, Fedor ; Golovach, Petr ; Lokshtanov, Daniel ; Saurabh, Saket ; Zehavi, MeiravACM transactions on algorithms, 2019-01, Vol.15 (1), p.1-27 [Peer Reviewed Journal]ACMFull text available |
|
5 |
Material Type: Article
|
Clustering what Matters: Optimal Approximation for Clustering with OutliersAgrawal, Akanksha ; Inamdar, Tanmay ; Saurabh, Saket ; Xue, JieThe Journal of artificial intelligence research, 2023-01, Vol.78, p.143-166 [Peer Reviewed Journal]Full text available |
|
6 |
Material Type: Article
|
Communication Complexity and Graph FamiliesKolay, Sudeshna ; Panolan, Fahad ; Saurabh, SaketACM transactions on computation theory, 2019-04, Vol.11 (2), p.1-28 [Peer Reviewed Journal]ACMFull text available |
|
7 |
Material Type: Article
|
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower BoundsFomin, Fedor V. ; Lokshtanov, Daniel ; Mihajlin, Ivan ; Saurabh, Saket ; Zehavi, MeiravACM transactions on computation theory, 2021-06, Vol.13 (2), p.1-25, Article 10 [Peer Reviewed Journal]New York, NY, USA: ACMFull text available |
|
8 |
Material Type: Article
|
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized ComplexityPanolan, Fahad ; Saurabh, Saket ; Zehavi, MeiravACM transactions on algorithms, 2024-04, Vol.20 (2), p.1-50, Article 15 [Peer Reviewed Journal]New York, NY: ACMFull text available |
|
9 |
Material Type: Article
|
Covering Small Independent Sets and Separators with Applications to Parameterized AlgorithmsLokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket ; Sharma, Roohani ; Zehavi, MeiravACM transactions on algorithms, 2020-06, Vol.16 (3), p.1-31 [Peer Reviewed Journal]ACMFull text available |
|
10 |
Material Type: Article
|
Distortion is Fixed Parameter TractableFellows, Michael ; Fomin, Fedor V ; Lokshtanov, Daniel ; Losievskaja, Elena ; Rosamond, Frances ; Saurabh, SaketACM transactions on computation theory, 2013-11, Vol.5 (4), p.1-20 [Peer Reviewed Journal]ACMFull text available |