- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Technische Universität Berlin
- (wann)
-
2024
- Urheber
-
Cavallaro, Dario Giuliano
Kawarabayashi, Ken-ichi
Kreutzer, Stephan
- DOI
-
10.14279/depositonce-21312
- Handle
-
11303/22511
- URN
-
urn:nbn:de:101:1-2409110202333.372929345456
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:47 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
- Cavallaro, Dario Giuliano
- Kawarabayashi, Ken-ichi
- Kreutzer, Stephan
- Technische Universität Berlin
Entstanden
- 2024
Ähnliche Objekte (12)
Shortest edge disjoint paths in graphs
The Complexity of Packing Edge-Disjoint Paths
Nearly-linear increasing paths in edge-ordered graphs
Lifted edges as connectivity priors for multicut and disjoint paths
Monotonic representations of outerplanar graphs as edge intersection graphs of paths on a grid
Martin Heidegger : paths taken, paths opened
On k-bend and monotonic l-bend edge intersection graphs of paths on a grid
Fastest Paths, Almost Disjoint Paths, and Beyond
Paths in Utopia
STRAIGHT EDGE {STRAIGHT EDGE} | MANNHEIM
Edge to edge : experimental design
EDGE
Shortest edge disjoint paths in graphs
The Complexity of Packing Edge-Disjoint Paths
Nearly-linear increasing paths in edge-ordered graphs
Lifted edges as connectivity priors for multicut and disjoint paths
Monotonic representations of outerplanar graphs as edge intersection graphs of paths on a grid
Martin Heidegger : paths taken, paths opened
On k-bend and monotonic l-bend edge intersection graphs of paths on a grid
Fastest Paths, Almost Disjoint Paths, and Beyond
Paths in Utopia
STRAIGHT EDGE {STRAIGHT EDGE} | MANNHEIM
Edge to edge : experimental design
EDGE
Shortest edge disjoint paths in graphs
The Complexity of Packing Edge-Disjoint Paths
Nearly-linear increasing paths in edge-ordered graphs
Lifted edges as connectivity priors for multicut and disjoint paths
Monotonic representations of outerplanar graphs as edge intersection graphs of paths on a grid
Martin Heidegger : paths taken, paths opened
On k-bend and monotonic l-bend edge intersection graphs of paths on a grid
Fastest Paths, Almost Disjoint Paths, and Beyond
Paths in Utopia
STRAIGHT EDGE {STRAIGHT EDGE} | MANNHEIM
Edge to edge : experimental design