The following pages link to Fahad Panolan (Q340563):
Displaying 50 items.
- On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Fréchet distance between a line and avatar point set (Q722543) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Finding even subgraphs even faster (Q1671994) (← links)
- Mixed Dominating Set: a parameterized perspective (Q1687931) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- On the kernelization complexity of string problems (Q1749539) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Long directed \((s,t)\)-path: FPT algorithm (Q1799598) (← links)
- Target set selection parameterized by vertex cover and more (Q2082561) (← links)
- Parameterized complexity of list coloring and max coloring (Q2097212) (← links)
- Parameterized complexity of set-restricted disjoint paths on chordal graphs (Q2097221) (← links)
- Partial vertex cover on graphs of bounded degeneracy (Q2097233) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? (Q2186825) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- Parameterized computational geometry via decomposition theorems (Q2327518) (← links)
- On the complexity of Mixed Dominating Set (Q2330564) (← links)
- On the parameterized complexity of edge-linked paths (Q2330567) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Faster parameterized algorithms for deletion to split graphs (Q2350905) (← links)
- Quick but odd growth of cacti (Q2408205) (← links)
- Harmonious coloring: parameterized algorithms and upper bounds (Q2632021) (← links)
- Simultaneous feedback edge set: a parameterized perspective (Q2659779) (← links)
- Gerrymandering on graphs: computational complexity and parameterized algorithms (Q2670918) (← links)
- On the optimality of pseudo-polynomial algorithms for integer programming (Q2687057) (← links)
- Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? (Q2849953) (← links)
- Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs (Q2864316) (← links)
- Faster Parameterized Algorithms for Deletion to Split Graphs (Q2904547) (← links)
- On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles (Q2914348) (← links)
- On the Kernelization Complexity of String Problems (Q2920454) (← links)
- Representative Sets of Product Families (Q2921430) (← links)
- (Q2963917) (← links)
- Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems (Q3132873) (← links)
- Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms (Q3177805) (← links)
- Harmonious Coloring: Parameterized Algorithms and Upper Bounds (Q3181062) (← links)
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q3448810) (← links)
- Deterministic Truncation of Linear Matroids (Q3448849) (← links)
- On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids (Q3449854) (← links)
- Editing to Connected f-Degree Graph (Q4601888) (← links)
- Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms (Q4608072) (← links)
- Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs (Q4608638) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q4619482) (← links)
- (Q4636486) (← links)
- Parameterized Algorithms for List K-Cycle (Q4636569) (← links)
- Fréchet Distance Between a Line and Avatar Point Set (Q4636580) (← links)
