On Computing All Maximal Cliques Distributedly. - Fábio Protti; Felipe M. G. França; Jayme Luiz Szwarcfiter (IRREGULAR, 1997)

On the Relations between Acceptable Programs and Stratifiable Classes. - Fábio Protti; Gerson Zaverucha (SBIA, 1998)

Clique-inverse graphs of K3-free and K4-free graphs. - Fábio Protti; Jayme Luiz Szwarcfiter (J. Graph Theory, 2000)

ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors. - Manoel B. Campêlo; Ricardo C. Corrêa; Nelson Maculan; Fábio Protti (Electron. Notes Discret. Math., 2001)

On generalized split graphs. - Pavol Hell; Sulamita Klein; Fábio Protti; Loana Tito Nogueira (Electron. Notes Discret. Math., 2001)

On the helly defect of a graph. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (J. Braz. Comput. Soc., 2001)

List Partitions of Chordal Graphs. - Tomás Feder; Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (LATIN, 2004)

A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load. - Diego Moreira de Araujo Carvalho; Fábio Protti; Massimo De Gregorio; Felipe M. G. França (OPODIS, 2004)

A Huffman-Based Error Detecting Code. - Paulo Eustáquio Duarte Pinto; Fábio Protti; Jayme Luiz Szwarcfiter (WEA, 2004)

Partitioning chordal graphs into independent sets and cliques. - Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (Discret. Appl. Math., 2004)

New advances about a conjecture on Helly circle graphs. - Juan Manuel Barrionuevo; Aureliano Calvo; Guillermo Durán; Fábio Protti (Electron. Notes Discret. Math., 2004)

On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation. - Márcia R. Cerioli; Luérbio Faria; Talita O. Ferreira; Fábio Protti (Electron. Notes Discret. Math., 2004)

On Clique-inverse graphs of Kp-free graphs. - Sylvain Gravier; Fábio Protti; Cláudia Linhares Sales (Electron. Notes Discret. Math., 2004)

Optimal grid representations. - Marcia Helena Costa Fampa; Sulamita Klein; Fábio Protti; Debora Cristina Alves Rêgo (Networks, 2004)

Application-Driven Node Management in Multihop Wireless Sensor Networks. - Flávia Coimbra Delicato; Fábio Protti; José Ferreira de Rezende; Luiz F. Rust da Costa Carmo; Luci Pirmez (ICN (1), 2005)

Packing r-Cliques in Weighted Chordal Graphs. - Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (Ann. Oper. Res., 2005)

The Helly property on subhypergraphs. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2005)

The Helly property on subfamilies of limited size. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2005)

Parity codes. - Paulo Eustáquio Duarte Pinto; Fábio Protti; Jayme Luiz Szwarcfiter (RAIRO Theor. Informatics Appl., 2005)

List matrix partitions of chordal graphs. - Tomás Feder; Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (Theor. Comput. Sci., 2005)

Applying Modular Decomposition to Parameterized Bicluster Editing. - Fábio Protti; Maise Dantas da Silva; Jayme Luiz Szwarcfiter (IWPEC, 2006)

An efficient heuristic for selecting active nodes in wireless sensor networks. - Flávia Coimbra Delicato; Fábio Protti; Luci Pirmez; José Ferreira de Rezende (Comput. Networks, 2006)

On simulating nondeterministic stochastic activity networks - Valmir Carneiro Barbosa; Fernando M. L. Ferreira; Daniel V. Kling; Eduardo Lopes; Fábio Protti; Eber A. Schmitz (CoRR, 2006)

Complexity aspects of generalized Helly hypergraphs. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2006)

Computational Aspects of the Helly Property: a Survey. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (J. Braz. Comput. Soc., 2006)

Characterization and recognition of generalized clique-Helly graphs. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2007)

Partition into cliques for cubic graphs: Planar case, complexity and approximation. - Márcia R. Cerioli; Luérbio Faria; Talita O. Ferreira; Carlos A. J. Martinhon; Fábio Protti; Bruce A. Reed (Discret. Appl. Math., 2008)

On the strong p-Helly property. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2008)

Algorithmic Aspects of Monophonic Convexity. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2008)

Extending the geometric build-up algorithm for the molecular distance geometry problem. - Ricardo dos Santos Carvalho; Carlile Lavor; Fábio Protti (Inf. Process. Lett., 2008)

Improved algorithms for recognizing p. - Mitre Costa Dourado; Min Chih Lin; Fábio Protti; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2008)

Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code. - Paulo Eustáquio Duarte Pinto; Fábio Protti; Jayme Luiz Szwarcfiter (TAMC, 2009)

