Wenxing Zhu

Orcid: 0000-0002-8698-0024

According to our database1, Wenxing Zhu authored at least 98 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A linear, second-order accurate, positivity-preserving and unconditionally energy stable scheme for the Navier-Stokes-Poisson-Nernst-Planck system.
Commun. Nonlinear Sci. Numer. Simul., April, 2024

Decoupled second-order energy stable scheme for an electrohydrodynamic model with variable electrical conductivity.
J. Comput. Appl. Math., March, 2024

Pplace-MS: Methodologically Faster Poisson's Equation-Based Mixed-Size Global Placement.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., February, 2024

Adaptive finite-time fault-tolerant control for Robot trajectory tracking systems under a novel smooth event-triggered mechanism.
J. Syst. Control. Eng., February, 2024

2023
Linear, second-order, unconditionally energy stable scheme for an electrohydrodynamic model with variable density and conductivity.
Commun. Nonlinear Sci. Numer. Simul., October, 2023

Analytical Placement with 3D Poisson's Equation and ADMM-based Optimization for Large-scale 2.5D Heterogeneous FPGAs.
ACM Trans. Design Autom. Electr. Syst., September, 2023

Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming.
J. Comb. Optim., July, 2023

PeF: Poisson's Equation-Based Large-Scale Fixed-Outline Floorplanning.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., June, 2023

iEDA: An Open-Source Intelligent Physical Implementation Toolkit and Library.
CoRR, 2023

Analytical Solution of Poisson's Equation with Application to VLSI Global Placement.
CoRR, 2023

Handling Orientation and Aspect Ratio of Modules in Electrostatics-Based Large Scale Fixed-Outline Floorplanning.
Proceedings of the IEEE/ACM International Conference on Computer Aided Design, 2023

Pathfinding Model and Lagrangian-Based Global Routing.
Proceedings of the 60th ACM/IEEE Design Automation Conference, 2023

2022
Mixed-Cell-Height Placement With Complex Minimum-Implant-Area Constraints.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2022

Novel Proximal Group ADMM for Placement Considering Fogging and Proximity Effects.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2022

Timing-Aware Fill Insertions With Design-Rule and Density Constraints.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2022

Discriminability of single-trial EEG during decision-making of cooperation or aggression: a study based on machine learning.
Medical Biol. Eng. Comput., 2022

Weighted thresholding homotopy method for sparsity constrained optimization.
J. Comb. Optim., 2022

An improved pure pursuit path tracking control method based on heading error rate.
Ind. Robot, 2022

SecureBiNN: 3-Party Secure Computation for Binarized Neural Network Inference.
Proceedings of the Computer Security - ESORICS 2022, 2022

Privacy Leakage in Privacy-Preserving Neural Network Inference.
Proceedings of the Computer Security - ESORICS 2022, 2022

2021
A Robust Modulus-Based Matrix Splitting Iteration Method for Mixed-Cell-Height Circuit Legalization.
ACM Trans. Design Autom. Electr. Syst., 2021

Iterative Weighted Group Thresholding Method for Group Sparse Recovery.
IEEE Trans. Neural Networks Learn. Syst., 2021

Internet connected vehicle platoon system modeling and linear stability analysis.
Comput. Commun., 2021

Two-Stage Neural Network Classifier for the Data Imbalance Problem with Application to Hotspot Detection.
Proceedings of the 58th ACM/IEEE Design Automation Conference, 2021

2020
Mixed-Cell-Height Legalization Considering Technology and Region Constraints.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020

A Discriminative Projection and Representation-Based Classification Framework for Face Recognition.
SIAM J. Imaging Sci., 2020

Erratum: The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs.
SIAM J. Discret. Math., 2020

Mixed-cell-height legalization considering complex minimum width constraints and half-row fragmentation effect.
Integr., 2020

DSA guiding template assignment with multiple redundant via and dummy via insertion.
Integr., 2020

Newton iterative method based on finite element discretization for the stationary Darcy-Brinkman equations.
Comput. Math. Appl., 2020

Sparse Group Feature Selection by Weighted Thresholding Homotopy Method.
IEEE Access, 2020

