Articles with public access mandates - Fahad PanolanLearn more
Not available anywhere: 8
Mixed Dominating Set: A Parameterized Perspective
P Jain, M Jayakrishnan, F Panolan, A Sahu
Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017
Mandates: European Commission
On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids
F Panolan, MS Ramanujan, S Saurabh
Algorithms and Data Structures: 14th International Symposium, WADS 2015 …, 2015
Mandates: European Commission
Fast exact algorithms for survivable network design with uniform requirements
A Agrawal, P Misra, F Panolan, S Saurabh
Algorithmica 84 (9), 2622-2641, 2022
Mandates: European Commission
Fast exact algorithms for survivable network design with uniform requirements
A Agrawal, P Misra, F Panolan, S Saurabh
Workshop on Algorithms and Data Structures, 25-36, 2017
Mandates: European Commission
On the Complexity of Mixed Dominating Set
J Madathil, F Panolan, A Sahu, S Saurabh
Computer Science–Theory and Applications: 14th International Computer …, 2019
Mandates: European Commission, Research Council of Norway
On the parameterized complexity of edge-linked paths
N Misra, F Panolan, S Saurabh
Computer Science–Theory and Applications: 14th International Computer …, 2019
Mandates: European Commission, Research Council of Norway
An ETH-Tight Algorithm for Bidirected Steiner Connectivity
D Lokshtanov, P Misra, F Panolan, S Saurabh, M Zehavi
Algorithms and Data Structures Symposium, 588-604, 2023
Mandates: US National Science Foundation
List Homomorphism: Beyond the Known Boundaries
S Bhyravarapu, S Jana, F Panolan, S Saurabh, S Verma
Latin American Symposium on Theoretical Informatics, 593-609, 2022
Mandates: Department of Science & Technology, India
Available somewhere: 50
Efficient computation of representative families with applications in parameterized and exact algorithms
FV Fomin, D Lokshtanov, F Panolan, S Saurabh
Journal of the ACM (JACM) 63 (4), 1-60, 2016
Mandates: European Commission
Lossy kernelization
D Lokshtanov, F Panolan, MS Ramanujan, S Saurabh
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
Mandates: Austrian Science Fund, European Commission
Representative families of product families
FV Fomin, D Lokshtanov, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 13 (3), 1-29, 2017
Mandates: European Commission
Deterministic truncation of linear matroids
D Lokshtanov, P Misra, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 14 (2), 1-20, 2018
Mandates: European Commission
Finding, hitting and packing cycles in subexponential time on unit disk graphs
FV Fomin, D Lokshtanov, F Panolan, S Saurabh, M Zehavi
Discrete & Computational Geometry 62, 879-911, 2019
Mandates: European Commission, Research Council of Norway
Lossy kernels for connected dominating set on sparse graphs
E Eiben, M Kumar, AE Mouawad, F Panolan, S Siebertz
SIAM Journal on Discrete Mathematics 33 (3), 1743-1771, 2019
Mandates: Austrian Science Fund, European Commission
Approximation schemes for low-rank binary matrix approximation problems
FV Fomin, PA Golovach, D Lokshtanov, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 16 (1), 1-39, 2019
Mandates: European Commission, Research Council of Norway
Parameterized low-rank binary matrix approximation
FV Fomin, PA Golovach, F Panolan
Data Mining and Knowledge Discovery 34, 478-532, 2020
Mandates: Research Council of Norway
Hitting topological minors is FPT
FV Fomin, D Lokshtanov, F Panolan, S Saurabh, M Zehavi
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
Mandates: US National Science Foundation, European Commission, Research Council of Norway
Deterministic algorithms for matching and packing problems based on representative sets
P Goyal, N Misra, F Panolan, M Zehavi
SIAM Journal on Discrete Mathematics 29 (4), 1815-1836, 2015
Mandates: Department of Science & Technology, India
2-approximating feedback vertex set in tournaments
D Lokshtanov, P Misra, J Mukherjee, F Panolan, G Philip, S Saurabh
ACM Transactions on Algorithms (TALG) 17 (2), 1-14, 2021
Mandates: European Commission, Research Council of Norway
A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs
A Agrawal, L Kanesh, F Panolan, MS Ramanujan, S Saurabh
SIAM Journal on Discrete Mathematics 36 (2), 911-921, 2022
Mandates: UK Engineering and Physical Sciences Research Council, European Commission
Publication and funding information is determined automatically by a computer program