Uéverton S. Souza

ORCID

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 103

Top Venues

CoRR

Discret. Appl. Math.

Theor. Comput. Sci.

Discret. Math. Theor. Comput. Sci.

Publications

Karthik C. S., Dániel Marx, Marcin Pilipczuk, Uéverton S. Souza
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof. SOSA (2024)
Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini
Simple and tight complexity lower bounds for solving Rabin games. SOSA (2024)
Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza
Recognizing well-dominated graphs is coNP-complete. Inf. Process. Lett. 183 (2024)
Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter
Linear-time algorithms for eliminating claws in graphs. Int. Trans. Oper. Res. 31 (1) (2024)
Luís Cunha, Ignasi Sau, Uéverton S. Souza
On the Complexity of the Median and Closest Permutation Problems. WABI (2024)
Luís Cunha, Gabriel L. Duarte, Fábio Protti, Loana Tito Nogueira, Uéverton S. Souza
Induced Tree Covering and the Generalized Yutsis Property. LATIN (2) (2024)
Samuel Eduardo da Silva, Uéverton S. Souza
Decoding Tree Decompositions from Permutations. LATIN (1) (2024)
Luís Cunha, Ignasi Sau, Uéverton S. Souza
On the Complexity of the Median and Closest Permutation Problems. CoRR (2023)
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
On Conflict-Free Cuts: Algorithms and Complexity. CoRR (2023)
Raquel S. F. Bravo, Rodolfo Oliveira, Fábio da Silva, Uéverton S. Souza
Partitioning P4-tidy graphs into a stable set and a forest. Discret. Appl. Math. 338 (2023)
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
Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities. Soft Comput. 27 (8) (2023)
Bruno José da Silva Barros, Rian Gabriel S. Pinheiro, Uéverton S. Souza, Luiz Satoru Ochi
Using adaptive memory in GRASP to find minimum conflict-free spanning trees. Soft Comput. 27 (8) (2023)
Maurício Pires, Uéverton S. Souza, Bruno Lopes
Twin-Treewidth: A Single-Exponential Logic-Based Approach. COCOA (2) (2023)
Linda Cook, Tomás Masarík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza
Proving a Directed Analogue of the Gyárfás-Sumner Conjecture for Orientations of $P_4$. Electron. J. Comb. 30 (3) (2023)
Claudson F. Bornstein, Gila Morgenstern, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter
-VPG graphs. Discuss. Math. Graph Theory 43 (4) (2023)
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
On the computational difficulty of the terminal connection problem. RAIRO Theor. Informatics Appl. 57 (2023)
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
Exact and Parameterized Algorithms for the Independent Cutset Problem. CoRR (2023)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
Reducing the vertex cover number via edge contractions. J. Comput. Syst. Sci. 136 (2023)
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
Exact and Parameterized Algorithms for the Independent Cutset Problem. FCT (2023)
Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza
Partitions and well-coveredness: The graph sandwich problem. Discret. Math. 346 (3) (2023)
Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini
Simple and tight complexity lower bounds for solving Rabin games. CoRR (2023)
Karthik C. S., Dániel Marx, Marcin Pilipczuk, Uéverton S. Souza
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof. CoRR (2023)
Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza
A tight quasi-polynomial bound for Global Label Min-Cut. SODA (2023)
Maria Luíza L. da Cruz, Raquel S. F. Bravo, Rodolfo Oliveira, Uéverton S. Souza
Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on Graphs Having Small Dominating Sets. COCOA (1) (2023)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
Reducing the Vertex Cover Number via Edge Contractions. CoRR (2022)
Luérbio Faria, Uéverton S. Souza
)-well-coveredness: Algorithms and complexity. Theor. Comput. Sci. 932 (2022)
Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza
Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs. IWOCA (2022)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
Reducing the Vertex Cover Number via Edge Contractions. MFCS (2022)
Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza
Recognizing well-dominated graphs is coNP-complete. CoRR (2022)
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
Taming graphs with no large creatures and skinny ladders. CoRR (2022)
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
Taming Graphs with No Large Creatures and Skinny Ladders. ESA (2022)
Márcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho, Braully R. Silva, Uéverton S. Souza, Fábio Protti
P3-convexity on graphs with diameter two: Computing hull and interval numbers. Discret. Appl. Math. 321 (2022)
João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza
A general framework for path convexities. J. Comb. Optim. 43 (5) (2022)
Janio Carlos Nascimento Silva, Igor Machado Coelho, Uéverton S. Souza, Luiz Satoru Ochi, Vitor Nazário Coelho
Finding the Maximum Multi Improvement on neighborhood exploration. Optim. Lett. 16 (1) (2022)
Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza
Perfect matching cuts partitioning a graph into complementary subgraphs. CoRR (2022)
Mitre Costa Dourado, Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Mateus de Oliveira Oliveira, Uéverton S. Souza
Computing the zig-zag number of directed graphs. Discret. Appl. Math. 312 (2022)
Bruno José da Silva Barros, Luiz Satoru Ochi, Rian Gabriel S. Pinheiro, Uéverton S. Souza
On Conflict-Free Spanning Tree: Algorithms and Complexity. CALDAM (2022)
Alesom Zorzi, Celina M. H. de Figueiredo, Raphael C. S. Machado, Leandro M. Zatesko, Uéverton S. Souza
Compositions, decompositions, and conformability for total coloring on power of cycle graphs. Discret. Appl. Math. 323 (2022)
Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza
A tight quasi-polynomial bound for Global Label Min-Cut. CoRR (2022)
Uéverton S. Souza
A note on independent sets in sparse-dense graphs. CoRR (2022)
Gabriel L. Duarte, Uéverton S. Souza
On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy. WG (2022)
Linda Cook, Tomás Masarík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza
. CoRR (2022)
Gabriel L. Duarte, Uéverton S. Souza
On the Minimum Cycle Cover problem on graphs with bounded co-degeneracy. CoRR (2022)
Janio Carlos Nascimento Silva, Uéverton S. Souza
Computing the best-case energy complexity of satisfying assignments in monotone circuits. Theor. Comput. Sci. 932 (2022)
Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
On the computational complexity of the bipartizing matching problem. Ann. Oper. Res. 316 (2) (2022)
Janio Carlos Nascimento Silva, Uéverton S. Souza
Computing the Best Case Energy Complexity of Satisfying Assignments in Monotone Circuits. CoRR (2022)
Priscila P. Camargo, Uéverton S. Souza, Julliano R. Nascimento
Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms. Int. J. Found. Comput. Sci. 32 (1) (2021)
Luérbio Faria, Uéverton S. Souza
On the Probe Problem for (r, ℓ )-Well-Coveredness. COCOON (2021)
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
On the Terminal Connection Problem. SOFSEM (2021)
Gabriel L. Duarte, Mateus de Oliveira Oliveira, Uéverton S. Souza
Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances. MFCS (2021)
Janio Carlos Nascimento Silva, Uéverton S. Souza, Luiz Satoru Ochi
Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case. AAIM (2021)
Pedro Henrique González Silva, Glauco Amorim, Uéverton S. Souza, Igor Morais, Joel A. F. dos Santos, Vanessa de A. Guimarães, Glaydston Mattos Ribeiro
Designing screen layout in multimedia applications through integer programming and metaheuristic. RAIRO Oper. Res. 55 (6) (2021)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza
Reducing graph transversals via edge contractions. J. Comput. Syst. Sci. 120 (2021)
Matheus S. D. Alves, Julliano R. Nascimento, Uéverton S. Souza
On the complexity of coloring -graphs. Int. Trans. Oper. Res. 28 (6) (2021)
Raffael M. Paranhos, Janio Carlos Nascimento Silva, Uéverton S. Souza, Luiz Satoru Ochi
Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-hierarchy Classes. COCOA (2021)
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
Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica 83 (5) (2021)
Julliano R. Nascimento, Uéverton S. Souza, Jayme Luiz Szwarcfiter
Partitioning a Graph into Complementary Subgraphs. Graphs Comb. 37 (4) (2021)
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
Computing the Largest Bond and the Maximum Connected Cut of a Graph. CoRR (2020)
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
A multivariate analysis of the strict terminal connection problem. J. Comput. Syst. Sci. 111 (2020)
Julliano Rosa Nascimento, Uéverton S. Souza, Jayme Luiz Szwarcfiter
Partitioning a Graph into Complementary Subgraphs. WALCOM (2020)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza
Reducing graph transversals via edge contractions. CoRR (2020)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza
Reducing Graph Transversals via Edge Contractions. MFCS (2020)
Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira
Maximum cuts in edge-colored graphs. Discret. Appl. Math. 281 (2020)
Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter
Linear-Time Algorithms for Eliminating Claws in Graphs. COCOON (2020)
Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter
EPG Graph Recognition. Discret. Math. Theor. Comput. Sci. 22 (1) (2020)
Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter
Linear-time Algorithms for Eliminating Claws in Graphs. CoRR (2020)
Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza
Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques. LATIN (2020)
Ignasi Sau, Uéverton S. Souza
Hitting forbidden induced subgraphs on bounded treewidth graphs. CoRR (2020)
Rafael T. Araújo, Eurinardo Rodrigues Costa, Sulamita Klein, Rudini Menezes Sampaio, Uéverton S. Souza
FPT algorithms to recognize well covered graphs. Discret. Math. Theor. Comput. Sci. 21 (1) (2019)
Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza
Width Parameterizations for Knot-free Vertex Deletion on Digraphs. CoRR (2019)
Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza
Deadlock resolution in wait-for graphs by vertex/arc deletion. J. Comb. Optim. 37 (2) (2019)
Isela Mendoza, Uéverton S. Souza, Marcos Kalinowski, Ruben Interian, Leonardo Gresta Paulino Murta
An Efficient Algorithm for Combining Verification and Validation Methods. SOFSEM (2019)
Pablo Luiz Araújo Munhoz, Felipe P. do Carmo, Uéverton S. Souza, Lúcia M. A. Drummond, Pedro Henrique González Silva, Luiz S. Ochi, Philippe Michelon
Locality Sensitive Algotrithms for Data Mule Routing Problem. AAIM (2019)
João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza
A General Framework for Path Convexities. AAIM (2019)
Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
Computing the Largest Bond of a Graph. IPEC (2019)
Alesom Zorzi, Celina M. H. de Figueiredo, Raphael Machado, Uéverton S. Souza
Even-power of Cycles With Many Vertices are Type 1 Total Colorable. LAGOS (2019)
Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza
Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. IPEC (2019)
Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter
EPG Graph Recognition. CoRR (2019)
Isela Mendoza, Marcos Kalinowski, Uéverton S. Souza, Michael Felderer
Relating Verification and Validation Methods to Software Product Quality Characteristics: Results of an Expert Survey. SWQD (2019)
Márcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho, Braully R. Silva, Fábio Protti, Uéverton S. Souza
-Hull Number of Graphs with Diameter Two. LAGOS (2019)
Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
Computing the largest bond of a graph. CoRR (2019)
Michael R. Fellows, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza
A Survey on the Complexity of Flood-Filling Games. Adventures Between Lower Bounds and Higher Altitudes (2018)
Letícia Rodrigues Bueno, Lucia Draque Penso, Fábio Protti, Victor R. Ramos, Dieter Rautenbach, Uéverton S. Souza
On the hardness of finding the geodetic number of a subcubic graph. Inf. Process. Lett. 135 (2018)
Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira
Maximum cuts in edge-colored graphs. CoRR (2018)
Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
)-graph. Theor. Comput. Sci. 746 (2018)
Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
Bipartizing with a Matching. COCOA (2018)
Rafael T. Araújo, Sulamita Klein, Rudini Menezes Sampaio, Uéverton S. Souza
FPT algorithms to recognize well covered graphs. CoRR (2018)
Michael R. Fellows, Fábio Protti, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number. Discret. Appl. Math. 245 (2018)
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
An efficient similarity-based approach for comparing XML documents. Inf. Syst. 78 (2018)
Fábio Protti, Uéverton S. Souza
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Carlos Vinícius G. C. Lima, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
And/or-convexity: a graph convexity based on processes and deadlock models. Ann. Oper. Res. 264 (1-2) (2018)
Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza
Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem. COCOON (2018)
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
Simple Undirected Two-Commodity Integral Flow with a Unitary Demand. Electron. Notes Discret. Math. 62 (2017)
Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
Eliminating Odd Cycles by Removing a Matching. CoRR (2017)
João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza
A general framework for path convexities. CoRR (2017)
Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
Generalized threshold processes on graphs. Theor. Comput. Sci. 689 (2017)
Fábio Protti, Uéverton S. Souza
Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes. CoRR (2017)
Rubens Sucupira, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
Maximum Cuts in Edge-colored Graphs. Electron. Notes Discret. Math. 62 (2017)
Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
On the (parameterized) complexity of recognizing well-covered (r, l)-graphs. CoRR (2017)
Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza
Deletion Graph Problems Based on Deadlock Resolution. COCOON (2017)

Uéverton S. Souza.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Uéverton S. Souza