On the computation of the hull number of a graph. - Mitre Costa Dourado; John G. Gimbel; Jan Kratochvíl; Fábio Protti; Jayme Luiz Szwarcfiter (Discret. Math., 2009)

Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals. - Mitre Costa Dourado; Rodolfo Alves de Oliveira; Fábio Protti (Electron. Notes Discret. Math., 2009)

On s-t paths and trails in edge-colored graphs. - Laurent Gourvès; Adria Lyra; Carlos A. J. Martinhon; Jérôme Monnot; Fábio Protti (Electron. Notes Discret. Math., 2009)

Cycle transversals in bounded degree graphs. - Marina Groshaus; Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (Electron. Notes Discret. Math., 2009)

Preface. - Thomas M. Liebling; Jayme Luiz Szwarcfiter; Carlos Eduardo Ferreira; Fábio Protti (Electron. Notes Discret. Math., 2009)

Structured construction and simulation of nondeterministic stochastic activity networks. - Valmir Carneiro Barbosa; Fernando M. L. Ferreira; Daniel V. Kling; Eduardo Lopes; Fábio Protti; Eber A. Schmitz (Eur. J. Oper. Res., 2009)

Applying Modular Decomposition to Parameterized Cluster Editing Problems. - Fábio Protti; Maise Dantas da Silva; Jayme Luiz Szwarcfiter (Theory Comput. Syst., 2009)

Advances on the List Stubborn Problem. - Simone Dantas; Luérbio Faria; Celina M. H. de Figueiredo; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (CATS, 2010)

SUTIL - Network selection based on utility function and integer linear programming. - Luci Pirmez; Jaime Cesar de Carvalho Jr.; Flávia Coimbra Delicato; Fábio Protti; Luiz Fernando Rust C. Carmo; Paulo F. Pires; Marcos Pirmez (Comput. Networks, 2010)

Complexity results related to monophonic convexity. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2010)

Some remarks on the geodetic number of a graph. - Mitre Costa Dourado; Fábio Protti; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Discret. Math., 2010)

On the Hull Number of Triangle-Free Graphs. - Mitre Costa Dourado; Fábio Protti; Dieter Rautenbach; Jayme Luiz Szwarcfiter (SIAM J. Discret. Math., 2010)

Towards a Novel Statistical Method for Generating Test Sets with a Given Coverage Probability. - Cristiane Selem Ferreira Neves; Eber Assis Schmitz; Fábio Protti; Antonio Juarez Alencar (SEKE, 2011)

Characterization and recognition of P4-sparse graphs partitionable into k independent sets and l cliques. - Raquel S. F. Bravo; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (Discret. Appl. Math., 2011)

New branch-and-bound algorithms for k-cardinality tree problems. - Luidi Simonetti; Fábio Protti; Yuri Frota; Cid C. de Souza (Electron. Notes Discret. Math., 2011)

A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation. - Márcia R. Cerioli; Luérbio Faria; Talita O. Ferreira; Fábio Protti (RAIRO Theor. Informatics Appl., 2011)

An improved derandomized approximation algorithm for the max-controlled set problem. - Carlos A. J. Martinhon; Fábio Protti (RAIRO Theor. Informatics Appl., 2011)

Optimal Variability Selection in Product Line Engineering. - Rafael Pinto Medeiros; Uéverton dos Santos Souza; Fábio Protti; Leonardo Gresta Paulino Murta (SEKE, 2012)

V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009. - Carlos Eduardo Ferreira; Fábio Protti; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2012)

Mixed unit interval graphs. - Mitre Costa Dourado; Van Bang Le; Fábio Protti; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Discret. Math., 2012)

Hybrid Metaheuristic for Bicluster Editing Problem. - Gilberto Farias de Sousa Filho; Lucídio dos Anjos F. Cabral; Luiz Satoru Ochi; Fábio Protti (Electron. Notes Discret. Math., 2012)

On the Convexity Number of Graphs. - Mitre Costa Dourado; Fábio Protti; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Graphs Comb., 2012)

Partitioning extended P4-laden graphs into cliques and stable sets. - Raquel S. F. Bravo; Sulamita Klein; Loana Tito Nogueira; Fábio Protti; Rudini Menezes Sampaio (Inf. Process. Lett., 2012)

Exact and approximation algorithms for error-detecting even codes. - Paulo Eustáquio Duarte Pinto; Fábio Protti; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2012)

On (k, ℓ)-Graph Sandwich Problems. - Fernanda Couto; Luérbio Faria; Sulamita Klein; Fábio Protti; Loana Tito Nogueira (FAW-AAIM, 2013)

Parameterized Complexity of Flood-Filling Games on Trees. - Uéverton dos Santos Souza; Fábio Protti; Maise Dantas da Silva (COCOON, 2013)

On specifying boundary conditions for the graph sandwich problem. - Fernanda Couto; Luérbio Faria; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (CTW, 2013)

