Stable groups / von Wagner, Frank O. (Frank Olaf), 1964-

Volltext öffnen

Simple theories von Wagner, Frank O.

Volltext öffnen

Modeling hypergraphs by graphs with the same mincut properties von Ihler, Edmund, Wagner, Dorothea 1957-, Wagner, Frank O. 1964-

Graph separation Is N P - hard even for graphs with bounded degree von Wagner, Dorothea 1957-, Wagner, Frank O. 1964-

An efficient parallel logarithmic time algorithm for the channel routing problem von Wagner, Dorothea 1957-, Wagner, Frank O. 1964-

Stable groups von Wagner, Frank O. 1964-

Volltext öffnen

Between min cut and graph bisection von Wagner, Dorothea 1957-, Wagner, Frank O. 1964-

Channel routing under different optimization criteria von Wagner, Dorothea 1957-, Wagner, Frank O. 1964-

A generalization of the zero-one principle for sorting algorithms von Wagner, Dorothea 1957-, Wagner, Frank O. 1964-

Simple theories von Wagner, Frank O. 1964-

Stable groups von Wagner, Frank O.

Stable groups von Wagner, Frank O. 1964-

Volltext öffnen

Wiring knock-knee layouts a global approach von Sarrafzadeh, Majid, Wagner, Dorothea 1957-, Wagner, Frank O. 1964-, Weihe, Karsten 1967-

VLSI network design a survey von Möhring, Rolf H. 1948-, Wagner, Dorothea 1957-, Wagner, Frank O. 1964-

Optimizing layer assignment and area in knock-knee channel routing von Kuchem, Ruth 1965-, Wagner, Dorothea 1957-, Wagner, Frank O. 1964-

Routing through a dense channel with minimum total wire length von Formann, Michael, Wagner, Dorothea 1957-, Wagner, Frank O. 1964-

Area-optimal three-layer channel routing von Kuchem, Ruth 1965-, Wagner, Dorothea 1957-, Wagner, Frank O. 1964-