The following pages link to Wenjun Li (Q410730):
Displaying 49 items.
- A parameterized algorithm for the hyperplane-cover problem (Q410731) (← links)
- Prediction with measurement errors in finite populations (Q419237) (← 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)
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- Kernelization for \(P_2\)-packing: a gerrymandering approach (Q777283) (← links)
- A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem (Q831124) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition (Q1643162) (← links)
- An improved branching algorithm for \((n,3)\)-MaxSAT based on refined observations (Q1708599) (← links)
- Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
- Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations (Q2077398) (← links)
- A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
- A \(5k\)-vertex kernel for \(P_2\)-packing (Q2118855) (← links)
- A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries (Q2143136) (← links)
- Reconstruction and verification of chordal graphs with a distance oracle (Q2227489) (← links)
- An improved linear kernel for complementary maximal strip recovery: simpler and smaller (Q2319903) (← links)
- Optimal throughput and energy efficiency for wireless sensor networks: multiple access and multipacket reception (Q2501762) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- On the full Brouwer's Laplacian spectrum conjecture (Q2675839) (← links)
- (Q2750979) (← links)
- A REVIEW ON NON-DARCY FLOW — FORCHHEIMER EQUATION, HYDRAULIC RADIUS MODEL, FRACTAL MODEL AND EXPERIMENT (Q2830981) (← links)
- Double Charm Decays of <i>B</i> Mesons in mSUGRA Model (Q2913304) (← links)
- Cellular Automaton Models of Highway Traffic Flow Considering Lane-Control and Speed-Control (Q2913433) (← links)
- Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees (Q2921450) (← links)
- Comparison of the GMRES and ORTHOMIN for the black oil model in porous media (Q3021650) (← links)
- LEPTON-FLAVOR-VIOLATING τ DECAYS IN TWO-HIGGS-DOUBLET MODEL III (Q3065593) (← links)
- Design-based random permutation models with auxiliary information (Q3143497) (← links)
- An Improved Kernel for the Complementary Maximal Strip Recovery Problem (Q3196419) (← links)
- Comparison of GMRES and ORTHOMIN for the black oil model on unstructured grids (Q3418165) (← links)
- (Q3431088) (← links)
- A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
- Smaller Kernels for Several FPT Problems Based on Simple Observations (Q3452562) (← links)
- Parameterized Minimum Cost Partition of a Tree with Supply and Demand (Q3452563) (← links)
- (Q4016408) (← links)
- (Q4215951) (← links)
- (Q4254973) (← links)
- (Q4320175) (← links)
- (Q4328957) (← links)
- Distributed Detection in Wireless Sensor Networks Using A Multiple Access Channel (Q4564390) (← links)
- Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
- A 42k Kernel for the Complementary Maximal Strip Recovery Problem (Q4632213) (← links)
- Cycle Extendability of Hamiltonian Strongly Chordal Graphs (Q4959662) (← links)
- Location-Aided Fast Distributed Consensus in Wireless Networks (Q5281175) (← links)
- Bisimulation proof methods in a path-based specification language for polynomial coalgebras (Q5740639) (← links)
- Adaptive virtual leader-leader-follower based formation switching for multiple autonomous tracked mobile robots in unknown obstacle environments (Q6542486) (← links)
- A polynomial-time algorithm for MCS partial search order on chordal graphs (Q6647714) (← links)
