default search action
Fahad Panolan
Person information
- affiliation: University of Leeds, UK
- affiliation (former): IIT Hyderabad, Sangareddy, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j44]Kishen N. Gowda
, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh:
Improved FPT Algorithms for Deletion to Forest-Like Structures. Algorithmica 86(5): 1657-1699 (2024) - [j43]Fedor V. Fomin
Diverse collections in matroids and graphs. Math. Program. 204(1): 415-447 (2024) - [j42]Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. ACM Trans. Algorithms 20(2): 15 (2024) - [c82]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. APPROX/RANDOM 2024: 6:1-6:14 - [c81]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. SoCG 2024: 72:1-72:11 - [c80]Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki:
Solving Quantified Boolean Formulas with Few Existential Variables. IJCAI 2024: 1889-1897 - [c79]Shubhada Aute
Parameterized Algorithms for Minimum Sum Vertex Cover. LATIN (2) 2024: 193-207 - [c78]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. LATIN (2) 2024: 223-237 - [c77]Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki:
Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. MFCS 2024: 39:1-39:14 - [c76]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Meta-theorems for Parameterized Streaming Algorithms‡. SODA 2024: 712-739 - [c75]Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Peter Strulo:
Decremental Sensitivity Oracles for Covering and Packing Minors. STACS 2024: 44:1-44:19 - [c74]Fahad Panolan
On MAX-SAT with Cardinality Constraint. WALCOM 2024: 118-133 - [i42]Shubhada Aute, Fahad Panolan:
Parameterized Algorithms for Minimum Sum Vertex Cover. CoRR abs/2401.05085 (2024) - [i41]Leif Eriksson, Victor Lagerkvist, George Osipov, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki:
Solving Quantified Boolean Formulas with Few Existential Variables. CoRR abs/2405.06485 (2024) - [i40]Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
When far is better: The Chamberlin-Courant approach to obnoxious committee selection. CoRR abs/2405.15372 (2024) - [i39]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. CoRR abs/2407.09356 (2024) - [i38]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Subexponential Parameterized Algorithms for Hitting Subgraphs. CoRR abs/2409.04786 (2024) - 2023
- [j41]Fedor V. Fomin
On the optimality of pseudo-polynomial algorithms for integer programming. Math. Program. 198(1): 561-593 (2023) - [c73]Daniel Lokshtanov, Fahad Panolan
A Framework for Approximation Schemes on Disk Graphs. SODA 2023: 2228-2241 - [c72]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan
Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage. SODA 2023: 3713-3733 - [c71]Sayan Bandyapadhyay
Socially Fair Matching: Exact and Approximation Algorithms. WADS 2023: 79-92 - [c70]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan
An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS 2023: 588-604 - [i37]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. CoRR abs/2304.13695 (2023) - [i36]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan
Meta-theorems for Parameterized Streaming Algorithms. CoRR abs/2308.01598 (2023) - [i35]Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan
Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective. CoRR abs/2309.04346 (2023) - 2022
- [j40]Daniel Lokshtanov, Amer E. Mouawad
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. Algorithmica 84(2): 482-509 (2022) - [j39]Ashwin Jacob
Structural Parameterizations with Modulator Oblivion. Algorithmica 84(8): 2335-2357 (2022) - [j38]Akanksha Agrawal
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
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
Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. CSR 2022: 152-169 - [c67]Fahad Panolan
Partial Vertex Cover on Graphs of Bounded Degeneracy. CSR 2022: 289-301 - [c66]Daniel Lokshtanov, Fahad Panolan
Backdoor Sets on Nowhere Dense SAT. ICALP 2022: 91:1-91:20 - [c65]Fedor V. Fomin
Boolean and $\mathbb{F}_{p}$-Matrix Factorization: From Theory to Practice. IJCNN 2022: 1-8 - [c64]Sriram Bhyravarapu, Satyabrata Jana
List Homomorphism: Beyond the Known Boundaries. LATIN 2022: 593-609 - [c63]Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. SODA 2022: 1976-2004 - [c62]Daniel Lokshtanov, Fahad Panolan
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
Boolean and Fp-Matrix Factorization: From Theory to Practice. CoRR abs/2207.11917 (2022) - [i32]Daniel Lokshtanov, Fahad Panolan
A Framework for Approximation Schemes on Disk Graphs. CoRR abs/2211.02717 (2022) - 2021
- [j35]Akanksha Agrawal, Fahad Panolan
Simultaneous Feedback Edge Set: A Parameterized Perspective. Algorithmica 83(2): 753-774 (2021) - [j34]Meirav Zehavi, Fedor V. Fomin
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
2-Approximating Feedback Vertex Set in Tournaments. ACM Trans. Algorithms 17(2): 11:1-11:14 (2021) - [j32]Fedor V. Fomin
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
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT 2021: 140-155 - [c59]Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet
EPTAS for k-means Clustering of Affine Subspaces. SODA 2021: 2649-2659 - [c58]Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. STACS 2021: 5:1-5:11 - [c57]Fedor V. Fomin
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
Parameterized Complexity of Geometric Covering Problems Having Conflicts. Algorithmica 82(1): 1-19 (2020) - [j30]Fedor V. Fomin
Parameterized low-rank binary matrix approximation. Data Min. Knowl. Discov. 34(2): 478-532 (2020) - [j29]Neeldhara Misra, Fahad Panolan
Subexponential algorithm for d-cluster edge deletion: Exception or rule? J. Comput. Syst. Sci. 113: 150-162 (2020) - [j28]Fedor V. Fomin
Going Far from Degeneracy. SIAM J. Discret. Math. 34(3): 1587-1601 (2020) - [j27]Fedor V. Fomin
Approximation Schemes for Low-rank Binary Matrix Approximation Problems. ACM Trans. Algorithms 16(1): 12:1-12:39 (2020) - [j26]Fedor V. Fomin
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ACM Trans. Algorithms 16(2): 21:1-21:37 (2020) - [j25]Daniel Lokshtanov, Fahad Panolan
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
On the parameterized complexity of [1, j]-domination problems. Theor. Comput. Sci. 804: 207-218 (2020) - [j23]Pranabendu Misra, Fahad Panolan
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
Manipulating Districts to Win Elections: Fine-Grained Complexity. AAAI 2020: 1902-1909 - [c55]Fedor V. Fomin
Low-Rank Binary Matrix Approximation in Column-Sum Norm. APPROX-RANDOM 2020: 32:1-32:18 - [c54]Fedor V. Fomin
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
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs. FSTTCS 2020: 18:1-18:15 - [c52]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. ICALP 2020: 80:1-80:16 - [c51]Fedor V. Fomin
Parameterization Above a Multiplicative Guarantee. ITCS 2020: 39:1-39:13 - [c50]Kishen N. Gowda
Improved FPT Algorithms for Deletion to Forest-Like Structures. ISAAC 2020: 34:1-34:16 - [c49]Ashwin Jacob
Structural Parameterizations with Modulator Oblivion. IPEC 2020: 19:1-19:18 - [c48]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. IPEC 2020: 24:1-24:15 - [c47]Pranabendu Misra, Fahad Panolan
Quick Separation in Chordal and Split Graphs. MFCS 2020: 70:1-70:14 - [c46]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan
2-Approximating Feedback Vertex Set in Tournaments. SODA 2020: 1010-1018 - [c45]Fedor V. Fomin
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
Stability in barter exchange markets. Auton. Agents Multi Agent Syst. 33(5): 518-539 (2019) - [j21]Neeldhara Misra, Fahad Panolan
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica 81(1): 26-46 (2019) - [j20]Fahad Panolan
Parameterized Algorithms for List K-Cycle. Algorithmica 81(3): 1267-1287 (2019) - [j19]Fedor V. Fomin
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discret. Comput. Geom. 62(4): 879-911 (2019) - [j18]Fedor V. Fomin
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. SIAM J. Discret. Math. 33(1): 327-345 (2019) - [j17]Fedor V. Fomin
Editing to Connected F-Degree Graph. SIAM J. Discret. Math. 33(2): 795-836 (2019) - [j16]Syed Mohammad Meesum
Rank Vertex Cover as a Natural Problem for Algebraic Compression. SIAM J. Discret. Math. 33(3): 1277-1296 (2019) - [j15]Eduard Eiben, Mithilesh Kumar
Lossy Kernels for Connected Dominating Set on Sparse Graphs. SIAM J. Discret. Math. 33(3): 1743-1771 (2019) - [j14]Sudeshna Kolay, Ragukumar Pandurangan
Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comput. Sci. 772: 132-142 (2019) - [j13]Sudeshna Kolay, Fahad Panolan
Communication Complexity and Graph Families. ACM Trans. Comput. Theory 11(2): 11:1-11:28 (2019) - [c44]Jayakrishnan Madathil, Fahad Panolan
On the Complexity of Mixed Dominating Set. CSR 2019: 262-274 - [c43]Neeldhara Misra, Fahad Panolan
On the Parameterized Complexity of Edge-Linked Paths. CSR 2019: 286-298 - [c42]Fedor V. Fomin
Going Far From Degeneracy. ESA 2019: 47:1-47:14 - [c41]Fedor V. Fomin
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
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. SODA 2019: 1035-1054 - [c38]Eduard Eiben
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. STACS 2019: 25:1-25:17 - [c37]Fahad Panolan
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
Fréchet Distance Between a Line and Avatar Point Set. Algorithmica 80(9): 2616-2636 (2018) - [j11]Fedor V. Fomin
Long directed (s, t)-path: FPT algorithm. Inf. Process. Lett. 140: 8-12 (2018) - [j10]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan
Reconfiguration on sparse graphs. J. Comput. Syst. Sci. 95: 122-131 (2018) - [j9]Prachi Goyal, Pranabendu Misra, Fahad Panolan
Finding even subgraphs even faster. J. Comput. Syst. Sci. 97: 1-13 (2018) - [j8]Daniel Lokshtanov, Pranabendu Misra
Deterministic Truncation of Linear Matroids. ACM Trans. Algorithms 14(2): 14:1-14:20 (2018) - [j7]Manu Basavaraju, Fahad Panolan
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
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. ESA 2018: 31:1-31:13 - [c34]Mohsen Alambardar Meybodi, Fedor V. Fomin
On the Parameterized Complexity of [1, j]-Domination Problems. FSTTCS 2018: 34:1-34:14 - [c33]Fedor V. Fomin
Parameterized Low-Rank Binary Matrix Approximation. ICALP 2018: 53:1-53:16 - [c32]Daniel Lokshtanov, Pranabendu Misra
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. ITCS 2018: 32:1-32:13 - [c31]Daniel Lokshtanov, Fahad Panolan
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. SODA 2018: 2785-2800 - [c30]Eduard Eiben, Mithilesh Kumar
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
Quick but Odd Growth of Cacti. Algorithmica 79(1): 271-290 (2017) - [j5]Fahad Panolan
On the parameterized complexity of b-chromatic number. J. Comput. Syst. Sci. 84: 120-131 (2017) - [j4]Fedor V. Fomin
Representative Families of Product Families. ACM Trans. Algorithms 13(3): 36:1-36:29 (2017) - [c29]Pranabendu Misra, Fahad Panolan
Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. COCOON 2017: 420-432 - [c28]Fedor V. Fomin
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. ICALP 2017: 65:1-65:15 - [c27]Sudeshna Kolay, Fahad Panolan
Communication Complexity of Pairs of Graph Families with Applications. MFCS 2017: 13:1-13:13 - [c26]Daniel Lokshtanov, Fahad Panolan
Lossy kernelization. STOC 2017: 224-237 - [c25]Akanksha Agrawal, Pranabendu Misra, Fahad Panolan
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. WADS 2017: 25-36 - [c24]Aritra Banik, Fahad Panolan
Parameterized Complexity of Geometric Covering Problems Having Conflicts. WADS 2017: 61-72 - [c23]Pallavi Jain, Jayakrishnan Madathil
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
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
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. SoCG 2016: 39:1-39:15 - [c21]Fahad Panolan
Parameterized Algorithms for List K-Cycle. FSTTCS 2016: 22:1-22:15 - [c20]Aritra Banik, Fahad Panolan
Fréchet Distance Between a Line and Avatar Point Set. FSTTCS 2016: 32:1-32:14 - [c19]Akanksha Agrawal
Simultaneous Feedback Edge Set: A Parameterized Perspective. ISAAC 2016: 5:1-5:13 - [c18]Sudeshna Kolay, Fahad Panolan
Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. MFCS 2016: 75:1-75:13 - [c17]Fedor V. Fomin
Editing to Connected f-Degree Graph. STACS 2016: 36:1-36:14 - [c16]Sudeshna Kolay, Ragukumar Pandurangan
Harmonious Coloring: Parameterized Algorithms and Upper Bounds. WG 2016: 245-256 - [r1]Fahad Panolan
Matroids in Parameterized Complexity and Exact Algorithms. Encyclopedia of Algorithms 2016: 1203-1206 - [i9]Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Lossy Kernelization. CoRR abs/1604.04111 (2016) - [i8]Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Fine-grained complexity of integer programming: The case of bounded branch-width and rank. CoRR abs/1607.05342 (2016) - [i7]Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Simultaneous Feedback Edge Set: A Parameterized Perspective. CoRR abs/1611.07701 (2016) - 2015
- [j2]Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan
Faster Parameterized Algorithms for Deletion to Split Graphs. Algorithmica 71(4): 989-1006 (2015) - [j1]Prachi Goyal, Neeldhara Misra, Fahad Panolan
Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets. SIAM J. Discret. Math. 29(4): 1815-1836 (2015) - [c15]Sudeshna Kolay, Fahad Panolan
Parameterized Algorithms for Deletion to (r, ell)-Graphs. FSTTCS 2015: 420-433 - [c14]Prachi Goyal, Pranabendu Misra, Fahad Panolan
Finding Even Subgraphs Even Faster. FSTTCS 2015: 434-447 - [c13]Fedor V. Fomin
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. ICALP (1) 2015: 494-505 - [c12]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan
Deterministic Truncation of Linear Matroids. ICALP (1) 2015: 922-934 - [c11]Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan
Quick but Odd Growth of Cacti. IPEC 2015: 258-269 - [c10]Fahad Panolan
B-Chromatic Number: Beyond NP-Hardness. IPEC 2015: 389-401 - [c9]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan
Reconfiguration on Sparse Graphs. WADS 2015: 506-517 - [c8]Fahad Panolan
On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids. WADS 2015: 566-577 - [i6]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Reconfiguration on sparse graphs. CoRR abs/1502.04803 (2015) - [i5]Sudeshna Kolay, Fahad Panolan:
Parameterized Algorithms for Deletion to (r, l)-graphs. CoRR abs/1504.08120 (2015) - [i4]Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs. CoRR abs/1512.04200 (2015) - 2014
- [c7]Manu Basavaraju, Fahad Panolan
On the Kernelization Complexity of String Problems. COCOON 2014: 141-153 - [c6]Fedor V. Fomin
Representative Sets of Product Families. ESA 2014: 443-454 - [i3]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Representative Sets of Product Families. CoRR abs/1402.3909 (2014) - [i2]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh:
Deterministic Truncation of Linear Matroids. CoRR abs/1404.4506 (2014) - [i1]Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Finding Even Subgraphs Even Faster. CoRR abs/1409.4935 (2014) - 2013
- [c5]Prachi Goyal, Neeldhara Misra, Fahad Panolan
Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets. FSTTCS 2013: 237-248 - [c4]Neeldhara Misra, Fahad Panolan
Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? MFCS 2013: 679-690 - [c3]Neeldhara Misra, Fahad Panolan
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. WG 2013: 370-381 - 2012
- [c2]Fahad Panolan
On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles. COCOON 2012: 445-457 - [c1]Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan
Faster Parameterized Algorithms for Deletion to Split Graphs. SWAT 2012: 107-118
Coauthor Index
[j43] [j41] [c71] [c65] [i33] [j34] [j32] [c61] [c59] [c57] [i31] [j30] [j28] [j27] [j26] [j24] [c56] [c55] [c54] [c51] [c45] [i28] [i26] [i24] [j19] [j18] [j17] [c42] [c41] [c40] [i23] [i22] [i21] [i20] [i19] [j11] [c35] [c34] [c33] [i16] [i15] [j4] [c28] [i13] [j3] [c22] [c17] [i8] [c13] [c6] [i3]
[c82] [c81] [c76] [i40] [i39] [i38] [c73] [c70] [i37] [i36] [j40] [c66] [c63] [c62] [i32] [j34] [j33] [j32] [i29] [j28] [j27] [j26] [j25] [c54] [c53] [c52] [c51] [c48] [c46] [c45] [i26] [j19] [j18] [c42] [c41] [i23] [i22] [i21] [i18] [j11] [j10] [j8] [c32] [c31] [i15] [i14] [j6] [j4] [c28] [c26] [i13] [i12] [j3] [c22] [i9] [c13] [c12] [c11] [c9] [i6] [c6] [i3] [i2]
[j44] [j43] [j42] [c82] [c81] [c78] [c76] [i40] [i39] [i38] [j41] [c73] [c72] [c70] [i37] [i36] [j38] [j36] [c68] [c64] [c63] [c62] [i32] [j35] [j34] [j33] [j32] [c60] [c58] [c57] [i31] [i30] [i29] [j31] [j29] [j28] [j27] [j26] [j25] [j23] [c54] [c53] [c52] [c51] [c50] [c47] [c46] [c45] [i26] [i25] [j22] [j21] [j20] [j19] [j18] [j17] [j16] [j13] [c44] [c43] [c42] [c41] [c39] [c37] [i23] [i22] [i21] [j11] [j10] [j9] [j8] [j7] [c36] [c35] [c32] [c31] [i15] [i14] [j6] [j5] [j4] [c29] [c28] [c27] [c26] [c25] [c24] [i13] [i12] [i11] [j3] [c22] [c19] [c18] [c17] [r1] [i9] [i8] [i7] [c14] [c13] [c12] [c11] [c10] [c9] [c8] [i6] [i4] [c7] [c6] [i3] [i2] [i1] [c4] [c3]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 21:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: