( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A proof for a conjecture of Gorgol.

, и . Discret. Appl. Math., (2018)

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.

Raul Guimarães Lopes

Diana Lopes Videira

Nicolas Lopes

Anne Lopes

António Carlos Lopes Madaleno

 

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

A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps., и . Theor. Comput. Sci., (2022)A proof for a conjecture of Gorgol., и . Discret. Appl. Math., (2018)Edge-Disjoint Branchings in Temporal Graphs., , , и . IWOCA, том 12126 из Lecture Notes in Computer Science, стр. 112-125. Springer, (2020)Adapting the Directed Grid Theorem into an FPT Algorithm., , , и . SIAM J. Discret. Math., 36 (3): 1887-1917 (сентября 2022)A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps., и . CoRR, (2019)Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage., , , и . WALCOM, том 13174 из Lecture Notes in Computer Science, стр. 251-262. Springer, (2022)Coloring Problems on Bipartite Graphs of Small Diameter., , , , , и . CoRR, (2020)Clique number of tournaments., , , и . CoRR, (2023)Edge-Disjoint Branchings in Temporal Digraphs., , , и . Electron. J. Comb., (2021)A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps., и . MFCS, том 170 из LIPIcs, стр. 68:1-68:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)