Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Geraets
Person information
- affiliation: Deutsche Bahn AG, Berlin, Germany
- affiliation: Free University of Berlin, Germany
- affiliation: RWTH Aachen University, Germany
Other persons with the same name
- Frank Wagner — disambiguation page
- Frank Wagner 0002
![[0000-0002-7770-1847]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-7770-1847")
— University of Stuttgart, Germany - Frank Wagner 0003 — Roskilde University, Denmark
- Frank Wagner 0004 — University of Évora, Portugal
- Frank Wagner 0005 — Universite de Lyon, Villeurbanne-Cedex, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[e2]Frank Geraets, Leo G. Kroon, Anita Schöbel, Dorothea Wagner, Christos D. Zaroliagis:
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. Lecture Notes in Computer Science 4359, Springer 2007, ISBN 978-3-540-74245-6 [contents]- 2004
- [e1]Leo G. Kroon, Frank Geraets, Dorothea Wagner, Christos D. Zaroliagis:
Algorithmic Methods for Railway Optimization, 20.06. - 25.06.2004. Dagstuhl Seminar Proceedings 04261, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2004 [contents] - [i1]Leo G. Kroon, Dorothea Wagner, Frank Geraets, Christos D. Zaroliagis:
04261 Abstracts Collection - Algorithmic Methods for Railway Optimization. Algorithmic Methods for Railway Optimization 2004 - 2001
- [j13]Frank Wagner, Alexander Wolff, Vikas Kapoor, Tycho Strijk:
Three Rules Suffice for Good Label Placement. Algorithmica 30(2): 334-349 (2001) - [c16]Frank Wagner:
A Complete Model of the Deutsche Bahn - Prosim and Beyond. ATMOS 2001: 11-12 - [c15]Horst W. Hamacher, Annegret Liebers, Anita Schöbel, Dorothea Wagner, Frank Wagner:
Locating New Stops in a Railway Network. ATMOS 2001: 13-23 - 2000
- [j12]Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis:
Computing Mimicking Networks. Algorithmica 26(1): 31-49 (2000) - [c14]Gabriele Neyer, Frank Wagner:
Labeling Downtown. CIAC 2000: 113-124
1990 – 1999
- 1998
- [c13]Frank Wagner, Alexander Wolff:
A Combinatorial Framework for Map Labeling. GD 1998: 316-331 - [c12]Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis:
Computing Mimicking Networks. ICALP 1998: 556-567 - 1997
- [j11]Frank Wagner, Alexander Wolff:
A Practical Map Labeling Algorithm. Comput. Geom. 7: 387-404 (1997) - [j10]Mechthild Stoer, Frank Wagner:
A simple min-cut algorithm. J. ACM 44(4): 585-591 (1997) - 1996
- [j9]Ruth Kuchem, Dorothea Wagner, Frank Wagner:
Optimizing Area for Three-Layer Knock-Knee Channel Routing. Algorithmica 15(5): 495-519 (1996) - 1995
- [c11]Frank Wagner, Alexander Wolff:
Map Labeling Heuristics: Provably Good and Practically Useful. SCG 1995: 109-118 - [c10]Frank Wagner, Alexander Wolff:
An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. ESA 1995: 420-433 - 1994
- [j8]Franz Aurenhammer, Michael Formann, Ramana M. Idury, Alejandro A. Schäffer, Frank Wagner:
Faster Isometric Embedding in Products of Complete Graphs. Discret. Appl. Math. 52(1): 17-28 (1994) - [j7]Frank Wagner:
Approximate Map Labeling is in Omega (n log n). Inf. Process. Lett. 52(3): 161-165 (1994) - [j6]Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe:
Wiring Knock-Knee Layouts: A Global Approach. IEEE Trans. Computers 43(5): 581-589 (1994) - [c9]Mechthild Stoer, Frank Wagner:
A Simple Min Cut Algorithm. ESA 1994: 141-147 - 1993
- [j5]Edmund Ihler, Dorothea Wagner, Frank Wagner:
Modeling Hypergraphs by Graphs with the Same Mincut Properties. Inf. Process. Lett. 45(4): 171-175 (1993) - [j4]Michael Formann, Dorothea Wagner, Frank Wagner:
Routing through a Dense Channel with Minimum Total Wire Length. J. Algorithms 15(2): 267-283 (1993) - [c8]Dorothea Wagner, Frank Wagner:
Between Min Cut and Graph Bisection. MFCS 1993: 744-750 - 1992
- [j3]Dorothea Wagner, Frank Wagner:
An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. Discret. Appl. Math. 40(1): 73-81 (1992) - [j2]Frank Wagner:
Book review. ZOR Methods Model. Oper. Res. 36(3): 226 (1992) - [c7]Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe:
Wiring Knock-Knee Layouts: A Global Appoach. ISAAC 1992: 388-399 - 1991
- [j1]Dorothea Wagner, Frank Wagner:
A generalization of the zero-one principle for sorting algorithms. Discret. Appl. Math. 30(2-3): 265-273 (1991) - [c6]Michael Formann, Frank Wagner:
A Packing Problem with Applications to Lettering of Maps. SCG 1991: 281-288 - [c5]Frank Wagner, Barbara Wolfers:
Short Wire Routing in Convex Grids. ISA 1991: 72-82 - [c4]Michael Formann, Dorothea Wagner, Frank Wagner:
Routing through a Dense Channel with Minimum Total Wire Length. SODA 1991: 475-482 - 1990
- [c3]Michael Formann, Frank Wagner:
The VLSI layout in various embedding models. WG 1990: 130-139
1980 – 1989
- 1989
- [c2]Ruth Kuchem, Dorothea Wagner, Frank Wagner:
Area-Optimal Three-Layer Channel Routing. FOCS 1989: 506-511 - 1988
- [b1]Frank Wagner:
Graphenzerlegung mit minimalem Schnitt: ein Grundproblem des VLSI-Layout. RWTH Aachen University, Germany, 1988, pp. 1-94 - 1986
- [c1]Frank Wagner:
Shuffle/Exchange is the Natural Interconnection Scheme for the Parallel Fast Fourier Transform. CONPAR 1986: 345-352
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-01 22:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
