( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Dial a Ride from k-forest.

, , , и . ACM Trans. Algorithms, 6 (2): 41:1-41:21 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Mohammad Taghi Rahnemaee

Mohammad Taghi Ameli

Mohammad Taghi Massoudieh

Mohammad Taghi Monzavi

Mohammad Taghi Karimian

 

Другие публикации лиц с тем же именем

Multi-VPN Optimization for Scalable Routing via Relaying., , , и . INFOCOM, стр. 2756-2760. IEEE, (2009)PIE: A Data-Driven Payoff Inference Engine for Strategic Security Applications., , , , , , и . IEEE Trans. Comput. Soc. Syst., 7 (1): 42-57 (2020)Length-constrained path-matchings in graphs., , , и . Networks, 39 (4): 210-215 (2002)A note on the Consecutive Ones Submatrix problem., и . Inf. Process. Lett., 83 (3): 163-166 (2002)Online client-server load balancing without global information., , , и . SODA, стр. 197-206. SIAM, (2005)Random MAX SAT, random MAX CUT, and their phase transitions., , , и . SODA, стр. 364-373. ACM/SIAM, (2003)The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema., и . SODA, стр. 631-640. ACM Press, (2006)Combination can be hard: approximability of the unique coverage problem., , , и . SODA, стр. 162-171. ACM Press, (2006)Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors., , и . Algorithmica, 41 (4): 245-267 (2005)Hat Guessing Games., , , и . SIAM J. Discret. Math., 22 (2): 592-605 (2008)