1 citations · 1 across the 4 of their papers we have counts for
4 papers
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…
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…
Hamiltonian Paths in Two Classes of Grid Graphs
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
In this paper, we give the necessary and sufficient conditions for the existence of Hamiltonian paths in alphabet and alphabet grid graphs. We also present a linear-time al…
Complexity of Planar Embeddability of Trees inside Simple Polygons
Alireza Bagheri, Mohammadreza Razzazi
Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a s…