4 citations · 14 across the 12 of their papers we have counts for
4 papers · 1 filter
An FPT Algorithm for Bipartite Vertex Splitting
Reyan Ahmed, Stephen Kobourov, Myroslav Kryven
Bipartite graphs model the relationship between two disjoint sets of objects. They have a wide range of applications and are often visualized as a 2-layered drawing, where each set…
Visualizing Evolving Trees
Kathryn Gray, Mingwei Li, Reyan Ahmed +1
Evolving trees arise in many real-life scenarios from computer file systems and dynamic call graphs, to fake news propagation and disease spread. Most layout algorithms for static…
Stress-Plus-X (SPX) Graph Layout
Sabin Devkota, Reyan Ahmed, Felice De Luca +2
Stress, edge crossings, and crossing angles play an important role in the quality and readability of graph drawings. Most standard graph drawing algorithms optimize one of these cr…
L-Graphs and Monotone L-Graphs
Abu Reyan Ahmed, Felice De Luca, Sabin Devkota +6
In an -embedding of a graph, each vertex is represented by an -segment, and two segments intersect each other if and only if the corresponding vertices are…