Uéverton S. Souza

According to our database, Uéverton S. Souza authored at least 107 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

An improved hybrid genetic search with data mining for the CVRP.

Marcelo Rodrigues de Holanda Maia, Alexandre Plastino, Uéverton dos Santos Souza

Networks, June, 2024

Linear-time algorithms for eliminating claws in graphs.

Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter

Int. Trans. Oper. Res., January, 2024

Recognizing well-dominated graphs is coNP-complete.

Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza

Inf. Process. Lett., January, 2024

Effectiveness of the MineReduce approach in reducing the size of combinatorial optimization problem instances.

Marcelo Rodrigues de Holanda Maia, Alexandre Plastino, Uéverton dos Santos Souza

RAIRO Oper. Res., 2024

Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof.

Karthik C. S., Dániel Marx, Marcin Pilipczuk, Uéverton S. Souza

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Simple and tight complexity lower bounds for solving Rabin games.

Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Decoding Tree Decompositions from Permutations.

Samuel Eduardo da Silva, Uéverton S. Souza

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Induced Tree Covering and the Generalized Yutsis Property.

Luís Cunha, Gabriel L. Duarte, Fábio Protti, Loana Tito Nogueira, Uéverton S. Souza

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

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

Raquel S. F. Bravo, Rodolfo Oliveira, Fábio da Silva, Uéverton S. Souza

Discret. Appl. Math., October, 2023

A biased random-key genetic algorithm for the chordal completion problem.

Samuel Eduardo da Silva, Celso C. Ribeiro, Uéverton dos Santos Souza

RAIRO Oper. Res., May, 2023

Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities.

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

Soft Comput., 2023

Using adaptive memory in GRASP to find minimum conflict-free spanning trees.

Bruno José da Silva Barros, Rian Gabriel S. Pinheiro, Uéverton S. Souza, Luiz Satoru Ochi

Soft Comput., 2023

Reducing the vertex cover number via edge contractions.

Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale

J. Comput. Syst. Sci., 2023

On the computational difficulty of the terminal connection problem.

Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza

RAIRO Theor. Informatics Appl., 2023

Helly and strong Helly numbers of B_k-EPG and B_k-VPG graphs.

Claudson F. Bornstein, Gila Morgenstern, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter

Discuss. Math. Graph Theory, 2023

Partitions and well-coveredness: The graph sandwich problem.

Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza

Discret. Math., 2023

On the Complexity of the Median and Closest Permutation Problems.

Luís Cunha, Ignasi Sau, Uéverton S. Souza

CoRR, 2023

On Conflict-Free Cuts: Algorithms and Complexity.

Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza

CoRR, 2023

Proving a Directed Analogue of the Gyárfás-Sumner Conjecture for Orientations of $P_4$.

Linda Cook, Tomás Masarík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza

Electron. J. Comb., 2023

A tight quasi-polynomial bound for Global Label Min-Cut.

Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Exact and Parameterized Algorithms for the Independent Cutset Problem.

Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

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

Maurício Pires, Uéverton S. Souza, Bruno Lopes

Proceedings of the Combinatorial Optimization and Applications, 2023

Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on Graphs Having Small Dominating Sets.

Maria Luíza L. da Cruz, Raquel S. F. Bravo, Rodolfo Oliveira, Uéverton S. Souza

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

Computing the best-case energy complexity of satisfying assignments in monotone circuits.

Janio Carlos Nascimento Silva, Uéverton S. Souza

Theor. Comput. Sci., 2022

On the probe problem for (<i>r</i>, <i>ℓ</i>)-well-coveredness: Algorithms and complexity.

Luérbio Faria, Uéverton S. Souza

Theor. Comput. Sci., 2022

On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem.

Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton dos Santos Souza

Theor. Comput. Sci., 2022

Finding the Maximum Multi Improvement on neighborhood exploration.

Janio Carlos Nascimento Silva, Igor Machado Coelho, Uéverton S. Souza, Luiz Satoru Ochi, Vitor Nazário Coelho

Optim. Lett., 2022

On the parameterized complexity of Grid Contraction.

Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale

J. Comput. Syst. Sci., 2022

A general framework for path convexities.

João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza

J. Comb. Optim., 2022

Compositions, decompositions, and conformability for total coloring on power of cycle graphs.

Alesom Zorzi, Celina M. H. de Figueiredo, Raphael C. S. Machado, Leandro M. Zatesko, Uéverton S. Souza

Discret. Appl. Math., 2022

Computing the zig-zag number of directed graphs.

Mitre Costa Dourado, Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Mateus de Oliveira Oliveira, Uéverton S. Souza

Discret. Appl. Math., 2022

P3-convexity on graphs with diameter two: Computing hull and interval numbers.

Márcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho, Braully R. Silva, Uéverton S. Souza, Fábio Protti

Discret. Appl. Math., 2022

Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P₄.

Linda Cook, Tomás Masarík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza

CoRR, 2022

A note on independent sets in sparse-dense graphs.

