• Publications
  • Influence
Routing with guaranteed delivery in ad hoc wireless networks
TLDR
The first distributed algorithms for routing that do not require duplication of packets or memory at the nodes and yet guarantee that a packet is delivered to its destination are described.
Online Routing in Triangulations
TLDR
This work considers online routing strategies for routing between the vertices of embedded planar straight line graphs and proposes two deterministic memoryless routing strategies and a randomized memoryless strategy that works for all triangulations.
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks
TLDR
The first distributed algorithms for routing that do not require duplication of packets or memory at the nodes and yet guarantee that a packet is delivered to its destination are described.
Pattern Matching for Permutations
TLDR
A polynomial time algorithm is given for the decision problem, and the corresponding counting problem, in the case that P is separable—i.e. contains neither the subpattern (3,1, 4,2) nor its reverse, the sub pattern (2,4, 1,3).
Feature-based cut detection with automatic threshold selection
TLDR
This work presents a scheme based on stable feature tracking for inter frame differencing and presents a method to stabilize the differences and automatically detect a global threshold to achieve a high detection rate.
Efficient visibility queries in simple polygons
We present a method of decomposing a simple polygon that allows the preprocessing of the polygon to efficiently answer visibility queries of various forms in an output sensitive manner. Using O(n3
Strategies for Hotlink Assignments
TLDR
This work gives algorithms for assigning hotlinks, as well as upper and lower bounds on the expected number of steps to reach the leaves from the source page s located at the root of a complete binary tree.
Pattern Matching for Permutations
TLDR
A polynomial time algorithm is given for the decision problem, and the corresponding counting problem, in the case that P is separable—i.e. contains neither the subpattern (3,1, 4,2) nor its reverse, the sub pattern (2,4, 1,3).
Flips in planar graphs
TLDR
This work overviews both the combinatorial perspective and the geometric perspective of edge flips in planar graphs, highlighting the similarities and differences of the two settings.
On the Spanning Ratio of Gabriel Graphs and beta-skeletons
The spanning ratio of a graph defined on n points in the Euclidean plane is the maximal ratio over all pairs of data points (u, v), of the minimum graph distance between u and v, over the Euclidean
...
1
2
3
4
5
...