Search results for "Frank Wagner"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Frank Wagner	Propriétés résiduelles dans les groupes supersimples.	J. Symb. Log.	2011	DBLP BibTeX RDF
1	Frank Wagner, Kathleen Krebs, Cataldo Mega, Bernhard Mitschang, Norbert Ritter	Email Archiving and Discovery as a Service.	IDC	2008	DBLP DOI BibTeX RDF
1	Frank Wagner, Kathleen Krebs, Cataldo Mega, Bernhard Mitschang, Norbert Ritter	Towards the Design of a Scalable Email Archiving and Discovery Solution.	ADBIS	2008	DBLP DOI BibTeX RDF	Email Archiving and Discovery, Legal Compliance, Engineering for Scalability, Virtualization, Enterprise Content Management, Scale-out
1	Frank Geraets, Leo G. Kroon, Anita Schöbel, Dorothea Wagner, Christos D. Zaroliagis (eds.)	Algorithmic Methods for Railway Optimization, International Dagstuhl Workshop, Dagstuhl Castle, Germany, June 20-25, 2004, 4th International Workshop, ATMOS 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers	ATMOS	2007	DBLP BibTeX RDF
1	Juan Luis Guerrero-Rascado, Hassan Lyamani, Lucas Alados-Arboledas, Ana María Silva, Frank Wagner, Sergio Pereira	Atmospheric vertical profiles obtained by Lidar over Évora during CAPEX project.	IGARSS	2007	DBLP DOI BibTeX RDF
1	Frank Wagner	Subsimple groups.	J. Symb. Log.	2005	DBLP BibTeX RDF
1	Frank Wagner, Jochen Eichert, Roman Schirra	Management Of Virtual Enterprises: A Case Study Of German Rapid Prototyping SMES.	PRO-VE	2003	DBLP BibTeX RDF
1	Frank Wagner, Alexander Wolff, Vikas Kapoor, Tycho Strijk	Three Rules Suffice for Good Label Placement.	Algorithmica	2001	DBLP DOI BibTeX RDF
1	Frank Wagner	Fields of Finite Morley Rank.	J. Symb. Log.	2001	DBLP BibTeX RDF
1	Horst W. Hamacher, Annegret Liebers, Anita Schöbel, Dorothea Wagner, Frank Wagner	Locating New Stops in a Railway Network.	Electr. Notes Theor. Comput. Sci.	2001	DBLP DOI BibTeX RDF
1	Frank Wagner	A Complete Model of the Deutsche Bahn - Prosim and Beyond.	Electr. Notes Theor. Comput. Sci.	2001	DBLP DOI BibTeX RDF
1	Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis	Computing Mimicking Networks.	Algorithmica	2000	DBLP DOI BibTeX RDF
1	Oleg V. Belegradek, Ya'acov Peterzil, Frank Wagner	Quasi-O-Minimal Structures.	J. Symb. Log.	2000	DBLP BibTeX RDF
1	Gabriele Neyer, Frank Wagner	Labeling Downtown.	CIAC	2000	DBLP DOI BibTeX RDF
1	Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis	Computing Mimicking Networks.	ICALP	1998	DBLP DOI BibTeX RDF
1	Frank Wagner, Alexander Wolff	A Combinatorial Framework for Map Labeling.	Graph Drawing	1998	DBLP DOI BibTeX RDF
1	Mechthild Stoer, Frank Wagner	A simple min-cut algorithm.	J. ACM	1997	DBLP DOI BibTeX RDF	min-cut
1	Frank Wagner, Alexander Wolff	A Practical Map Labeling Algorithm.	Comput. Geom.	1997	DBLP DOI BibTeX RDF
1	Ruth Kuchem, Dorothea Wagner, Frank Wagner	Optimizing Area for Three-Layer Knock-Knee Channel Routing.	Algorithmica	1996	DBLP DOI BibTeX RDF
1	Frank Wagner, Alexander Wolff	An Efficient and Effective Approximation Algorithm for the Map Labeling Problem.	ESA	1995	DBLP DOI BibTeX RDF
1	Frank Wagner, Alexander Wolff	Map Labeling Heuristics: Provably Good and Practically Useful.	Symposium on Computational Geometry	1995	DBLP DOI BibTeX RDF
1	Frank Wagner	Approximate Map Labeling is in Omega (n log n).	Inf. Process. Lett.	1994	DBLP DOI BibTeX RDF
1	Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe	Wiring Knock-Knee Layouts: A Global Approach.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF
1	Franz Aurenhammer, Michael Formann, Ramana M. Idury, Alejandro A. Schäffer, Frank Wagner	Faster Isometric Embedding in Products of Complete Graphs.	Discrete Applied Mathematics	1994	DBLP DOI BibTeX RDF
1	Mechthild Stoer, Frank Wagner	A Simple Min Cut Algorithm.	ESA	1994	DBLP DOI BibTeX RDF
1	Edmund Ihler, Dorothea Wagner, Frank Wagner	Modeling Hypergraphs by Graphs with the Same Mincut Properties.	Inf. Process. Lett.	1993	DBLP DOI BibTeX RDF
1	Michael Formann, Dorothea Wagner, Frank Wagner	Routing through a Dense Channel with Minimum Total Wire Length.	J. Algorithms	1993	DBLP DOI BibTeX RDF
1	Dorothea Wagner, Frank Wagner	Between Min Cut and Graph Bisection.	MFCS	1993	DBLP DOI BibTeX RDF
1	Dorothea Wagner, Frank Wagner	An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem.	Discrete Applied Mathematics	1992	DBLP BibTeX RDF
1	Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe	Wiring Knock-Knee Layouts: A Global Appoach.	ISAAC	1992	DBLP DOI BibTeX RDF
1	Dorothea Wagner, Frank Wagner	A generalization of the zero-one principle for sorting algorithms.	Discrete Applied Mathematics	1991	DBLP DOI BibTeX RDF
1	Michael Formann, Dorothea Wagner, Frank Wagner	Routing through a Dense Channel with Minimum Total Wire Length.	SODA	1991	DBLP DOI BibTeX RDF
1	Michael Formann, Frank Wagner	A Packing Problem with Applications to Lettering of Maps.	Symposium on Computational Geometry	1991	DBLP DOI BibTeX RDF
1	Frank Wagner, Barbara Wolfers	Short Wire Routing in Convex Grids.	ISA	1991	DBLP DOI BibTeX RDF
1	Michael Formann, Frank Wagner	The VLSI layout in various embedding models.	WG	1990	DBLP DOI BibTeX RDF	embedding models, Manhattan model, knock-knee model, routing, VLSI, NP-completeness, layout
1	Ruth Kuchem, Dorothea Wagner, Frank Wagner	Area-Optimal Three-Layer Channel Routing	FOCS	1989	DBLP DOI BibTeX RDF	area optimal routing algorithm, three-layer channel routing, knock-knee mode, three conducting layers, three-layer wirable layout, time complexity, vias, layer assignment, layout algorithms
1	Frank Wagner	Shuffle/Exchange is the Natural Interconnection Scheme for the Parallel Fast Fourier Transform.	CONPAR	1986	DBLP DOI BibTeX RDF

Publications of Frank Wagner Frank Geraets ( http://dblp.L3S.de/Authors/Frank_Wagner )