1 code implementation • 4 Apr 2019 • Juan Jose Besa, Timothy Johnson, Nil Mamano, Martha C. Osegueda
In doing so, we show that these extensions also admit a constant approximation ratio on the minimum number of turns, and on the number of crossings in most cases.
Data Structures and Algorithms
no code implementations • 29 Jun 2017 • David Eppstein, Michael Goodrich, Doruk Korkmaz, Nil Mamano
In this approach, each geographic district is defined in terms of a center, which identifies a location of interest, such as a post office or polling place, and all other network vertices must be labeled with the center to which they are associated.
Data Structures and Algorithms
1 code implementation • 30 May 2016 • David Eppstein, Michael T. Goodrich, Jenny Lam, Nil Mamano, Michael Mitzenmacher, Manuel Torres
We introduce models and algorithmic foundations for graph watermarking.
Multimedia Data Structures and Algorithms
