Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Souza, Uéverton S.
122  Ergebnisse:
Personensuche X
?
1

On conflict-free cuts: Algorithms and complexity:

Rauch, Johannes ; Rautenbach, Dieter ; Souza, Uéverton S.
Information Processing Letters.  187 (2025)  - p. 106503 , 2025
Link: https://doi.org/10.1016/..
 
?
2

Recognizing well-dominated graphs is coNP-complete:

Agrawal, Akanksha ; Fernau, Henning ; Kindermann, Philipp..
Information Processing Letters.  183 (2024)  - p. 106419 , 2024
Link: https://doi.org/10.1016/..
 
?
3

Decoding Tree Decompositions from Permutations:

, In: Lecture Notes in Computer Science; LATIN 2024: Theoretical Informatics,
da Silva, Samuel Eduardo ; Souza, Uéverton S. - p. 19-34 , 2024
Link: https://doi.org/10.1007/..
 
?
4

Exact and Parameterized Algorithms for the Independent Cuts..:

, In: Fundamentals of Computation Theory; Lecture Notes in Computer Science,
Rauch, Johannes ; Rautenbach, Dieter ; Souza, Uéverton S. - p. 378-391 , 2023
Link: https://doi.org/10.1007/..
 
?
5

On the computational difficulty of the terminal connection ..:

de Melo, Alexsander A. ; de Figueiredo, Celina M.H. ; Souza, Uéverton S.
RAIRO - Theoretical Informatics and Applications.  57 (2023)  - p. 3 , 2023
Link: https://doi.org/10.1051/..
 
?
6

Partitions and well-coveredness: The graph sandwich problem:

Alves, Sancrey R. ; Couto, Fernanda ; Faria, Luerbio...
Discrete Mathematics.  346 (2023)  3 - p. 113253 , 2023
Link: https://doi.org/10.1016/..
 
?
7

Partitioning P4-tidy graphs into a stable set and a forest:

Bravo, Raquel ; Oliveira, Rodolfo ; da Silva Junior, Fábio.
Discrete Applied Mathematics.  338 (2023)  - p. 22-29 , 2023
Link: https://doi.org/10.1016/..
 
?
8

Near-Bipartiteness, Connected Near-Bipartiteness, Independe..:

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,
da Cruz, Maria Luíza L. ; Bravo, Raquel S. F. ; Oliveira, Rodolfo A.. - p. 82-93 , 2023
Link: https://doi.org/10.1007/..
 
?
9

Twin-Treewidth: A Single-Exponential Logic-Based Approach:

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,
Pires, Maurício ; Souza, Uéverton S. ; Lopes, Bruno - p. 43-55 , 2023
Link: https://doi.org/10.1007/..
 
?
10

Reducing the vertex cover number via edge contractions:

Lima, Paloma T. ; dos Santos, Vinicius F. ; Sau, Ignasi..
Journal of Computer and System Sciences.  136 (2023)  - p. 63-87 , 2023
Link: https://doi.org/10.1016/..
 
?
11

P3-convexity on graphs with diameter two: Computing hull an..:

Cappelle, Márcia R. ; Coelho, Erika M.M. ; Coelho, Hebert...
Discrete Applied Mathematics.  321 (2022)  - p. 368-378 , 2022
Link: https://doi.org/10.1016/..
 
?
12

On Conflict-Free Spanning Tree: Algorithms and Complexity:

, In: Algorithms and Discrete Applied Mathematics; Lecture Notes in Computer Science,
Barros, Bruno José S. ; Ochi, Luiz Satoru ; Pinheiro, Rian Gabriel S.. - p. 91-102 , 2022
Link: https://doi.org/10.1007/..
 
?
13

Computing the best-case energy complexity of satisfying ass..:

Silva, Janio Carlos Nascimento ; Souza, Uéverton S.
Theoretical Computer Science.  932 (2022)  - p. 41-55 , 2022
Link: https://doi.org/10.1016/..
 
?
14

On the Minimum Cycle Cover Problem on Graphs with Bounded C..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Duarte, Gabriel L. ; Souza, Uéverton S. - p. 187-200 , 2022
Link: https://doi.org/10.1007/..
 
?
15

Metaheuristic techniques for the capacitated facility locat..:

Maia, Marcelo R. H. ; Reula, Miguel ; Parreño-Torres, Consuelo...
Soft Computing.  27 (2022)  8 - p. 4685-4698 , 2022
Link: https://doi.org/10.1007/..
 
1-15