( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems.

, , и . Networks, 77 (4): 559-571 (2021)

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.

Gerard de Melo

Fabiana Andrade Melo Sterza

Irene Melo de Carvalho

José Carlos de Andrade Moura

Julia-Maria Sass ˜deœ Andrade

 

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

Revising Johnson's table for the 21st century., , , и . Discret. Appl. Math., (2022)Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete., , , и . MFCS, том 202 из LIPIcs, стр. 38:1-38:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A multivariate analysis of the strict terminal connection problem., , и . J. Comput. Syst. Sci., (2020)Maximum cut on interval graphs of interval count five is NP-complete., , , и . CoRR, (2020)Revising Johnson's table for the 21st century., , , и . CoRR, (2021)On the Terminal Connection Problem., , и . SOFSEM, том 12607 из Lecture Notes in Computer Science, стр. 278-292. Springer, (2021)Computing the zig-zag number of directed graphs., , , , и . Discret. Appl. Math., (2022)On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems., , и . Networks, 77 (4): 559-571 (2021)Simple Undirected Two-Commodity Integral Flow with a Unitary Demand., , и . Electron. Notes Discret. Math., (2017)MaxCut on Permutation Graphs is NP-complete., , , и . CoRR, (2022)