research
∙
05/17/2023
A Scalable Method for Readable Tree Layouts
Large tree structures are ubiquitous and real-world relational datasets ...
share
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
∙
08/27/2022
An FPT Algorithm for Bipartite Vertex Splitting
Bipartite graphs model the relationship between two disjoint sets of obj...
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/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
∙
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
∙
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
∙
09/07/2019
Graph Spanners: A Tutorial Review
This tutorial review provides a guiding reference to researchers who wan...
research
∙
08/04/2019
Stress-Plus-X (SPX) Graph Layout
Stress, edge crossings, and crossing angles play an important role in th...
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
∙
04/08/2018
