11 citations · 40 across the 30 of their papers we have counts for
38 papers
An algorithm for accurate and simple-looking metaphorical maps
Eleni Katsanou, Tamara Mchedlidze, Antonios Symvonis +1
"Metaphorical maps" or "contact representations" are visual representations of vertex-weighted graphs that rely on the geographic map metaphor. The vertices are represented by coun…
Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4
Maarten Löffler, Tamara Mchedlidze, David Orden +2
A pseudo-triangle is a simple polygon with exactly three convex vertices, and all other vertices (if any) are distributed on three concave chains. A pseudo-triangulation~$\mathcal{…
On 1-bend Upward Point-set Embeddings of -digraphs
Emilio Di Giacomo, Henry Förster, Daria Kokhovich +4
We study the upward point-set embeddability of digraphs on one-sided convex point sets with at most 1 bend per edge. We provide an algorithm to compute a 1-bend upward point-set em…
Heuristic Algorithms for the Approximation of Mutual Coherence
Gregor Betz, Vera Chekan, Tamara Mchedlidze
Mutual coherence is a measure of similarity between two opinions. Although the notion comes from philosophy, it is essential for a wide range of technologies, e.g., the Wahl-O-Mat…
Identifying Cluttering Edges in Near-Planar Graphs
Simon van Wageningen, Tamara Mchedlidze, Alexandru Telea
Planar drawings of graphs tend to be favored over non-planar drawings. Testing planarity and creating a planar layout of a planar graph can be done in linear time. However, creatin…
Can an NN model plainly learn planar layouts?
Smon van Wageningen, Tamara Mchedlidze
Planar graph drawings tend to be aesthetically pleasing. In this poster we explore a Neural Network's capability of learning various planar graph classes. Additionally, we also inv…