research
∙
08/31/2023
Balancing between the Local and Global Structures (LGS) in Graph Embedding
We present a method for balancing between the Local and Global Structure...
share
research
∙
08/29/2023
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem
A vertex of a plane digraph is bimodal if all its incoming edges (and he...
research
∙
05/17/2023
A Scalable Method for Readable Tree Layouts
Large tree structures are ubiquitous and real-world relational datasets ...
research
∙
04/30/2023
Nearly Optimal Steiner Trees using Graph Neural Network Assisted Monte Carlo Tree Search
Graph neural networks are useful for learning problems, as well as for c...
research
∙
01/29/2023
Multi-Priority Graph Sparsification
A sparsification of a given graph G is a sparser graph (typically a subg...
research
∙
01/25/2023
Splitting Vertices in 2-Layer Graph Drawings
Bipartite graphs model the relationships between two disjoint sets of en...
research
∙
09/01/2022
The Rique-Number of Graphs
We continue the study of linear layouts of graphs in relation to known d...
research
∙
09/01/2022
Spherical Graph Drawing by Multi-dimensional Scaling
We describe an efficient and scalable spherical graph embedding method. ...
research
∙
08/27/2022
An FPT Algorithm for Bipartite Vertex Splitting
Bipartite graphs model the relationship between two disjoint sets of obj...
research
∙
05/24/2022
Embedding Neighborhoods Simultaneously t-SNE (ENS-t-SNE)
We propose an algorithm for visualizing a dataset by embedding it in 3-d...
research
∙
05/16/2022
Browser-based Hyperbolic Visualization of Graphs
Hyperbolic geometry offers a natural focus + context for data visualizat...
research
∙
02/23/2022
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs
The segment number of a planar graph G is the smallest number of line se...
research
∙
12/02/2021
Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, (SGD)^2
Readability criteria, such as distance or neighborhood preservation, are...
research
∙
08/30/2021
Approximation algorithms for priority Steiner tree problems
In the Priority Steiner Tree (PST) problem, we are given an undirected g...
research
∙
08/25/2021
Visualizing JIT Compiler Graphs
Just-in-time (JIT) compilers are used by many modern programming systems...
research
∙
08/18/2021
Computing Steiner Trees using Graph Neural Networks
Graph neural networks have been successful in many learning problems and...
research
∙
06/16/2021
Visualizing Evolving Trees
Evolving trees arise in many real-life scenarios from computer file syst...
research
∙
06/09/2021
Visualizing The Intermediate Representation of Just-in-Time Compilers
Just-in-Time (JIT) compilers are used by many modern programming systems...
research
∙
03/17/2021
On additive spanners in weighted graphs with local error
An additive +β spanner of a graph G is a subgraph which preserves distan...
research
∙
02/11/2021
Multi-level Weighted Additive Spanners
Given a graph G = (V,E), a subgraph H is an additive +β spanner if _H(u,...
research
∙
01/20/2021
On the Readability of Abstract Set Visualizations
Set systems are used to model data that naturally arises in many context...
research
∙
10/15/2020
The Language of Food during the Pandemic: Hints about the Dietary Effects of Covid-19
We study the language of food on Twitter during the pandemic lockdown in...
research
∙
08/24/2020
Polygons with Prescribed Angles in 2D and 3D
We consider the construction of a polygon P with n vertices whose turnin...
research
∙
08/21/2020
MetroSets: Visualizing Sets as Metro Maps
We propose MetroSets, a new, flexible online tool for visualizing set sy...
research
∙
08/17/2020
Drawing Shortest Paths in Geodetic Graphs
Motivated by the fact that in a space where shortest paths are unique, n...
research
∙
08/12/2020
Graph Drawing via Gradient Descent, (GD)^2
Readability criteria, such as distance or neighborhood preservation, are...
research
∙
02/15/2020
Kruskal-based approximation algorithm for the multi-level Steiner tree problem
We study the multi-level Steiner tree problem: a generalization of the S...
research
∙
02/15/2020
Weighted Additive Spanners
An α-additive spanner of an undirected graph G=(V, E) is a subgraph H su...
research
∙
11/05/2019
Packing Trees into 1-planar Graphs
We introduce and study the 1-planar packing problem: Given k graphs with...
research
∙
11/04/2019
Same Stats, Different Graphs: Exploring the Space of Graphs in Terms of Graph Properties
Data analysts commonly utilize statistics to summarize large datasets. W...
research
∙
09/13/2019
Multi-Perspective, Simultaneous Embedding
We describe a method for simultaneous visualization of multiple pairwise...
research
∙
09/07/2019
Graph Spanners: A Tutorial Review
This tutorial review provides a guiding reference to researchers who wan...
research
∙
08/23/2019
The QuaSEFE Problem
We initiate the study of Simultaneous Graph Embedding with Fixed Edges i...
research
∙
08/20/2019
Computing Stable Demers Cartograms
Cartograms are popular for visualizing numerical data for map regions. M...
research
∙
08/04/2019
Stress-Plus-X (SPX) Graph Layout
Stress, edge crossings, and crossing angles play an important role in th...
research
∙
07/01/2019
Symmetry Detection and Classification in Drawings of Graphs
Symmetry is a key feature observed in nature (from flowers and leaves, t...
research
∙
06/14/2019
Multi-level tree based approach for interactive graph visualization with semantic zoom
A recent data visualization literacy study shows that most people cannot...
research
∙
05/02/2019
A General Framework for Multi-level Subsetwise Graph Sparsifiers
Given an undirected weighted graph $G(V,E)$, a subsetwise sparsifier ove...
research
∙
04/01/2019
Approximation algorithms and an integer program for multi-level graph spanners
Given a weighted graph G(V,E) and t > 1, a subgraph H is a t--spanner of...
research
∙
02/19/2019
Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains
We show new applications of the nearest-neighbor chain algorithm, a tech...
research
∙
11/28/2018
Computing Vertex-Weighted Multi-Level Steiner Trees
In the classical vertex-weighted Steiner tree problem (VST), one is give...
research
∙
08/29/2018
Recognition and Drawing of Stick Graphs
A Stick graph is an intersection graph of axis-aligned segments such tha...
research
∙
08/29/2018
Same Stats, Different Graphs (Graph Statistics and Why We Need Graph Drawings)
Data analysts commonly utilize statistics to summarize large datasets. W...
research
∙
08/27/2018
Turning Cliques into Paths to Achieve Planarity
Motivated by hybrid graph representations, we introduce and study the fo...
research
∙
08/02/2018
Perception of Symmetries in Drawings of Graphs
Symmetry is an important factor in human perception in general, as well ...
research
∙
09/01/2017
Drawing Dynamic Graphs Without Timeslices
Timeslices are often used to draw and visualize dynamic graphs. While ti...
research
∙
08/31/2017
Lombardi Drawings of Knots and Links
Knot and link diagrams are projections of one or more 3-dimensional simp...
research
∙
08/31/2017
Revisited Experimental Comparison of Node-Link and Matrix Representations
Visualizing network data is applicable in domains such as biology, engin...
research
∙
06/15/2017
Research Topics Map: rtopmap
In this paper we describe a system for visualizing and analyzing worldwi...
research
∙
03/11/2016
