Zobrazeno 1 - 10
of 13
pro vyhledávání: '"N��llenburg, Martin"'
A preference profile with $m$ alternatives and $n$ voters is $d$-Manhattan (resp. $d$-Euclidean) if both the alternatives and the voters can be placed into the $d$-dimensional space such that between each pair of alternatives, every voter prefers the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7a4affae6a8d5ad75a9c904ed30ba6b
http://arxiv.org/abs/2201.09691
http://arxiv.org/abs/2201.09691
We consider the problem of untangling a given (non-planar) straight-line circular drawing $\delta_G$ of an outerplanar graph $G=(V, E)$ into a planar straight-line circular drawing by shifting a minimum number of vertices to a new position on the cir
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49602456fe5f352ed26158dcf8a6022a
This report documents the program and the outcomes of Dagstuhl Seminar 21293 "Parameterized Complexity in Graph Drawing". The seminar was held mostly in-person from July 18 to July 23, 2021. It brought together 28 researchers from the Graph Drawing a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5704709bc5667386daae0b3c28a9efcf
Weak unit disk contact graphs are graphs that admit a representation of the nodes as a collection of internally disjoint unit disks whose boundaries touch if there is an edge between the corresponding nodes. We provide a gadget-based reduction to sho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c4ef46823ec55cf4129d29ba91b1334
http://arxiv.org/abs/2010.01881
http://arxiv.org/abs/2010.01881
Autor:
Purchase, Helen C., Archambault, Daniel, Kobourov, Stephen, N��llenburg, Martin, Pupyrev, Sergey, Wu, Hsiang-Yun
Do algorithms for drawing graphs pass the Turing Test? That is, are their outputs indistinguishable from graphs drawn by humans? We address this question through a human-centred experiment, focusing on `small' graphs, of a size for which it would be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dccfb6aae8b2fb7e4a66a62a26adb3fd
http://arxiv.org/abs/2008.04869
http://arxiv.org/abs/2008.04869
Partial edge drawing (PED) is a drawing style for non-planar graphs, in which edges are drawn only partially as pairs of opposing stubs on the respective end-vertices. In a PED, by erasing the central parts of edges, all edge crossings and the result
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f580a64c9f73915f4a06bb8f18fe5d28
http://arxiv.org/abs/1908.08905
http://arxiv.org/abs/1908.08905
A $k$-page linear graph layout of a graph $G = (V,E)$ draws all vertices along a line $\ell$ and each edge in one of $k$ disjoint halfplanes called pages, which are bounded by $\ell$. We consider two types of pages. In a stack page no two edges shoul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4032d0ecfd3110c71ad01bf0ace154c
http://arxiv.org/abs/1908.08938
http://arxiv.org/abs/1908.08938
Autor:
Nickel, Soeren, N��llenburg, Martin
Traditionally, most schematic metro maps in practice as well as metro map layout algorithms adhere to an octolinear layout style with all paths composed of horizontal, vertical, and 45{\deg}-diagonal edges. Despite growing interest in more general mu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::79f5be0d672868ed8899d005b3a28180
http://arxiv.org/abs/1904.03039
http://arxiv.org/abs/1904.03039
Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016)
Autor:
Hu, Yifan, N��llenburg, Martin
This is the arXiv index for the electronic proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016), which was held in Athens, Greece, September 19-21 2016. It contains the peer-reviewed and revised accepte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::243a5be36713b6933c76b3f747a5bbcd
http://arxiv.org/abs/1609.02443
http://arxiv.org/abs/1609.02443
Given an unlabeled road map, we consider, from an algorithmic perspective, the cartographic problem to place non-overlapping road labels embedded in their roads. We first decompose the road network into logically coherent road sections, e.g., parts o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::488cd593848a882986ae049e6c49f614
http://arxiv.org/abs/1605.04265
http://arxiv.org/abs/1605.04265