The following pages link to Jianxin Wang (Q328685):
Displayed 50 items.
- Kernelization and randomized parameterized algorithms for co-path set problem (Q328686) (← links)
- Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees (Q328699) (← links)
- A discrete-time Geo/G/1 retrial queue with preferred and impatient customers (Q346191) (← links)
- A new policy to solve routing conflicts in shuffle-exchange networks (Q350906) (← links)
- Planar graph vertex partition for linear problem kernels (Q355502) (← links)
- Parameterized complexity of Min-power multicast problems in wireless ad hoc networks (Q388087) (← 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)
- (Q410729) (redirect page) (← links)
- A parameterized algorithm for the hyperplane-cover problem (Q410731) (← links)
- Improved parameterized algorithms for minimum link-length rectilinear spanning path problem (Q477189) (← links)
- (Q505446) (redirect page) (← links)
- Approximate association via dissociation (Q505447) (← links)
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
- Improved deterministic algorithms for weighted matching and packing problems (Q534565) (← links)
- Complexity and parameterized algorithms for cograph editing (Q690461) (← 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)
- Parameterized algorithms for minimum tree cut/paste distance and minimum common integer partition (Q777276) (← links)
- Improved kernels for several problems on planar graphs (Q777291) (← links)
- A practical exact algorithm for the individual haplotyping problem MEC/GI (Q848946) (← links)
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors (Q867026) (← links)
- High-sum-rate beamformers for multi-pair two-way relay networks with amplify-and-forward relaying strategy (Q893673) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Kernelization and parameterized algorithms for covering a tree by a set of stars or paths (Q897955) (← links)
- Foreign ownership and volatility dynamics of Indonesian stocks (Q928167) (← links)
- Parameterized algorithms for weighted matching and packing problems (Q955335) (← links)
- An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs (Q958213) (← links)
- An improved lower bound on approximation algorithms for the closest substring problem (Q963389) (← links)
- An analytical model for end-to-end communication channel over PLCN based on QBDs (Q990086) (← links)
- An improved kernelization for \(P_{2}\)-packing (Q991748) (← links)
- A practical algorithm based on particle swarm optimization for haplotype reconstruction (Q1004420) (← links)
- On counting 3-D matchings of size \(k\) (Q1040648) (← links)
- An equivalent canonical form for multiple time series (Q1098209) (← links)
- Auctions as algorithms. Computerized trade execution and price discovery (Q1309832) (← links)
- Order flow and the bid-ask spread: an empirical probability model of screen-based trading (Q1391446) (← links)
- An effective randomized QoS routing algorithm on networks with inaccurate parameters (Q1599637) (← links)
- Corrigendum to ``How well does the weighted price contribution measure price discovery?'' (Q1657527) (← links)
- How well does the weighted price contribution measure price discovery? (Q1657556) (← links)
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees (Q1671997) (← links)
- Complex brain network analysis and its applications to brain disorders: a survey (Q1687457) (← links)
- SDTRLS: predicting drug-target interactions for complex diseases based on chemical substructures (Q1694189) (← links)
- An improved branching algorithm for \((n,3)\)-MaxSAT based on refined observations (Q1708599) (← links)
- Planar vertex-disjoint cycle packing: new structures and improved kernel (Q1708648) (← links)
- Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- Social exposure and trustworthiness: experimental evidence (Q1787235) (← links)
- Spatio-temporal target identification method of high-range resolution radar (Q1818121) (← links)