5 citations · 8 across the 4 of their papers we have counts for
9 papers
Taming the Knight's Tour: Minimizing Turns and Crossings
Juan Jose Besa, Timothy Johnson, Nil Mamano +2
We introduce two new metrics of "simplicity" for knight's tours: the number of turns and the number of crossings. We give a novel algorithm that produces tours with tu…
Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains
Nil Mamano, Alon Efrat, David Eppstein +5
We show new applications of the nearest-neighbor chain algorithm, a technique that originated in agglomerative hierarchical clustering. We apply it to a diverse class of geometric…
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms
Gill Barequet, David Eppstein, Michael T. Goodrich +1
We study algorithms and combinatorial complexity bounds for \emph{stable-matching Voronoi diagrams}, where a set, , of point sites in the plane determines a stable matching…
Reactive Proximity Data Structures for Graphs
David Eppstein, Michael T. Goodrich, Nil Mamano
We consider data structures for graphs where we maintain a subset of the nodes called sites, and allow proximity queries, such as asking for the closest site to a query node, and u…
Defining Equitable Geographic Districts in Road Networks via Stable Matching
David Eppstein, Michael Goodrich, Doruk Korkmaz +1
We introduce a novel method for defining geographic districts in road networks using stable matching. In this approach, each geographic district is defined in terms of a center, wh…
Algorithms for Stable Matching and Clustering in a Grid
David Eppstein, Michael T. Goodrich, Nil Mamano
We study a discrete version of a geometric stable marriage problem originally proposed in a continuous setting by Hoffman, Holroyd, and Peres, in which points in the plane are stab…
SANA NetGO: A combinatorial approach to using Gene Ontology (GO) terms to score network alignments
Wayne B. Hayes, Nil Mamano
Gene Ontology (GO) terms are frequently used to score alignments between protein-protein interaction (PPI) networks. Methods exist to measure the GO similarity between two proteins…
SANA: Simulated Annealing Network Alignment Applied to Biological Networks
Nil Mamano, Wayne Hayes
The alignment of biological networks has the potential to teach us as much about biology and disease as has sequence alignment. Sequence alignment can be optimally solved in polyno…
Models and Algorithms for Graph Watermarking
David Eppstein, Michael T. Goodrich, Jenny Lam +3
We introduce models and algorithmic foundations for graph watermarking. Our frameworks include security definitions and proofs, as well as characterizations when graph watermarking…