- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Ereignis
-
Veröffentlichung
- (wo)
-
Köln
- (wer)
-
Universitäts- und Stadtbibliothek Köln
- (wann)
-
2011
- Urheber
-
Gronemann, Martin
Jünger, Michael
Mallach, Sven
Schmidt, Daniel R.
- URN
-
urn:nbn:de:hbz:38-550212
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:27 MESZ
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
- Gronemann, Martin
- Jünger, Michael
- Mallach, Sven
- Schmidt, Daniel R.
- Universitäts- und Stadtbibliothek Köln
Entstanden
- 2011
Ähnliche Objekte (12)
Drawing Shortest Paths in Geodetic Graphs
Shortest edge disjoint paths in graphs
Sketch-Driven Orthogonal Graph Drawing
“The Longest Way Round Is The Shortest Way Home”: An Overhaul of Surgical Ward Rounds
Longest cycles in cyclically 4-edge-connected cubic planar graphs
Orthogonal graph drawing with constraints : algorithms and applications
Orthogonal graph drawing with constraints : algorithms and applications
Edge Label Placement in Layered Graph Drawing
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
The longest journey
On the hardness of orthogonal-order preserving graph drawing
Women: the longest revolution
Drawing Shortest Paths in Geodetic Graphs
Shortest edge disjoint paths in graphs
Sketch-Driven Orthogonal Graph Drawing
“The Longest Way Round Is The Shortest Way Home”: An Overhaul of Surgical Ward Rounds
Longest cycles in cyclically 4-edge-connected cubic planar graphs
Orthogonal graph drawing with constraints : algorithms and applications
Orthogonal graph drawing with constraints : algorithms and applications
Edge Label Placement in Layered Graph Drawing
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
The longest journey
On the hardness of orthogonal-order preserving graph drawing
Women: the longest revolution
Drawing Shortest Paths in Geodetic Graphs
Shortest edge disjoint paths in graphs
Sketch-Driven Orthogonal Graph Drawing
“The Longest Way Round Is The Shortest Way Home”: An Overhaul of Surgical Ward Rounds
Longest cycles in cyclically 4-edge-connected cubic planar graphs
Orthogonal graph drawing with constraints : algorithms and applications
Orthogonal graph drawing with constraints : algorithms and applications
Edge Label Placement in Layered Graph Drawing
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
The longest journey
On the hardness of orthogonal-order preserving graph drawing