var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Ff%2F964yB9FokgnpKrFd8%2Faraujosn.bib&jsonp=1&noTitleLinks=true&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Ff%2F964yB9FokgnpKrFd8%2Faraujosn.bib&jsonp=1&noTitleLinks=true\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Ff%2F964yB9FokgnpKrFd8%2Faraujosn.bib&jsonp=1&noTitleLinks=true\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2024\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Graph convexity impartial games: Complexity and winning strategies.\n \n \n\n\n \n Araújo, S. N; Brito, J. M.; Folz, R.; de Freitas, R.; and Sampaio, R. M\n\n\n \n\n\n\n Theor. Comput. Sci., 998(114534): 114534. June 2024.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@ARTICLE{Araujo2024-cx,\n  title     = "Graph convexity impartial games: Complexity and winning\n               strategies",\n  author    = "Ara{\\'u}jo, Samuel N and Brito, Jo{\\~a}o Marcos and Folz, Raquel\n               and de Freitas, Rosiane and Sampaio, Rudini M",\n  journal   = "Theor. Comput. Sci.",\n  publisher = "Elsevier BV",\n  volume    =  998,\n  number    =  114534,\n  pages     = "114534",\n  month     =  jun,\n  year      =  2024,\n  language  = "en",\n  doi = {http://dx.doi.org/10.1016/j.tcs.2024.114534}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Jogos Partizan de Convexidade de Grafos.\n \n \n\n\n \n N. Araújo, S.; Marcos Brito, J.; Folz, R.; de Freitas, R.; and Sampaio, R.\n\n\n \n\n\n\n In Anais do Simpósio Brasileiro de Pesquisa Operacional, volume 56, 2024, Fortaleza - Ceará, Brasil, 2024. Galoa\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{N_Araujo2024-fm,\n  title           = "Jogos Partizan de Convexidade de Grafos",\n  booktitle       = "Anais do Simp{\\'o}sio Brasileiro de Pesquisa Operacional",\n  author          = "N. Ara{\\'u}jo, Samuel and Marcos Brito, Jo{\\~a}o and Folz,\n                     Raquel and de Freitas, Rosiane and Sampaio, Rudini",\n  publisher       = "Galoa",\n  volume          = "56, 2024",\n  year            =  2024,\n  address         = "Fortaleza - Cear{\\'a}, Brasil",\n  conference      = "ANAIS DO LVI SIMP{\\'o}SIO BRASILEIRO DE PESQUISA\n                     OPERACIONAL",\n  doi = {http://dx.doi.org/10.59254/sbpo-2024-193912}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Jogos de Convexidade em Grafos Direcionados.\n \n \n\n\n \n Araújo, S. N. d.; Brito, J. M.; and Sampaio, R. M.\n\n\n \n\n\n\n In Anais do IX Encontro de Teoria da Computa ̧cão (ETC 2024), July 2024. Sociedade Brasileira de Computa ̧cão - SBC\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{Araujo2024-qj,\n  title      = "Jogos de Convexidade em Grafos Direcionados",\n  booktitle  = "Anais do {IX} Encontro de Teoria da Computa{\\c c}{\\~a}o ({ETC}\n                2024)",\n  author     = "Ara{\\'u}jo, Samuel Nascimento de and Brito, Jo{\\~a}o Marcos and\n                Sampaio, Rudini Menezes",\n  publisher  = "Sociedade Brasileira de Computa{\\c c}{\\~a}o - SBC",\n  month      =  jul,\n  year       =  2024,\n  conference = "Encontro de Teoria da Computa{\\c c}{\\~a}o",\n  location   = "Brasil",\n  doi = {http://dx.doi.org/10.5753/etc.2024.2023}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Estratégias Vencedoras e Complexidade de Jogos de Convexidade em Grafos.\n \n \n\n\n \n Araújo, S. N.; Folz, R.; de Freitas, R.; Brito, J. M.; and Sampaio, R.\n\n\n \n\n\n\n In Anais do VIII Encontro de Teoria da Computação (ETC 2023), August 2023. Sociedade Brasileira de Computação - SBC\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{Arajo2023,\n  doi = {https://doi.org/10.5753/etc.2023.230749},\n  year = {2023},\n  month = aug,\n  publisher = {Sociedade Brasileira de Computa{\\c{c}}{\\~{a}}o - {SBC}},\n  author = {Samuel N. Ara{\\'{u}}jo and Raquel Folz and Rosiane de Freitas and Jo{\\~{a}}o Marcos Brito and Rudini Sampaio},\n  title = {Estrat{\\'{e}}gias Vencedoras e Complexidade de Jogos de Convexidade em Grafos},\n  booktitle = {Anais do {VIII} Encontro de Teoria da Computa{\\c{c}}{\\~{a}}o ({ETC} 2023)},  \n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Complexity and winning strategies of graph convexity games (Brief Announcement).\n \n \n\n\n \n Araújo, S. N.; Folz, R.; de Freitas, R.; and Sampaio, R.\n\n\n \n\n\n\n Procedia Computer Science, 223: 394–396. 2023.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{Arajo2023,\n  title = {Complexity and winning strategies of graph convexity games (Brief Announcement)},\n  volume = {223},\n  ISSN = {1877-0509},\n  doi = {http://dx.doi.org/10.1016/j.procs.2023.08.258},\n  journal = {Procedia Computer Science},\n  publisher = {Elsevier BV},\n  author = {Araújo,  Samuel N. and Folz,  Raquel and de Freitas,  Rosiane and Sampaio,  Rudini},\n  year = {2023},\n  pages = {394–396}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Roman domination in subgraphs of grids.\n \n \n\n\n \n Nascimento, S.; and Sampaio, R.\n\n\n \n\n\n\n Electronic Notes in Discrete Mathematics, 50: 77-82. 2015.\n LAGOS'15 – VIII Latin-American Algorithms, Graphs and Optimization Symposium\n\n\n\n
\n\n\n\n \n \n \"RomanPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{NASCIMENTO2015,\ntitle = {Roman domination in subgraphs of grids},\njournal = {Electronic Notes in Discrete Mathematics},\nvolume = {50},\npages = {77-82},\nyear = {2015},\nnote = {LAGOS'15 – VIII Latin-American Algorithms, Graphs and Optimization Symposium},\nissn = {1571-0653},\ndoi = {https://doi.org/10.1016/j.endm.2015.07.014},\nurl = {https://www.sciencedirect.com/science/article/pii/S1571065315001699},\nauthor = {Samuel Nascimento and Rudini Sampaio},\nkeywords = {Roman domination, APX-hard, Fixed parameter tractable, grid},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results.\n \n \n\n\n \n Marcilon, T.; Nascimento, S.; and Sampaio, R.\n\n\n \n\n\n\n In Kratsch, D.; and Todinca, I., editor(s), Graph-Theoretic Concepts in Computer Science, pages 372–383, Cham, 2014. Springer International Publishing\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Marcilonetal2014,\nauthor="Marcilon, Thiago\nand Nascimento, Samuel\nand Sampaio, Rudini",\neditor="Kratsch, Dieter\nand Todinca, Ioan",\ntitle="The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results",\nbooktitle="Graph-Theoretic Concepts in Computer Science",\nyear="2014",\npublisher="Springer International Publishing",\naddress="Cham",\npages="372--383",\nisbn="978-3-319-12340-0",\ndoi = {http://dx.doi.org/10.1007/978-3-319-12340-0_31}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2011\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Partição dos grafos $P_4$-laden em conjuntos independentes e cliques.\n \n \n\n\n \n Bravo, R.; Klein, S.; Nascimento, S.; Nogueira, L.; Protti, F.; and Sampaio, R.\n\n\n \n\n\n\n In ANAIS DO XLIII SBPO, pages 2559–2566, 2011. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Bravoetal2011,\nauthor="Bravo, Raquel\nand Klein, Sulamita\nand Nascimento, Samuel\nand Nogueira, Loana\nand Protti, Fábio\nand Sampaio, Rudini",\ntitle="Partição dos grafos $P_4$-laden em conjuntos independentes e cliques",\nbooktitle="ANAIS DO XLIII SBPO",\nyear="2011",\npages="2559--2566",\nissn="2965-1476",\ndoi = {https://www.din.uem.br/sbpo/sbpo2011/pdf/85763.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);