73 citations · 387 across the 61 of their papers we have counts for
5 papers · 1 filter
Memoryless Routing in Convex Subdivisions: Random Walks are Optimal
Dan Chen, Luc Devroye, Vida Dujmovic +1
A memoryless routing algorithm is one in which the decision about the next edge on the route to a vertex t for a packet currently located at vertex v is made based only on the coor…
Notes on large angle crossing graphs
Vida Dujmovic, Joachim Gudmundsson, Pat Morin +1
A graph G is an a-angle crossing (aAC) graph if every pair of crossing edges in G intersect at an angle of at least a. The concept of right angle crossing (RAC) graphs (a=Pi/2) was…
On the Expected Maximum Degree of Gabriel and Yao Graphs
Luc Devroye, Joachim Gudmundsson, Pat Morin
Motivated by applications of Gabriel graphs and Yao graphs in wireless ad-hoc networks, we show that the maximal degree of a random Gabriel graph or Yao graph defined on points…
Algorithms for Marketing-Mix Optimization
Joachim Gudmundsson, Pat Morin, Michiel Smid
Algorithms for determining quality/cost/price tradeoffs in saturated markets are considered. A product is modeled by real-valued qualities whose sum determines the unit cost of…
Entropy, Triangulation, and Point Location in Planar Subdivisions
Sebastien Collette, Vida Dujmovic, John Iacono +2
A data structure is presented for point location in connected planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query tim…