Uéverton S. Souza

CoRR, 2022

On the computational complexity of the bipartizing matching problem.

Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter

Ann. Oper. Res., 2022

On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy.

Gabriel L. Duarte, Uéverton S. Souza

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs.

Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Taming Graphs with No Large Creatures and Skinny Ladders.

Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

On Conflict-Free Spanning Tree: Algorithms and Complexity.

Bruno José da Silva Barros, Luiz Satoru Ochi, Rian Gabriel S. Pinheiro, Uéverton S. Souza

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

MineReduce-Based Metaheuristic for the Minimum Latency Problem.

Marcelo Rodrigues de Holanda Maia, Ítalo Santana, Isabel Rosseti, Uéverton dos Santos Souza, Alexandre Plastino

Proceedings of the Metaheuristics - 14th International Conference, 2022

2021

Succinct certification of monotone circuits.

Mateus Rodrigues Alves, Mateus de Oliveira Oliveira, Janio Carlos Nascimento Silva, Uéverton dos Santos Souza

Theor. Comput. Sci., 2021

Designing screen layout in multimedia applications through integer programming and metaheuristic.

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

RAIRO Oper. Res., 2021

On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems.

Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton dos Santos Souza

Networks, 2021

Reducing graph transversals via edge contractions.

Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza

J. Comput. Syst. Sci., 2021

On the complexity of coloring -graphs.

Matheus S. D. Alves, Julliano R. Nascimento, Uéverton S. Souza

Int. Trans. Oper. Res., 2021

Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms.

Priscila P. Camargo, Uéverton S. Souza, Julliano R. Nascimento

Int. J. Found. Comput. Sci., 2021

Hitting forbidden induced subgraphs on bounded treewidth graphs.

Ignasi Sau, Uéverton dos Santos Souza

Inf. Comput., 2021

Partitioning a Graph into Complementary Subgraphs.

Julliano R. Nascimento, Uéverton S. Souza, Jayme Luiz Szwarcfiter

Graphs Comb., 2021

Computing the Largest Bond and the Maximum Connected Cut of a Graph.

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

Algorithmica, 2021

On the Terminal Connection Problem.

Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances.

Gabriel L. Duarte, Mateus de Oliveira Oliveira, Uéverton S. Souza

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

On the Probe Problem for (r, ℓ )-Well-Coveredness.

Luérbio Faria, Uéverton S. Souza

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-hierarchy Classes.

Raffael M. Paranhos, Janio Carlos Nascimento Silva, Uéverton S. Souza, Luiz Satoru Ochi

Proceedings of the Combinatorial Optimization and Applications, 2021

Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case.

Janio Carlos Nascimento Silva, Uéverton S. Souza, Luiz Satoru Ochi

Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020

A multivariate analysis of the strict terminal connection problem.

Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza

J. Comput. Syst. Sci., 2020

The Complexity of Helly-B₁ EPG Graph Recognition.

Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter

Discret. Math. Theor. Comput. Sci., 2020

Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques.

Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Succinct Monotone Circuit Certification: Planarity and Parameterized Complexity.

Mateus Rodrigues Alves, Mateus de Oliveira Oliveira, Janio Carlos Nascimento Silva, Uéverton dos Santos Souza

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Deadlock resolution in wait-for graphs by vertex/arc deletion.

Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza

J. Comb. Optim., 2019

Even-power of Cycles With Many Vertices are Type 1 Total Colorable.

Alesom Zorzi, Celina M. H. de Figueiredo, Raphael Machado, Uéverton S. Souza

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

<i>P</i>₃-Hull Number of Graphs with Diameter Two.

Márcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho, Braully R. Silva, Fábio Protti, Uéverton S. Souza

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

FPT algorithms to recognize well covered graphs.

Rafael T. Araújo, Eurinardo Rodrigues Costa, Sulamita Klein, Rudini Menezes Sampaio, Uéverton S. Souza

Discret. Math. Theor. Comput. Sci., 2019

Relating Verification and Validation Methods to Software Product Quality Characteristics: Results of an Expert Survey.

Isela Mendoza, Marcos Kalinowski, Uéverton S. Souza, Michael Felderer

Proceedings of the Software Quality: The Complexity and Challenges of Software Engineering and Software Quality in the Cloud, 2019

An Efficient Algorithm for Combining Verification and Validation Methods.

Isela Mendoza, Uéverton S. Souza, Marcos Kalinowski, Ruben Interian, Leonardo Gresta Paulino Murta

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Computing the Largest Bond of a Graph.

Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

Width Parameterizations for Knot-Free Vertex Deletion on Digraphs.

Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

Locality Sensitive Algotrithms for Data Mule Routing Problem.

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

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018

On the (parameterized) complexity of recognizing well-covered (<i>r</i>, <i>ℓ</i>)-graph.

Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza

Theor. Comput. Sci., 2018

Graphs in which some and every maximum matching is uniquely restricted.

Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza

J. Graph Theory, 2018

An efficient similarity-based approach for comparing XML documents.

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

