34 citations · 41 across the 5 of their papers we have counts for
6 papers
Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent,
Reyan Ahmed, Felice De Luca, Sabin Devkota +2
Readability criteria, such as distance or neighborhood preservation, are often used to optimize node-link representations of graphs to enable the comprehension of the underlying da…
Domain-Centered Support for Layout, Tasks, and Specification for Control Flow Graph Visualization
Sabin Devkota, Matthew P. LeGendre, Adam Kunen +2
Computing professionals in areas like compilers, performance analysis, and security often analyze and manipulate control flow graphs (CFGs) in their work. CFGs are directed network…
CcNav: Understanding Compiler Optimizations in Binary Code
Sabin Devkota, Pascal Aschwanden, Adam Kunen +2
Program developers spend significant time on optimizing and tuning programs. During this iterative process, they apply optimizations, analyze the resulting code, and modify the com…
Graph Drawing via Gradient Descent,
Reyan Ahmed, Felice De Luca, Sabin Devkota +2
Readability criteria, such as distance or neighborhood preservation, are often used to optimize node-link representations of graphs to enable the comprehension of the underlying da…
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…