Extremal values and bounds for the zero forcing number M Gentner, LD Penso, D Rautenbach, US Souza Discrete applied mathematics 214, 196-200, 2016 | 63 | 2016 |
Complexity properties of complementary prisms MA Duarte, L Penso, D Rautenbach, U dos Santos Souza Journal of Combinatorial Optimization 33, 365-372, 2017 | 38 | 2017 |
An efficient similarity-based approach for comparing XML documents A Oliveira, G Tessarolli, G Ghiotto, B Pinto, F Campello, M Marques, ... Information Systems 78, 40-57, 2018 | 24 | 2018 |
Complexity analysis of P3-convexity problems on bounded-degree and planar graphs LD Penso, F Protti, D Rautenbach, U dos Santos Souza Theoretical Computer Science 607, 83-95, 2015 | 23 | 2015 |
Hitting forbidden induced subgraphs on bounded treewidth graphs I Sau, U dos Santos Souza Information and Computation 281, 104812, 2021 | 20 | 2021 |
Revisiting the complexity of and/or graph solution U dos Santos Souza, F Protti, MD da Silva Journal of Computer and System Sciences 79 (7), 1156-1163, 2013 | 20 | 2013 |
On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph SR Alves, KK Dabrowski, L Faria, S Klein, I Sau, US Souza Theoretical Computer Science 746, 36-48, 2018 | 19 | 2018 |
On the hardness of finding the geodetic number of a subcubic graph LR Bueno, LD Penso, F Protti, VR Ramos, D Rautenbach, US Souza Information Processing Letters 135, 22-27, 2018 | 18 | 2018 |
An algorithmic analysis of Flood-it and Free-Flood-it on graph powers U dos Santos Souza, F Protti, M Silva Discrete Mathematics & Theoretical Computer Science 16 (Analysis of Algorithms), 2014 | 14 | 2014 |
Parameterized complexity of flood-filling games on trees U dos Santos Souza, F Protti, MD da Silva International Computing and Combinatorics Conference, 531-542, 2013 | 14 | 2013 |
Deadlock resolution in wait-for graphs by vertex/arc deletion ADA Carneiro, F Protti, US Souza Journal of Combinatorial Optimization 37 (2), 546-562, 2019 | 13 | 2019 |
Graphs in which some and every maximum matching is uniquely restricted LD Penso, D Rautenbach, U dos Santos Souza Journal of Graph Theory 89 (1), 55-63, 2018 | 13 | 2018 |
Maximum induced matchings close to maximum matchings MA Duarte, F Joos, LD Penso, D Rautenbach, US Souza Theoretical Computer Science 588, 131-137, 2015 | 13 | 2015 |
Relating verification and validation methods to software product quality characteristics: results of an expert survey I Mendoza, M Kalinowski, U Souza, M Felderer Software Quality: The Complexity and Challenges of Software Engineering and …, 2019 | 12 | 2019 |
Decycling with a matching CVGC Lima, D Rautenbach, US Souza, JL Szwarcfiter Information Processing Letters 124, 26-29, 2017 | 12 | 2017 |
Deadlock models in distributed computation: foundations, design, and computational complexity VC Barbosa, ADA Carneiro, F Protti, US Souza Proceedings of the 31st annual ACM symposium on applied computing, 538-541, 2016 | 12 | 2016 |
Computing the largest bond and the maximum connected cut of a graph GL Duarte, H Eto, T Hanaka, Y Kobayashi, Y Kobayashi, D Lokshtanov, ... Algorithmica 83, 1421-1458, 2021 | 9 | 2021 |
Tractability and hardness of flood-filling games on trees MR Fellows, U dos Santos Souza, F Protti, MD da Silva Theoretical Computer Science 576, 102-116, 2015 | 9 | 2015 |
Compositions, decompositions, and conformability for total coloring on power of cycle graphs A Zorzi, CMH Figueiredo, RCS Machado, LM Zatesko, US Souza Discrete Applied Mathematics 323, 349-363, 2022 | 8 | 2022 |
Even-power of cycles with many vertices are Type 1 total colorable A Zorzi, C de Figueiredo, R Machado, US Souza Electronic Notes in Theoretical Computer Science 346, 747-758, 2019 | 8 | 2019 |