Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFahad Panolan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j41]Fedor V. Fomin, Fahad Panolan
, M. S. Ramanujan, Saket Saurabh:
On the optimality of pseudo-polynomial algorithms for integer programming. Math. Program. 198(1): 561-593 (2023)- [c71]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A Framework for Approximation Schemes on Disk Graphs. SODA 2023: 2228-2241 - [c70]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage. SODA 2023: 3713-3733 - 2022
- [j40]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. Algorithmica 84(2): 482-509 (2022) - [j39]Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Structural Parameterizations with Modulator Oblivion. Algorithmica 84(8): 2335-2357 (2022) - [j38]Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh:
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. Algorithmica 84(9): 2622-2641 (2022) - [j37]Suman Banerjee, Rogers Mathew, Fahad Panolan:
Target Set Selection Parameterized by Vertex Cover and More. Theory Comput. Syst. 66(5): 996-1018 (2022) - [j36]Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs. SIAM J. Discret. Math. 36(2): 911-921 (2022) - [c69]Bardiya Aryanfard, Fahad Panolan:
Parameterized Complexity of List Coloring and Max Coloring. CSR 2022: 46-63 - [c68]Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh:
Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. CSR 2022: 152-169 - [c67]Fahad Panolan, Hannane Yaghoubizade:
Partial Vertex Cover on Graphs of Bounded Degeneracy. CSR 2022: 289-301 - [c66]Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan:
Backdoor Sets on Nowhere Dense SAT. ICALP 2022: 91:1-91:20 - [c65]Fedor V. Fomin, Fahad Panolan, Anurag Patil, Adil Tanveer:
Boolean and $\mathbb{F}_{p}$-Matrix Factorization: From Theory to Practice. IJCNN 2022: 1-8 - [c64]Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh, Shaily Verma:
List Homomorphism: Beyond the Known Boundaries. LATIN 2022: 593-609 - [c63]Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. SODA 2022: 1976-2004 - [c62]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). SODA 2022: 2005-2031 - [i34]Fahad Panolan, Hannane Yaghoubizade:
Partial Vertex Cover on Graphs of Bounded Degeneracy. CoRR abs/2201.03876 (2022) - [i33]Fedor V. Fomin, Fahad Panolan, Anurag Patil, Adil Tanveer:
Boolean and Fp-Matrix Factorization: From Theory to Practice. CoRR abs/2207.11917 (2022) - [i32]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A Framework for Approximation Schemes on Disk Graphs. CoRR abs/2211.02717 (2022) - 2021
- [j35]Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Simultaneous Feedback Edge Set: A Parameterized Perspective. Algorithmica 83(2): 753-774 (2021) - [j34]Meirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. J. Comput. Geom. 12(2): 126-148 (2021) - [j33]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
2-Approximating Feedback Vertex Set in Tournaments. ACM Trans. Algorithms 17(2): 11:1-11:14 (2021) - [j32]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Multiplicative Parameterization Above a Guarantee. ACM Trans. Comput. Theory 13(3): 18:1-18:16 (2021) - [c61]Yogesh Dahiya, Fedor V. Fomin, Fahad Panolan, Kirill Simonov:
Fixed-Parameter and Approximation Algorithms for PCA with Outliers. ICML 2021: 2341-2351 - [c60]Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh:
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT 2021: 140-155 - [c59]Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov:
EPTAS for k-means Clustering of Affine Subspaces. SODA 2021: 2649-2659 - [c58]Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. STACS 2021: 5:1-5:11 - [c57]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Diverse Collections in Matroids and Graphs. STACS 2021: 31:1-31:14 - [i31]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Diverse Collections in Matroids and Graphs. CoRR abs/2101.04633 (2021) - [i30]Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh:
Gerrymandering on graphs: Computational complexity and parameterized algorithms. CoRR abs/2102.09889 (2021) - [i29]Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Elimination Distance to Topological-minor-free Graphs is FPT. CoRR abs/2104.09950 (2021) - 2020
- [j31]Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh:
Parameterized Complexity of Geometric Covering Problems Having Conflicts. Algorithmica 82(1): 1-19 (2020) - [j30]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan:
Parameterized low-rank binary matrix approximation. Data Min. Knowl. Discov. 34(2): 478-532 (2020) - [j29]Neeldhara Misra, Fahad Panolan, Saket Saurabh:
Subexponential algorithm for d-cluster edge deletion: Exception or rule? J. Comput. Syst. Sci. 113: 150-162 (2020) - [j28]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far from Degeneracy. SIAM J. Discret. Math. 34(3): 1587-1601 (2020) - [j27]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Approximation Schemes for Low-rank Binary Matrix Approximation Problems. ACM Trans. Algorithms 16(1): 12:1-12:39 (2020) - [j26]Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh:
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ACM Trans. Algorithms 16(2): 21:1-21:37 (2020) - [j25]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. ACM Trans. Algorithms 16(3): 32:1-32:31 (2020) - [j24]Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan:
On the parameterized complexity of [1, j]-domination problems. Theor. Comput. Sci. 804: 207-218 (2020) - [j23]Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Linear representation of transversal matroids and gammoids parameterized by rank. Theor. Comput. Sci. 818: 51-59 (2020) - [c56]Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov:
Manipulating Districts to Win Elections: Fine-Grained Complexity. AAAI 2020: 1902-1909 - [c55]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov:
Low-Rank Binary Matrix Approximation in Column-Sum Norm. APPROX-RANDOM 2020: 32:1-32:18 - [c54]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. SoCG 2020: 44:1-44:18 - [c53]Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs. FSTTCS 2020: 18:1-18:15 - [c52]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. ICALP 2020: 80:1-80:16 - [c51]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Parameterization Above a Multiplicative Guarantee. ITCS 2020: 39:1-39:13 - [c50]Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh:
Improved FPT Algorithms for Deletion to Forest-Like Structures. ISAAC 2020: 34:1-34:16 - [c49]Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Structural Parameterizations with Modulator Oblivion. IPEC 2020: 19:1-19:18 - [c48]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. IPEC 2020: 24:1-24:15 - [c47]Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma:
Quick Separation in Chordal and Split Graphs. MFCS 2020: 70:1-70:14 - [c46]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
2-Approximating Feedback Vertex Set in Tournaments. SODA 2020: 1010-1018 - [c45]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Hitting topological minors is FPT. STOC 2020: 1317-1326 - [i28]Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov:
Manipulating Districts to Win Elections: Fine-Grained Complexity. CoRR abs/2002.07607 (2020) - [i27]Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Structural Parameterizations with Modulator Oblivion. CoRR abs/2002.09972 (2020) - [i26]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. CoRR abs/2003.00938 (2020) - [i25]Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh:
Improved FPT Algorithms for Deletion to Forest-like Structures. CoRR abs/2009.13949 (2020) - [i24]Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov:
EPTAS for k-means Clustering of Affine Subspaces. CoRR abs/2010.09580 (2020)
2010 – 2019
- 2019
- [j22]Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Stability in barter exchange markets. Auton. Agents Multi Agent Syst. 33(5): 518-539 (2019) - [j21]Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica 81(1): 26-46 (2019) - [j20]Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms for List K-Cycle. Algorithmica 81(3): 1267-1287 (2019) - [j19]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discret. Comput. Geom. 62(4): 879-911 (2019) - [j18]Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. SIAM J. Discret. Math. 33(1): 327-345 (2019) - [j17]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh:
Editing to Connected F-Degree Graph. SIAM J. Discret. Math. 33(2): 795-836 (2019) - [j16]Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Rank Vertex Cover as a Natural Problem for Algebraic Compression. SIAM J. Discret. Math. 33(3): 1277-1296 (2019) - [j15]Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
Lossy Kernels for Connected Dominating Set on Sparse Graphs. SIAM J. Discret. Math. 33(3): 1743-1771 (2019) - [j14]Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale:
Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comput. Sci. 772: 132-142 (2019) - [j13]Sudeshna Kolay, Fahad Panolan, Saket Saurabh:
Communication Complexity and Graph Families. ACM Trans. Comput. Theory 11(2): 11:1-11:28 (2019) - [c44]Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh:
On the Complexity of Mixed Dominating Set. CSR 2019: 262-274 - [c43]Neeldhara Misra, Fahad Panolan, Saket Saurabh:
On the Parameterized Complexity of Edge-Linked Paths. CSR 2019: 286-298 - [c42]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far From Degeneracy. ESA 2019: 47:1-47:14 - [c41]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Decomposition of Map Graphs with Applications. ICALP 2019: 60:1-60:15 - [c40]Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan:
Refined Complexity of PCA with Outliers. ICML 2019: 5818-5826 - [c39]Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. SODA 2019: 1035-1054 - [c38]Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý:
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. STACS 2019: 25:1-25:17 - [c37]Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Parameterized Computational Geometry via Decomposition Theorems. WALCOM 2019: 15-27 - [i23]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far From Degeneracy. CoRR abs/1902.02526 (2019) - [i22]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Decomposition of Map Graphs with Applications. CoRR abs/1903.01291 (2019) - [i21]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Reducing Topological Minor Containment to the Unique Linkage Theorem. CoRR abs/1904.02944 (2019) - [i20]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov:
Low-rank binary matrix approximation in column-sum norm. CoRR abs/1904.06141 (2019) - [i19]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov:
Refined Complexity of PCA with Outliers. CoRR abs/1905.04124 (2019) - [i18]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. CoRR abs/1910.00581 (2019) - 2018
- [j12]Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Fréchet Distance Between a Line and Avatar Point Set. Algorithmica 80(9): 2616-2636 (2018) - [j11]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Long directed (s, t)-path: FPT algorithm. Inf. Process. Lett. 140: 8-12 (2018) - [j10]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Reconfiguration on sparse graphs. J. Comput. Syst. Sci. 95: 122-131 (2018) - [j9]Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Finding even subgraphs even faster. J. Comput. Syst. Sci. 97: 1-13 (2018) - [j8]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh:
Deterministic Truncation of Linear Matroids. ACM Trans. Algorithms 14(2): 14:1-14:20 (2018) - [j7]Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh:
On the kernelization complexity of string problems. Theor. Comput. Sci. 730: 21-31 (2018) - [c36]Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Stability in Barter Exchange Markets. AAMAS 2018: 1371-1379 - [c35]Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. ESA 2018: 31:1-31:13 - [c34]Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan:
On the Parameterized Complexity of [1, j]-Domination Problems. FSTTCS 2018: 34:1-34:14 - [c33]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan:
Parameterized Low-Rank Binary Matrix Approximation. ICALP 2018: 53:1-53:16 - [c32]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. ITCS 2018: 32:1-32:13 - [c31]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. SODA 2018: 2785-2800 - [c30]Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
Lossy Kernels for Connected Dominating Set on Sparse Graphs. STACS 2018: 29:1-29:15 - [i17]Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý:
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. CoRR abs/1802.08189 (2018) - [i16]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan:
Parameterized Low-Rank Binary Matrix Approximation. CoRR abs/1803.06102 (2018) - [i15]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Approximation Schemes for Low-Rank Binary Matrix Approximation Problems. CoRR abs/1807.07156 (2018) - [i14]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh:
A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. CoRR abs/1809.08437 (2018) - 2017
- [j6]Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Quick but Odd Growth of Cacti. Algorithmica 79(1): 271-290 (2017) - [j5]Fahad Panolan, Geevarghese Philip, Saket Saurabh:
On the parameterized complexity of b-chromatic number. J. Comput. Syst. Sci. 84: 120-131 (2017) - [j4]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Representative Families of Product Families. ACM Trans. Algorithms 13(3): 36:1-36:29 (2017) - [c29]Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. COCOON 2017: 420-432 - [c28]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. ICALP 2017: 65:1-65:15 - [c27]Sudeshna Kolay, Fahad Panolan, Saket Saurabh:
Communication Complexity of Pairs of Graph Families with Applications. MFCS 2017: 13:1-13:13 - [c26]Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Lossy kernelization. STOC 2017: 224-237 - [c25]Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh:
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. WADS 2017: 25-36 - [c24]Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh:
Parameterized Complexity of Geometric Covering Problems Having Conflicts. WADS 2017: 61-72 - [c23]Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu:
Mixed Dominating Set: A Parameterized Perspective. WG 2017: 330-343 - [i13]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. CoRR abs/1704.07279 (2017) - [i12]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. CoRR abs/1705.01414 (2017) - [i11]Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Rank Vertex Cover as a Natural Problem for Algebraic Compression. CoRR abs/1705.02822 (2017) - [i10]Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan:
Lossy Kernels for Connected Dominating Set on Sparse Graphs. CoRR abs/1706.09339 (2017) - 2016
- [j3]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms. J. ACM 63(4): 29:1-29:60 (2016) - [c22]Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. SoCG 2016: 39:1-39:15 - [c21]Fahad Panolan, Meirav Zehavi:
Parameterized Algorithms for List K-Cycle. FSTTCS 2016: 22:1-22:15 - [c20]Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Fréchet Distance Between a Line and Avatar Point Set. FSTTCS 2016: 32:1-32:14 - [c19]Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Simultaneous Feedback Edge Set: A Parameterized Perspective. ISAAC 2016: 5:1-5:13 - [c18]