1 citations · 1 across the 16 of their papers we have counts for
5 papers · 1 filter
Minimum-Width Drawing of Trees with Sized Vertices
Markus Wallinger, Oscar Navarro, Stephen G. Kobourov
Trees arise in many applications and computing nice tree layouts is a classical problem in information visualization. In many practical settings, vertices need to be represented as…
Embedding Trees and Cactus Graphs with Integer Edge Lengths on a Compact Integer Grid
Henry Förster, Aaron Büngener, Stephen Kobourov +2
Every planar graph can be embedded with crossing-free, straight-line edges on an integer grid, where is the number of vertices. It is not known, however, whe…
Using Reinforcement Learning to Optimize the Global and Local Crossing Number
Timo Brand, Henry Förster, Stephen Kobourov +4
Graph drawing concerns the algorithmic visualization of graphs. A good drawing of a graph is easy to read and facilitates solving tasks on the graph. Several properties have been i…
Representing Hypergraphs by Point-Line Incidences
Alexander Dobler, Stephen Kobourov, Debajyoti Mondal +1
We consider hypergraph visualizations that represent vertices as points in the plane and hyperedges as curves passing through the points of their incident vertices. Specifically, w…
Size Should Not Matter: Evaluating Network Visualizations with Stress
Reyan Ahmed, Cesim Erten, Stephen Kobourov +3
The normalized stress metric is widely used to assess graph drawing quality, measuring how closely distances between vertices in a layout match their graph-theoretic distances. Thi…