12 citations · 12 across the 1 of their papers we have counts for
4 papers
Computing k-Modal Embeddings of Planar Digraphs
Juan Jose Besa, Giordano Da Lozzo, Michael T. Goodrich
Given a planar digraph and a positive even integer , an embedding of in the plane is k-modal, if every vertex of is incident to at most pairs of consecutive edge…
Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data
Juan Jose Besa, William E. Devanny, David Eppstein +2
We empirically study sorting in the evolving data model. In this model, a sorting algorithm maintains an approximation to the sorted order of a list of data items while simultaneou…
Optimally Sorting Evolving Data
Juan Jose Besa, William E. Devanny, David Eppstein +2
We give optimal sorting algorithms in the evolving data framework, where an algorithm's input data is changing while the algorithm is executing. In this framework, instead of produ…
Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection
Juan José Besa Vial, William E. Devanny, David Eppstein +1
We study various versions of the problem of scheduling platoons of autonomous vehicles through an unregulated intersection, where an algorithm must schedule which platoons should w…