- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: 10.4230/LIPIcs.IPEC.2019.10
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2019
- Urheber
-
Dreier, Jan
Fuchs, Janosch
Hartmann, Tim A.
Kuinke, Philipp
Rossmanith, Peter
Tauer, Björn F.
Wang, Hung-Lung
- DOI
-
10.18154/RWTH-2019-11765
- URN
-
urn:nbn:de:101:1-2021032315153523923510
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:51 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Dreier, Jan
- Fuchs, Janosch
- Hartmann, Tim A.
- Kuinke, Philipp
- Rossmanith, Peter
- Tauer, Björn F.
- Wang, Hung-Lung
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2019
Ähnliche Objekte (12)
Shortest edge disjoint paths in graphs
Edge-Disjoint Paths in Eulerian Digraphs
Average-case complexity of shortest-paths problems
Average-case complexity of shortest-paths problems
Nearly-linear increasing paths in edge-ordered graphs
Packing the Mule
Lifted edges as connectivity priors for multicut and disjoint paths
Paths and walks, forests and planes : arcadian algorithms and complexity
Grid graphs with diagonal edges and the complexity of Xmas mazes
Container packing
Packing up for the holidays
Recognizing Court-Packing
Shortest edge disjoint paths in graphs
Edge-Disjoint Paths in Eulerian Digraphs
Average-case complexity of shortest-paths problems
Average-case complexity of shortest-paths problems
Nearly-linear increasing paths in edge-ordered graphs
Packing the Mule
Lifted edges as connectivity priors for multicut and disjoint paths
Paths and walks, forests and planes : arcadian algorithms and complexity
Grid graphs with diagonal edges and the complexity of Xmas mazes
Container packing
Packing up for the holidays
Recognizing Court-Packing
Shortest edge disjoint paths in graphs
Edge-Disjoint Paths in Eulerian Digraphs
Average-case complexity of shortest-paths problems
Average-case complexity of shortest-paths problems
Nearly-linear increasing paths in edge-ordered graphs
Packing the Mule
Lifted edges as connectivity priors for multicut and disjoint paths
Paths and walks, forests and planes : arcadian algorithms and complexity
Grid graphs with diagonal edges and the complexity of Xmas mazes
Container packing
Packing up for the holidays