Fatemeh Rajabi-Alni

14 papers Journal 14
YearRankTypeTitle / Venue / Authors
2025 J jnl
An efficient algorithm for the limited-capacity many-to-many point matching in one dimension.
J. Supercomput.
Fatemeh Rajabi-Alni, Behrouz Minaei-Bidgoli, Alireza Bagheri
2024 J jnl
Approximation Algorithms for the Freeze Tag Problem inside Polygons.
CoRR
Fatemeh Rajabi-Alni, Alireza Bagheri, Behrouz Minaei-Bidgoli
2022 J jnl
Computing a many-to-many matching with demands and capacities between two sets using the Hungarian algorithm.
CoRR
Fatemeh Rajabi-Alni, Alireza Bagheri
2019 J jnl
A Fast and Efficient algorithm for Many-To-Many Matching of Points with Demands in One Dimension.
CoRR
Fatemeh Rajabi-Alni, Alireza Bagheri
2019 J jnl
A Faster Algorithm for the Limited-Capacity Many-to-Many Point Matching in One Dimension.
CoRR
Fatemeh Rajabi-Alni, Alireza Bagheri
2017 J jnl
An O(n^2) algorithm for Many-To-Many Matching of Points with Demands in One Dimension.
CoRR
Fatemeh Rajabi-Alni, Alireza Bagheri
2016 J jnl
An O(n
Algorithmica
Fatemeh Rajabi-Alni, Alireza Bagheri
2015 J jnl
Constrained Point Set Embedding of a Balanced Binary Tree.
Int. J. Found. Comput. Sci.
Fatemeh Rajabi-Alni, Alireza Bagheri
2014 J jnl
An O(n^3) time algorithm for the maximum weight b-matching problem on bipartite graphs.
CoRR
Fatemeh Rajabi-Alni, Alireza Bagheri, Behrouz Minaei-Bidgoli
2013 J jnl
A new algorithm for Many to Many Matching with Demands and Capacities
CoRR
Fatemeh Rajabi-Alni
2013 J jnl
Embedding a balanced binary tree on a bounded point set
CoRR
Fatemeh Rajabi-Alni, Alireza Bagheri
2013 J jnl
Many to Many Matching with Demands and Capacities
CoRR
Fatemeh Rajabi-Alni, Alireza Bagheri
2013 J jnl
Two exact algorithms for the generalized assignment problem
CoRR
Fatemeh Rajabi-Alni
2012 J jnl
Limited-Capacity Many-To-Many Point Matching in One Dimension
CoRR
Fatemeh Rajabi-Alni, Alireza Bagheri