Complexity of Single-Layer Routing

No abstract is available for this paper.

• Publication year

  1984

• Venue

  IEEE transactions on computers

• Publication date

  1984-03-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TC.1984.1676428
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Planar Formulae and Their Uses

  1982cited by this paper
• Optimal Tile Salvage.

  1981cited by this paper
• The equivalence of theorem proving and the interconnection problem

  1975cited by this paper

• Design and Implementation of Integrated Circuit Routing Algorithm based on A-Star

  2023cites this paper
• Literature Survey on Automatic Pipe Routing

  2023cites this paper
• Smart Grid Optimization by Means of MapReduce

  2019cites this paper
• Power Grid Visualization by Means of Optimization

  2016cites this paper
• On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems

  2016cites this paper
• A Bibliography of IEEE Transactions on Computers (1980{1989)

  2012cites this paper
• Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs

  2012cites this paper
• Using ant colony optimization for routing in microprocesors

  2009cites this paper
• String Tightening as a Self-Organizing Phenomenon

  2007cites this paper
• Computing homotopic shortest paths in the plane

  2003cites this paper
• A hierarchical genetic algorithm for multi-layer channel routing

  2003cites this paper
• Computing homotopic shortest paths efficiently

  2002cites this paper
• Drawing with Fat Edges

  2001cites this paper
• Intelligent approaches to VLSI routing

  2000cites this paper
• A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion

  2000cites this paper
• On the Sum Coloring Problem on Interval Graphs

  1999cites this paper
• FAAR: A router for field-programmable analog arrays

  1999cites this paper
• Algorithms for VLSI Physical Design Automation

  1999cites this paper
• A New Approach to the Ball Grid Array Package Routing

  1999cites this paper
• An even wiring approach to the ball grid array package routing

  1999cites this paper
• NEWS: a net-even-wiring system for the routing on a multilayer PGA package

  1998cites this paper
• A new genetic single-layer routing algorithm for analog transistor arrays

  1996cites this paper
• A faster algorithm for rubber-band equivalent transformation for planar VLSI layouts

  1996cites this paper
• Geometric interconnection and placement algorithms

  1995influential citation
• Single Row Routing on Multilayers

  1995cites this paper
• EMC-driven midway routing on PCBs

  1995cites this paper
• On Multiterminal Single Bend Wirability

  1994cites this paper
• On multiterminal single bend wirability

  1994cites this paper
• Two-layer via-free routing in channels and switchboxes

  1992cites this paper
• A wire-length minimization algorithm for single-layer layouts

  1992cites this paper
• On Planar Routing of Multi-Terminal Nets in VLSI Physical Design

  1992cites this paper
• Boundary single-layer routing with movable terminals

  1991cites this paper
• Layout design of VLSI multichip packaging

  1991cites this paper
• Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract)

  1991cites this paper
• Single-layer global routing

  1991cites this paper
• An exact algorithm for single-layer wire-length minimization

  1990cites this paper
• Finding Steiner forests in planar graphs

  1990cites this paper
• Vertex-Disjoint Trees and Boundary Single-Layer Routing

  1990cites this paper
• On the Computational Complexity of Continuous Routing

  1989cites this paper
• On the Complexity of Single Row Routing Problems

  1989cites this paper
• Picture processing: 1984

  1985cites this paper
• Algorithms for routing and testing routability of planar VLSI layouts

  1985cites this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cites this paper