MBPANet: Solving Multiple Power Allocation Optimization Problems by a Universal Neural Network Architecture.
Proceedings of the 2020 IEEE International Conference on Communications Workshops, 2020

Hamiltonian Path Based Mixed-Cell-Height Legalization for Neighbor Diffusion Effect Mitigation.
Proceedings of the 57th ACM/IEEE Design Automation Conference, 2020

An Efficient EPIST Algorithm for Global Placement with Non-Integer Multiple-Height Cells <sup>*</sup>.
Proceedings of the 57th ACM/IEEE Design Automation Conference, 2020

2019
Optimizing Movement for Maximizing Lifetime of Mobile Sensors for Covering Targets on a Line.
Sensors, 2019

On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary.
Proceedings of the Theory and Applications of Models of Computation, 2019

Analytical Mixed-Cell-Height Legalization Considering Average and Maximum Movement Minimization.
Proceedings of the 2019 International Symposium on Physical Design, 2019

Timing-Aware Fill Insertions with Design-Rule and Density Constraints.
Proceedings of the International Conference on Computer-Aided Design, 2019

Analytical Placement with 3D Poisson's Equation and ADMM Based Optimization for Large-Scale 2.5D Heterogeneous FPGAs.
Proceedings of the International Conference on Computer-Aided Design, 2019

A local optimal method on DSA guiding template assignment with redundant/dummy via insertion.
Proceedings of the 24th Asia and South Pacific Design Automation Conference, 2019

2018
Graph-Based Redundant Via Insertion and Guiding Template Assignment for DSA-MP.
IEEE Trans. Very Large Scale Integr. Syst., 2018

Homotopy Methods Based on l<sub>0</sub>-Norm for Compressed Sensing.
IEEE Trans. Neural Networks Learn. Syst., 2018

The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs.
SIAM J. Discret. Math., 2018

Discrete relaxation method for contact layer decomposition of DSA with triple patterning.
Integr., 2018

A review of "linear programming computation" by Ping-Qi Pan.
Eur. J. Oper. Res., 2018

Lagrange Dual Method for Sparsity Constrained Optimization.
IEEE Access, 2018

A Homotopy Iterative Hard Thresholding Algorithm With Extreme Learning Machine for Scene Recognition.
IEEE Access, 2018

Efficient Algorithms for Flexible Sweep Coverage in Crowdsensing.
IEEE Access, 2018

Mixed-cell-height legalization considering technology and region constraints.
Proceedings of the International Conference on Computer-Aided Design, 2018

Analytical solution of Poisson's equation and its application to VLSI global placement.
Proceedings of the International Conference on Computer-Aided Design, 2018

Mixed-cell-height placement with complex minimum-implant-area constraints.
Proceedings of the International Conference on Computer-Aided Design, 2018

Novel proximal group ADMM for placement considering fogging and proximity effects.
Proceedings of the International Conference on Computer-Aided Design, 2018

Generalized augmented lagrangian and its applications to VLSI global placement.
Proceedings of the 55th Annual Design Automation Conference, 2018

2017
Two-Stage Layout Decomposition for Hybrid E-Beam and Triple Patterning Lithography.
ACM Trans. Design Autom. Electr. Syst., 2017

Efficient Approximation Algorithms for Multi-Antennae Largest Weight Data Retrieval.
IEEE Trans. Mob. Comput., 2017

Discrete Relaxation Method for Triple Patterning Lithography Layout Decomposition.
IEEE Trans. Computers, 2017

An adaptive hybrid memetic algorithm for thermal-aware non-slicing VLSI floorplanning.
Integr., 2017

Toward Optimal Legalization for Mixed-Cell-Height Circuit Designs.
Proceedings of the 54th Annual Design Automation Conference, 2017

An effective legalization algorithm for mixed-cell-height standard cells.
Proceedings of the 22nd Asia and South Pacific Design Automation Conference, 2017

Cut redistribution and DSA template assignment for unidirectional design.
Proceedings of the 12th IEEE International Conference on ASIC, 2017

2016
An Effective Hybrid Memetic Algorithm for the Minimum Weight Dominating Set Problem.
IEEE Trans. Evol. Comput., 2016

