SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Frank Wagner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Gabriele Neyer, Frank Wagner
Labeling Downtown. [Citation Graph (0, 0)][DBLP]
CIAC, 2000, pp:113-124 [Conf]
Michael Formann, Frank Wagner
A Packing Problem with Applications to Lettering of Maps. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1991, pp:281-288 [Conf]
Frank Wagner, Alexander Wolff
Map Labeling Heuristics: Provably Good and Practically Useful. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1995, pp:109-118 [Conf]
Frank Wagner
Shuffle/Exchange is the Natural Interconnection Scheme for the Parallel Fast Fourier Transform. [Citation Graph (0, 0)][DBLP]
CONPAR, 1986, pp:345-352 [Conf]
Mechthild Stoer, Frank Wagner
A Simple Min Cut Algorithm. [Citation Graph (0, 0)][DBLP]
ESA, 1994, pp:141-147 [Conf]
Frank Wagner, Alexander Wolff
An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. [Citation Graph (0, 0)][DBLP]
ESA, 1995, pp:420-433 [Conf]
Ruth Kuchem, Dorothea Wagner, Frank Wagner
Area-Optimal Three-Layer Channel Routing [Citation Graph (0, 0)][DBLP]
FOCS, 1989, pp:506-511 [Conf]
Frank Wagner, Alexander Wolff
A Combinatorial Framework for Map Labeling. [Citation Graph (0, 0)][DBLP]
Graph Drawing, 1998, pp:316-331 [Conf]
Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
Computing Mimicking Networks. [Citation Graph (0, 0)][DBLP]
ICALP, 1998, pp:556-567 [Conf]
Frank Wagner, Jochen Eichert, Roman Schirra
Management Of Virtual Enterprises: A Case Study Of German Rapid Prototyping SMES. [Citation Graph (0, 0)][DBLP]
PRO-VE, 2003, pp:493-500 [Conf]
Frank Wagner, Barbara Wolfers
Short Wire Routing in Convex Grids. [Citation Graph (0, 0)][DBLP]
ISA, 1991, pp:72-82 [Conf]
Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe
Wiring Knock-Knee Layouts: A Global Appoach. [Citation Graph (0, 0)][DBLP]
ISAAC, 1992, pp:388-399 [Conf]
Dorothea Wagner, Frank Wagner
Between Min Cut and Graph Bisection. [Citation Graph (0, 0)][DBLP]
MFCS, 1993, pp:744-750 [Conf]
Michael Formann, Dorothea Wagner, Frank Wagner
Routing through a Dense Channel with Minimum Total Wire Length. [Citation Graph (0, 0)][DBLP]
SODA, 1991, pp:475-482 [Conf]
Michael Formann, Frank Wagner
The VLSI layout in various embedding models. [Citation Graph (0, 0)][DBLP]
WG, 1990, pp:130-139 [Conf]
Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
Computing Mimicking Networks. [Citation Graph (0, 0)][DBLP]
Algorithmica, 2000, v:26, n:1, pp:31-49 [Journal]
Ruth Kuchem, Dorothea Wagner, Frank Wagner
Optimizing Area for Three-Layer Knock-Knee Channel Routing. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1996, v:15, n:5, pp:495-519 [Journal]
Frank Wagner, Alexander Wolff, Vikas Kapoor, Tycho Strijk
Three Rules Suffice for Good Label Placement. [Citation Graph (0, 0)][DBLP]
Algorithmica, 2001, v:30, n:2, pp:334-349 [Journal]
Frank Wagner, Alexander Wolff
A Practical Map Labeling Algorithm. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 1997, v:7, n:, pp:387-404 [Journal]
Franz Aurenhammer, Michael Formann, Ramana M. Idury, Alejandro A. Schäffer, Frank Wagner
Faster Isometric Embedding in Products of Complete Graphs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1994, v:52, n:1, pp:17-28 [Journal]
Dorothea Wagner, Frank Wagner
An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1992, v:40, n:1, pp:73-81 [Journal]
Horst W. Hamacher, Annegret Liebers, Anita Schoebel, Dorothea Wagner, Frank Wagner
Locating New Stops in a Railway Network. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2001, v:50, n:1, pp:- [Journal]
Frank Wagner
A Complete Model of the Deutsche Bahn - Prosim and Beyond. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2001, v:50, n:1, pp:- [Journal]
Edmund Ihler, Dorothea Wagner, Frank Wagner
Modeling Hypergraphs by Graphs with the Same Mincut Properties. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1993, v:45, n:4, pp:171-175 [Journal]
Frank Wagner
Approximate Map Labeling is in Omega (n log n). [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1994, v:52, n:3, pp:161-165 [Journal]
Mechthild Stoer, Frank Wagner
A simple min-cut algorithm. [Citation Graph (0, 0)][DBLP]
J. ACM, 1997, v:44, n:4, pp:585-591 [Journal]
Michael Formann, Dorothea Wagner, Frank Wagner
Routing through a Dense Channel with Minimum Total Wire Length. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1993, v:15, n:2, pp:267-283 [Journal]
Oleg V. Belegradek, Ya'acov Peterzil, Frank Wagner
Quasi-O-Minimal Structures. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2000, v:65, n:3, pp:1115-1132 [Journal]
Frank Wagner
Fields of Finite Morley Rank. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2001, v:66, n:2, pp:703-706 [Journal]
Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe
Wiring Knock-Knee Layouts: A Global Approach. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1994, v:43, n:5, pp:581-589 [Journal]
Towards the Design of a Scalable Email Archiving and Discovery Solution. [Citation Graph (, )][DBLP]
Email Archiving and Discovery as a Service. [Citation Graph (, )][DBLP]
A generalization of the zero-one principle for sorting algorithms. [Citation Graph (, )][DBLP]

Search in 0.036secs, Finished in 0.038secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP