Switchbox Routing in VLSI Design: Closing the Complexity Gap

Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz. Switchbox Routing in VLSI Design: Closing the Complexity Gap. In Fabrizio d Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela, editors, Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG 96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings. Volume 1197 of Lecture Notes in Computer Science, pages 196-210, Springer, 1996.

@inproceedings{HartmannSS96,
  title = {Switchbox Routing in VLSI Design: Closing the Complexity Gap},
  author = {Stephan Hartmann and Markus W. Schäffter and Andreas S. Schulz},
  year = {1996},
  tags = {design complexity, routing, design},
  researchr = {https://researchr.org/publication/HartmannSS96},
  cites = {0},
  citedby = {0},
  pages = {196-210},
  booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG  96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings},
  editor = {Fabrizio d Amore and Paolo Giulio Franciosa and Alberto Marchetti-Spaccamela},
  volume = {1197},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-62559-3},
}