Fatemeh Rajabi-Alni

According to our database, Fatemeh Rajabi-Alni authored at least 12 papers between 2012 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2022

Computing a many-to-many matching with demands and capacities between two sets using the Hungarian algorithm.

Fatemeh Rajabi-Alni, Alireza Bagheri

CoRR, 2022

2019

A Fast and Efficient algorithm for Many-To-Many Matching of Points with Demands in One Dimension.

Fatemeh Rajabi-Alni, Alireza Bagheri

CoRR, 2019

A Faster Algorithm for the Limited-Capacity Many-to-Many Point Matching in One Dimension.

Fatemeh Rajabi-Alni, Alireza Bagheri

CoRR, 2019

2017

An O(n^2) algorithm for Many-To-Many Matching of Points with Demands in One Dimension.

Fatemeh Rajabi-Alni, Alireza Bagheri

CoRR, 2017

2016

An O(n²) Algorithm for the Limited-Capacity Many-to-Many Point Matching in One Dimension.

Fatemeh Rajabi-Alni, Alireza Bagheri

Algorithmica, 2016

2015

Constrained Point Set Embedding of a Balanced Binary Tree.

Fatemeh Rajabi-Alni, Alireza Bagheri

Int. J. Found. Comput. Sci., 2015

2014

An O(n^3) time algorithm for the maximum weight b-matching problem on bipartite graphs.

Fatemeh Rajabi-Alni, Alireza Bagheri, Behrouz Minaei-Bidgoli

CoRR, 2014

2013

Two exact algorithms for the generalized assignment problem

Fatemeh Rajabi-Alni

CoRR, 2013

A new algorithm for Many to Many Matching with Demands and Capacities

Fatemeh Rajabi-Alni

CoRR, 2013

Many to Many Matching with Demands and Capacities

Fatemeh Rajabi-Alni, Alireza Bagheri

CoRR, 2013

Embedding a balanced binary tree on a bounded point set

Fatemeh Rajabi-Alni, Alireza Bagheri

CoRR, 2013

2012

Limited-Capacity Many-To-Many Point Matching in One Dimension

Fatemeh Rajabi-Alni, Alireza Bagheri

CoRR, 2012