Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Andreas Gleißner"'
Autor:
Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Christopher Auer, Daniel Neuwirth, Christian Bachmaier, Josef Reislhuber
Publikováno v:
Algorithmica. 83:3534-3535
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47e6399877971ec9e3c736fc2ea2d5e6
https://doi.org/10.1007/s00453-021-00874-z
https://doi.org/10.1007/s00453-021-00874-z
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
Autor:
Franz J. Brandenburg, Andreas Gleißner
Publikováno v:
Theoretical Computer Science. 636:66-76
Ranking information is an important topic in information sciences, Internet searching, voting systems, and sports. In the full information approach, a ranking is a total order of the candidates. We compare two rankings by pairwise comparisons under t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a8b38e1312857fa6a58803b335117a9
https://doi.org/10.1016/j.tcs.2016.05.026
https://doi.org/10.1016/j.tcs.2016.05.026
Autor:
Christian Bachmaier, Kathrin Hanauer, Christopher Auer, Franz J. Brandenburg, Andreas Gleißner
Publikováno v:
Theoretical Computer Science. 571:36-49
We consider upward planar drawings of directed graphs in the plane (UP), and on standing (SUP) and rolling cylinders (RUP). In the plane and on the standing cylinder the edge curves are monotonically increasing in y-direction. On the rolling cylinder
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::238651377dde60af1d491668ace73a4d
https://doi.org/10.1016/j.tcs.2015.01.003
https://doi.org/10.1016/j.tcs.2015.01.003
Publikováno v:
Journal of Graph Algorithms and Applications. 19:67-86
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. 1-planarity is known NP-hard, even for graphs of bounded bandwidth, pathwidth, or treewidth, and for near-planar graphs in which an edge is added to a pl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84e7ca1a5d5fc8fcc27a7706bdaa8855
https://doi.org/10.7155/jgaa.00347
https://doi.org/10.7155/jgaa.00347
Autor:
Andreas Gleißner, Franz J. Brandenburg, Josef Reislhuber, Christian Bachmaier, Christopher Auer
Publikováno v:
Journal of Graph Algorithms and Applications. 17:541-565
Optical graph recognition (OGR) reverses graph drawing. A drawing transforms the topological structure of a graph into a graphical representation. Primarily, it maps vertices to points and displays them by icons and it maps edges to Jordan curves con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce20f6cd222d7ca8e7a3ba74efcd4b1a
https://doi.org/10.7155/jgaa.00303
https://doi.org/10.7155/jgaa.00303
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642452772
IWOCA
IWOCA
The rank aggregation problem consists in finding a consensus ranking on a set of alternatives, based on the preferences of individual voters. These are expressed by permutations, whose distance can be measured in many ways.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad1e46de54173e8f6a9a4294b1e89d05
https://doi.org/10.1007/978-3-642-45278-9_3
https://doi.org/10.1007/978-3-642-45278-9_3
Publikováno v:
Graph Drawing ISBN: 9783642367625
Graph Drawing
Graph Drawing
A simple undirected graph G = (V, E) is k-planar if it can be drawn in the plane such that each edge is crossed at most k times, incident edges do not cross, and a pair of edges must not cross twice. Such graphs have attracted many graph drawers, see
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d006872c5c69bda87cf3d14c245ac6f
https://doi.org/10.1007/978-3-642-36763-2_50
https://doi.org/10.1007/978-3-642-36763-2_50
Publikováno v:
Graph Drawing ISBN: 9783642367625
Graph Drawing
Graph Drawing
We show that planarity testing can be interpreted as a train switching problem. Train switching problems have been studied in the context of permutation networks, i. e., permuting the cars of a train on a given railroad network [5]. The cars enter th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::714ad16e3be39cc78b8a43d4402f4cba
https://doi.org/10.1007/978-3-642-36763-2_51
https://doi.org/10.1007/978-3-642-36763-2_51
Autor:
Andreas Gleißner, Josef Reislhuber, Franz J. Brandenburg, David Eppstein, Michael T. Goodrich, Kathrin Hanauer
Publikováno v:
Graph Drawing ISBN: 9783642367625
Graph Drawing
Graph Drawing
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. It is maximal 1-planar if the addition of any edge violates 1-planarity. Maximal 1-planar graphs have at most 4n−8 edges. We show that there are sparse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a550b2d418933e17d401b0e0f8163f38
https://doi.org/10.1007/978-3-642-36763-2_29
https://doi.org/10.1007/978-3-642-36763-2_29