226 citations · 762 across the 90 of their papers we have counts for
17 papers · 1 filter
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…
Multi-Priority Graph Sparsification
Reyan Ahmed, Keaton Hamm, Stephen Kobourov +3
A \emph{sparsification} of a given graph is a sparser graph (typically a subgraph) which aims to approximate or preserve some property of . Examples of sparsifications inclu…
The Rique-Number of Graphs
Michael A. Bekos, Stefan Felsner, Philipp Kindermann +3
We continue the study of linear layouts of graphs in relation to known data structures. At a high level, given a data structure, the goal is to find a linear order of the vertices…
Approximation algorithms for priority Steiner tree problems
Faryad Darabi Sahneh, Stephen Kobourov, Richard Spence
In the Priority Steiner Tree (PST) problem, we are given an undirected graph with a source and terminals , where each terminal $v…
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…
Kruskal-based approximation algorithm for the multi-level Steiner tree problem
Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm +2
We study the multi-level Steiner tree problem: a generalization of the Steiner tree problem in graphs where terminals require varying priority, level, or quality of service. In…