Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Wolfgang Brunner"'
Autor:
Christopher Auer, Wolfgang Brunner, Andreas Gleißner, Christian Bachmaier, Franz J. Brandenburg
Publikováno v:
Journal of Graph Algorithms and Applications. 22:207-237
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::610a86de417e6d791b1ddb073b955e47
https://doi.org/10.7155/jgaa.00465
https://doi.org/10.7155/jgaa.00465
Publikováno v:
Schooling for Sustainable Development in Africa ISBN: 9783319459875
This chapter shares insights into the development and use of Fundisana Online, an ESD e-learning teacher education programme, in teacher professional development for mainstreaming education for sustainable development. We describe how SADC REEP and S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2021cf0113762219c6276e0941cb2ccb
https://doi.org/10.1007/978-3-319-45989-9_20
https://doi.org/10.1007/978-3-319-45989-9_20
Publikováno v:
Journal of Graph Algorithms and Applications. 16:151-198
Directed graphs are generally drawn as level drawings using the hierarchical approach. Such drawings are constructed by a framework of algorithms which operates in four phases: cycle removal, leveling, crossing reduction, and coordinate assignment. H
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1fc66f62487262111b751cd4f1814a0
https://doi.org/10.7155/jgaa.00254
https://doi.org/10.7155/jgaa.00254
Publikováno v:
Journal of Graph Algorithms and Applications. 15:631-659
Directed graphs are commonly drawn by a four phase framework introduced by Sugiyama et al. in 1981. The vertices are placed on parallel horizontal levels. The edge routing between consecutive levels is computed by solving one-sided 2-level crossing m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b8399f95a9b8937cf9ac236870edf98
https://doi.org/10.7155/jgaa.00242
https://doi.org/10.7155/jgaa.00242
Autor:
Wolfgang Brunner
Effizientes Kundenmanagement und motivierte Mitarbeiter sind für den Erfolg eines Kreditinstituts unverzichtbar. Um den sich permanent wandelnden Kundenbedürfnissen gerecht werden zu können, müssen die Mitarbeiter neben branchenspezifischen Fachk
Publikováno v:
ACM Journal of Experimental Algorithmics. 17
Directed graphs are commonly drawn by the Sugiyama algorithm where first vertices are placed on distinct hierarchical levels, and second vertices on the same level are permuted to reduce the overall number of crossings. Separating these two phases si
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b6603defc5afe1bc2b318d9b60f77c3
https://doi.org/10.1145/2133803.2345682
https://doi.org/10.1145/2133803.2345682
Autor:
Wolfgang Brunner
Publikováno v:
Österreichische Musikzeitschrift. 67
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5056b417b97623cbfd1e7dde595ad35f
https://doi.org/10.7767/omz.2012.67.2.59
https://doi.org/10.7767/omz.2012.67.2.59
Autor:
Andreas Gleißner, Christian Bachmaier, Wolfgang Brunner, Franz J. Brandenburg, Christopher Auer
Publikováno v:
Graph Drawing ISBN: 9783642184680
Graph Drawing
Graph Drawing
In stack and queue layouts the vertices of a graph are linearly ordered from left to right, where each edge corresponds to an item and the left and right end vertex of each edge represents the addition and removal of the item to the used data structu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b2916f3e49fd1ce95e85b5420b13127
https://doi.org/10.1007/978-3-642-18469-7_7
https://doi.org/10.1007/978-3-642-18469-7_7
Autor:
Marco Matzeder, Wolfgang Brunner
Publikováno v:
Graph Drawing ISBN: 9783642184680
Graph Drawing
Graph Drawing
We explore the complexity of drawing ordered (k - 1)-ary trees on grids with k directions for k ∈ {4, 6, 8} and within a given area. This includes, e. g., ternary trees drawn on the orthogonal grid. For aesthetically pleasing tree drawings on these
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5c4697a1b155929f7540be82f39766d
https://doi.org/10.1007/978-3-642-18469-7_10
https://doi.org/10.1007/978-3-642-18469-7_10
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783642114397
WALCOM
WALCOM
Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations, which are still ${\mathcal{NP}}$-hard. We introduce a global crossing reductio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87fd142b7cb7c22404d7980bcff0ac83
https://doi.org/10.1007/978-3-642-11440-3_7
https://doi.org/10.1007/978-3-642-11440-3_7