E-LIB Suche - Ergebnisse für: Souza, Uéverton S.

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

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/..

3

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/..

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

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/..

6

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/..

7

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/..

8

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/..

9

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/..

10

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/..

11

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/..

12

Perfect Matching Cuts Partitioning a Graph into Complementa..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Castonguay, Diane ; Coelho, Erika M. M. ; Coelho, Hebert.. - p. 257-269 , 2022

Link: https://doi.org/10.1007/..

13

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/..

14

Computing the zig-zag number of directed graphs:

Dourado, Mitre C. ; de Figueiredo, Celina M.H. ; de Melo, Alexsander A...
Discrete Applied Mathematics. 312 (2022) - p. 86-105 , 2022

Link: https://doi.org/10.1016/..

15

On the probe problem for (r,ℓ)-well-coveredness: Algorithms..:

Faria, Luerbio ; Souza, Uéverton S.
Theoretical Computer Science. 932 (2022) - p. 56-68 , 2022

Link: https://doi.org/10.1016/..