( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Minimizing Movement: Fixed-Parameter Tractability.

, , и . ESA, том 5757 из Lecture Notes in Computer Science, стр. 718-729. Springer, (2009)

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.

No persons found for author name Hajiaghayi, MohammadTaghi
add a person with the name Hajiaghayi, MohammadTaghi
 

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

Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs., , и . CoRR, (2018)Euclidean Prize-Collecting Steiner Forest., и . LATIN, том 6034 из Lecture Notes in Computer Science, стр. 503-514. Springer, (2010)On the Efficiency and Equilibria of Rich Ads., , , и . IJCAI, стр. 301-307. ijcai.org, (2019)Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)., , , и . CoRR, (2019)Improved Approximation Algorithms for Minimum Weight Vertex Separators., , и . SIAM J. Comput., 38 (2): 629-657 (2008)Contraction decomposition in h-minor-free graphs and algorithmic applications., , и . STOC, стр. 441-450. ACM, (2011)Minimizing Movement: Fixed-Parameter Tractability., , и . ESA, том 5757 из Lecture Notes in Computer Science, стр. 718-729. Springer, (2009)A Theory of Loss-Leaders: Making Money by Pricing Below Cost., , , и . WINE, том 4858 из Lecture Notes in Computer Science, стр. 293-299. Springer, (2007)Bidimensionality, Map Graphs, and Grid Minors, и . CoRR, (2005)Fast algorithms for knapsack via convolution and prediction., , , и . STOC, стр. 1269-1282. ACM, (2018)