Uéverton S. Souza

124 papers A* 2A 1B 11C 12Misc 6Journal 83Unranked 9
YearRankTypeTitle / Venue / Authors
2025 J jnl
Characterizations and recognition algorithms for distance-hereditary graphs partitionable into a stable set and a forest.
J. Braz. Comput. Soc.
Maria Luíza L. da Cruz, Victor R. Ramos, Rodolfo A. Oliveira, Raquel S. F. Bravo, Uéverton S. Souza
2025 J jnl
Closing the Complexity Gap of the Double Distance Problem.
IEEE Trans. Comput. Biol. Bioinform.
Luís Cunha, Thiago Lopes, Uéverton S. Souza, Leonard Bohnenkämper, Marília D. V. Braga, Jens Stoye
2025 A* conf
Computing Distances on Graph Associahedra Is Fixed-Parameter Tractable.
ICALP
Luís Felipe I. Cunha, Ignasi Sau, Uéverton S. Souza, Mario Valencia-Pabon
2025 J jnl
Computing Distances on Graph Associahedra is Fixed-parameter Tractable.
CoRR
Luís Felipe I. Cunha, Ignasi Sau, Uéverton S. Souza, Mario Valencia-Pabon
2025 J jnl
Exact and parameterized algorithms for the independent cutset problem.
J. Comput. Syst. Sci.
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
2025 J jnl
Induced tree covering and the generalized Yutsis property.
J. Comput. Syst. Sci.
Luís Cunha, Gabriel L. Duarte, Fábio Protti, Loana Tito Nogueira, Uéverton S. Souza
2025 J jnl
Near-bipartiteness on graphs having small dominating sets.
J. Comb. Optim.
Maria Luíza L. da Cruz, Raquel S. F. Bravo, Rodolfo A. Oliveira, Uéverton S. Souza
2025 J jnl
On Conflict-Free Spanning Tree: Mapping tractable and hard instances through the lenses of graph classes.
Theor. Comput. Sci.
Bruno José da Silva Barros, Luiz Satoru Ochi, Rian Gabriel S. Pinheiro, Uéverton S. Souza
2025 J jnl
On conflict-free cuts: Algorithms and complexity.
Inf. Process. Lett.
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
2025 C conf
On musical arrangement problems time complexity.
LAGOS
N. Figueiredo, Luérbio Faria, Vinícius Fernandes dos Santos, Uéverton S. Souza
2025 J jnl
Perfect matching cuts partitioning a graph into complementary subgraphs.
Ars Math. Contemp.
Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza
2025 J jnl
Sparse Vertex Cutsets and the Maximum Degree.
Electron. J. Comb.
Stéphane Bessy, Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
2024 J jnl
Canonical cuts of path powers.
Contributions Discret. Math.
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez, Sulamita Klein, Uéverton S. Souza, Rubens Sucupira
2024 J jnl
Closing the complexity gap of the double distance problem.
CoRR
Luís Cunha, Thiago Lopes, Uéverton S. Souza, Marília D. V. Braga, Jens Stoye
2024 — conf
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof.
SOSA
Karthik C. S., Dániel Marx, Marcin Pilipczuk, Uéverton S. Souza
2024 — conf
Decoding Tree Decompositions from Permutations.
LATIN (1)
Samuel Eduardo da Silva, Uéverton S. Souza
2024 — conf
Induced Tree Covering and the Generalized Yutsis Property.
LATIN (2)
Luís Cunha, Gabriel L. Duarte, Fábio Protti, Loana Tito Nogueira, Uéverton S. Souza
2024 J jnl
Linear-time algorithms for eliminating claws in graphs.
Int. Trans. Oper. Res.
Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2024 C conf
On the Complexity of the Median and Closest Permutation Problems.
WABI
Luís Cunha, Ignasi Sau, Uéverton S. Souza
2024 J jnl
On the parameterized complexity of the median and closest problems under some permutation metrics.
Algorithms Mol. Biol.
Luís Cunha, Ignasi Sau, Uéverton S. Souza
2024 J jnl
Recognizing well-dominated graphs is coNP-complete.
Inf. Process. Lett.
Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza
2024 — conf
Simple and tight complexity lower bounds for solving Rabin games.
SOSA
Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini
2024 J jnl
Taming Graphs with No Large Creatures and Skinny Ladders.
SIAM J. Discret. Math.
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Masaríková, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
2023 A* conf
A tight quasi-polynomial bound for Global Label Min-Cut.
SODA
Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza
2023 J jnl
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof.
CoRR
Karthik C. S., Dániel Marx, Marcin Pilipczuk, Uéverton S. Souza
2023 B conf
Exact and Parameterized Algorithms for the Independent Cutset Problem.
FCT
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
2023 J jnl
Exact and Parameterized Algorithms for the Independent Cutset Problem.
CoRR
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
2023 J jnl
Helly and strong Helly numbers of B
Discuss. Math. Graph Theory
Claudson F. Bornstein, Gila Morgenstern, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2023 J jnl
Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities.
Soft Comput.
Marcelo Rodrigues de Holanda Maia, Miguel Reula, Consuelo Parreño-Torres, Prem Prakash Vuppuluri, Alexandre Plastino, Uéverton S. Souza, Sara Ceschia, Mario Pavone, Andrea Schaerf
2023 — conf
Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on Graphs Having Small Dominating Sets.
COCOA (1)
Maria Luíza L. da Cruz, Raquel S. F. Bravo, Rodolfo A. Oliveira, Uéverton S. Souza
2023 J jnl
On Conflict-Free Cuts: Algorithms and Complexity.
CoRR
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
2023 J jnl
On the Complexity of the Median and Closest Permutation Problems.
CoRR
Luís Cunha, Ignasi Sau, Uéverton S. Souza
2023 J jnl
On the computational difficulty of the terminal connection problem.
RAIRO Theor. Informatics Appl.
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
2023 J jnl
Partitioning P4-tidy graphs into a stable set and a forest.
Discret. Appl. Math.
Raquel S. F. Bravo, Rodolfo A. Oliveira, Fábio da Silva, Uéverton S. Souza
2023 J jnl
Partitions and well-coveredness: The graph sandwich problem.
Discret. Math.
Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza
2023 J jnl
Proving a Directed Analogue of the Gyárfás-Sumner Conjecture for Orientations of $P_4$.
Electron. J. Comb.
Linda Cook, Tomás Masarík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza
2023 J jnl
Reducing the vertex cover number via edge contractions.
J. Comput. Syst. Sci.
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
2023 J jnl
Simple and tight complexity lower bounds for solving Rabin games.
CoRR
Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini
2023 — conf
Twin-Treewidth: A Single-Exponential Logic-Based Approach.
COCOA (2)
Maurício Pires, Uéverton S. Souza, Bruno Lopes
2023 J jnl
Using adaptive memory in GRASP to find minimum conflict-free spanning trees.
Soft Comput.
Bruno José da Silva Barros, Rian Gabriel S. Pinheiro, Uéverton S. Souza, Luiz Satoru Ochi
2022 J jnl
A general framework for path convexities.
J. Comb. Optim.
João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza
2022 J jnl
A note on independent sets in sparse-dense graphs.
CoRR
Uéverton S. Souza
2022 J jnl
A tight quasi-polynomial bound for Global Label Min-Cut.
CoRR
Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza
2022 J jnl
Compositions, decompositions, and conformability for total coloring on power of cycle graphs.
Discret. Appl. Math.
Alesom Zorzi, Celina M. H. de Figueiredo, Raphael C. S. Machado, Leandro M. Zatesko, Uéverton S. Souza
2022 J jnl
Computing the Best Case Energy Complexity of Satisfying Assignments in Monotone Circuits.
CoRR
Janio Carlos Nascimento Silva, Uéverton S. Souza
2022 J jnl
Computing the best-case energy complexity of satisfying assignments in monotone circuits.
Theor. Comput. Sci.
Janio Carlos Nascimento Silva, Uéverton S. Souza
2022 J jnl
Computing the zig-zag number of directed graphs.
Discret. Appl. Math.
Mitre Costa Dourado, Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Mateus de Oliveira Oliveira, Uéverton S. Souza
2022 J jnl
Finding the Maximum Multi Improvement on neighborhood exploration.
Optim. Lett.
Janio Carlos Nascimento Silva, Igor Machado Coelho, Uéverton S. Souza, Luiz Satoru Ochi, Vitor Nazário Coelho
2022 — conf
On Conflict-Free Spanning Tree: Algorithms and Complexity.
CALDAM
Bruno José da Silva Barros, Luiz Satoru Ochi, Rian Gabriel S. Pinheiro, Uéverton S. Souza
2022 B conf
On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy.
WG
Gabriel L. Duarte, Uéverton S. Souza
2022 J jnl
On the Minimum Cycle Cover problem on graphs with bounded co-degeneracy.
CoRR
Gabriel L. Duarte, Uéverton S. Souza
2022 J jnl
On the computational complexity of the bipartizing matching problem.
Ann. Oper. Res.
Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2022 J jnl
On the probe problem for (
Theor. Comput. Sci.
Luérbio Faria, Uéverton S. Souza
2022 J jnl
P3-convexity on graphs with diameter two: Computing hull and interval numbers.
Discret. Appl. Math.
Márcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho, Braully R. Silva, Uéverton S. Souza, Fábio Protti
2022 C conf
Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs.
IWOCA
Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza
2022 J jnl
Perfect matching cuts partitioning a graph into complementary subgraphs.
CoRR
Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza
2022 J jnl
Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P
CoRR
Linda Cook, Tomás Masarík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza
2022 J jnl
Recognizing well-dominated graphs is coNP-complete.
CoRR
Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza
2022 B conf
Reducing the Vertex Cover Number via Edge Contractions.
MFCS
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
2022 J jnl
Reducing the Vertex Cover Number via Edge Contractions.
CoRR
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
2022 A conf
Taming Graphs with No Large Creatures and Skinny Ladders.
ESA
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
2022 J jnl
Taming graphs with no large creatures and skinny ladders.
CoRR
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
2021 B conf
Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances.
MFCS
Gabriel L. Duarte, Mateus de Oliveira Oliveira, Uéverton S. Souza
2021 J jnl
Computing the Largest Bond and the Maximum Connected Cut of a Graph.
Algorithmica
Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
2021 J jnl
Designing screen layout in multimedia applications through integer programming and metaheuristic.
RAIRO Oper. Res.
Pedro Henrique González, Glauco Amorim, Uéverton S. Souza, Igor Morais, Joel A. F. dos Santos, Vanessa de A. Guimarães, Glaydston Mattos Ribeiro
2021 C conf
Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case.
AAIM
Janio Carlos Nascimento Silva, Uéverton S. Souza, Luiz Satoru Ochi
2021 Misc conf
On the Probe Problem for (r, ℓ )-Well-Coveredness.
COCOON
Luérbio Faria, Uéverton S. Souza
2021 B conf
On the Terminal Connection Problem.
SOFSEM
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
2021 J jnl
On the complexity of coloring -graphs.
Int. Trans. Oper. Res.
Matheus S. D. Alves, Julliano R. Nascimento, Uéverton S. Souza
2021 C conf
Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-hierarchy Classes.
COCOA
Raffael M. Paranhos, Janio Carlos Nascimento Silva, Uéverton S. Souza, Luiz Satoru Ochi
2021 J jnl
Partitioning a Graph into Complementary Subgraphs.
Graphs Comb.
Julliano R. Nascimento, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2021 J jnl
Reducing graph transversals via edge contractions.
J. Comput. Syst. Sci.
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza
2021 J jnl
Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms.
Int. J. Found. Comput. Sci.
Priscila P. Camargo, Uéverton S. Souza, Julliano R. Nascimento
2020 J jnl
A multivariate analysis of the strict terminal connection problem.
J. Comput. Syst. Sci.
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
2020 J jnl
Computing the Largest Bond and the Maximum Connected Cut of a Graph.
CoRR
Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
2020 B conf
Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques.
LATIN
Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza
2020 J jnl
Hitting forbidden induced subgraphs on bounded treewidth graphs.
CoRR
Ignasi Sau, Uéverton S. Souza
2020 Misc conf
Linear-Time Algorithms for Eliminating Claws in Graphs.
COCOON
Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2020 J jnl
Linear-time Algorithms for Eliminating Claws in Graphs.
CoRR
Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2020 J jnl
Maximum cuts in edge-colored graphs.
Discret. Appl. Math.
Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira
2020 B conf
Partitioning a Graph into Complementary Subgraphs.
WALCOM
Julliano Rosa Nascimento, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2020 B conf
Reducing Graph Transversals via Edge Contractions.
MFCS
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza
2020 J jnl
Reducing graph transversals via edge contractions.
CoRR
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza
2020 J jnl
The Complexity of Helly-B
Discret. Math. Theor. Comput. Sci.
Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2019 C conf
A General Framework for Path Convexities.
AAIM
João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza
2019 B conf
An Efficient Algorithm for Combining Verification and Validation Methods.
SOFSEM
Isela Mendoza, Uéverton S. Souza, Marcos Kalinowski, Ruben Interian, Leonardo Gresta Paulino Murta
2019 B conf
Computing the Largest Bond of a Graph.
IPEC
Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
2019 J jnl
Computing the largest bond of a graph.
CoRR
Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
2019 J jnl
Deadlock resolution in wait-for graphs by vertex/arc deletion.
J. Comb. Optim.
Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza
2019 C conf
Even-power of Cycles With Many Vertices are Type 1 Total Colorable.
LAGOS
Alesom Zorzi, Celina M. H. de Figueiredo, Raphael Machado, Uéverton S. Souza
2019 J jnl
FPT algorithms to recognize well covered graphs.
Discret. Math. Theor. Comput. Sci.
Rafael T. Araújo, Eurinardo Rodrigues Costa, Sulamita Klein, Rudini Menezes Sampaio, Uéverton S. Souza
2019 C conf
Locality Sensitive Algotrithms for Data Mule Routing Problem.
AAIM
Pablo Luiz Araújo Munhoz, Felipe P. do Carmo, Uéverton S. Souza, Lúcia M. A. Drummond, Pedro Henrique González, Luiz S. Ochi, Philippe Michelon
2019 — conf
Relating Verification and Validation Methods to Software Product Quality Characteristics: Results of an Expert Survey.
SWQD
Isela Mendoza, Marcos Kalinowski, Uéverton S. Souza, Michael Felderer
2019 J jnl
The Complexity of Helly-B
CoRR
Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2019 B conf
Width Parameterizations for Knot-Free Vertex Deletion on Digraphs.
IPEC
Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza
2019 J jnl
Width Parameterizations for Knot-free Vertex Deletion on Digraphs.
CoRR
Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza
2018 — conf
A Survey on the Complexity of Flood-Filling Games.
Adventures Between Lower Bounds and Higher Altitudes
Michael R. Fellows, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza
2018 J jnl
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number.
Discret. Appl. Math.
Michael R. Fellows, Fábio Protti, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza
2018 J jnl
An efficient similarity-based approach for comparing XML documents.
Inf. Syst.
Alessandreia Marta de Oliveira, Gabriel Tessarolli, Gleiph Ghiotto, Bruno Pinto, Fernando Campello, Matheus Marques, Carlos Roberto Carvalho Oliveira, Igor Rodrigues, Marcos Kalinowski, Uéverton S. Souza, Leonardo Murta, Vanessa Braganholo
2018 J jnl
And/or-convexity: a graph convexity based on processes and deadlock models.
Ann. Oper. Res.
Carlos Vinícius G. C. Lima, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2018 C conf
Bipartizing with a Matching.
COCOA
Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2018 J jnl
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs.
Discret. Math. Theor. Comput. Sci.
Fábio Protti, Uéverton S. Souza
2018 J jnl
FPT algorithms to recognize well covered graphs.
CoRR
Rafael T. Araújo, Sulamita Klein, Rudini Menezes Sampaio, Uéverton S. Souza
2018 Misc conf
Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem.
COCOON
Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza
2018 J jnl
Maximum cuts in edge-colored graphs.
CoRR
Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira
2018 J jnl
On the (parameterized) complexity of recognizing well-covered (
Theor. Comput. Sci.
Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
2018 J jnl
On the hardness of finding the geodetic number of a subcubic graph.
Inf. Process. Lett.
Letícia Rodrigues Bueno, Lucia Draque Penso, Fábio Protti, Victor R. Ramos, Dieter Rautenbach, Uéverton S. Souza
2017 J jnl
A general framework for path convexities.
CoRR
João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza
2017 J jnl
Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes.
CoRR
Fábio Protti, Uéverton S. Souza
2017 J jnl
Decycling with a matching.
Inf. Process. Lett.
Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2017 Misc conf
Deletion Graph Problems Based on Deadlock Resolution.
COCOON
Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza
2017 J jnl
Eliminating Odd Cycles by Removing a Matching.
CoRR
Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2017 J jnl
Generalized threshold processes on graphs.
Theor. Comput. Sci.
Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2017 J jnl
Maximum Cuts in Edge-colored Graphs.
Electron. Notes Discret. Math.
Rubens Sucupira, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
2017 J jnl
On the (parameterized) complexity of recognizing well-covered (r, l)-graphs.
CoRR
Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
2017 J jnl
Simple Undirected Two-Commodity Integral Flow with a Unitary Demand.
Electron. Notes Discret. Math.
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
2016 Misc conf
Deadlock models in distributed computation: foundations, design, and computational complexity.
SAC
Valmir Carneiro Barbosa, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza
2016 J jnl
Extremal values and bounds for the zero forcing number.
Discret. Appl. Math.
Michael Gentner, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza
2015 Misc conf
Amê: an environment to learn and analyze adversarial search algorithms using stochastic card games.
SAC
Ana Beatriz Cruz, Leonardo Preuss, João Quadros, Uéverton S. Souza, Sabrina Serique, Angélica Ogasawara, Eduardo Bezerra, Eduardo S. Ogasawara
2015 C conf
Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4.
CTW
Uéverton S. Souza, Letícia Rodrigues Bueno, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti
2015 J jnl
Maximum induced matchings close to maximum matchings.
Theor. Comput. Sci.
Márcio Antônio Duarte, Felix Joos, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza
2015 C conf
The P3-Convexity in the Complementary Prism of a Graph.
CTW
Márcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza
2014 J jnl
An algorithmic analysis of Flood-it and Free-Flood-it on graph powers.
Discret. Math. Theor. Comput. Sci.
Uéverton S. Souza, Fábio Protti, Maise Dantas da Silva
2014 C conf
On P 3-Convexity of Graphs with Bounded Degree.
AAIM
Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza