9 citations · 36 across the 21 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DS2013★ 1 cited
A new algorithm for Many to Many Matching with Demands and Capacities
Fatemeh Rajabi-Alni
Let A={a_1,a_2,...,a_s} and {b_1,b_2,...,b_t} with s+r=n, the many to many point matching with demands and capacities matches each point a_i in A to at least alpha_i and at most al…
cs.DS2013
Many to Many Matching with Demands and Capacities
Fatemeh Rajabi-Alni, Alireza Bagheri
Let A and B be two finite sets of points with total cardinality n, the many to many point matching with demands and capacities matches each point ai in A to at least alpha'i and at…
cs.CG2013
Embedding a balanced binary tree on a bounded point set
Fatemeh Rajabi-Alni, Alireza Bagheri
Given an undirected planar graph G with n vertices and a set S of n points inside a simple polygon P, a point-set embedding of G on S is a planar drawing of G such that each vertex…