Inf. Syst., 2018

On the hardness of finding the geodetic number of a subcubic graph.

Letícia Rodrigues Bueno, Lucia Draque Penso, Fábio Protti, Victor R. Ramos, Dieter Rautenbach, Uéverton S. Souza

Inf. Process. Lett., 2018

General Variable Neighborhood Search for the Data Mule Scheduling Problem.

Pablo Luiz Araújo Munhoz, Pedro Henrique González, Uéverton dos Santos Souza, Luiz Satoru Ochi, Philippe Michelon, Lúcia Maria de A. Drummond

Electron. Notes Discret. Math., 2018

Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs.

Fábio Protti, Uéverton S. Souza

Discret. Math. Theor. Comput. Sci., 2018

Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number.

Michael R. Fellows, Fábio Protti, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza

Discret. Appl. Math., 2018

FPT algorithms to recognize well covered graphs.

Rafael T. Araújo, Sulamita Klein, Rudini Menezes Sampaio, Uéverton S. Souza

CoRR, 2018

And/or-convexity: a graph convexity based on processes and deadlock models.

Carlos Vinícius G. C. Lima, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter

Ann. Oper. Res., 2018

Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem.

Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Bipartizing with a Matching.

Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter

Proceedings of the Combinatorial Optimization and Applications, 2018

A Survey on the Complexity of Flood-Filling Games.

Michael R. Fellows, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017

Corrigendum to "Complexity analysis of P₃-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95].

Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton dos Santos Souza

Theor. Comput. Sci., 2017

Generalized threshold processes on graphs.

Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter

Theor. Comput. Sci., 2017

Complexity properties of complementary prisms.

Márcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza

J. Comb. Optim., 2017

Decycling with a matching.

Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter

Inf. Process. Lett., 2017

Maximum Cuts in Edge-colored Graphs.

Rubens Sucupira, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza

Electron. Notes Discret. Math., 2017

Simple Undirected Two-Commodity Integral Flow with a Unitary Demand.

Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza

Electron. Notes Discret. Math., 2017

Tractability, hardness, and kernelization lower bound for and/or graph solution.

Uéverton dos Santos Souza, Fábio Protti

Discret. Appl. Math., 2017

Eliminating Odd Cycles by Removing a Matching.

Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter

CoRR, 2017

Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes.

Fábio Protti, Uéverton S. Souza

CoRR, 2017

Deletion Graph Problems Based on Deadlock Resolution.

Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Extremal values and bounds for the zero forcing number.

Michael Gentner, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza

Discret. Appl. Math., 2016

Deadlock models in distributed computation: foundations, design, and computational complexity.

Valmir Carneiro Barbosa, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza

Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016

On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs.

Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Complexity analysis of P₃-convexity problems on bounded-degree and planar graphs.

Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton dos Santos Souza

Theor. Comput. Sci., 2015

Tractability and hardness of flood-filling games on trees.

Michael R. Fellows, Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva

Theor. Comput. Sci., 2015

Maximum induced matchings close to maximum matchings.

Márcio Antônio Duarte, Felix Joos, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza

Theor. Comput. Sci., 2015

The Flood-It game parameterized by the vertex cover number.

Uéverton dos Santos Souza, Frances A. Rosamond, Michael R. Fellows, Fábio Protti, Maise Dantas da Silva

Electron. Notes Discret. Math., 2015

On Graphs with Induced Matching Number Almost Equal to Matching Number.

Márcio Antônio Duarte, Felix Joos, Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza

Electron. Notes Discret. Math., 2015

Amê: an environment to learn and analyze adversarial search algorithms using stochastic card games.

Ana Beatriz Cruz, Leonardo Preuss, João Quadros, Uéverton S. Souza, Sabrina Serique, Angélica Ogasawara, Eduardo Bezerra, Eduardo S. Ogasawara

Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015

Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4.

Uéverton S. Souza, Letícia Rodrigues Bueno, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

On Hamiltonian Cycles in Kneser Graphs.

Felipe De Campos Mesquita, Letícia Rodrigues Bueno, Rodrigo de Alencar Hausen, Uéverton dos Santos Souza

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

The P3-Convexity in the Complementary Prism of a Graph.

Márcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

An algorithmic analysis of Flood-it and Free-Flood-it on graph powers.

Uéverton S. Souza, Fábio Protti, Maise Dantas da Silva

Discret. Math. Theor. Comput. Sci., 2014

On P 3-Convexity of Graphs with Bounded Degree.

Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Revisiting the complexity of and/or graph solution.

Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva

J. Comput. Syst. Sci., 2013

Parameterized and/or graph solution.

Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

Parameterized Complexity of Flood-Filling Games on Trees.

Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Optimal Variability Selection in Product Line Engineering.

Rafael Pinto Medeiros, Uéverton dos Santos Souza, Fábio Protti, Leonardo Gresta Paulino Murta

Proceedings of the 24th International Conference on Software Engineering & Knowledge Engineering (SEKE'2012), 2012