On the complexity of finding even pairs in planar perfect graphs. - Rudini Menezes Sampaio; Cláudia Linhares Sales (Electron. Notes Discret. Math., 2001)

Estudo e Implementacao de Algoritmos de Roteamento sobre Grafos em um Sistema de Informacoes Geograficas - Rudini Menezes Sampaio; Horacio Hideki Yanasse (CoRR, 2005)

Limits of permutation sequences. - Rudini Menezes Sampaio (2008)

Property Testing and Parameter Testing for Permutations. - Carlos Hoppen; Yoshiharu Kohayakawa; Carlos Gustavo T. de A. Moreira; Rudini Menezes Sampaio (SODA, 2010)

Two Fixed-Parameter Algorithms for the Cocoloring Problem. - Victor A. Campos; Sulamita Klein; Rudini Menezes Sampaio; Ana Silva 001 (ISAAC, 2011)

Fixed parameter algorithms for restricted coloring problems: acyclic, star, nonrepetitive, harmonious and clique colorings - Victor A. Campos; Cláudia Linhares Sales; Ana Karolinna Maia; Nicolas Almeida Martins; Rudini Menezes Sampaio (CoRR, 2011)

Every hereditary permutation property is testable. - Antônio J. O. Bastos; Carlos Hoppen; Yoshiharu Kohayakawa; Rudini Menezes Sampaio (Electron. Notes Discret. Math., 2011)

Restricted coloring problems on graphs with few P'4s. - Victor A. Campos; Cláudia Linhares Sales; Ana Karolinna Maia; Nicolas Almeida Martins; Rudini Menezes Sampaio (Electron. Notes Discret. Math., 2011)

A note on random k-dimensional posets. - Ricardo C. Corrêa; Carlos Hoppen; Yoshiharu Kohayakawa; Rudini Menezes Sampaio (Electron. Notes Discret. Math., 2011)

Testing permutation properties through subpermutations. - Carlos Hoppen; Yoshiharu Kohayakawa; Carlos Gustavo T. de A. Moreira; Rudini Menezes Sampaio (Theor. Comput. Sci., 2011)

Graphs with Few P4's Under the Convexity of Paths of Order Three. - Victor A. Campos; Rudini Menezes Sampaio; Ana Silva 001; Jayme Luiz Szwarcfiter (CTW, 2012)

A note on permutation regularity. - Carlos Hoppen; Yoshiharu Kohayakawa; Rudini Menezes Sampaio (Discret. Appl. Math., 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)

On the Complexity of Solving or Approximating Convex Recoloring Problems. - Manoel B. Campêlo; Cristiana Gomes Huiban; Rudini M. Sampaio; Yoshiko Wakabayashi (COCOON, 2013)

The convexity of induced paths of order three. - Rafael T. Araújo; Rudini Menezes Sampaio; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2013)

Limits of permutation sequences. - Carlos Hoppen; Yoshiharu Kohayakawa; Carlos Gustavo T. de A. Moreira; Balázs Ráth; Rudini Menezes Sampaio (J. Comb. Theory B, 2013)

Backbone colouring: Tree backbones with small diameter in planar graphs. - Victor A. Campos; Frédéric Havet; Rudini Menezes Sampaio; Ana Silva 001 (Theor. Comput. Sci., 2013)

The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results. - Thiago Braga Marcilon; Samuel Nascimento; Rudini M. Sampaio (WG, 2014)

Restricted coloring problems on Graphs with few P 4's. - Cláudia Linhares Sales; Ana Karolinna Maia; Nicolas Almeida Martins; Rudini Menezes Sampaio (Ann. Oper. Res., 2014)

Fixed-parameter algorithms for the cocoloring problem. - Victor A. Campos; Sulamita Klein; Rudini Menezes Sampaio; Ana Silva 001 (Discret. Appl. Math., 2014)

Maximization coloring problems on graphs with few P4. - Victor A. Campos; Cláudia Linhares Sales; Rudini Menezes Sampaio; Ana Karolinna Maia (Discret. Appl. Math., 2014)

Hardness and inapproximability of convex recoloring problems. - Manoel B. Campêlo; Cristiana Gomes Huiban; Rudini M. Sampaio; Yoshiko Wakabayashi (Theor. Comput. Sci., 2014)

