PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Wagner, Frank"

Author of the publication

copydeleteadd this publication to your clipboard
Area-Optimal Three-Layer Channel Routing

, , and . FOCS, page 506-511. IEEE Computer Society, (1989)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Juhan Frank

Dr. rer. nat. Bettina Frank University of Stuttgart

Lukas Frank University of Stuttgart

Daniel Frank University of Stuttgart

Frank Scheiner University of Stuttgart

 

Other publications of authors with the same name

Routing through a Dense Channel with Minimum Total Wire Length., , and . J. Algorithms, 15 (2): 267-283 (1993)Optimizing Area for Three-Layer Knock-Knee Channel Routing., , and . Algorithmica, 15 (5): 495-519 (1996)Propriétés résiduelles dans les groupes supersimples.. J. Symb. Log., 76 (2): 361-367 (2011)Faster Isometric Embedding in Products of Complete Graphs., , , , and . Discrete Applied Mathematics, 52 (1): 17-28 (1994)Routing through a Dense Channel with Minimum Total Wire Length., , and . SODA, page 475-482. ACM/SIAM, (1991)Management Of Virtual Enterprises: A Case Study Of German Rapid Prototyping SMES., , and . PRO-VE, volume 262 of IFIP Conference Proceedings, page 493-500. Kluwer, (2003)Graphenzerlegung mit minimalem Schnitt: ein Grundproblem des VLSI-Layout.. RWTH Aachen University, Germany, (1988)Locating New Stops in a Railway Network., , , , and . Electron. Notes Theor. Comput. Sci., 50 (1): 13-23 (2001)Blog Perspectives.. Metainformatics, volume 3511 of Lecture Notes in Computer Science, page 212-219. Springer, (2004)Between Min Cut and Graph Bisection., and . MFCS, volume 711 of Lecture Notes in Computer Science, page 744-750. Springer, (1993)