Parameterized and/or graph solution. - Uéverton dos Santos Souza; Fábio Protti; Maise Dantas da Silva (CTW, 2013)

Matching Preclusion Number in Cartesian Product of Graphs and its Application to Interconnection Networks. - Aline Ribeiro de Almeida; Fábio Protti; Lilian Markenzon (Ars Comb., 2013)

An energy function and its application to the periodic behavior of k-reversible processes. - Leonardo I. L. Oliveira; Valmir Carneiro Barbosa; Fábio Protti (CoRR, 2013)

Clique cycle transversals in graphs with few P4's. - Raquel S. F. Bravo; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (Discret. Math. Theor. Comput. Sci., 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)

Cycle transversals in perfect graphs and cographs. - Andreas Brandstädt; Synara Brito; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (Theor. Comput. Sci., 2013)

Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23]. - Andreas Brandstädt; Synara Brito; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (Theor. Comput. Sci., 2013)

On P 3-Convexity of Graphs with Bounded Degree. - Lucia Draque Penso; Fábio Protti; Dieter Rautenbach; Uéverton S. Souza (AAIM, 2014)

Algorithmic aspects of Steiner convexity and enumeration of Steiner trees. - Mitre Costa Dourado; Rodolfo Alves de Oliveira; Fábio Protti (Ann. Oper. Res., 2014)

On Helly Hypergraphs with Variable Intersection Sizes. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Ars Comb., 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)

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 (CTW, 2015)

Parameterized mixed cluster editing via modular decomposition. - Maise Dantas da Silva; Fábio Protti; Jayme Luiz Szwarcfiter (CoRR, 2015)

Cycles in complementary prisms. - Dirk Meierling; Fábio Protti; Dieter Rautenbach; Aline Ribeiro de Almeida (Discret. Appl. Math., 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)

A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem. - Ivan C. Martins; Rian G. S. Pinheiro; Fábio Protti; Luiz Satoru Ochi (Expert Syst. Appl., 2015)

Robust recoverable perfect matchings. - Mitre Costa Dourado; Dirk Meierling; Lucia Draque Penso; Dieter Rautenbach; Fábio Protti; Aline Ribeiro de Almeida (Networks, 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)

The predecessor-existence problem for k-reversible processes. - Leonardo I. L. Oliveira; Valmir Carneiro Barbosa; Fábio Protti (Theor. Comput. Sci., 2015)

Complexity analysis of P3-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)

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 (SAC, 2016)

Clique cycle-transversals in distance-hereditary graphs. - Andreas Brandstädt; Simone Esposito; Loana Tito Nogueira; Fábio Protti (Discret. Appl. Math., 2016)

On the geodetic iteration number of distance-hereditary graphs. - Mitre Costa Dourado; Rodolfo Alves de Oliveira; Fábio Protti; Dieter Rautenbach (Discret. Math., 2016)

On solving manufacturing cell formation via Bicluster Editing. - Rian G. S. Pinheiro; Ivan C. Martins; Fábio Protti; Luiz S. Ochi; Luidi Gelabert Simonetti; Anand Subramanian 001 (Eur. J. Oper. Res., 2016)

A parallel hybrid metaheuristic for bicluster editing. - Gilberto Farias de Sousa Filho; Teobaldo L. Bulhões Júnior; Lucídio dos Anjos F. Cabral; Luiz Satoru Ochi; Fábio Protti (Int. Trans. Oper. Res., 2016)

Efficient algorithms for cluster editing. - Lucas de O. Bastos; Luiz Satoru Ochi; Fábio Protti; Anand Subramanian 001; Ivan César Martins; Rian Gabriel S. Pinheiro (J. Comb. Optim., 2016)

Adaptive event sensing in networks of autonomous mobile agents. - Rodrigo R. Esch; Fábio Protti; Valmir C. Barbosa (J. Netw. Comput. Appl., 2016)

Deletion Graph Problems Based on Deadlock Resolution. - Alan Diêgo Aurélio Carneiro; Fábio Protti; Uéverton S. Souza (COCOON, 2017)

New heuristics for the Bicluster Editing Problem. - Gilberto Farias de Sousa Filho; Teobaldo L. Bulhões Júnior; Lucídio dos Anjos F. Cabral; Luiz Satoru Ochi; Fábio Protti (Ann. Oper. Res., 2017)

New algorithms for the Minimum Coloring Cut Problem. - Augusto Bordini; Fábio Protti (CoRR, 2017)

Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes. - Fábio Protti; Uéverton S. Souza (CoRR, 2017)

Tractability, hardness, and kernelization lower bound for and/or graph solution. - Uéverton dos Santos Souza; Fábio Protti (Discret. Appl. Math., 2017)

Corrigendum to "Complexity analysis of P3-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)

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 (COCOON, 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)

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)