The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results. - Thiago Braga Marcilon; Rudini M. Sampaio (WG, 2015)

The maximum time of 2-neighbour bootstrap percolation in grid graphs and some parameterized results. - Thiago Braga Marcilon; Rudini Menezes Sampaio (CoRR, 2015)

On the complexity of the flow coloring problem. - Manoel B. Campêlo; Cristiana Gomes Huiban; Carlos Diego Rodrigues; Rudini M. Sampaio (Discret. Appl. Math., 2015)

Graphs with few P4's under the convexity of paths of order three. - Victor A. Campos; Rudini Menezes Sampaio; Ana Silva 001; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2015)

Inapproximability results related to monophonic convexity. - Eurinardo Rodrigues Costa; Mitre Costa Dourado; Rudini M. Sampaio (Discret. Appl. Math., 2015)

The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects. - Fabrício Benevides; Victor A. Campos; Mitre Costa Dourado; Rudini Menezes Sampaio; Ana Silva 001 (Eur. J. Comb., 2015)

Preface - VIII Latin-american Algorithms, Graphs and Optimization Symposium. - Manoel B. Campêlo; Ricardo C. Corrêa; Cláudia Linhares Sales; Rudini M. Sampaio (Electron. Notes Discret. Math., 2015)

Inapproximability of the lid-chromatic number. - Nicolas Almeida Martins; Rudini Menezes Sampaio (Electron. Notes Discret. Math., 2015)

Roman domination in subgraphs of grids. - Samuel Nascimento; Rudini Menezes Sampaio (Electron. Notes Discret. Math., 2015)

Inapproximability results for graph convexity parameters. - Erika M. M. Coelho; Mitre Costa Dourado; Rudini M. Sampaio (Theor. Comput. Sci., 2015)

Complexity aspects of the triangle path convexity. - Mitre Costa Dourado; Rudini M. Sampaio (Discret. Appl. Math., 2016)

L(2, 1)-labelling of graphs with few P4's. - Márcia R. Cerioli; Nicolas Almeida Martins; Daniel F. D. Posner; Rudini M. Sampaio (Discret. Optim., 2016)

The maximum infection time in the geodesic and monophonic convexities. - Fabrício Benevides; Victor A. Campos; Mitre Costa Dourado; Rudini Menezes Sampaio; Ana Silva 001 (Theor. Comput. Sci., 2016)

Edge-colorings of graphs avoiding complete graphs with a prescribed coloring. - Fabrício Benevides; Carlos Hoppen; Rudini M. Sampaio (Discret. Math., 2017)

Identifying codes for infinite triangular grids with a finite number of rows. - Rennan Dantas; Frédéric Havet; Rudini M. Sampaio (Discret. Math., 2017)

Minimum density of identifying codes of king grids. - Rennan Dantas; Rudini M. Sampaio; Frédéric Havet (Electron. Notes Discret. Math., 2017)

FPT algorithms to recognize well covered graphs. - Rafael T. Araújo; Sulamita Klein; Rudini Menezes Sampaio; Uéverton S. Souza (CoRR, 2018)

The convexity of induced paths of order three and applications: Complexity aspects. - Rafael T. Araújo; Rudini M. Sampaio; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2018)

Preface: LAGOS'15 - Eighth Latin-American Algorithms, Graphs, and Optimization Symposium, Fortaleza, Brazil - 2015. - Manoel B. Campêlo; Thomas M. Liebling; Rudini Menezes Sampaio (Discret. Appl. Math., 2018)

Limits of k-dimensional poset sequences. - Ricardo Cordeiro Corrêa; Carlos Hoppen; Rudini Menezes Sampaio (Discret. Appl. Math., 2018)

The maximum infection time of the P3 convexity in graphs with bounded maximum degree. - Thiago Braga Marcilon; Rudini M. Sampaio (Discret. Appl. Math., 2018)

The P3 infection time is W[1]-hard parameterized by the treewidth. - Thiago Braga Marcilon; Rudini Menezes Sampaio (Inf. Process. Lett., 2018)

Spy-game on graphs: Complexity and simple topologies. - Nathann Cohen; Nicolas Almeida Martins; Fionn Mc Inerney; Nicolas Nisse; Stéphane Pérennes; Rudini M. Sampaio (Theor. Comput. Sci., 2018)

The maximum time of 2-neighbor bootstrap percolation: Complexity results. - Thiago Braga Marcilon; Rudini Menezes Sampaio (Theor. Comput. Sci., 2018)

Locally identifying coloring of graphs with few P4s. - Nicolas Almeida Martins; Rudini M. Sampaio (Theor. Comput. Sci., 2018)

Hardness of some variants of the graph coloring game. - Thiago Marcilon; Nicolas Almeida Martins; Rudini M. Sampaio (CoRR, 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)

PSPACE-hardness of Two Graph Coloring Games. - Eurinardo Rodrigues Costa; Victor Lage Pessoa; Rudini Menezes Sampaio; Ronan Soares (LAGOS, 2019)

On the parameterized complexity of the geodesic hull number. - Mamadou Moustapha Kanté; Thiago Braga Marcilon; Rudini M. Sampaio (Theor. Comput. Sci., 2019)

Hardness of Variants of the Graph Coloring Game. - Thiago Marcilon; Nicolas Almeida Martins; Rudini Menezes Sampaio (LATIN, 2020)

PSPACE-completeness of two graph coloring games. - Eurinardo Rodrigues Costa; Victor Lage Pessoa; Rudini M. Sampaio; Ronan Soares (Theor. Comput. Sci., 2020)

Spy Game: FPT-Algorithm and Results on Graph Products. - Eurinardo Rodrigues Costa; Nicolas Almeida Martins; Rudini M. Sampaio (COCOON, 2021)

Spy game: FPT-algorithm, hardness and graph products. - Eurinardo Rodrigues Costa; Nicolas Almeida Martins; Rudini M. Sampaio (Theor. Comput. Sci., 2022)

PSPACE-hardness of variants of the graph coloring game. - Carlos V. G. C. Lima; Thiago Marcilon; Nicolas Almeida Martins; Rudini M. Sampaio (Theor. Comput. Sci., 2022)

Complexity and winning strategies of graph convexity games (Brief Announcement). - Samuel N. Araújo; Raquel Folz; Rosiane de Freitas; Rudini M. Sampaio (LAGOS, 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)

The connected greedy coloring game. - Carlos V. G. C. Lima; Thiago Marcilon; Nicolas Almeida Martins; Rudini Menezes Sampaio (Theor. Comput. Sci., 2023)

Domination and convexity problems in the target set selection model. - Rafael T. Araújo; Rudini M. Sampaio (Discret. Appl. Math., 2023)

Target set selection with maximum activation time. - Lucas Keiler; Carlos Vinícius G. C. Lima; Ana Karolinna Maia; Rudini M. Sampaio; Ignasi Sau (Discret. Appl. Math., 2023)

Graph Convexity Partizan Games: Complexity and Winning Strategies. - Samuel N. Araújo; João Marcos Brito; Raquel Folz; Rosiane de Freitas; Rudini Menezes Sampaio (COCOON (1), 2024)

The Graph Coloring Game on 4⨉n-Grids. - Caroline Brosse; Nicolas Almeida Martins; Nicolas Nisse; Rudini Menezes Sampaio (CoRR, 2024)

Density of identifying codes of hexagonal grids with finite number of rows. - Rudini M. Sampaio; Gabriel A. G. Sobral; Yoshiko Wakabayashi (RAIRO Oper. Res., 2024)

Graph convexity impartial games: Complexity and winning strategies. - Samuel N. Araújo; João Marcos Brito; Raquel Folz; Rosiane de Freitas; Rudini M. Sampaio (Theor. Comput. Sci., 2024)

The general position avoidance game and hardness of general position games. - S. V. Ullas Chandran; Sandi Klavzar; P. K. Neethu; Rudini Menezes Sampaio (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)

Algorithms and complexity of graph convexity partizan games. - Samuel N. Araújo; João Marcos Brito; Raquel Folz; Rosiane de Freitas; Rudini M. Sampaio (Theor. Comput. Sci., 2025)

The Convex Set Forming Game. - Caroline Brosse; Nicolas Almeida Martins; Nicolas Nisse; Rudini Menezes Sampaio (Theor. Comput. Sci., 2025)

The Normal Play of the Domination Game. - João Marcos Brito; Nicolas Almeida Martins; Rudini Menezes Sampaio (CoRR, 2025)