- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: 10.4230/LIPIcs.IPEC.2019.10
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
Universitätsbibliothek der RWTH Aachen
- (when)
-
2019
- Creator
-
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
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:51 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Dreier, Jan
- Fuchs, Janosch
- Hartmann, Tim A.
- Kuinke, Philipp
- Rossmanith, Peter
- Tauer, Björn F.
- Wang, Hung-Lung
- Universitätsbibliothek der RWTH Aachen
Time of origin
- 2019
Other Objects (12)
Edge-Disjoint Paths in Eulerian Digraphs
Shortest edge disjoint paths in graphs
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
Container packing
Grid graphs with diagonal edges and the complexity of Xmas mazes
Packing up for the holidays
Recognizing Court-Packing
Edge-Disjoint Paths in Eulerian Digraphs
Shortest edge disjoint paths in graphs
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
Container packing
Grid graphs with diagonal edges and the complexity of Xmas mazes
Packing up for the holidays
Recognizing Court-Packing
Edge-Disjoint Paths in Eulerian Digraphs
Shortest edge disjoint paths in graphs
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
Container packing
Grid graphs with diagonal edges and the complexity of Xmas mazes
Packing up for the holidays