Frank Wagner - RankMe

30 papers A* 3A 3B 3C 3Journal 13Unranked 4

Year	Rank	Type	Title / Venue / Authors
2001	C	`conf`	A Complete Model of the Deutsche Bahn - Prosim and Beyond. ATMOS Frank Wagner
2001	C	`conf`	Locating New Stops in a Railway Network. ATMOS Horst W. Hamacher, Annegret Liebers, Anita Schöbel, Dorothea Wagner, Frank Wagner
2001	J	`jnl`	Three Rules Suffice for Good Label Placement. Algorithmica Frank Wagner, Alexander Wolff, Vikas Kapoor, Tycho Strijk
2000	J	`jnl`	Computing Mimicking Networks. Algorithmica Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
2000	C	`conf`	Labeling Downtown. CIAC Gabriele Neyer, Frank Wagner
1998	A	`conf`	A Combinatorial Framework for Map Labeling. GD Frank Wagner, Alexander Wolff
1998	A*	`conf`	Computing Mimicking Networks. ICALP Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
1997	J	`jnl`	A Practical Map Labeling Algorithm. Comput. Geom. Frank Wagner, Alexander Wolff
1997	J	`jnl`	A simple min-cut algorithm. J. ACM Mechthild Stoer, Frank Wagner
1996	J	`jnl`	Optimizing Area for Three-Layer Knock-Knee Channel Routing. Algorithmica Ruth Kuchem, Dorothea Wagner, Frank Wagner
1995	A	`conf`	An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. ESA Frank Wagner, Alexander Wolff
1995	—	`conf`	Map Labeling Heuristics: Provably Good and Practically Useful. SCG Frank Wagner, Alexander Wolff
1994	A	`conf`	A Simple Min Cut Algorithm. ESA Mechthild Stoer, Frank Wagner
1994	J	`jnl`	Approximate Map Labeling is in Omega (n log n). Inf. Process. Lett. Frank Wagner
1994	J	`jnl`	Faster Isometric Embedding in Products of Complete Graphs. Discret. Appl. Math. Franz Aurenhammer, Michael Formann, Ramana M. Idury, Alejandro A. Schäffer, Frank Wagner
1994	J	`jnl`	Wiring Knock-Knee Layouts: A Global Approach. IEEE Trans. Computers Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe
1993	B	`conf`	Between Min Cut and Graph Bisection. MFCS Dorothea Wagner, Frank Wagner
1993	J	`jnl`	Modeling Hypergraphs by Graphs with the Same Mincut Properties. Inf. Process. Lett. Edmund Ihler, Dorothea Wagner, Frank Wagner
1993	J	`jnl`	Routing through a Dense Channel with Minimum Total Wire Length. J. Algorithms Michael Formann, Dorothea Wagner, Frank Wagner
1992	J	`jnl`	An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. Discret. Appl. Math. Dorothea Wagner, Frank Wagner
1992	J	`jnl`	Book review. ZOR Methods Model. Oper. Res. Frank Wagner
1992	B	`conf`	Wiring Knock-Knee Layouts: A Global Appoach. ISAAC Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe
1991	—	`conf`	A Packing Problem with Applications to Lettering of Maps. SCG Michael Formann, Frank Wagner
1991	J	`jnl`	A generalization of the zero-one principle for sorting algorithms. Discret. Appl. Math. Dorothea Wagner, Frank Wagner
1991	A*	`conf`	Routing through a Dense Channel with Minimum Total Wire Length. SODA Michael Formann, Dorothea Wagner, Frank Wagner
1991	—	`conf`	Short Wire Routing in Convex Grids. ISA Frank Wagner, Barbara Wolfers
1990	B	`conf`	The VLSI layout in various embedding models. WG Michael Formann, Frank Wagner
1989	A*	`conf`	Area-Optimal Three-Layer Channel Routing FOCS Ruth Kuchem, Dorothea Wagner, Frank Wagner
1988	—	`—`	Graphenzerlegung mit minimalem Schnitt: ein Grundproblem des VLSI-Layout. Frank Wagner
1986	—	`conf`	Shuffle/Exchange is the Natural Interconnection Scheme for the Parallel Fast Fourier Transform. CONPAR Frank Wagner