Rudini M. Sampaio

36 papers B 3C 2Misc 2Journal 29
YearRankTypeTitle / Venue / Authors
2026 J jnl
The harmonious coloring game.
Inf. Process. Lett.
Cláudia Linhares Sales, Thiago Marcilon, Nicolas Almeida Martins, Nicolas Nisse, Rudini M. Sampaio
2025 J jnl
Algorithms and complexity of graph convexity partizan games.
Theor. Comput. Sci.
Samuel N. Araújo, João Marcos Brito, Raquel Folz, Rosiane de Freitas, Rudini M. Sampaio
2025 C conf
The Graph Coloring Game on 4 x n-Grids.
LAGOS
Caroline Brosse, Nicolas Almeida Martins, Nicolas Nisse, Rudini M. Sampaio
2024 J jnl
Density of identifying codes of hexagonal grids with finite number of rows.
RAIRO Oper. Res.
Rudini M. Sampaio, Gabriel A. G. Sobral, Yoshiko Wakabayashi
2024 J jnl
Graph convexity impartial games: Complexity and winning strategies.
Theor. Comput. Sci.
Samuel N. Araújo, João Marcos Brito, Raquel Folz, Rosiane de Freitas, Rudini M. Sampaio
2023 C conf
Complexity and winning strategies of graph convexity games (Brief Announcement).
LAGOS
Samuel N. Araújo, Raquel Folz, Rosiane de Freitas, Rudini M. Sampaio
2023 J jnl
Domination and convexity problems in the target set selection model.
Discret. Appl. Math.
Rafael T. Araújo, Rudini M. Sampaio
2023 J jnl
Target set selection with maximum activation time.
Discret. Appl. Math.
Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau
2023 J jnl
The general position number and the iteration time in the P3 convexity.
CoRR
Júlio Araújo, Mitre Costa Dourado, Fábio Protti, Rudini M. Sampaio
2022 J jnl
PSPACE-hardness of variants of the graph coloring game.
Theor. Comput. Sci.
Carlos V. G. C. Lima, Thiago Marcilon, Nicolas Almeida Martins, Rudini M. Sampaio
2022 J jnl
Spy game: FPT-algorithm, hardness and graph products.
Theor. Comput. Sci.
Eurinardo Rodrigues Costa, Nicolas Almeida Martins, Rudini M. Sampaio
2021 Misc conf
Spy Game: FPT-Algorithm and Results on Graph Products.
COCOON
Eurinardo Rodrigues Costa, Nicolas Almeida Martins, Rudini M. Sampaio
2020 J jnl
PSPACE-completeness of two graph coloring games.
Theor. Comput. Sci.
Eurinardo Rodrigues Costa, Victor Lage Pessoa, Rudini M. Sampaio, Ronan Soares
2020 J jnl
Target set selection with maximum activation time.
CoRR
Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau
2019 J jnl
Hardness of some variants of the graph coloring game.
CoRR
Thiago Marcilon, Nicolas Almeida Martins, Rudini M. Sampaio
2019 J jnl
On the parameterized complexity of the geodesic hull number.
Theor. Comput. Sci.
Mamadou Moustapha Kanté, Thiago Braga Marcilon, Rudini M. Sampaio
2018 J jnl
Locally identifying coloring of graphs with few P4s.
Theor. Comput. Sci.
Nicolas Almeida Martins, Rudini M. Sampaio
2018 J jnl
Minimum density of identifying codes of king grids.
Discret. Math.
Rennan Dantas, Frédéric Havet, Rudini M. Sampaio
2018 J jnl
Spy-game on graphs: Complexity and simple topologies.
Theor. Comput. Sci.
Nathann Cohen, Nicolas Almeida Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, Rudini M. Sampaio
2018 J jnl
The convexity of induced paths of order three and applications: Complexity aspects.
Discret. Appl. Math.
Rafael T. Araújo, Rudini M. Sampaio, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter
2018 J jnl
The maximum infection time of the P3 convexity in graphs with bounded maximum degree.
Discret. Appl. Math.
Thiago Braga Marcilon, Rudini M. Sampaio
2017 J jnl
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring.
Discret. Math.
Fabrício Benevides, Carlos Hoppen, Rudini M. Sampaio
2017 J jnl
Identifying codes for infinite triangular grids with a finite number of rows.
Discret. Math.
Rennan Dantas, Frédéric Havet, Rudini M. Sampaio
2017 J jnl
Minimum density of identifying codes of king grids.
Electron. Notes Discret. Math.
Rennan Dantas, Rudini M. Sampaio, Frédéric Havet
2016 J jnl
Complexity aspects of the triangle path convexity.
Discret. Appl. Math.
Mitre Costa Dourado, Rudini M. Sampaio
2016 J jnl
L(2, 1)-labelling of graphs with few P
Discret. Optim.
Márcia R. Cerioli, Nicolas Almeida Martins, Daniel F. D. Posner, Rudini M. Sampaio
2015 J jnl
Complexity aspects of the triangle path convexity.
CoRR
Mitre Costa Dourado, Rudini M. Sampaio
2015 J jnl
Inapproximability results for graph convexity parameters.
Theor. Comput. Sci.
Erika M. M. Coelho, Mitre Costa Dourado, Rudini M. Sampaio
2015 J jnl
Inapproximability results related to monophonic convexity.
Discret. Appl. Math.
Eurinardo Rodrigues Costa, Mitre Costa Dourado, Rudini M. Sampaio
2015 J jnl
On the complexity of the flow coloring problem.
Discret. Appl. Math.
Manoel B. Campêlo, Cristiana Gomes Huiban, Carlos Diego Rodrigues, Rudini M. Sampaio
2015 J jnl
Preface - VIII Latin-american Algorithms, Graphs and Optimization Symposium.
Electron. Notes Discret. Math.
Manoel B. Campêlo, Ricardo C. Corrêa, Cláudia Linhares Sales, Rudini M. Sampaio
2015 B conf
The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results.
WG
Thiago Braga Marcilon, Rudini M. Sampaio
2014 J jnl
Hardness and inapproximability of convex recoloring problems.
Theor. Comput. Sci.
Manoel B. Campêlo, Cristiana Gomes Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi
2014 B conf
The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results.
WG
Thiago Braga Marcilon, Samuel Nascimento, Rudini M. Sampaio
2013 B conf
Inapproximability Results for Graph Convexity Parameters.
WAOA
Erika M. M. Coelho, Mitre Costa Dourado, Rudini M. Sampaio
2013 Misc conf
On the Complexity of Solving or Approximating Convex Recoloring Problems.
COCOON
Manoel B. Campêlo, Cristiana Gomes Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi