Shortest Two Disjoint Paths in Polynomial Time

Andreas Björklund; Thore Husfeldt

doi:10.1007/978-3-662-43948-7_18

Shortest Two Disjoint Paths in Polynomial Time

Algorithms

Lund University

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

Original language	English
Title of host publication	Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I
Number of pages	12
Publication date	2014
ISBN (Print)	978-3-662-43947-0
ISBN (Electronic)	978-3-662-43948-7
DOIs	https://doi.org/10.1007/978-3-662-43948-7_18
Publication status	Published - 2014

Series	Lecture Notes in Computer Science
Volume	8572
ISSN	0302-9743

Access to Document

10.1007/978-3-662-43948-7_18

Best Paper Award: Best Paper at ICALP 2014, Track A: Algorithms, Complexity and Games
Husfeldt, T. (Recipient), 9 Jul 2014
Prize: Prizes, scholarships, distinctions

Cite this

@inproceedings{f97460fe1d6940c0ab95966772b1b080,

title = "Shortest Two Disjoint Paths in Polynomial Time",

author = "Andreas Bj{\"o}rklund and Thore Husfeldt",

year = "2014",

doi = "10.1007/978-3-662-43948-7\_18",

language = "English",

isbn = "978-3-662-43947-0",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

booktitle = "Automata, Languages, and Programming",

}

Shortest Two Disjoint Paths in Polynomial Time. / Björklund, Andreas; Husfeldt, Thore.
Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. 2014. (Lecture Notes in Computer Science, Vol. 8572).

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

Shortest Two Disjoint Paths in Polynomial Time

Access to Document

Prizes

Best Paper Award: Best Paper at ICALP 2014, Track A: Algorithms, Complexity and Games

Cite this