The following pages link to Jian'er Chen (Q1599636):
Displaying 50 items.
- (Q234863) (redirect page) (← links)
- A note on approximating graph genus (Q290221) (← links)
- Planar graph vertex partition for linear problem kernels (Q355502) (← links)
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks (Q391780) (← links)
- Improved linear problem kernel for planar connected dominating set (Q392013) (← links)
- Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902) (← links)
- A parameterized algorithm for the hyperplane-cover problem (Q410731) (← links)
- A \(2k\) kernel for the cluster editing problem (Q414871) (← links)
- Multicut in trees viewed through the eyes of vertex cover (Q440014) (← links)
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees (Q476897) (← links)
- Improved parameterized algorithms for minimum link-length rectilinear spanning path problem (Q477189) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- Partition on trees with supply and demand: kernelization and algorithms (Q507429) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
- Improved deterministic algorithms for weighted matching and packing problems (Q534565) (← links)
- On the planarization of wireless sensor networks (Q548669) (← links)
- On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
- On input read-modes of alternating Turing machines (Q672377) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- Approximating maximum agreement forest on multiple binary trees (Q727962) (← links)
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- Algorithms for parameterized maximum agreement forest problem on multiple trees (Q744101) (← links)
- Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems (Q818673) (← links)
- A practical exact algorithm for the individual haplotyping problem MEC/GI (Q848946) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4] (Q860874) (← links)
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors (Q867026) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- Probabilistic analysis on mesh network fault tolerance (Q868044) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- (Q920982) (redirect page) (← links)
- The difference between one tape and two tapes: With respect to reversal complexity (Q920983) (← links)
- Limit points for average genus. I: 3-connected and 2-connected simplicial graphs (Q921011) (← links)
- Improved algorithms for feedback vertex set problems (Q955350) (← links)
- An improved lower bound on approximation algorithms for the closest substring problem (Q963389) (← links)
- An improved kernelization for \(P_{2}\)-packing (Q991748) (← links)
- Finding pathway structures in protein interaction networks (Q995774) (← links)
- A practical algorithm based on particle swarm optimization for haplotype reconstruction (Q1004420) (← links)
- On the pseudo-achromatic number problem (Q1006054) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- Improved parameterized set splitting algorithms: A Probabilistic approach (Q1040647) (← links)
- On counting 3-D matchings of size \(k\) (Q1040648) (← links)
- A new complete language for DSPACE(log n) (Q1123607) (← links)
- An NL hierarchy (Q1182111) (← links)
- Characterizing parallel hierarchies by reducibilities (Q1183416) (← links)
- Limit points for average genus. II: 2-connected non-simplicial graphs (Q1204469) (← links)
- Kuratowski-type theorems for average genus (Q1204482) (← links)
