16 citations · 72 across the 11 of their papers we have counts for
6 papers · 1 filter
Simultaneous Matrix Orderings for Graph Collections
Nathan van Beusekom, Wouter Meulemans, Bettina Speckmann
Undirected graphs are frequently used to model networks. The topology of an undirected graph G can be captured by an adjacency matrix; this matrix in turn can be visualized directl…
Near-Delaunay Metrics
Nathan van Beusekom, Kevin Buchin, Hidde Koerts +3
We study metrics that assess how close a triangulation is to being a Delaunay triangulation, for use in contexts where a good triangulation is desired but constraints (e.g., maximu…
Crossing Numbers of Beyond-Planar Graphs Revisited
Nathan van Beusekom, Irene Parada, Bettina Speckmann
Graph drawing beyond planarity focuses on drawings of high visual quality for non-planar graphs which are characterized by certain forbidden edge configurations. A natural criterio…
Obstructing Classification via Projection
Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckman +2
Machine learning and data mining techniques are effective tools to classify large amounts of data. But they tend to preserve any inherent bias in the data, for example, with regard…
Polygon-Universal Graphs
Tim Ophelders, Ignaz Rutter, Bettina Speckmann +1
We study a fundamental question from graph drawing: given a pair of a graph and a cycle in together with a simple polygon , is there a straight-line drawing…
Preprocessing Imprecise Points for the Pareto Front
Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler +1
In the preprocessing model for uncertain data we are given a set of regions R which model the uncertainty associated with an unknown set of points P. In this model there are two ph…