default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUéverton S. Souza
Uéverton dos Santos Souza
Person information
- affiliation: Fluminense Federal University, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j62]Johannes Rauch
, Dieter Rautenbach, Uéverton S. Souza:
On conflict-free cuts: Algorithms and complexity. Inf. Process. Lett. 187: 106503 (2025)- 2024
- [j61]Raffael M. Paranhos, Janio Carlos Nascimento Silva, Uéverton dos Santos Souza:
Parameterized Complexity Classes Defined by Threshold Circuits and Their Connection with Sorting Networks. Int. J. Found. Comput. Sci. 35(6): 651-668 (2024) - [j60]Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza:
Recognizing well-dominated graphs is coNP-complete. Inf. Process. Lett. 183: 106419 (2024) - [j59]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): 296-315 (2024) - [j58]Marcelo Rodrigues de Holanda Maia, Alexandre Plastino, Uéverton dos Santos Souza:
An improved hybrid genetic search with data mining for the CVRP. Networks 83(4): 692-711 (2024) - [j57]Marcelo Rodrigues de Holanda Maia, Alexandre Plastino, Uéverton dos Santos Souza:
Effectiveness of the MineReduce approach in reducing the size of combinatorial optimization problem instances. RAIRO Oper. Res. 58(2): 1131-1146 (2024) - [c45]Samuel Eduardo da Silva, Uéverton S. Souza:
Decoding Tree Decompositions from Permutations. LATIN (1) 2024: 19-34 - [c44]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: 147-161 - [c43]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: 160-167 - [c42]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: 383-395 - [c41]Luís Cunha, Ignasi Sau, Uéverton S. Souza:
On the Complexity of the Median and Closest Permutation Problems. WABI 2024: 2:1-2:23 - 2023
- [j56]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) - [j55]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: 22-29 (2023) - [j54]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): 113253 (2023) - [j53]Claudson F. Bornstein, Gila Morgenstern, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Helly and strong Helly numbers of Bk-EPG and Bk-VPG graphs. Discuss. Math. Graph Theory 43(4): 1237-1252 (2023) - [j52]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: 3 (2023) - [j51]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: 63-87 (2023) - [j50]Samuel Eduardo da Silva, Celso C. Ribeiro, Uéverton dos Santos Souza:
A biased random-key genetic algorithm for the chordal completion problem. RAIRO Oper. Res. 57(3): 1559-1578 (2023) - [j49]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): 4685-4698 (2023) - [j48]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): 4699-4712 (2023) - [c40]Maurício Pires, Uéverton S. Souza, Bruno Lopes:
Twin-Treewidth: A Single-Exponential Logic-Based Approach. COCOA (2) 2023: 43-55 - [c39]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: 82-93 - [c38]Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza:
Exact and Parameterized Algorithms for the Independent Cutset Problem. FCT 2023: 378-391 - [c37]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: 290-303 - [i33]Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza:
Exact and Parameterized Algorithms for the Independent Cutset Problem. CoRR abs/2307.02107 (2023) - [i32]Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini:
Simple and tight complexity lower bounds for solving Rabin games. CoRR abs/2310.20433 (2023) - [i31]Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza:
On Conflict-Free Cuts: Algorithms and Complexity. CoRR abs/2311.01077 (2023) - [i30]Karthik C. S., Dániel Marx, Marcin Pilipczuk, Uéverton S. Souza:
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof. CoRR abs/2311.05913 (2023) - [i29]Luís Cunha, Ignasi Sau, Uéverton S. Souza:
On the Complexity of the Median and Closest Permutation Problems. CoRR abs/2311.17224 (2023) - 2022
- [j47]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): 1235-1256 (2022) - [j46]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: 86-105 (2022) - [j45]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: 368-378 (2022) - [j44]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: 349-363 (2022) - [j43]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): 994-1009 (2022) - [j42]Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale:
On the parameterized complexity of Grid Contraction. J. Comput. Syst. Sci. 129: 22-38 (2022) - [j41]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): 97-115 (2022) - [j40]Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton dos Santos Souza:
On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem. Theor. Comput. Sci. 909: 97-109 (2022) - [j39]Janio Carlos Nascimento Silva, Uéverton S. Souza:
Computing the best-case energy complexity of satisfying assignments in monotone circuits. Theor. Comput. Sci. 932: 41-55 (2022) - [j38]Luérbio Faria, Uéverton S. Souza:
On the probe problem for (r, ℓ)-well-coveredness: Algorithms and complexity. Theor. Comput. Sci. 932: 56-68 (2022) - [c36]Marcelo Rodrigues de Holanda Maia, Ítalo Santana, Isabel Rosseti, Uéverton dos Santos Souza, Alexandre Plastino:
MineReduce-Based Metaheuristic for the Minimum Latency Problem. MIC 2022: 88-102 - [c35]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: 91-102 - [c34]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: 58:1-58:8 - [c33]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: 257-269 - [c32]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: 69:1-69:14 - [c31]Gabriel L. Duarte, Uéverton S. Souza:
On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy. WG 2022: 187-200 - [i28]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 abs/2202.03322 (2022) - [i27]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 abs/2205.01191 (2022) - [i26]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 abs/2207.07426 (2022) - [i25]Uéverton S. Souza:
A note on independent sets in sparse-dense graphs. CoRR abs/2208.04408 (2022) - [i24]Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza:
Recognizing well-dominated graphs is coNP-complete. CoRR abs/2208.08864 (2022) - [i23]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 P4. CoRR abs/2209.06171 (2022) - [i22]Gabriel L. Duarte, Uéverton S. Souza:
On the Minimum Cycle Cover problem on graphs with bounded co-degeneracy. CoRR abs/2210.06703 (2022) - [i21]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 abs/2210.06714 (2022) - [i20]Janio Carlos Nascimento Silva, Uéverton S. Souza:
Computing the Best Case Energy Complexity of Satisfying Assignments in Monotone Circuits. CoRR abs/2210.06739 (2022) - 2021
- [j37]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): 1421-1458 (2021) - [j36]Julliano R. Nascimento, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Partitioning a Graph into Complementary Subgraphs. Graphs Comb. 37(4): 1311-1331 (2021) - [j35]Ignasi Sau, Uéverton dos Santos Souza:
Hitting forbidden induced subgraphs on bounded treewidth graphs. Inf. Comput. 281: 104812 (2021) - [j34]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): 37-52 (2021) - [j33]Matheus S. D. Alves, Julliano R. Nascimento, Uéverton S. Souza:
On the complexity of coloring -graphs. Int. Trans. Oper. Res. 28(6): 3172-3189 (2021) - [j32]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: 62-74 (2021) - [j31]Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton dos Santos Souza:
On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems. Networks 77(4): 559-571 (2021) - [j30]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:
Designing screen layout in multimedia applications through integer programming and metaheuristic. RAIRO Oper. Res. 55(6): 3379-3397 (2021) - [j29]Mateus Rodrigues Alves, Mateus de Oliveira Oliveira, Janio Carlos Nascimento Silva, Uéverton dos Santos Souza:
Succinct certification of monotone circuits. Theor. Comput. Sci. 889: 1-13 (2021) - [c30]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: 380-391 - [c29]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: 348-363 - [c28]Luérbio Faria, Uéverton S. Souza:
On the Probe Problem for (r, ℓ )-Well-Coveredness. COCOON 2021: 375-386 - [c27]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: 42:1-42:17 - [c26]Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza:
On the Terminal Connection Problem. SOFSEM 2021: 278-292 - 2020
- [j28]Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira:
Maximum cuts in edge-colored graphs. Discret. Appl. Math. 281: 229-234 (2020) - [j27]Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
The Complexity of Helly-B1 EPG Graph Recognition. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [j26]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: 22-41 (2020) - [c25]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: 14-26 - [c24]Mateus Rodrigues Alves, Mateus de Oliveira Oliveira, Janio Carlos Nascimento Silva, Uéverton dos Santos Souza:
Succinct Monotone Circuit Certification: Planarity and Parameterized Complexity. COCOON 2020: 496-507 - [c23]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: 587-599 - [c22]Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza:
Reducing Graph Transversals via Edge Contractions. MFCS 2020: 64:1-64:15 - [c21]Ignasi Sau, Uéverton dos Santos Souza:
Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs. MFCS 2020: 82:1-82:15 - [c20]Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale:
On the Parameterized Complexity of Grid Contraction. SWAT 2020: 34:1-34:17 - [c19]Julliano Rosa Nascimento, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Partitioning a Graph into Complementary Subgraphs. WALCOM 2020: 223-235 - [i19]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 abs/2004.05672 (2020) - [i18]Ignasi Sau, Uéverton S. Souza:
Hitting forbidden induced subgraphs on bounded treewidth graphs. CoRR abs/2004.08324 (2020) - [i17]Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza:
Reducing graph transversals via edge contractions. CoRR abs/2005.01460 (2020) - [i16]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 abs/2007.04513 (2020) - [i15]Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale:
On the Parameterized Complexity Of Grid Contraction. CoRR abs/2008.07967 (2020)
2010 – 2019
- 2019
- [j25]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) - [j24]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): 546-562 (2019) - [c18]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:
Locality Sensitive Algotrithms for Data Mule Routing Problem. AAIM 2019: 236-248 - [c17]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: 272-283 - [c16]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: 2:1-2:16 - [c15]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: 12:1-12:15 - [c14]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: 324-340 - [c13]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: 33-44 - [c12]Márcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho, Braully R. Silva, Fábio Protti, Uéverton S. Souza:
P3-Hull Number of Graphs with Diameter Two. LAGOS 2019: 309-320 - [c11]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: 747-758 - [i14]Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
The Complexity of Helly-B1 EPG Graph Recognition. CoRR abs/1906.11185 (2019) - [i13]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 abs/1910.01071 (2019) - [i12]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 abs/1910.01783 (2019) - 2018
- [j23]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): 267-286 (2018) - [j22]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: 94-100 (2018) - [j21]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) - [j20]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:
General Variable Neighborhood Search for the Data Mule Scheduling Problem. Electron. Notes Discret. Math. 66: 71-78 (2018) - [j19]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: 22-27 (2018) - [j18]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: 40-57 (2018) - [j17]Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza:
Graphs in which some and every maximum matching is uniquely restricted. J. Graph Theory 89(1): 55-63 (2018) - [j16]Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza:
On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph. Theor. Comput. Sci. 746: 36-48 (2018) - [c10]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: 357-376 - [c9]Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Bipartizing with a Matching. COCOA 2018: 198-213 - [c8]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: 84-95 - [i11]Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira:
Maximum cuts in edge-colored graphs. CoRR abs/1805.00858 (2018) - [i10]Rafael T. Araújo, Sulamita Klein, Rudini Menezes Sampaio, Uéverton S. Souza:
FPT algorithms to recognize well covered graphs. CoRR abs/1810.08276 (2018) - 2017
- [j15]Uéverton dos Santos Souza, Fábio Protti:
Tractability, hardness, and kernelization lower bound for and/or graph solution. Discret. Appl. Math. 232: 125-133 (2017) - [j14]Rubens Sucupira, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza:
Maximum Cuts in Edge-colored Graphs. Electron. Notes Discret. Math. 62: 87-92 (2017) - [j13]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: 279-284 (2017) - [j12]Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Decycling with a matching. Inf. Process. Lett. 124: 26-29 (2017) - [j11]Márcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza:
Complexity properties of complementary prisms. J. Comb. Optim. 33(2): 365-372 (2017) - [j10]Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Generalized threshold processes on graphs. Theor. Comput. Sci. 689: 27-35 (2017) - [j9]Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton dos Santos Souza:
Corrigendum to "Complexity analysis of P3-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95]. Theor. Comput. Sci. 704: 92-93 (2017) - [c7]Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza:
Deletion Graph Problems Based on Deadlock Resolution. COCOON 2017: 75-86 - [i9]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 abs/1702.06112 (2017) - [i8]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 abs/1705.09177 (2017) - [i7]Fábio Protti, Uéverton S. Souza:
Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes. CoRR abs/1707.02473 (2017) - [i6]Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Eliminating Odd Cycles by Removing a Matching. CoRR abs/1710.07741 (2017) - 2016
- [j8]Michael Gentner, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza:
Extremal values and bounds for the zero forcing number. Discret. Appl. Math. 214: 196-200 (2016) - [c6]Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza:
On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs. COCOA 2016: 423-437 - [c5]Valmir Carneiro Barbosa, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza:
Deadlock models in distributed computation: foundations, design, and computational complexity. SAC 2016: 538-541 - 2015
- [j7]Márcio Antônio Duarte, Felix Joos, Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza:
On Graphs with Induced Matching Number Almost Equal to Matching Number. Electron. Notes Discret. Math. 50: 9-14 (2015) - [j6]Uéverton dos Santos Souza, Frances A. Rosamond, Michael R. Fellows, Fábio Protti, Maise Dantas da Silva:
The Flood-It game parameterized by the vertex cover number. Electron. Notes Discret. Math. 50: 35-40 (2015) - [j5]Michael R. Fellows, Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva:
Tractability and hardness of flood-filling games on trees. Theor. Comput. Sci. 576: 102-116 (2015) - [j4]Márcio Antônio Duarte, Felix Joos, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza:
Maximum induced matchings close to maximum matchings. Theor. Comput. Sci. 588: 131-137 (2015) - [j3]Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton dos Santos Souza:
Complexity analysis of P3-convexity problems on bounded-degree and planar graphs. Theor. Comput. Sci. 607: 83-95 (2015) - [c4]Ana Beatriz Cruz, Leonardo Preuss, João Quadros, Uéverton S. Souza, Sabrina Serique, Angélica Ogasawara, Eduardo Bezerra, Eduardo S. Ogasawara:
Amê: an environment to learn and analyze adversarial search algorithms using stochastic card games. SAC 2015: 208-213 - [i5]Felipe De Campos Mesquita, Letícia Rodrigues Bueno, Rodrigo de Alencar Hausen, Uéverton dos Santos Souza:
On Hamiltonian Cycles in Kneser Graphs. CTW 2015: 121-124 - [i4]Uéverton S. Souza, Letícia Rodrigues Bueno, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti:
Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4. CTW 2015: 197-200 - [i3]Márcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza:
The P3-Convexity in the Complementary Prism of a Graph. CTW 2015: 225-228 - 2014
- [j2]Uéverton S. Souza, Fábio Protti, Maise Dantas da Silva:
An algorithmic analysis of Flood-it and Free-Flood-it on graph powers. Discret. Math. Theor. Comput. Sci. 16(3): 279-290 (2014) - [c3]Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza:
On P 3-Convexity of Graphs with Bounded Degree. AAIM 2014: 263-274 - 2013
- [j1]Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva:
Revisiting the complexity of and/or graph solution. J. Comput. Syst. Sci. 79(7): 1156-1163 (2013) - [c2]Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva:
Parameterized Complexity of Flood-Filling Games on Trees. COCOON 2013: 531-542 - [i2]Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva:
Parameterized and/or graph solution. CTW 2013: 205-208 - 2012
- [c1]Rafael Pinto Medeiros, Uéverton dos Santos Souza, Fábio Protti, Leonardo Gresta Paulino Murta:
Optimal Variability Selection in Product Line Engineering. SEKE 2012: 635-640 - [i1]Maise Dantas da Silva, Fábio Protti, Uéverton dos Santos Souza:
Revisiting the Complexity of And/Or Graph Solution. CoRR abs/1203.3249 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 20:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
