226 citations · 762 across the 90 of their papers we have counts for
108 papers
Weighted Book Thickness
Henry Förster, Michael Hoffmann, Stephen Kobourov +3
We introduce and study the weighted book thickness of graphs. A -page book embedding of a graph is defined by a spanning cycle for (which does not need to be p…
Rerouting Curves on Surfaces
Timo Brand, Stefan Felsner, Henry Förster +8
We study the problem of reconfiguring a crossing-free embedding of a graph on a surface, with edges represented as curves, into another crossing-free embedding of the same graph on…
The Census-Stub Graph Invariant Descriptor
Matt I. B. Oddo, Stephen Kobourov, Tamara Munzner
An invariant descriptor captures meaningful structural features of networks, useful where traditional visualizations, like node-link views, face challenges like the hairball phenom…
Graph Sparsifications using Neural Network Assisted Monte Carlo Tree Search
Alvin Chiu, Mithun Ghosh, Reyan Ahmed +3
Graph neural networks have been successful for machine learning, as well as for combinatorial and graph problems such as the Subgraph Isomorphism Problem and the Traveling Salesman…
Balancing between the Local and Global Structures (LGS) in Graph Embedding
Jacob Miller, Vahan Huroyan, Stephen Kobourov
We present a method for balancing between the Local and Global Structures (LGS) in graph embedding, via a tunable parameter. Some embedding methods aim to capture global structures…
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem
Walter Didimo, Fedor V. Fomin, Petr A. Golovach +3
A vertex of a plane digraph is bimodal if all its incoming edges (and hence all its outgoing edges) are consecutive in the cyclic order around it. A plane digraph is bimodal if all…