Fahad Panolan
Titel
Geciteerd door
Geciteerd door
Jaar
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
1022016
Lossy kernelization
D Lokshtanov, F Panolan, MS Ramanujan, S Saurabh
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing†…, 2017
542017
Representative families of product families
FV Fomin, D Lokshtanov, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 13 (3), 1-29, 2017
48*2017
Faster parameterized algorithms for deletion to split graphs
E Ghosh, S Kolay, M Kumar, P Misra, F Panolan, A Rai, MS Ramanujan
Algorithmica 71 (4), 989-1006, 2015
472015
Deterministic truncation of linear matroids
D Lokshtanov, P Misra, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 14 (2), 1-20, 2018
322018
Reconfiguration on sparse graphs
D Lokshtanov, AE Mouawad, F Panolan, MS Ramanujan, S Saurabh
Journal of Computer and System Sciences 95, 122-131, 2018
282018
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
20*2015
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
172019
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 (4), 879-911, 2019
132019
Parameterized single-exponential time polynomial space algorithm for steiner tree
FV Fomin, P Kaski, D Lokshtanov, F Panolan, S Saurabh
SIAM Journal on Discrete Mathematics 33 (1), 327-345, 2019
13*2019
Editing to connected f-degree graph
FV Fomin, P Golovach, F Panolan, S Saurabh
SIAM Journal on Discrete Mathematics 33 (2), 795-836, 2019
122019
Finding even subgraphs even faster
P Goyal, P Misra, F Panolan, G Philip, S Saurabh
Journal of Computer and System Sciences 97, 1-13, 2018
112018
Parameterized algorithms for deletion to (r, l)-graphs
S Kolay, F Panolan
arXiv preprint arXiv:1504.08120, 2015
112015
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
102019
Parameterized low-rank binary matrix approximation
FV Fomin, PA Golovach, F Panolan
Data Mining and Knowledge Discovery 34 (2), 478-532, 2020
92020
On the optimality of pseudo-polynomial algorithms for integer programming
FV Fomin, F Panolan, MS Ramanujan, S Saurabh
arXiv preprint arXiv:1607.05342, 2016
9*2016
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
N Misra, F Panolan, A Rai, V Raman, S Saurabh
International Workshop on Graph-Theoretic Concepts in Computer Science, 370-381, 2013
92013
Mixed Dominating Set: A Parameterized Perspective
P Jain, M Jayakrishnan, F Panolan, A Sahu
International Workshop on Graph-Theoretic Concepts in Computer Science, 330-343, 2017
72017
On the parameterized complexity of b-chromatic number
F Panolan, G Philip, S Saurabh
Journal of Computer and System Sciences 84, 120-131, 2017
7*2017
Parameterized algorithms on perfect graphs for deletion to (r, l)-graphs
S Kolay, F Panolan, V Raman, S Saurabh
41st International Symposium on Mathematical Foundations of Computer Science†…, 2016
72016
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20