English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Efficient Algorithms for Path Problems with Gernal Cost Citeria

Lengauer, T., & Theune, D. (1991). Efficient Algorithms for Path Problems with Gernal Cost Citeria. In J. L. Albert, B. Monien, & M. Rodríguez Artalejo (Eds.), Automata, Languages and Programming (pp. 314-326). Berlin: Springer.

Item is

Basic

show hide
Genre: Conference Paper

Files

show Files

Locators

show
hide
Locator:
https://rdcu.be/dN3My (Publisher version)
Description:
-
OA-Status:
Not specified

Creators

show
hide
 Creators:
Lengauer, Thomas1, Author
Theune, Dirk1, Author
Affiliations:
1External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 1991
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1007/3-540-54233-7\_144
BibTex Citekey: DBLP:conf/icalp/LengauerT91
 Degree: -

Event

show
hide
Title: 18th International Colloquium on Automata, Languages and Programming
Place of Event: Madrid, Spain
Start-/End Date: 1991-07-08 - 1991-07-12

Legal Case

show

Project information

show

Source 1

show
hide
Title: Automata, Languages and Programming
  Abbreviation : ICALP 1991
  Subtitle : 18th International Colloquium, Madrid, Spain, July 8-12, 1991. Proceedings
Source Genre: Proceedings
 Creator(s):
Albert, Javier Leach1, Editor
Monien, Burkhard1, Editor
Rodríguez Artalejo, Mario1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 314 - 326 Identifier: ISBN: 978-3-540-54233-9

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 510 Sequence Number: - Start / End Page: - Identifier: -