# Browse by IITH Authors

Up a level |

**38**.

## Article

Agrawal, Akanksha and Misra, Pranabendu and Panolan, Fahad and Saurabh, Saket
(2022)
*Fast Exact Algorithms for Survivable Network Design with Uniform Requirements.*
Algorithmica.
ISSN 0178-4617

Agrawal, Akanksha and Kanesh, Lawqueen and Panolan, Fahad and et al, .
(2022)
*A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs.*
SIAM Journal on Discrete Mathematics, 36 (2).
pp. 911-921.
ISSN 0895-4801

Lokshtanov, Daniel and Mouawad, Amer E. and Panolan, Fahad and et al, .
(2022)
*On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets.*
Algorithmica, 84 (2).
pp. 482-509.
ISSN 0178-4617

Fomin, Fedor V. and Panolan, Fahad and Ramanujan, M. S. and et al, .
(2022)
*On the optimality of pseudo-polynomial algorithms for integer programming.*
Mathematical Programming.
ISSN 0025-5610

Jacob, Ashwin and Panolan, Fahad and Raman, Venkatesh and Sahlot, Vibha
(2022)
*Structural Parameterizations with Modulator Oblivion.*
Algorithmica.
ISSN 0178-4617

Banerjee, Suman and Mathew, Rogers and Panolan, Fahad
(2022)
*Target Set Selection Parameterized by Vertex Cover and More.*
Theory of Computing Systems.
ISSN 1432-4350

Lokshtanov, D and Misra, P and Mukherjee, J and Panolan, F. and et al, .
(2021)
*2-Approximating Feedback Vertex Set in Tournaments.*
ACM Transactions on Algorithms, 17 (2).
pp. 1-14.
ISSN 1549-6333

Fomin, F.V. and Lokshtanov, D. and Panolan, F. and et al, .
(2021)
*ETH-TIGHT ALGORITHMS FOR LONG PATH AND CYCLE ON UNIT DISK GRAPHS∗.*
Journal of Computational Geometry, 12 (2).
pp. 126-148.
ISSN 1920-180X

Agrawal, Akanksha and Panolan, Fahad and Saurabh, Saket and et al, .
(2021)
*Simultaneous Feedback Edge Set: A Parameterized Perspective.*
Algorithmica, 83 (2).
pp. 753-774.
ISSN 0178-4617

Fomin, Fedor V and Golovach, Petr A. and Panolan, Fahad and Lokshtanov, Daniel and Saurabh, Saket and Zehavi, Meirav
(2020)
*Going far from degeneracy.*
SIAM Journal on Discrete Mathematics, 34 (3).
1587 -1601.
ISSN 0895-4801

Eibe, Eduard and Fomin, Fedor V and Panolan, Fahad and et al, .
(2020)
*Manipulating Districts to Win Elections: Fine-Grained
Complexity.*
arXiv.org.

Alambardar Meybodi, Mohsen and Fomin, Fedor V and Panolan, Fahad and et al, .
(2020)
*On the parameterized complexity of [1,j]-domination problems.*
Theoretical Computer Science, 804.
pp. 207-218.
ISSN 03043975

Fomin, Fedor V and Golovach, Petr A and Panolan, Fahad
(2020)
*Parameterized low-rank binary matrix approximation.*
Data Mining and Knowledge Discovery.
ISSN 1384-5810
(In Press)

Jacob, Ashwin and Panolan, Fahad
(2020)
*Structural Parameterizations with Modulator Oblivion.*
arXiv.org.

Fomin, Fedor V. and Lokshtanov, Daniel and Kolay, Sudeshna and Panolan, Fahad and Saurabh, Saket
(2020)
*Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems.*
ACM Transactions on Algorithms, 16 (2).
pp. 1-37.
ISSN 1549-6325

Fomin, Fedor V and Golovach, Petr A and Panolan, Fahad and et al, .
(2019)
*Approximation Schemes for Low-rank Binary Matrix Approximation Problems.*
ACM Transactions on Algorithms, 16 (1).
pp. 1-39.
ISSN 15496325

## Conference or Workshop Item

Lokshtanov, D. and Panolan, F. and Ramanujan, M.S.
(2022)
*Backdoor Sets on Nowhere Dense SAT.*
In: 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022, 4 July 2022 through 8 July 2022, Paris.

Fomin, Fedor and Panolan, Fahad and Patil, Anurag and et al, .
(2022)
*Boolean and Fp-Matrix Factorization: From Theory to Practice.*
In: 2022 International Joint Conference on Neural Networks, IJCNN 2022, 18 July 2022through 23 July 2022, Padua.

Agrawal, Akanksha and Kanesh, Lawqueen and Lokshtanov, Daniel and Panolan, Fahad and et al, .
(2022)
*Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent.*
In: 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 9 January 2022 through 12 January 2022, Alexander.

