11 citations · 20 across the 14 of their papers we have counts for
3 papers · 1 filter
Recognition of Triangulation Duals of Simple Polygons With and Without Holes
Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac
We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particu…
Lower Bounds for Graph Exploration Using Local Policies
Aditya Kumar Akash, Sandor P. Fekete, Seoung Kyou Lee +3
We give lower bounds for various natural node- and edge-based local strategies for exploring a graph. We consider this problem both in the setting of an arbitrary graph as well as…
Arbitrary Overlap Constraints in Graph Packing Problems
Alejandro López-Ortiz, Jazmín Romero
In earlier versions of the community discovering problem, the overlap between communities was restricted by a simple count upper-bound [17,5,11,8]. In this paper, we introduce the…