The following pages link to Jianer Chen (Q1599636):
Displaying 50 items.
- Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees (Q2864298) (← links)
- Parameterized Complexity of Control and Bribery for d-Approval Elections (Q2867125) (← links)
- Kernels for Packing and Covering Problems (Q2897995) (← links)
- Improved FPT Algorithms for Rectilinear k-Links Spanning Path (Q2898068) (← links)
- FPT Results for Signed Domination (Q2898069) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- Identification of essential nodes based on topology of a bionetwork (Q2919754) (← links)
- Approximation Algorithms for Maximum Agreement Forest on Multiple Trees (Q2920475) (← links)
- Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees (Q2921450) (← links)
- (Q2934608) (← links)
- An Improved Kernel for Planar Connected Dominating Set (Q3010387) (← links)
- (Q3014297) (← links)
- (Q3044338) (← links)
- Kernelization Techniques and Its Applications to Parameterized Computation (Q3054241) (← links)
- Cluster Editing: Kernelization Based on Edge Cuts (Q3058692) (← links)
- A practical parameterised algorithm for the individual haplotyping problem MLF (Q3060194) (← links)
- Improved Algorithms for Weighted 3-Set Packing (Q3071458) (← links)
- Cograph Editing: Complexity and Parameterized Algorithms (Q3087943) (← links)
- Matching and P 2-Packing: Weighted Versions (Q3087962) (← links)
- Linear Problem Kernels for Planar Graph Problems with Small Distance Property (Q3088074) (← links)
- An Improved SAT Algorithm in Terms of Formula Length (Q3183448) (← links)
- Iterative Expansion and Color Coding (Q3189047) (← links)
- Probabilistic analysis on connectivity for sensor grids with unreliable nodes (Q3443291) (← links)
- Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm (Q3449815) (← links)
- A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
- A fixed-parameter algorithm for the directed feedback vertex set problem (Q3452187) (← links)
- Improved MaxSAT Algorithms for Instances of Degree 3 (Q3467831) (← links)
- Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms (Q3499726) (← links)
- On the Effective Enumerability of NP Problems (Q3499739) (← links)
- An Improved Parameterized Algorithm for a Generalized Matching Problem (Q3502648) (← links)
- A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF (Q3502667) (← links)
- Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters (Q3503572) (← links)
- A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem (Q3507315) (← links)
- A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI (Q3511345) (← links)
- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size (Q3519389) (← links)
- (Q3549698) (← links)
- On Feedback Vertex Set New Measure and New Structures (Q3569882) (← links)
- A 2k Kernel for the Cluster Editing Problem (Q3578346) (← links)
- Linear FPT reductions and computational lower bounds (Q3580971) (← links)
- Improved Algorithms for the Feedback Vertex Set Problems (Q3603546) (← links)
- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem (Q3603552) (← links)
- A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem (Q3608860) (← links)
- Improved Algorithms for Weighted and Unweighted Set Splitting Problems (Q3608877) (← links)
- (Q3610987) (← links)
- A Lower Bound on Approximation Algorithms for the Closest Substring Problem (Q3611982) (← links)
- On Parameterized Exponential Time Complexity (Q3630202) (← links)
- Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms (Q3654388) (← links)
- (Q3656220) (← links)
- Reversal Complexity (Q3978172) (← links)
- The Maximum Partition Matching Problem with Applications (Q4229415) (← links)