The robust constant and its applications in random global search for unconstrained global optimization.
J. Glob. Optim., 2016

An effective discrete dynamic convexized method for solving the winner determination problem.
J. Comb. Optim., 2016

2015
Nonsmooth Optimization Method for VLSI Global Placement.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2015

An improvement of the penalty decomposition method for sparse approximation.
Signal Process., 2015

A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints.
J. Glob. Optim., 2015

A memetic algorithm for the max-cut problem.
Int. J. Comput. Sci. Math., 2015

Efficient Approximation Algorithms for the Largest Weight Data Retrieval Problem.
CoRR, 2015

A VLSI global placement solver based on proximal alternating direction method.
Proceedings of the 2015 IEEE 11th International Conference on ASIC, 2015

2014
An augmented Lagrangian method for VLSI global placement.
J. Supercomput., 2014

An Efficient Memetic Algorithm for theMax-Bisection Problem.
IEEE Trans. Computers, 2014

Solving the weighted MAX-SAT problem using the dynamic convexized method.
Optim. Lett., 2014

A Placement Flow for Very Large-Scale mixed-Size Circuit Placement.
J. Circuits Syst. Comput., 2014

A new alternating direction method of multipliers for sparse Probabilistic Boolean Networks.
Proceedings of the 10th International Conference on Natural Computation, 2014

A scaled LSE wirelength model for VLSI global placement.
Proceedings of the 11th International Conference on Fuzzy Systems and Knowledge Discovery, 2014

2013
A discrete dynamic convexized method for VLSI circuit partitioning.
Optim. Methods Softw., 2013

An Alternating Direction Method for Nash Equilibrium of Two-Person Games with Alternating Offers.
J. Optim. Theory Appl., 2013

Max-<i>k</i>-Cut by the Discrete Dynamic Convexized Method.
INFORMS J. Comput., 2013

2012
An Analytical Placer for VLSI Standard Cell Placement.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2012

A heuristic algorithm for the strip packing problem.
J. Heuristics, 2012

A discrete dynamic convexized method for the max-cut problem.
Ann. Oper. Res., 2012

A derivative-free variant called DFSA of Dekkers and Aarts' continuous simulated annealing algorithm.
Appl. Math. Comput., 2012

An Augmented Lagrangian Optimization Method for VLSI Global Placement.
Proceedings of the 13th International Conference on Parallel and Distributed Computing, 2012

2011
A Hybrid Simulated Annealing Algorithm for Nonslicing VLSI Floorplanning.
IEEE Trans. Syst. Man Cybern. Part C, 2011

An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable.
J. Glob. Optim., 2011

A dynamic convexized method for nonconvex mixed integer nonlinear programming.
Comput. Oper. Res., 2011

A Local Search Approximation Algorithm for Max-k-Cut of Graph and Hypergraph.
Proceedings of the Fourth International Symposium on Parallel Architectures, 2011

2010
The Complement of Hypergraph Capacitated Min-k-Cut Problem.
Proceedings of the Third International Symposium on Parallel Architectures, 2010

A GRASP based algorithm for multi-constraint circuit partitioning.
Proceedings of the Sixth International Conference on Natural Computation, 2010

2009
Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming.
Comput. Oper. Res., 2009

2006
Globally concavized filled function method for the box constrained continuous global minimization problem.
Optim. Methods Softw., 2006

Unsolvability of some optimization problems.
Appl. Math. Comput., 2006

Partner selection with a due date constraint in virtual enterprises.
Appl. Math. Comput., 2006

A Dynamic Convexized Function with the Same Global Minimizers for Global Optimization.
Proceedings of the Advances in Natural Computation, Second International Conference, 2006

2005
A provable better Branch and Bound method for a nonconvex integer quadratic programming problem.
J. Comput. Syst. Sci., 2005

A class of filled functions for box constrained continuous global optimization.
Appl. Math. Comput., 2005

A New Algorithm for Partner Selection in Virtual Enterprise.
Proceedings of the Sixth International Conference on Parallel and Distributed Computing, 2005

2003
A Sequential Convexification Method (SCM) for Continuous Global Optimization.
J. Glob. Optim., 2003


  Loading...