An Efficient Aopproach to Constrained Via Minimization for Two-Layer VLSI Routing

Related Articles

• An Efficient Approach to Multi-layer Layer Assignment with Application to Via Minimization
  Design Automation Conference
• Knowledge-based Genetic Algorithm for Layer Assignment
  Australasian Computer Science Conference
• Routing Method for VLSI Design Using Irregular Cells
  Design Automation Conference
• A Particle Swarm Optimization Approach for Routing in VLSI
  Computational Intelligence, Communication Systems and Networks, International Conference on
• Timing-Driven Hierarchical Global Routing with Wire-Sizing and Buffer-Insertion for VLSI with Multi-Routing-Layer
  Asia and South Pacific Design Automation Conference
• A graph-partitioning-based approach for multi-layer Constrained Via Minimization
  Proceedings of ICCAD International Conference on Computer Aided Design
• Dynamic Tree Reconstruction with Application to Timing-Constrained Congestion-Driven Global Routing
  VLSI Design, International Conference on
• A Two-Step Binary Particle Swarm Optimization Approach for Routing in VLSI with Iterative RLC Delay Model
  Computational Intelligence, Modelling and Simulation, International Conference on
• The constrained via minimization problem for PCB and VLSI design
  Design Automation Conference
• Delay-Constrained GNR Routing for Layer Minimization
  IEEE Transactions on Very Large Scale Integration (VLSI) Systems