Person:328685: Difference between revisions

From MaRDI portal
Person:328685
Created automatically from import231006081045
 
m AuthorDisambiguator moved page Jianxin Wang to Jianxin Wang: Duplicate
 
(No difference)

Latest revision as of 09:22, 11 December 2023

Available identifiers

zbMath Open wang.jianxinDBLP75/2669-1WikidataQ87850823 ScholiaQ87850823MaRDI QIDQ328685

List of research outcomes





PublicationDate of PublicationType
Modification problems toward proper (Helly) circular-arc graphs2024-12-03Paper
Modification problems toward proper (Helly) circular-arc graphs2024-12-03Paper
Improved approximation algorithm for the distributed lower-bounded \(k\)-center problem2024-11-12Paper
Comment on `Criteria for robust finite-time stabilisation of linear singular systems with interval time-varying delay'2024-09-05Paper
PTAS for minimum cost multicovering with disks2024-08-27Paper
A PTAS framework for clustering problems in doubling metrics2024-08-22Paper
Parameterized algorithms for fixed-order book drawing with few crossings per edge2024-07-09Paper
Study of the effects of fractional order and damping coefficient on the dynamics of giant magnetostrictive actuators2024-05-27Paper
New algorithms for fair \(k\)-center problem with outliers and capacity constraints2024-04-16Paper
On scheduling multiple parallel two-stage flowshops with Johnson's rule2024-03-20Paper
Applying Johnson's rule in scheduling multiple parallel two-stage flowshops2024-02-28Paper
The fair \(k\)-center with outliers problem: FPT and polynomial approximations2024-02-28Paper
A 2.57-approximation algorithm for contig-based genomic scaffold filling2024-02-23Paper
Exponential time approximation scheme for TSP2024-02-23Paper
https://portal.mardi4nfdi.de/entity/Q61473032024-01-15Paper
A unified framework of FPT approximation algorithms for clustering problems2023-11-14Paper
Graph Searches and Their End Vertices.2023-02-03Paper
Small candidate set for translational pattern search2023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q58756292023-02-03Paper
Improved approximation algorithms for solving the squared metric \(k\)-facility location problem2022-12-21Paper
Characterization and linear-time recognition of paired threshold graphs2022-12-21Paper
Small candidate set for translational pattern search2022-10-06Paper
Graph searches and their end vertices2022-08-18Paper
New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition2022-07-21Paper
A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries2022-05-31Paper
A refined branching algorithm for the maximum satisfiability problem2022-03-22Paper
An improved FPT algorithm for the flip distance problem2021-11-25Paper
An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses2021-11-25Paper
Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem2021-11-01Paper
End vertices of graph searches on bipartite graphs2021-10-19Paper
Fixed-parameter tractability for the Tree Assembly problem2021-10-06Paper
Cycle Extendability of Hamiltonian Strongly Chordal Graphs2021-09-17Paper
Improved approximation for prize-collecting red-blue median2021-07-22Paper
On fixed-order book thickness parameterized by the pathwidth of the vertex ordering2021-07-05Paper
https://portal.mardi4nfdi.de/entity/Q49962272021-07-01Paper
On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering2021-06-22Paper
Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem2021-04-08Paper
Reconstruction and verification of chordal graphs with a distance oracle2021-02-15Paper
A new approximation algorithm for contig-based genomic scaffold filling2021-01-25Paper
Parameterized algorithms for minimum tree cut/paste distance and minimum common integer partition2020-07-07Paper
Improved kernels for several problems on planar graphs2020-07-07Paper
https://portal.mardi4nfdi.de/entity/Q51112822020-05-26Paper
An improved kernel for max-bisection above tight lower bound2020-04-07Paper
On scheduling multiple two-stage flowshops2020-04-07Paper
Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem2020-02-11Paper
Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition2020-01-16Paper
An approximation algorithm for the \(l\)-pseudoforest deletion problem2020-01-16Paper
Improved approximation algorithms for two-stage flowshops scheduling problem2020-01-16Paper
New kernels for several problems on planar graphs2020-01-16Paper
Local coloring: new observations and new reductions2019-10-11Paper
An improved approximation algorithm for the \(k\)-means problem with penalties2019-10-11Paper
A novel extended Pareto optimality consensus model for predicting essential proteins2019-09-12Paper
An improved linear kernel for complementary maximal strip recovery: simpler and smaller2019-08-20Paper
On scheduling inclined jobs on multiple two-stage flowshops2019-08-20Paper
Improved PTAS for the constrained \(k\)-means problem2019-06-25Paper
Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms2019-06-25Paper
Scheduling two-stage jobs on multiple flowshops2019-05-29Paper
Randomized parameterized algorithms for the kidney exchange problem2019-05-14Paper
Improved Algorithms for Several Parameterized Problems Based on Random Methods2019-04-26Paper
Parameterized Algorithms for Maximum Edge Biclique and Related Problems2019-04-26Paper
On Counting Parameterized Matching and Packing2019-04-26Paper
A 42k Kernel for the Complementary Maximal Strip Recovery Problem2019-04-26Paper
On Approximation Algorithms for Two-Stage Scheduling Problems2019-04-26Paper
Social exposure and trustworthiness: experimental evidence2018-10-05Paper
Local Coloring and its Complexity2018-09-07Paper
A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees2018-09-07Paper
Corrigendum to ``How well does the weighted price contribution measure price discovery?2018-08-13Paper
How well does the weighted price contribution measure price discovery?2018-08-13Paper
Parameterized counting matching and packing: a family of hard problems that admit FPTRAS2018-06-05Paper
Dealing with several parameterized problems by random methods2018-06-05Paper
Parameterized algorithms for edge biclique and related problems2018-06-05Paper
An improved FPT algorithm for almost forest deletion problem2018-05-25Paper
Unit interval vertex deletion: fewer vertices are relevant2018-05-08Paper
An improved branching algorithm for \((n,3)\)-MaxSAT based on refined observations2018-03-26Paper
Planar vertex-disjoint cycle packing: new structures and improved kernel2018-03-26Paper
SDTRLS: predicting drug-target interactions for complex diseases based on chemical substructures2018-02-01Paper
Complex brain network analysis and its applications to brain disorders: a survey2018-01-03Paper
A new kernel for parameterized Max-Bisection above tight lower bound2017-10-23Paper
Approximation algorithms for scheduling multiple two-stage flowshops2017-10-23Paper
https://portal.mardi4nfdi.de/entity/Q53718902017-10-20Paper
https://portal.mardi4nfdi.de/entity/Q52762382017-07-14Paper
A local average connectivity-based method for identifying essential proteins from the network level2017-07-10Paper
On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms2017-06-20Paper
Dealing with 4-variables by resolution: an improved MaxSAT algorithm2017-03-16Paper
Approximate association via dissociation2017-01-23Paper
Approximate association via dissociation2016-12-22Paper
Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree2016-12-22Paper
Approximating maximum agreement forest on multiple binary trees2016-12-21Paper
A discrete-time Geo/G/1 retrial queue with preferred and impatient customers2016-12-05Paper
Kernelization and randomized parameterized algorithms for co-path set problem2016-10-20Paper
Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees2016-10-20Paper
https://portal.mardi4nfdi.de/entity/Q29932352016-08-10Paper
Improved MaxSAT Algorithms for Instances of Degree 32016-02-05Paper
Kernelization and parameterized algorithms for covering a tree by a set of stars or paths2015-12-08Paper
High-sum-rate beamformers for multi-pair two-way relay networks with amplify-and-forward relaying strategy2015-11-20Paper
On the parameterized vertex cover problem for graphs with perfect matching2015-11-20Paper
Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm2015-10-30Paper
A 2k-vertex Kernel for Maximum Internal Spanning Tree2015-10-30Paper
An Improved Kernel for the Complementary Maximal Strip Recovery Problem2015-10-29Paper
Parameterized complexity of control and bribery for \(d\)-approval elections2015-07-24Paper
Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems2015-07-10Paper
An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs2015-07-10Paper
Fractional Factorial Split-plot Designs with Two- and Four-level Factors Containing Clear Effects2015-06-24Paper
Edge deletion problems: branching facilitated by modular decomposition2015-02-24Paper
Improved parameterized algorithms for minimum link-length rectilinear spanning path problem2014-12-02Paper
Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees2014-10-08Paper
Algorithms for parameterized maximum agreement forest problem on multiple trees2014-10-06Paper
Approximation Algorithms for Maximum Agreement Forest on Multiple Trees2014-09-26Paper
Kernelization and Lower Bounds of the Signed Domination Problem2014-04-03Paper
Matching and weighted \(P_2\)-packing: algorithms and kernels2014-01-24Paper
Parameterized complexity of max-lifetime target coverage in wireless sensor networks2014-01-13Paper
Improved linear problem kernel for planar connected dominating set2014-01-13Paper
Parameterized complexity of Min-power multicast problems in wireless ad hoc networks2013-12-19Paper
Parameterized Complexity of Control and Bribery for d-Approval Elections2013-12-10Paper
Planar graph vertex partition for linear problem kernels2013-07-24Paper
A new policy to solve routing conflicts in shuffle-exchange networks2013-07-03Paper
Random Methods for Parameterized Problems2013-06-11Paper
An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs2013-06-11Paper
Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees2013-06-11Paper
Performance analysis for \((X,S)\)-bottleneck cell in large-scale wireless networks2013-04-04Paper
Complexity and parameterized algorithms for cograph editing2012-11-27Paper
https://portal.mardi4nfdi.de/entity/Q29197542012-10-05Paper
Improved FPT Algorithms for Rectilinear k-Links Spanning Path2012-07-16Paper
FPT Results for Signed Domination2012-07-16Paper
A parameterized algorithm for the hyperplane-cover problem2012-04-03Paper
https://portal.mardi4nfdi.de/entity/Q31107542012-01-27Paper
Cograph Editing: Complexity and Parameterized Algorithms2011-08-17Paper
Matching and P 2-Packing: Weighted Versions2011-08-17Paper
Linear Problem Kernels for Planar Graph Problems with Small Distance Property2011-08-17Paper
https://portal.mardi4nfdi.de/entity/Q30142972011-07-19Paper
An Improved Kernel for Planar Connected Dominating Set2011-07-01Paper
The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View2011-06-03Paper
Improved deterministic algorithms for weighted matching and packing problems2011-05-18Paper
An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem2011-04-05Paper
Improved Algorithms for Weighted 3-Set Packing2011-02-05Paper
A practical parameterised algorithm for the individual haplotyping problem MLF2010-12-01Paper
Kernelization Techniques and Its Applications to Parameterized Computation2010-11-05Paper
An improved kernelization for \(P_{2}\)-packing2010-09-07Paper
An analytical model for end-to-end communication channel over PLCN based on QBDs2010-09-02Paper
https://portal.mardi4nfdi.de/entity/Q35737422010-07-08Paper
An improved lower bound on approximation algorithms for the closest substring problem2010-04-19Paper
A practical exact algorithm for the individual haplotyping problem MEC/GI2010-02-23Paper
On counting 3-D matchings of size \(k\)2009-11-25Paper
https://portal.mardi4nfdi.de/entity/Q36446752009-11-11Paper
The cost of becoming anonymous: on the participant payload in crowds2009-07-21Paper
An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set2009-07-14Paper
Improved Deterministic Algorithms for Weighted Matching and Packing Problems2009-06-03Paper
A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem2009-06-03Paper
A practical algorithm based on particle swarm optimization for haplotype reconstruction2009-03-10Paper
A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem2009-03-06Paper
https://portal.mardi4nfdi.de/entity/Q36109872009-03-06Paper
A Lower Bound on Approximation Algorithms for the Closest Substring Problem2009-03-03Paper
An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem2009-03-03Paper
An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs2008-12-02Paper
Parameterized algorithms for weighted matching and packing problems2008-11-19Paper
https://portal.mardi4nfdi.de/entity/Q35135582008-08-06Paper
Improved Parameterized Algorithms for Weighted 3-Set Packing2008-07-10Paper
A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI2008-07-10Paper
A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem2008-06-19Paper
Foreign ownership and volatility dynamics of Indonesian stocks2008-06-11Paper
An O *(3.523k ) Parameterized Algorithm for 3-Set Packing2008-05-27Paper
An Improved Parameterized Algorithm for a Generalized Matching Problem2008-05-27Paper
A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF2008-05-27Paper
https://portal.mardi4nfdi.de/entity/Q54532242008-04-04Paper
Parameterized Algorithms for Weighted Matching and Packing Problems2007-11-13Paper
An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs2007-11-13Paper
https://portal.mardi4nfdi.de/entity/Q54233962007-10-23Paper
https://portal.mardi4nfdi.de/entity/Q57542992007-08-22Paper
A simple linear time approximation algorithm for multi-processor job scheduling on four processors2007-02-14Paper
https://portal.mardi4nfdi.de/entity/Q57020922005-10-31Paper
https://portal.mardi4nfdi.de/entity/Q48257512004-11-05Paper
https://portal.mardi4nfdi.de/entity/Q48239132004-10-28Paper
https://portal.mardi4nfdi.de/entity/Q48239532004-10-28Paper
An effective randomized QoS routing algorithm on networks with inaccurate parameters2002-06-05Paper
https://portal.mardi4nfdi.de/entity/Q27518992001-10-21Paper
The Unbounded Energy Solution for Free Vibration of an Axially Moving String2000-11-09Paper
Spatio-temporal target identification method of high-range resolution radar2000-01-04Paper
Order flow and the bid-ask spread: an empirical probability model of screen-based trading1998-07-22Paper
Auctions as algorithms. Computerized trade execution and price discovery1994-01-16Paper
An equivalent canonical form for multiple time series1987-01-01Paper

Research outcomes over time

This page was built for person: Jianxin Wang