nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
|
Shi, C.-J |
|
1999 |
90 |
1-3 |
p. 223-243 21 p. |
artikel |
2 |
A fast and simple Steiner routing heuristic
|
Borah, Manjit |
|
1999 |
90 |
1-3 |
p. 51-67 17 p. |
artikel |
3 |
A graph theoretical approach for the yield enhancement of reconfigurable VLSI/WSI arrays
|
Narasimhan, Jagannathan |
|
1999 |
90 |
1-3 |
p. 195-221 27 p. |
artikel |
4 |
A note on formulations for the A-partition problem on hypergraphs
|
Chopra, Sunil |
|
1999 |
90 |
1-3 |
p. 115-133 19 p. |
artikel |
5 |
Author index
|
|
|
1999 |
90 |
1-3 |
p. 257- 1 p. |
artikel |
6 |
Class Steiner trees and VLSI-design
|
Ihler, Edmund |
|
1999 |
90 |
1-3 |
p. 173-194 22 p. |
artikel |
7 |
Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
|
Ganley, Joseph L |
|
1999 |
90 |
1-3 |
p. 161-171 11 p. |
artikel |
8 |
Editorial Board
|
|
|
1999 |
90 |
1-3 |
p. v-vi nvt p. |
artikel |
9 |
Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
|
Boros, Endre |
|
1999 |
90 |
1-3 |
p. 69-88 20 p. |
artikel |
10 |
Optimal layout of edge-weighted forests
|
Fischer, Michael J |
|
1999 |
90 |
1-3 |
p. 135-159 25 p. |
artikel |
11 |
Path optimization for graph partitioning problems
|
Berry, Jonathan W |
|
1999 |
90 |
1-3 |
p. 27-50 24 p. |
artikel |
12 |
Preface for advanced discrete optimization techniques for VLSI layout problems
|
Hoffman, Alan J |
|
1999 |
90 |
1-3 |
p. 1-2 2 p. |
artikel |
13 |
Routing multiterminal nets on a hexagonal grid
|
Tan, Xuehou |
|
1999 |
90 |
1-3 |
p. 245-255 11 p. |
artikel |
14 |
Spectral partitioning with multiple eigenvectors
|
Alpert, Charles J |
|
1999 |
90 |
1-3 |
p. 3-26 24 p. |
artikel |
15 |
Transistor chaining in static CMOS functional cells of arbitrary planar topology
|
Carlson, Bradley S |
|
1999 |
90 |
1-3 |
p. 89-114 26 p. |
artikel |