Aryanfard, Bardiya and Panolan, Fahad
(2022)
*Parameterized Complexity of List Coloring and Max Coloring.*
In: 17th International Computer Science Symposium in Russia, CSR 2022, 29 June 2022through 1 July 2022, Virtual, Online.

Golovach, Petr A. and Panolan, Fahad and Rai, Ashutosh and et al, .
(2022)
*Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs.*
In: 17th International Computer Science Symposium in Russia, CSR 2022, 29 June 2022through 1 July 2022, Virtual, Online.

Panolan, Fahad and Yaghoubizade, Hannane
(2022)
*Partial Vertex Cover on Graphs of Bounded Degeneracy.*
In: 17th International Computer Science Symposium in Russia, CSR 2022, 29 June 2022through 1 July 2022, Virtual, Online.

Lokshtanov, D. and Panolan, F. and Saurab, S. and et al, .
(2022)
*Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract).*
In: 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 9 January 2022 through 12 January 2022, Alexander.

Fomin, F.V. and Panolan, F. and et al, .
(2021)
*Diverse Collections in Matroids and Graphs.*
In: 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021).

Eiben, E. and Panolan, F.
(2021)
*EPTAS for k-means clustering of affine subspaces.*
In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 10 January 2021 through 13 January 2021, Alexandria, Virtual.

Agrawal, A. and Kanesh, L. and Panolan, Fahad and et al, .
(2021)
*An FPT algorithm for elimination distance to bounded degree graphs.*
In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, 16 March 2021 through 19 March 2021, Virtual, Saarbrucken.

Gupta, Sushmita and Jain, Pallavi and Panolan, Fahad and et al, .
(2021)
*Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms.*
In: 14th International Symposium on Algorithmic Game Theory, SAGT 2021, 21 September 2021 through 24 September 2021, Virtual, Online.

Fomin, Fedor V. and Golovach, Petr A. and Lokshtanov, Daniel and Panolan, Fahad and et al, .
(2021)
*Multiplicative Parameterization Above a Guarantee.*
In: ACM Transactions on Computation Theory.

Lokshtanov, D. and Misra, P. and Mukherjee, J. and Panolan, Fahad and et al, .
(2020)
*2-approximating feedback vertex set in tournaments.*
In: 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, 5 January 2020through 8 January 2020, Salt Lake City.

Lokshtanov, Daniel and Panolan, Fahad and Saurabh, Saket and et al, .
(2020)
*Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.*
In: ACM Transactions on Algorithms.

Fomin, F.V. and Lokshtanov, D. and Panolan, Fahad and et al, .
(2020)
*Eth-tight algorithms for long path and cycle on unit disk graphs.*
In: 36th International Symposium on Computational Geometry, SoCG 2020, 23 June 2020through 26 June 2020, Zurich.

Fomin, Fedor V and Lokshtanov, Daniel and Panolan, Fahad and et al, .
(2020)
*Hitting Topological Minors is FPT.*
In: STOC 2020:52nd Annual ACM Symposium on Theory of Computing, 22–26 June 2020, Chicago, IL.
(In Press)

Gowda, K.N. and Lonkar, A. and Panolan, Fahad and Patel, V. and Saurabh, S.
(2020)
*Improved FPT algorithms for deletion to forest-like structures.*
In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, 14-18 December 2020, Virtual, Hong Kong.

Fomin, F.V. and Golovach, P.A. and Panolan, Fahad and Simonov, K.
(2020)
*Low-rank binary matrix approximation in column-sum norm.*
In: 23rd International Conference on Approximation Algorithms for Combinatorial Optimization Problems and 24th International Conference on Randomization and Computation, APPROX/RANDOM 2020, 17-19 August 2020, Virtual, Online.

Lokshtanov, Daniel and Mouawad, Amer E. and Panolan, Fahad and Siebertz, Sebastian
(2020)
*On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets.*
In: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 14 December 2020through 18 December 2020, Virtual, Hong Kong.

Fomin, Fedor V and Golovach, P A and Panolan, Fahad and et al, .
(2020)
*Parameterization above a multiplicative guarantee.*
In: 11th Innovations in Theoretical Computer Science Conference, ITCS, 12-14 January 2020, Seattle, United States.

Choudhary, P. and Kanesh, L. and Lokshtanov, D. and Panolan, Fahad and et al, .
(2020)
*Parameterized complexity of feedback vertex sets on hypergraphs.*
In: 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, 14-18 December 2020, Virtual, Goa.

Misra, P. and Panolan, Fahad and Rai, A. and et al, .
(2020)
*Quick separation in chordal and split graphs.*
In: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, 25-26 August 2020, Prague.