- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Algorithmica (83:) - London [u.a.] : SpringerNature - S. 116-143
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Technische Universität Berlin
- (when)
-
2021
- Creator
-
Aichholzer, Oswin
Cardinal, Jean
Huynh, Tony
Knauer, Kolja
Mütze, Torsten
Steiner, Raphael
Vogtenhuber, Birgit
- DOI
-
10.14279/depositonce-11656
- Handle
-
11303/12856
- URN
-
urn:nbn:de:101:1-2021032400571499241975
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:23 AM CEST
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
- Aichholzer, Oswin
- Cardinal, Jean
- Huynh, Tony
- Knauer, Kolja
- Mütze, Torsten
- Steiner, Raphael
- Vogtenhuber, Birgit
- Technische Universität Berlin
Time of origin
- 2021
Other Objects (12)
Flip Distances Between Graph Orientations
Distances Between Immersed Graphs: Metric Properties
Flip colouring of graphs
Increasing distances in graphs
Acyclic orientations of mixed graphs
Flips & Partitions in Geometric Graphs
Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances
Generalized tournaments and efficient orientations of graphs
Linear Distances between Markov Chains
Connectivity of Triangulation Flip Graphs in the Plane
Fixed-Parameter Tractable Distances to Sparse Graph Classes
Tree-decompositions, Hamilton circles and Orientations of infinite Graphs
Flip Distances Between Graph Orientations
Distances Between Immersed Graphs: Metric Properties
Flip colouring of graphs
Increasing distances in graphs
Acyclic orientations of mixed graphs
Flips & Partitions in Geometric Graphs
Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances
Generalized tournaments and efficient orientations of graphs
Linear Distances between Markov Chains
Connectivity of Triangulation Flip Graphs in the Plane
Fixed-Parameter Tractable Distances to Sparse Graph Classes
Tree-decompositions, Hamilton circles and Orientations of infinite Graphs
Flip Distances Between Graph Orientations
Distances Between Immersed Graphs: Metric Properties
Flip colouring of graphs
Increasing distances in graphs
Acyclic orientations of mixed graphs
Flips & Partitions in Geometric Graphs
Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances
Generalized tournaments and efficient orientations of graphs
Linear Distances between Markov Chains
Connectivity of Triangulation Flip Graphs in the Plane
Fixed-Parameter Tractable Distances to Sparse Graph Classes