A computational study of f-reversible processes on graphs. - Carlos Vinícius G. C. Lima; Leonardo I. L. Oliveira; Valmir C. Barbosa; Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Discret. Appl. 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)

Closure of genomic sets: applications of graph convexity to genome rearrangement problems. - Luís Felipe I. Cunha; Fábio Protti (Electron. Notes Discret. Math., 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)

A matheuristic for the cell formation problem. - Rian Gabriel S. Pinheiro; Ivan C. Martins; Fábio Protti; Luiz Satoru Ochi (Optim. Lett., 2018)

On the complete set packing and set partitioning polytopes: Properties and rank 1 facets. - Teobaldo Bulhões; Artur Alves Pessoa; Fábio Protti; Eduardo Uchoa (Oper. Res. Lett., 2018)

Cograph generation with linear delay. - Átila A. Jones; Fábio Protti; Renata R. Del-Vecchio (Theor. Comput. Sci., 2018)

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 (IPEC, 2019)

P3-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 (LAGOS, 2019)

New algorithms for the minimum coloring cut problem. - Augusto Bordini; Fábio Protti; Thiago Gouveia da Silva; Gilberto Farias de Sousa Filho (Int. Trans. Oper. Res., 2019)

Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems. - Luís Felipe I. Cunha; Fábio Protti (J. Comput. Biol., 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)

Mobility, Citizens, Innovation and Technology in Digital and Smart Cities. - Thays A. Oliveira; Yuri B. Gabrich; Helena Ramalhinho; Miquel Oliver; Miri Weiss-Cohen; Luiz S. Ochi; Serigne Gueye; Fábio Protti; Alysson A. Pinto; Diógenes V. M. Ferreira; Igor Machado Coelho; Vitor Nazário Coelho (Future Internet, 2020)

Vector Domination in split-indifference graphs. - Rodrigo Lamblet Mafort; Fábio Protti (Inf. Process. Lett., 2020)

On clique-inverse graphs of graphs with bounded clique number. - Liliana Alcón; Sylvain Gravier; Cláudia Linhares Sales; Fábio Protti; Gabriela Ravenna (J. Graph Theory, 2020)

The biclique partitioning polytope. - Gilberto Farias de Sousa Filho; Teobaldo Bulhões; Lucídio dos Anjos F. Cabral; Luiz Satoru Ochi; Fábio Protti; Rian G. S. Pinheiro (Discret. Appl. Math., 2021)

Declawing a graph: polyhedra and Branch-and-Cut algorithms. - Felipe C. Fragoso; Gilberto Farias de Sousa Filho; Fábio Protti (J. Comb. Optim., 2021)

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)

Edge clique partition in (k, ℓ)-graphs. - Átila A. Jones; Fábio Protti; Renata R. Del-Vecchio (Discret. Appl. Math., 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)

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)

A Greedy Heuristic for Majority Target Set Selection in Social Networks. - Braully Rocha da Silva; Erika Morais Martins Coelho; Hebert Coelho da Coelho; Fábio Protti (ASONAM, 2023)

Geodetic convexity and kneser graphs. - Marcos V. N. Bedo; João V. S. Leite; Rodolfo Alves de Oliveira; Fábio Protti (Appl. Math. Comput., 2023)

All-path convexity: Combinatorial and complexity aspects. - Fábio Protti; João Vinicius C. Thompson (CoRR, 2023)

The general position number and the iteration time in the P3 convexity. - Júlio Araújo 001; Mitre Costa Dourado; Fábio Protti; Rudini M. Sampaio (CoRR, 2023)

Convex geometries over induced paths with bounded length. - Marisa Gutierrez; Fábio Protti; Silvia B. Tondato (Discret. Math., 2023)

Weakly toll convexity and proper interval graphs. - Mitre Costa Dourado; Marisa Gutierrez; Fábio Protti; Silvia B. Tondato (Discret. Math. Theor. Comput. Sci., 2024)

Computing the hull and interval numbers in the weakly toll convexity. - Mitre Costa Dourado; Marisa Gutierrez; Fábio Protti; Silvia B. Tondato (Theor. Comput. Sci., 2024)

The iteration time and the general position number in graph convexities. - Júlio Araújo 001; Mitre Costa Dourado; Fábio Protti; Rudini Menezes Sampaio (Appl. Math. Comput., 2025)

Characterizations of graph classes via convex geometries: A survey. - Mitre Costa Dourado; Marisa Gutierrez; Fábio Protti; Rudini Menezes Sampaio; Silvia B. Tondato (Discret. Appl. Math., 2025)

Induced tree covering and the generalized Yutsis property. - Luís Cunha 001; Gabriel L. Duarte; Fábio Protti; Loana Tito Nogueira; Uéverton S. Souza (J. Comput. Syst. Sci., 2025)