default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDU. Pape
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1992
[j12]Uwe Pape:
Breitbandkommunikation und elektronisches Publizieren. Wirtschaftsinf. 34(1): 76-83 (1992)- 1990
- [j11]Kurt Sandkuhl, Uwe Pape:
Aspekte und Trends des Elektronischen Publizierens / Aspects and trends of electronic publishing. it Inf. Technol. 32(4): 220-230 (1990)
1980 – 1989
- 1985
- [j10]Uwe Pape:
Personal-Disposition in Schichtbetrieben, dargestellt am Beispiel des Kranfürer-Einsatzes in der Stahlindustrie. Angew. Inform. 27(5): 215-218 (1985) - [e3]Uwe Pape:
Proceedings WG '84, Workshop on Graphtheoretic Concepts in Computer Science, Berlin, Germany. Trauner, Linz 1985, ISBN 3-853-20334-5 - 1983
- [j9]U. Pape:
Remark on algorithm 562: shortest path lengths. ACM Trans. Math. Softw. 9(2): 260 (1983) - [j8]I. Chalaris, Uwe Pape:
Ein heuristisches Verfahren zur Disposition von Öltransporten in Ölleitungsnetzen. Angew. Inform. 25(12): 525-533 (1983) - 1982
- [j7]Uwe Pape:
Ein Verfahren zur Disposition des Personaleinsatzes. Angew. Inform. 24(9): 470-476 (1982) - 1981
- [j6]Uwe Pape, Francisco Sedeño-Andrés, Hans-Christian Walter:
Projektstudium im Fach "Angewandte Informatik" - Modell einer Lehrform für das Hauptstudium Betriebsinformatik. Angew. Inform. 23(6): 233-238 (1981) - 1980
- [j5]K.-P. Kugler, Uwe Pape:
Algorithmus 41 Ein Algorithmus zum vollständigen Durchlaufen eines ungerichteten, zusammenhängenden Graphen. Computing 24(2-3): 269-274 (1980) - [j4]U. Pape:
Algorithm 562: Shortest Path Lengths [H]. ACM Trans. Math. Softw. 6(3): 450-455 (1980) - [e2]U. Pape:
Discrete Structures and Algorithms, Proceedings WG '79, Berlin, Germany. Hanser, Munich 1980, ISBN 3-446-13135-3, pp. 270
1970 – 1979
- 1976
- [e1]Uwe Pape:
1. Fachtagung über Graphentheoretische Konzepte der Informatik (Graphtheoretic Concepts in Computer Science), 2.-4. Juli 1975, Berlin, 3. Workshop und Treffen des German Chapter of the ACM über Graphen-Sprachen und Algorithmen auf Graphen. Carl Hanser Verlag München Wien 1976, ISBN 3-446-12215-X, pp. 236 [contents] - 1975
- [c1]Uwe Pape:
Graphen-Sprachen - eine Übersicht. WG 1975: 11-28 - 1974
- [j3]U. Pape:
Netzwerk-Veränderungen und Korrektur kürzester Weglängen von einer Wurzelmenge zu allen anderen Knoten. Computing 12(4): 357-362 (1974) - [j2]U. Pape:
Implementation and efficiency of Moore-algorithms for the shortest route problem. Math. Program. 7(1): 212-222 (1974)
1960 – 1969
- 1968
- [j1]Uwe Pape:
Letters to the Editor: Some Computational Notes on the Shortest Route Problem. Comput. J. 11(2): 240 (1968)
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 2025-01-09 13:15 CET 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:
