
Computing Steiner Trees using Graph Neural Networks
Graph neural networks have been successful in many learning problems and...
read it

Visualizing Evolving Trees
Evolving trees arise in many reallife scenarios from computer file syst...
read it

On additive spanners in weighted graphs with local error
An additive +β spanner of a graph G is a subgraph which preserves distan...
read it

Multilevel Weighted Additive Spanners
Given a graph G = (V,E), a subgraph H is an additive +β spanner if _H(u,...
read it

Graph Drawing via Gradient Descent, (GD)^2
Readability criteria, such as distance or neighborhood preservation, are...
read it

Kruskalbased approximation algorithm for the multilevel Steiner tree problem
We study the multilevel Steiner tree problem: a generalization of the S...
read it

Weighted Additive Spanners
An αadditive spanner of an undirected graph G=(V, E) is a subgraph H su...
read it

Graph Spanners: A Tutorial Review
This tutorial review provides a guiding reference to researchers who wan...
read it

StressPlusX (SPX) Graph Layout
Stress, edge crossings, and crossing angles play an important role in th...
read it

A General Framework for Multilevel Subsetwise Graph Sparsifiers
Given an undirected weighted graph $G(V,E)$, a subsetwise sparsifier ove...
read it

Approximation algorithms and an integer program for multilevel graph spanners
Given a weighted graph G(V,E) and t > 1, a subgraph H is a tspanner of...
read it

MultiLevel Steiner Trees
In the classical Steiner tree problem, one is given an undirected, conne...
read it
Reyan Ahmed
is this you? claim profile