We present a method for balancing between the Local and Global Structure...
A vertex of a plane digraph is bimodal if all its incoming edges (and he...
Large tree structures are ubiquitous and real-world relational datasets ...
Graph neural networks are useful for learning problems, as well as for
c...
A sparsification of a given graph G is a sparser graph (typically a
subg...
Bipartite graphs model the relationships between two disjoint sets of
en...
We continue the study of linear layouts of graphs in relation to known d...
We describe an efficient and scalable spherical graph embedding method. ...
Bipartite graphs model the relationship between two disjoint sets of obj...
We propose an algorithm for visualizing a dataset by embedding it in
3-d...
Hyperbolic geometry offers a natural focus + context for data visualizat...
The segment number of a planar graph G is the smallest number of line
se...
Readability criteria, such as distance or neighborhood preservation, are...
In the Priority Steiner Tree (PST) problem, we are given an undirected g...
Just-in-time (JIT) compilers are used by many modern programming systems...
Graph neural networks have been successful in many learning problems and...
Evolving trees arise in many real-life scenarios from computer file syst...
Just-in-Time (JIT) compilers are used by many modern programming systems...
An additive +β spanner of a graph G is a subgraph which
preserves distan...
Given a graph G = (V,E), a subgraph H is an additive +β
spanner if _H(u,...
Set systems are used to model data that naturally arises in many context...
We study the language of food on Twitter during the pandemic lockdown in...
We consider the construction of a polygon P with n vertices whose turnin...
We propose MetroSets, a new, flexible online tool for visualizing set sy...
Motivated by the fact that in a space where shortest paths are unique, n...
Readability criteria, such as distance or neighborhood preservation, are...
We study the multi-level Steiner tree problem: a generalization of the
S...
An α-additive spanner of an undirected graph G=(V, E) is a subgraph
H su...
We introduce and study the 1-planar packing problem: Given k graphs with...
Data analysts commonly utilize statistics to summarize large datasets. W...
We describe a method for simultaneous visualization of multiple pairwise...
This tutorial review provides a guiding reference to researchers who wan...
We initiate the study of Simultaneous Graph Embedding with Fixed Edges i...
Cartograms are popular for visualizing numerical data for map regions.
M...
Stress, edge crossings, and crossing angles play an important role in th...
Symmetry is a key feature observed in nature (from flowers and leaves, t...
A recent data visualization literacy study shows that most people cannot...
Given an undirected weighted graph $G(V,E)$, a subsetwise sparsifier ove...
Given a weighted graph G(V,E) and t > 1, a subgraph H is a
t--spanner of...
We show new applications of the nearest-neighbor chain algorithm, a tech...
In the classical vertex-weighted Steiner tree problem (VST), one is give...
A Stick graph is an intersection graph of axis-aligned segments such
tha...
Data analysts commonly utilize statistics to summarize large datasets. W...
Motivated by hybrid graph representations, we introduce and study the
fo...
Symmetry is an important factor in human perception in general, as well ...
Timeslices are often used to draw and visualize dynamic graphs. While
ti...
Knot and link diagrams are projections of one or more 3-dimensional simp...
Visualizing network data is applicable in domains such as biology,
engin...
In this paper we describe a system for visualizing and analyzing worldwi...
We describe a strategy for the acquisition of training data necessary to...