( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Maximum Flows by Incremental Breadth-First Search.

, , , , и . ESA, том 6942 из Lecture Notes in Computer Science, стр. 457-468. Springer, (2011)

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.

Till Werneck

Frank Rodolfo Fonseca Fonseca

Irene Fonseca

Ricardo Fonseca

João Fonseca

 

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

Design of data structures for mergeable trees., , и . SODA, стр. 394-403. ACM Press, (2006)Shortest Path Feasibility Algorithms: An Experimental Evaluation., , , , и . ALENEX, стр. 118-132. SIAM, (2008)Dynamic Trees in Practice., и . WEA, том 4525 из Lecture Notes in Computer Science, стр. 80-93. Springer, (2007)A hybrid multistart heuristic for the uncapacitated facility location problem., и . Eur. J. Oper. Res., 174 (1): 54-68 (2006)Virtual Ring Routing Trends., , , , и . DISC, том 5805 из Lecture Notes in Computer Science, стр. 392-406. Springer, (2009)Better Landmarks Within Reach., , и . WEA, том 4525 из Lecture Notes in Computer Science, стр. 38-51. Springer, (2007)Dynamic Trees.. Encyclopedia of Algorithms, Springer, (2008)On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem., и . ALENEX, стр. 119-127. SIAM, (2003)Self-adjusting top trees., и . SODA, стр. 813-822. SIAM, (2005)On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs., и . ALENEX, том 2409 из Lecture Notes in Computer Science, стр. 1-15. Springer, (2002)