( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Simple and tight complexity lower bounds for solving Rabin games.

, , , , и . CoRR, (2023)

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.

Vasco Souza

Alexander Souza

Leonardo Souza Menezes

Jusamara Vieira Souza

José Cláudio Almeida Souza

 

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

FPT algorithms to recognize well covered graphs., , , и . CoRR, (2018)Exact and Parameterized Algorithms for the Independent Cutset Problem., , и . FCT, том 14292 из Lecture Notes in Computer Science, стр. 378-391. Springer, (2023)Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on Graphs Having Small Dominating Sets., , , и . COCOA (1), том 14461 из Lecture Notes in Computer Science, стр. 82-93. Springer, (2023)The Complexity of Helly-B1 EPG Graph Recognition., , , , и . Discret. Math. Theor. Comput. Sci., (2020)Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques., , , , , и . LATIN, том 12118 из Lecture Notes in Computer Science, стр. 587-599. Springer, (2020)Relating Verification and Validation Methods to Software Product Quality Characteristics: Results of an Expert Survey., , , и . SWQD, том 338 из Lecture Notes in Business Information Processing, стр. 33-44. Springer, (2019)Deletion Graph Problems Based on Deadlock Resolution., , и . COCOON, том 10392 из Lecture Notes in Computer Science, стр. 75-86. Springer, (2017)Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof., , , и . SOSA, стр. 383-395. SIAM, (2024)Taming Graphs with No Large Creatures and Skinny Ladders., , , , , , и . ESA, том 244 из LIPIcs, стр. 58:1-58:8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Computing the Largest Bond of a Graph., , , , и . IPEC, том 148 из LIPIcs, стр. 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)