( en | de | ru )

 

Disambiguation of "de Melo, Alexsander Andrade"

Author of the publication

copydeleteadd this publication to your clipboard
On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems.

, , and . 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. You can also use the button next to the name to display some publications already assigned to the person.

Gerard de Melo

Fabiana Andrade Melo Sterza

Irene Melo de Carvalho

José Carlos de Andrade Moura

Julia-Maria Sass ˜deœ Andrade

 

Other publications of authors with the same name

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