default search action
Rudini Menezes Sampaio
Person information
- affiliation: Universidade Federal do Ceará, Fortaleza, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j50]Júlio Araújo, Mitre Costa Dourado
, Fábio Protti
The iteration time and the general position number in graph convexities. Appl. Math. Comput. 487: 129084 (2025) - [j49]Mitre Costa Dourado
Characterizations of graph classes via convex geometries: A survey. Discret. Appl. Math. 360: 246-257 (2025) - 2024
- [j48]S. V. Ullas Chandran, Sandi Klavzar, P. K. Neethu, Rudini Menezes Sampaio
The general position avoidance game and hardness of general position games. Theor. Comput. Sci. 988: 114370 (2024) - [j47]Samuel N. Araújo, João Marcos Brito, Raquel Folz, Rosiane de Freitas, Rudini M. Sampaio
Graph convexity impartial games: Complexity and winning strategies. Theor. Comput. Sci. 998: 114534 (2024) - 2023
- [j46]Rafael T. Araújo, Rudini M. Sampaio
Domination and convexity problems in the target set selection model. Discret. Appl. Math. 330: 14-23 (2023) - [j45]Lucas Keiler
Target set selection with maximum activation time. Discret. Appl. Math. 338: 199-217 (2023) - [j44]Carlos V. G. C. Lima, Thiago Marcilon
The connected greedy coloring game. Theor. Comput. Sci. 940(Part): 1-13 (2023) - [c12]Samuel N. Araújo, Raquel Folz, Rosiane de Freitas, Rudini M. Sampaio:
Complexity and winning strategies of graph convexity games (Brief Announcement). LAGOS 2023: 394-396 - [i12]Júlio Araújo, Mitre Costa Dourado, Fábio Protti, Rudini M. Sampaio:
The general position number and the iteration time in the P3 convexity. CoRR abs/2305.00467 (2023) - 2022
- [j43]Carlos V. G. C. Lima
PSPACE-hardness of variants of the graph coloring game. Theor. Comput. Sci. 909: 87-96 (2022) - [j42]Eurinardo Rodrigues Costa, Nicolas Almeida Martins, Rudini M. Sampaio
Spy game: FPT-algorithm, hardness and graph products. Theor. Comput. Sci. 923: 304-317 (2022) - [i11]Mitre Costa Dourado, Fábio Protti, Rudini Menezes Sampaio:
Characterizations of graph classes via convex geometries: A survey. CoRR abs/2203.15878 (2022) - [i10]S. V. Ullas Chandran, Sandi Klavzar, P. K. Neethu, Rudini Menezes Sampaio:
The general position avoidance game and hardness of general position games. CoRR abs/2205.03526 (2022) - 2021
- [c11]Eurinardo Rodrigues Costa, Nicolas Almeida Martins, Rudini M. Sampaio:
Spy Game: FPT-Algorithm and Results on Graph Products. COCOON 2021: 680-691 - [c10]Lucas Keiler, Carlos V. G. C. Lima, Ana Karolinna Maia, Rudini Menezes Sampaio, Ignasi Sau
Target set selection with maximum activation time. LAGOS 2021: 86-96 - [i9]Eurinardo Rodrigues Costa, Nicolas Almeida Martins, Rudini Menezes Sampaio:
Spy game: FPT-algorithm, hardness and graph products. CoRR abs/2110.08898 (2021) - 2020
- [j41]Eurinardo Rodrigues Costa, Victor Lage Pessoa, Rudini M. Sampaio
PSPACE-completeness of two graph coloring games. Theor. Comput. Sci. 824-825: 36-45 (2020) - [c9]Thiago Marcilon, Nicolas Almeida Martins, Rudini Menezes Sampaio:
Hardness of Variants of the Graph Coloring Game. LATIN 2020: 348-359 - [i8]Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau:
Target set selection with maximum activation time. CoRR abs/2007.05246 (2020)
2010 – 2019
- 2019
- [j40]Rafael T. Araújo, Eurinardo Rodrigues Costa, Sulamita Klein, Rudini Menezes Sampaio
FPT algorithms to recognize well covered graphs. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [j39]Mamadou Moustapha Kanté, Thiago Braga Marcilon
On the parameterized complexity of the geodesic hull number. Theor. Comput. Sci. 791: 10-27 (2019) - [c8]Eurinardo Rodrigues Costa, Victor Lage Pessoa, Rudini Menezes Sampaio
PSPACE-hardness of Two Graph Coloring Games. LAGOS 2019: 333-344 - [i7]Thiago Marcilon, Nicolas Almeida Martins, Rudini M. Sampaio:
Hardness of some variants of the graph coloring game. CoRR abs/1911.10363 (2019) - 2018
- [j38]Rafael T. Araújo, Rudini M. Sampaio
The convexity of induced paths of order three and applications: Complexity aspects. Discret. Appl. Math. 237: 33-42 (2018) - [j37]Manoel B. Campêlo, Thomas M. Liebling, Rudini Menezes Sampaio
Preface: LAGOS'15 - Eighth Latin-American Algorithms, Graphs, and Optimization Symposium, Fortaleza, Brazil - 2015. Discret. Appl. Math. 245: 1-3 (2018) - [j36]Ricardo Cordeiro Corrêa
Limits of k-dimensional poset sequences. Discret. Appl. Math. 245: 208-219 (2018) - [j35]Thiago Braga Marcilon
The maximum infection time of the P3 convexity in graphs with bounded maximum degree. Discret. Appl. Math. 251: 245-257 (2018) - [j34]Rennan Dantas, Frédéric Havet
Minimum density of identifying codes of king grids. Discret. Math. 341(10): 2708-2719 (2018) - [j33]Thiago Braga Marcilon
The P3 infection time is W[1]-hard parameterized by the treewidth. Inf. Process. Lett. 132: 55-61 (2018) - [j32]Nicolas Almeida Martins, Rudini M. Sampaio
Locally identifying coloring of graphs with few P4s. Theor. Comput. Sci. 707: 69-76 (2018) - [j31]Thiago Braga Marcilon
The maximum time of 2-neighbor bootstrap percolation: Complexity results. Theor. Comput. Sci. 708: 1-17 (2018) - [j30]Nathann Cohen, Nicolas Almeida Martins, Fionn Mc Inerney
Spy-game on graphs: Complexity and simple topologies. Theor. Comput. Sci. 725: 1-15 (2018) - [i6]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
- [j29]Rennan Dantas, Frédéric Havet, Rudini M. Sampaio
Identifying codes for infinite triangular grids with a finite number of rows. Discret. Math. 340(7): 1584-1597 (2017) - [j28]Fabrício Benevides, Carlos Hoppen
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring. Discret. Math. 340(9): 2143-2160 (2017) - [j27]Rennan Dantas, Rudini M. Sampaio, Frédéric Havet:
Minimum density of identifying codes of king grids. Electron. Notes Discret. Math. 62: 51-56 (2017) - 2016
- [j26]Mitre Costa Dourado, Rudini M. Sampaio
Complexity aspects of the triangle path convexity. Discret. Appl. Math. 206: 39-47 (2016) - [j25]Márcia R. Cerioli, Nicolas Almeida Martins, Daniel F. D. Posner, Rudini M. Sampaio
L(2, 1)-labelling of graphs with few P4's. Discret. Optim. 20: 1-10 (2016) - [j24]Fabrício Benevides
The maximum infection time in the geodesic and monophonic convexities. Theor. Comput. Sci. 609: 287-295 (2016) - 2015
- [j23]Victor A. Campos, Rudini Menezes Sampaio
Graphs with few P4's under the convexity of paths of order three. Discret. Appl. Math. 192: 28-39 (2015) - [j22]Eurinardo Rodrigues Costa, Mitre Costa Dourado, Rudini M. Sampaio
Inapproximability results related to monophonic convexity. Discret. Appl. Math. 197: 70-74 (2015) - [j21]Manoel B. Campêlo
On the complexity of the flow coloring problem. Discret. Appl. Math. 197: 75-92 (2015) - [j20]Fabrício Benevides, Victor A. Campos, Mitre Costa Dourado, Rudini Menezes Sampaio
The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects. Eur. J. Comb. 48: 88-99 (2015) - [j19]Manoel B. Campêlo, Ricardo C. Corrêa
Preface - VIII Latin-american Algorithms, Graphs and Optimization Symposium. Electron. Notes Discret. Math. 50: 1-2 (2015) - [j18]Samuel Nascimento
Roman domination in subgraphs of grids. Electron. Notes Discret. Math. 50: 77-82 (2015) - [j17]Nicolas Almeida Martins, Rudini Menezes Sampaio
Inapproximability of the lid-chromatic number. Electron. Notes Discret. Math. 50: 121-126 (2015) - [j16]Erika M. M. Coelho, Mitre Costa Dourado, Rudini M. Sampaio
Inapproximability results for graph convexity parameters. Theor. Comput. Sci. 600: 49-58 (2015) - [c7]Thiago Braga Marcilon, Rudini M. Sampaio:
The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results. WG 2015: 169-185 - [i5]Mitre Costa Dourado, Rudini M. Sampaio:
Complexity aspects of the triangle path convexity. CoRR abs/1503.00458 (2015) - [i4]Thiago Braga Marcilon, Rudini Menezes Sampaio:
The maximum time of 2-neighbour bootstrap percolation in grid graphs and some parameterized results. CoRR abs/1508.06847 (2015) - [i3]Thiago Braga Marcilon, Rudini Menezes Sampaio:
The maximum time of 2-neighbor bootstrap percolation: complexity results. CoRR abs/1508.06874 (2015) - 2014
- [j15]Cláudia Linhares Sales
Restricted coloring problems on Graphs with few P 4's. Ann. Oper. Res. 217(1): 385-397 (2014) - [j14]Victor A. Campos, Cláudia Linhares Sales
Maximization coloring problems on graphs with few P4. Discret. Appl. Math. 164: 539-546 (2014) - [j13]Victor A. Campos, Sulamita Klein, Rudini Menezes Sampaio
Fixed-parameter algorithms for the cocoloring problem. Discret. Appl. Math. 167: 52-60 (2014) - [j12]Manoel B. Campêlo
Hardness and inapproximability of convex recoloring problems. Theor. Comput. Sci. 533: 15-25 (2014) - [c6]Thiago Braga Marcilon
The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results. WG 2014: 372-383 - 2013
- [j11]Rafael T. Araújo, Rudini Menezes Sampaio
The convexity of induced paths of order three. Electron. Notes Discret. Math. 44: 109-114 (2013) - [j10]Carlos Hoppen
Limits of permutation sequences. J. Comb. Theory B 103(1): 93-113 (2013) - [j9]Victor A. Campos, Frédéric Havet, Rudini Menezes Sampaio
Backbone colouring: Tree backbones with small diameter in planar graphs. Theor. Comput. Sci. 487: 50-64 (2013) - [c5]Manoel B. Campêlo
On the Complexity of Solving or Approximating Convex Recoloring Problems. COCOON 2013: 614-625 - [c4]Erika M. M. Coelho, Mitre Costa Dourado, Rudini M. Sampaio
Inapproximability Results for Graph Convexity Parameters. WAOA 2013: 97-107 - 2012
- [j8]Carlos Hoppen
A note on permutation regularity. Discret. Appl. Math. 160(18): 2716-2727 (2012) - [j7]Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira
Partitioning extended P4-laden graphs into cliques and stable sets. Inf. Process. Lett. 112(21): 829-834 (2012) - [c3]Victor A. Campos, Rudini Menezes Sampaio, Ana Silva, Jayme Luiz Szwarcfiter:
Graphs with Few P4's Under the Convexity of Paths of Order Three. CTW 2012: 60-63 - 2011
- [j6]Ricardo C. Corrêa
A note on random k-dimensional posets. Electron. Notes Discret. Math. 37: 51-56 (2011) - [j5]Victor A. Campos, Cláudia Linhares Sales
Restricted coloring problems on graphs with few P'4s. Electron. Notes Discret. Math. 37: 57-62 (2011) - [j4]Antônio J. O. Bastos, Carlos Hoppen
Every hereditary permutation property is testable. Electron. Notes Discret. Math. 38: 123-128 (2011) - [j3]Carlos Hoppen
Testing permutation properties through subpermutations. Theor. Comput. Sci. 412(29): 3555-3567 (2011) - [c2]Victor A. Campos, Sulamita Klein, Rudini Menezes Sampaio
Two Fixed-Parameter Algorithms for the Cocoloring Problem. ISAAC 2011: 634-642 - [i2]Victor A. Campos, Cláudia Linhares Sales, Ana Karolinna Maia, Nicolas Almeida Martins, Rudini Menezes Sampaio:
Fixed parameter algorithms for restricted coloring problems: acyclic, star, nonrepetitive, harmonious and clique colorings. CoRR abs/1107.0056 (2011) - 2010
- [c1]Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Rudini Menezes Sampaio:
Property Testing and Parameter Testing for Permutations. SODA 2010: 66-75
2000 – 2009
- 2009
- [j2]Carlos Hoppen
A note on permutation regularity. Electron. Notes Discret. Math. 35: 183-188 (2009) - 2008
- [b1]Rudini Menezes Sampaio:
Limits of permutation sequences. University of São Paulo, Brazil, 2008 - 2005
- [i1]Rudini Menezes Sampaio, Horacio Hideki Yanasse:
Estudo e Implementacao de Algoritmos de Roteamento sobre Grafos em um Sistema de Informacoes Geograficas. CoRR abs/cs/0505031 (2005) - 2001
- [j1]Rudini Menezes Sampaio
On the complexity of finding even pairs in planar perfect graphs. Electron. Notes Discret. Math. 7: 186-189 (2001)
Coauthor Index
aka: Thiago Marcilon
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-11-07 20:28 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: