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=http://www.inf.ufpr.br/andre/bibtex/meus.bib&jsonp=1&fullnames=1&sort=-year&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=http://www.inf.ufpr.br/andre/bibtex/meus.bib&jsonp=1&fullnames=1&sort=-year\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=http://www.inf.ufpr.br/andre/bibtex/meus.bib&jsonp=1&fullnames=1&sort=-year\"></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 (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n The hardness of recognising poorly matchable graphs and the hunting of the d-snark.\n \n \n \n \n\n\n \n Leandro Zatesko; Renato Carmo; André L. P. Guedes; Raphael C. S. Machado; and Celina M. H. Figueiredo.\n\n\n \n\n\n\n RAIRO - Operations Research. March 2024.\n To appear.\n\n\n\n
\n\n\n\n \n \n \"ThePaper\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{ZateskoRAIRO2024,\n   title        = {The hardness of recognising poorly matchable graphs\n                  and the hunting of the d-snark},\n   issn         = {2804-7303},\n   url          = {http://dx.doi.org/10.1051/ro/2024068},\n   doi          = {10.1051/ro/2024068},\n   journal      = {RAIRO - Operations Research},\n   publisher    = {EDP Sciences},\n   author       = {Zatesko, Leandro and Carmo, Renato and Guedes, André\n                  L. P. and Machado, Raphael C. S. and Figueiredo,\n                  Celina M. H.},\n   year         = {2024},\n   month        = mar,\n   note = {To appear.}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Edge and Non-edge differentiated Biclique Graphs.\n \n \n \n \n\n\n \n Edmilson Pereira Da Cruz; Marina Groshaus; and André L. P. Guedes.\n\n\n \n\n\n\n Procedia Computer Science, 223: 53–61. 2023.\n XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023)\n\n\n\n
\n\n\n\n \n \n \"EdgePaper\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 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{CruzGroshausGuedesProcedia2023,\n        title = {Edge and Non-edge differentiated Biclique Graphs},\n        author = {Edmilson Pereira Da Cruz and Marina Groshaus and André L. P. Guedes},\n\tnote={XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023)},\n        journal={Procedia Computer Science},\n        volume={223},\n\tyear={2023},\n        ISSN={1877-0509},\n        url={http://dx.doi.org/10.1016/j.procs.2023.08.213},\n        DOI={10.1016/j.procs.2023.08.213},\n        publisher={Elsevier BV},\n        pages={53–61}\n}\n\n\n\n\n% ----------------------------------------------------------------------\n% for emacs' bibtex mode\n%\n% The variables below are used for the maintainance of this file\n%\n% In short: C-u C-c C-c should generate the key for the entry at\n% point using the same standard used\n% throughout the file\n%\n% For details, please, see the bibtex-mode manual at\n% http://www.brl.ntt.co.jp/people/leroux/bibtex-mode.html\n%\n% especially the section "Automatic Reference Key Generation" at\n% http://www.brl.ntt.co.jp/people/leroux/bibtex-mode.html#0630\n%\n% This file should survive\n% M-x bibtex-validate\n%\n% Local Variables:\n% bibtex-align-at-equal-sign: t\n% bibtex-autokey-expand-strings: nil\n% bibtex-autokey-name-case-convert-function: capitalize\n% bibtex-autokey-name-separator: ""\n% bibtex-autokey-name-year-separator: ""\n% bibtex-autokey-names: infty\n% bibtex-autokey-titleword-separator: ""\n% bibtex-autokey-titlewords-stretch: 0\n% bibtex-autokey-titlewords: 0\n% bibtex-autokey-year-length: 4\n% bibtex-autokey-year-title-separator: ""\n% bibtex-contline-indentation: 21\n% bibtex-entry-format: (required-fields page-dashes whitespace inherit-booktitle realign last-comma delimiters unify-case braces strings)\n% bibtex-field-indentation: 3\n% bibtex-maintain-sorted-entries: entry-class\n% bibtex-sort-entry-class: (("Book") ("InBook") ("Article") ("InCollection") ("InProceedings") ("Proceedings") ("Manual") ("TechReport") ("PhdThesis") ("MastersThesis") ("Misc") (catch-all))\n% bibtex-text-indentation: 18\n% End:\n% ----------------------------------------------------------------------\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Subclass Hierarchy on Circular Arc Bigraphs.\n \n \n \n \n\n\n \n Marina Groshaus; André L. P. Guedes; and Fabricio S. Kolberg.\n\n\n \n\n\n\n Matemática Contemporânea, 48: 74-83. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"SubclassPaper\n  \n \n \n \"Subclass pdf\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{GroshausGuedesKolberg2022MC,\n  title={Subclass Hierarchy on Circular Arc Bigraphs},\n  author={Groshaus, Marina and Guedes, Andr{\\'e} L. P. and Kolberg, Fabricio S.},\n  journal={Matem{\\'a}tica Contempor{\\^a}nea},\n  issn = {2317-6636},\n  volume={48},\n  pages={74-83},\n  doi = {http://doi.org/10.21711/231766362021/rmc488},\n  url = {https://mc.sbm.org.br/volumes/volume-48/},\n  url_pdf = {https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-08-vol-48.pdf},\n  year={2022}\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Biclique Graphs of Interval Containment Bigraphs.\n \n \n \n \n\n\n \n Edmilson P. Cruz; Marina Groshaus; and André L. P. Guedes.\n\n\n \n\n\n\n Matemática Contemporânea, 48: 221-230. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"BicliquePaper\n  \n \n \n \"Biclique pdf\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{CruzGroshausGuedes2022MC,\n  title={Biclique Graphs of Interval Containment Bigraphs},\n  author={Cruz, Edmilson P. and Groshaus, Marina and Guedes, Andr{\\'e} L. P.},\n  journal={Matem{\\'a}tica Contempor{\\^a}nea},\n  issn = {2317-6636},\n  volume={48},\n  pages={221-230},\n  doi = {http://doi.org/10.21711/231766362021/rmc4822},\n  url = {https://mc.sbm.org.br/volumes/volume-48/},\n  url_pdf = {https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-22-vol-48.pdf},\n  year={2022}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Biclique graphs of split graphs.\n \n \n \n \n\n\n \n M. Groshaus; A.L.P. Guedes; and J.P. Puppo.\n\n\n \n\n\n\n Discrete Applied Mathematics, 323: 252-267. 2022.\n LAGOS’19 – X Latin and American Algorithms, Graphs, and Optimization Symposium – Belo Horizonte, Minas Gerais, Brazil\n\n\n\n
\n\n\n\n \n \n \"BicliquePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 3 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\n
\n
@article{GroshausGuedesPuppo2022,\ntitle = {Biclique graphs of split graphs},\njournal = {Discrete Applied Mathematics},\nvolume = {323},\npages = {252-267},\nyear = {2022},\nissn = {0166-218X},\ndoi = {https://doi.org/10.1016/j.dam.2021.12.028},\nurl = {https://www.sciencedirect.com/science/article/pii/S0166218X2100514X},\nauthor = {M. Groshaus and A.L.P. Guedes and J.P. Puppo},\nkeywords = {Bicliques, Biclique graphs, Split graphs, Biclique-complete, -complete},\nnote = {LAGOS’19 – X Latin and American Algorithms, Graphs, and Optimization Symposium – Belo Horizonte, Minas Gerais, Brazil},\nabstract = {The biclique graph is the intersection graph of the bicliques of a graph. Its recognition problem is still open. In this paper we study the problem restricted to the class of split graphs. We define a class called nested separable split graphs and solve the recognition problem of biclique graphs of a subclass of the mentioned class. For that, we give a polynomial time algorithm with positive certificate. We also characterize nested split graphs and study properties of biclique graphs of split graphs. For example, we show that they are Hamiltonian. We also present a complexity result for recognizing graphs such that their biclique graphs are complete graphs, that is, we prove that the problem of recognizing biclique-complete graphs in co-NP-complete.}\n}\n\n
\n
\n\n\n
\n The biclique graph is the intersection graph of the bicliques of a graph. Its recognition problem is still open. In this paper we study the problem restricted to the class of split graphs. We define a class called nested separable split graphs and solve the recognition problem of biclique graphs of a subclass of the mentioned class. For that, we give a polynomial time algorithm with positive certificate. We also characterize nested split graphs and study properties of biclique graphs of split graphs. For example, we show that they are Hamiltonian. We also present a complexity result for recognizing graphs such that their biclique graphs are complete graphs, that is, we prove that the problem of recognizing biclique-complete graphs in co-NP-complete.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (8)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Reconhecimento de grafos IIC-comparabilidade.\n \n \n \n \n\n\n \n Lucas F. Glir; and André L. P. Guedes.\n\n\n \n\n\n\n In IV Workshop de Pesquisa em Computação dos Campos Gerais, volume 4, pages 13, Ponta Grossa, Paraná, 2021. \n \n\n\n\n
\n\n\n\n \n \n \"Reconhecimento pdf\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 1 download\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
@InProceedings{GlirGuedesWPCCG2021,\n   author        =  {Lucas F. Glir and André L. P. Guedes},\n   title        = {Reconhecimento de grafos IIC-comparabilidade},\n   booktitle     = {IV  Workshop de  Pesquisa em  Computação dos  Campos\n                  Gerais},\n   issn         = {2526-1371},\n   volume       = {4},\n   year         = {2021},\n   pages        = {13},\n   keywords     = {Grafo, Grafo de Comparabilidade, Ordem Parcial, Decomposição Modular, Orientação Transitiva},\n   address      = {Ponta Grossa, Paraná},\n   doi          = {10.5281/zenodo.6090322},\n   url_pdf      = {http://www.wpccg.pro.br/wpccg2021/papers/paper_19}\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A realidade das abordagens adaptadas em problemas de otimização contínua.\n \n \n \n \n\n\n \n Raphael Bezerra Xavier; and André L. P. Guedes.\n\n\n \n\n\n\n In IV Workshop de Pesquisa em Computação dos Campos Gerais, volume 4, pages 12, Ponta Grossa, Paraná, 2021. \n \n\n\n\n
\n\n\n\n \n \n \"A pdf\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 \n \n\n\n\n
\n
@InProceedings{XavierGuedesWPCCG2021,\n   author        =  {Raphael Bezerra Xavier and André L. P. Guedes},\n   title        = {A realidade das abordagens adaptadas em problemas de otimização contínua},\n   booktitle     = {IV  Workshop de  Pesquisa em  Computação dos  Campos\n                  Gerais},\n   issn         = {2526-1371},\n   volume       = {4},\n   year         = {2021},\n   pages        = {12},\n   keywords     = {Otimização, Adaptações, Hibridizações},\n   address      = {Ponta Grossa, Paraná},\n   doi          = {10.5281/zenodo.6090322},\n   url_pdf      = {http://www.wpccg.pro.br/wpccg2021/papers/paper_16}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Problemas de otimização utilizando o SCIP.\n \n \n \n \n\n\n \n Viviane Frida Belli; and André L. P. Guedes.\n\n\n \n\n\n\n In IV Workshop de Pesquisa em Computação dos Campos Gerais, volume 4, pages 6, Ponta Grossa, Paraná, 2021. \n \n\n\n\n
\n\n\n\n \n \n \"Problemas pdf\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 1 download\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
@InProceedings{BelliGuedesWPCCG2021,\n   author        =  {Viviane Frida Belli and André L. P. Guedes},\n   title        = {Problemas de otimização utilizando o SCIP},\n   booktitle     = {IV  Workshop de  Pesquisa em  Computação dos  Campos\n                  Gerais},\n   issn         = {2526-1371},\n   volume       = {4},\n   year         = {2021},\n   pages        = {6},\n   keywords     = {Otimização, Classificação de problemas de otimização, SCIP},\n   address      = {Ponta Grossa, Paraná},\n   doi          = {10.5281/zenodo.6090322},\n   url_pdf      = {http://www.wpccg.pro.br/wpccg2021/papers/paper_9}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Geração de grafo de cena utilizando teorema de causa e efeito na extração e classificação das propriedades.\n \n \n \n \n\n\n \n Flávio Henrique Silva; and André L. P. Guedes.\n\n\n \n\n\n\n In IV Workshop de Pesquisa em Computação dos Campos Gerais, volume 4, pages 3, Ponta Grossa, Paraná, 2021. \n \n\n\n\n
\n\n\n\n \n \n \"Geração pdf\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 1 download\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
@InProceedings{SilvaGuedesWPCCG2021,\n   author        =  {Flávio Henrique da Silva and André L. P. Guedes},\n   title        = {Geração de grafo de cena utilizando teorema de causa e efeito na extração e classificação das propriedades},\n   booktitle     = {IV  Workshop de  Pesquisa em  Computação dos  Campos\n                  Gerais},\n   issn         = {2526-1371},\n   volume       = {4},\n   year         = {2021},\n   pages        = {3},\n   keywords     = {Geração de Grafo de Cena, Redes Neurais de Grafos, Aprendizado Profundo em Grafos, Classificação de Imagens},\n   address      = {Ponta Grossa, Paraná},\n   doi          = {10.5281/zenodo.6090322},\n   url_pdf      = {http://www.wpccg.pro.br/wpccg2021/papers/paper_6}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On feedback vertex set in reducible flow hypergraphs.\n \n \n \n \n\n\n \n Luerbio Faria; André L. P. Guedes; and Lilian Markenzon.\n\n\n \n\n\n\n Procedia Computer Science, 195: 212-220. 2021.\n Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium.\n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\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{FariaGuedesMarkenzonProcedia2021,\ntitle = "On feedback vertex set in reducible flow hypergraphs",\njournal = {Procedia Computer Science},\nvolume = {195},\npages = {212-220},\nyear = {2021},\nnote = {Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium.},\nissn = {1877-0509},\ndoi = {https://doi.org/10.1016/j.procs.2021.11.027},\nurl = {https://www.sciencedirect.com/science/article/pii/S1877050921021669},\nauthor = {Luerbio Faria and André L. P. Guedes and Lilian Markenzon},\nkeywords = {directed hypergraphs, feedback vertex set, NP-complete, approximation algorithms},\nabstract = {A directed hypergraph H = (V, A) is a finite set of vertices V and a set of hyper-arcs A, where each hyper-arc is an ordered pair of nonempty subsets of vertices. A flow hypergraph H = (V, A, s) is a triple, such that (V, A) is a directed hypergraph, s e V is a distinguished vertex such that s reaches every vertex of V. Reducible flow hypergraphs are a generalization of Hecht and Ullman’s reducible flowgraphs. The feedback vertex set (fvs) decision problem has a directed hypergraph H and an integer k ≥ 0 as input and the question is whether there is V'⊆V, |V' |≤k such that H\\V' is an acyclic directed hypergraph. It is known that fvs is polynomial time solvable for reducible flowgraphs. In this article we prove that fvs is NP-complete for reducible flow hypergraphs showing a reduction from 3-satisfiability problem with at most 3 occurrences per variable (3sat3-). We exhibit a polynomial-time ∆-approximation for fvs in reducible flow hypergraphs, where ∆ is the maximum number of hyper-arcs adjacent to a vertex of H.}\n}\n\n
\n
\n\n\n
\n A directed hypergraph H = (V, A) is a finite set of vertices V and a set of hyper-arcs A, where each hyper-arc is an ordered pair of nonempty subsets of vertices. A flow hypergraph H = (V, A, s) is a triple, such that (V, A) is a directed hypergraph, s e V is a distinguished vertex such that s reaches every vertex of V. Reducible flow hypergraphs are a generalization of Hecht and Ullman’s reducible flowgraphs. The feedback vertex set (fvs) decision problem has a directed hypergraph H and an integer k ≥ 0 as input and the question is whether there is V'⊆V, |V' |≤k such that H\\V' is an acyclic directed hypergraph. It is known that fvs is polynomial time solvable for reducible flowgraphs. In this article we prove that fvs is NP-complete for reducible flow hypergraphs showing a reduction from 3-satisfiability problem with at most 3 occurrences per variable (3sat3-). We exhibit a polynomial-time ∆-approximation for fvs in reducible flow hypergraphs, where ∆ is the maximum number of hyper-arcs adjacent to a vertex of H.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Biclique Graphs of K3-free Graphs and Bipartite Graphs.\n \n \n \n \n\n\n \n Marina Groshaus; and André L. P. Guedes.\n\n\n \n\n\n\n Procedia Computer Science, 195: 230–238. 2021.\n Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium.\n\n\n\n
\n\n\n\n \n \n \"BicliquePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \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\n\n
\n
@article{GroshausGuedesProcedia2021,\n   title        = "Biclique Graphs of K3-free Graphs and Bipartite\n                  Graphs",\n   author       = "Marina Groshaus and André L. P. Guedes",\n   journal      = {Procedia Computer Science},\n   volume       = {195},\n   year         = "2021",\n   ISSN         = {1877-0509},\n   url          = {http://dx.doi.org/10.1016/j.procs.2021.11.029},\n   DOI          = {10.1016/j.procs.2021.11.029},\n   publisher    = {Elsevier BV},\n   pages        = {230–238},\n   note         = {Proceedings of the XI Latin and American Algorithms,\n                  Graphs and Optimization Symposium.},\n   keywords     = {Bicliques, Biclique graphs, Intersection graphs,\n                  Triangle-free graphs, Bipartite graphs, Comparability\n                  graphs, Power of a graph},\n   abstract     = {A biclique of a graph is a maximal complete bipartite\n                  subgraph.  The biclique graph of a graph G, KB(G),\n                  defined as the intersection graph of the bicliques of\n                  G, was introduced and characterized in 2010 by\n                  Groshaus and Szwarcfiter. However, this\n                  characterization does not lead to polynomial time\n                  recognition algorithms, and the time complexity of its\n                  recognition problem remains open. There are some works\n                  on this problem when restricted to some classes. In\n                  this work we give a characterization of the biclique\n                  graph of a K3-free graph G. We prove that KB(G) is the\n                  square graph of a particular graph which we call\n                  Mutually Included Biclique Graph of G,\n                  KBm(G). Although it does not lead to a polynomial time\n                  recognition algorithm, it gives a new tool to prove\n                  properties of biclique graphs (restricted to K3-free\n                  graphs) using known properties of square graphs. For\n                  instance we generalize a property about induced P3's\n                  in biclique graphs to a property about stars and\n                  proved a conjecture posted by Groshaus and Montero,\n                  when restricted to K3-free graphs.  Also we give\n                  another characterization of the class of biclique\n                  graphs of bipartite graphs. We prove that\n                  KB(bipartite) = (IIC-comparability)2, where\n                  IIC-comparability is a subclass of comparability\n                  graphs that we call Interval Intersection Closed\n                  Comparability.}\n}\n\n\n\n
\n
\n\n\n
\n A biclique of a graph is a maximal complete bipartite subgraph. The biclique graph of a graph G, KB(G), defined as the intersection graph of the bicliques of G, was introduced and characterized in 2010 by Groshaus and Szwarcfiter. However, this characterization does not lead to polynomial time recognition algorithms, and the time complexity of its recognition problem remains open. There are some works on this problem when restricted to some classes. In this work we give a characterization of the biclique graph of a K3-free graph G. We prove that KB(G) is the square graph of a particular graph which we call Mutually Included Biclique Graph of G, KBm(G). Although it does not lead to a polynomial time recognition algorithm, it gives a new tool to prove properties of biclique graphs (restricted to K3-free graphs) using known properties of square graphs. For instance we generalize a property about induced P3's in biclique graphs to a property about stars and proved a conjecture posted by Groshaus and Montero, when restricted to K3-free graphs. Also we give another characterization of the class of biclique graphs of bipartite graphs. We prove that KB(bipartite) = (IIC-comparability)2, where IIC-comparability is a subclass of comparability graphs that we call Interval Intersection Closed Comparability.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Lex-Libras: Morphosyntactic Model of the Brazilian Sign Language to Support a Context-based Machine Translation Process.\n \n \n \n \n\n\n \n Antônio M. Silva; Tânya Amara Felipe; Laura Sánchez García; Diego R. Antunes; and André Luiz Pires Guedes.\n\n\n \n\n\n\n In Joaquim Filipe; Michal Smialek; Alexander Brodsky; and Slimane Hammoudi., editor(s), Proceedings of the 23rd International Conference on Enterprise Information Systems, ICEIS 2021, Online Streaming, April 26-28, 2021, Volume 2, pages 267-274, 2021. SCITEPRESS\n \n\n\n\n
\n\n\n\n \n \n \"Lex-Libras:Paper\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{SilvaFGAG21,\n  author    = {Ant{\\^{o}}nio M. Silva and\n               T{\\^{a}}nya Amara de Felipe and\n               Laura S{\\'{a}}nchez Garc{\\'{\\i}}a and\n               Diego R. Antunes and\n               Andr{\\'{e}} Luiz Pires Guedes},\n  editor    = {Joaquim Filipe and\n               Michal Smialek and\n               Alexander Brodsky and\n               Slimane Hammoudi},\n  title     = {Lex-Libras: Morphosyntactic Model of the Brazilian Sign Language to\n               Support a Context-based Machine Translation Process},\n  booktitle = {Proceedings of the 23rd International Conference on Enterprise Information\n               Systems, {ICEIS} 2021, Online Streaming, April 26-28, 2021, Volume\n               2},\n  pages     = {267-274},\n  publisher = {{SCITEPRESS}},\n  year      = {2021},\n  url       = {https://doi.org/10.5220/0010442402670274},\n  doi       = {10.5220/0010442402670274},\n  timestamp = {Tue, 13 Jul 2021 11:04:37 +0200},\n  biburl    = {https://dblp.org/rec/conf/iceis/SilvaFGAG21.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Deaf Inclusion Through Brazilian Sign Language: A Computational Architecture Supporting Artifacts and Interactive Applications and Tools.\n \n \n \n \n\n\n \n Laura Sánchez García; Tânya Amara Felipe; André Luiz Pires Guedes; Diego Roberto Antunes; Carlos Eduardo Iatskiu; Eduardo Todt; J. Bueno; Daniela F. Guilhermino Trindade; D. A. Gonçalves; R. Canteri; M. C. Canal; M. A. Ferreira; A. M. C. Silva; L. Galvão; and L. Rodrigues.\n\n\n \n\n\n\n In Margherita Antona; and Constantine Stephanidis., editor(s), Universal Access in Human-Computer Interaction. Access to Media, Learning and Assistive Environments - 15th International Conference, UAHCI 2021, Held as Part of the 23rd HCI International Conference, HCII 2021, Virtual Event, July 24-29, 2021, Proceedings, Part II, volume 12769, of Lecture Notes in Computer Science, pages 167-185, 2021. Springer\n \n\n\n\n
\n\n\n\n \n \n \"DeafPaper\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{GarciaFGAITBTGC21,\n  author    = {Laura S{\\'{a}}nchez Garc{\\'{\\i}}a and\n               T{\\^{a}}nya Amara de Felipe and\n               Andr{\\'{e}} Luiz Pires Guedes and\n               Diego Roberto Antunes and\n               Carlos Eduardo Iatskiu and\n               Eduardo Todt and\n               J. Bueno and\n               Daniela de F. Guilhermino Trindade and\n               D. A. Gon{\\c{c}}alves and\n               R. Canteri and\n               M. C. Canal and\n               M. A. M. Ferreira and\n               A. M. C. Silva and\n               L. Galv{\\~{a}}o and\n               L. Rodrigues},\n  editor    = {Margherita Antona and\n               Constantine Stephanidis},\n  title     = {Deaf Inclusion Through Brazilian Sign Language: {A} Computational\n               Architecture Supporting Artifacts and Interactive Applications and\n               Tools},\n  booktitle = {Universal Access in Human-Computer Interaction. Access to Media, Learning\n               and Assistive Environments - 15th International Conference, {UAHCI}\n               2021, Held as Part of the 23rd {HCI} International Conference, {HCII}\n               2021, Virtual Event, July 24-29, 2021, Proceedings, Part {II}},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {12769},\n  pages     = {167-185},\n  publisher = {Springer},\n  year      = {2021},\n  url       = {https://doi.org/10.1007/978-3-030-78095-1\\_14},\n  doi       = {10.1007/978-3-030-78095-1\\_14},\n  timestamp = {Tue, 13 Jul 2021 11:03:41 +0200},\n  biburl    = {https://dblp.org/rec/conf/hci/GarciaFGAITBTGC21.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Subclass Hierarchy on Circular Arc Bigraphs.\n \n \n \n \n\n\n \n M. Groshaus; A. L. P. Guedes; and F. S. Kolberg.\n\n\n \n\n\n\n In Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20), pages 28, 2020. \n \n\n\n\n
\n\n\n\n \n \n \"SubclassPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{GroshausGuedesKolberg2020,\n  author = {M. Groshaus and A. L. P. Guedes and F. S. Kolberg},\n  title = {Subclass Hierarchy on Circular Arc Bigraphs},\n  language = {english},\n  year = 2020,\n  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)},\n  pages = 28,\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Recognition of Biclique Graphs: What we know so far.\n \n \n \n \n\n\n \n M. Groshaus; and A. L. P. Guedes.\n\n\n \n\n\n\n In Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20), pages 27, Rio de Janeiro - online, 2020. \n \n\n\n\n
\n\n\n\n \n \n \"RecognitionPaper\n  \n \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{GroshausGuedes2020,\n  author = {M. Groshaus and A. L. P. Guedes},\n  title = {Recognition of Biclique Graphs: What we know so far},\n  language = {english},\n  year = 2020,\n  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)},\n  address = {Rio de Janeiro - online},\n  pages = 27,\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf},\n  pdf = {https://www.lawcg.mat.br/lawcg20/posters/LAWCG2020_poster_55.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Mutually Included Biclique Graphs of Interval Containment Bigraphs and Interval Bigraphs.\n \n \n \n \n\n\n \n E. P. Cruz; M. Groshaus; and A. L. P. Guedes.\n\n\n \n\n\n\n In Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20), pages 26, Rio de Janeiro - online, 2020. \n \n\n\n\n
\n\n\n\n \n \n \"MutuallyPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{CruzGroshausGuedes2020,\n  author = {E. P. Cruz and M. Groshaus and A. L. P. Guedes},\n  title = {Mutually Included Biclique Graphs of Interval Containment Bigraphs and Interval Bigraphs},\n  language = {english},\n  year = 2020,\n  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)},\n  address = {Rio de Janeiro - online},\n  pages = 26,\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n On the Helly Subclasses of Interval Bigraphs and Circular Arc Bigraphs.\n \n \n \n\n\n \n M. Groshaus; A. L. P. Guedes; and F. S. Kolberg.\n\n\n \n\n\n\n In Proceedings of the 14th Latin American Theoretical Informatics Symposium, São Paulo, 2020. \n \n\n\n\n
\n\n\n\n \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{GroshausGuedesKolbergLATIN2020,\n   author       = {M. Groshaus and A. L. P. Guedes and F. S. Kolberg},\n   title         = {On  the Helly  Subclasses of  Interval Bigraphs  and\n                  Circular Arc Bigraphs},\n   booktitle    =  {Proceedings of  the 14th Latin  American Theoretical\n                  Informatics Symposium},\n   year         = {2020},\n   address      = {São Paulo},\n   _keywords    = {Universal2016}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Edge-colouring graphs with bounded local degree sums.\n \n \n \n \n\n\n \n L. M. Zatesko; A. Zorzi; R. Carmo; and A. L. P. Guedes.\n\n\n \n\n\n\n Discrete Applied Mathematics, 281: 268-283. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"Edge-colouringPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 8 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{Zatesko2020,\n   title        = {Edge-colouring graphs with bounded local degree sums},\n   journal      = {Discrete Applied Mathematics},\n   volume       = {281},\n   pages        = {268-283},\n   year         = {2020},\n   _keywords    = {Universal2016},\n   _note        = {SI: LAGOS’17},\n   issn         = {0166-218X},\n   doi          = {10.1016/j.dam.2020.03.044},\n   url                                                                 =\n                  {http://www.sciencedirect.com/science/article/pii/S0166218X20301438},\n   author        = {L.   M.  Zatesko  and A.   Zorzi and  R.  Carmo  and\n                  A. L. P. Guedes},\n   keywords     = {Colouring of  graphs and hypergraphs, Vertex degrees,\n                  Graph algorithms, Graph theory},\n   abstract     = {Deciding  if a general graph G with  maximum degree Δ\n                  is  Class 1  (Δ-edge-colourable)   is  an  NP-complete\n                  problem. Therefore,  for over 30 years  there has been\n                  much work  aimed at identifying graph  classes wherein\n                  Δ-edge-colourability       is      equivalent       to\n                  non-subgraph-overfullness, a polynomial-time decidable\n                  property. A  graph G  is said to  be subgraph-overfull\n                  (SO)  if it  has a  subgraph H  with the  same maximum\n                  degree as G and more  than Δ⌊|V(H)|∕2⌋ edges, which is\n                  a   sufficient  condition   for   G   to  be   Class 2\n                  (non-Δ-edge-colourable).  Let  X be  the class  of the\n                  graphs whose majors (vertices  of degree Δ) have local\n                  degree sum  at most Δ2−Δ  (by ‘local degree sum’  of a\n                  vertex  u  we mean  the  sum  of  the degrees  of  the\n                  neighbours of u). The class  X is a large graph class,\n                  in the sense  that almost every graph G is  in X, even\n                  given  that  the  majors  of G  induce  a  graph  with\n                  cycles. It follows from the definition that all graphs\n                  in X are non-SO and we show further that all graphs in\n                  X are in fact Class 1.  This implies that every vertex\n                  of a critical graph (a  connected Class 2 graph G such\n                  that χ′(G−e)<χ′(G) for every e∈E(G)) is adjacent to at\n                  least  two  majors  with  local degree  sum  at  least\n                  Δ2−Δ+1,  extending a  well-known result  by Vizing  of\n                  1965. The proof presented is constructive and yields a\n                  polynomial-time   edge-colouring  algorithm   for  all\n                  graphs in X.}\n}\n\n
\n
\n\n\n
\n Deciding if a general graph G with maximum degree Δ is Class 1 (Δ-edge-colourable) is an NP-complete problem. Therefore, for over 30 years there has been much work aimed at identifying graph classes wherein Δ-edge-colourability is equivalent to non-subgraph-overfullness, a polynomial-time decidable property. A graph G is said to be subgraph-overfull (SO) if it has a subgraph H with the same maximum degree as G and more than Δ⌊|V(H)|∕2⌋ edges, which is a sufficient condition for G to be Class 2 (non-Δ-edge-colourable). Let X be the class of the graphs whose majors (vertices of degree Δ) have local degree sum at most Δ2−Δ (by ‘local degree sum’ of a vertex u we mean the sum of the degrees of the neighbours of u). The class X is a large graph class, in the sense that almost every graph G is in X, even given that the majors of G induce a graph with cycles. It follows from the definition that all graphs in X are non-SO and we show further that all graphs in X are in fact Class 1. This implies that every vertex of a critical graph (a connected Class 2 graph G such that χ′(G−e)<χ′(G) for every e∈E(G)) is adjacent to at least two majors with local degree sum at least Δ2−Δ+1, extending a well-known result by Vizing of 1965. The proof presented is constructive and yields a polynomial-time edge-colouring algorithm for all graphs in X.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Biclique Graphs of $K_3$-free Graphs and Bipartite Graphs.\n \n \n \n \n\n\n \n Marina Groshaus; and André Luiz Pires Guedes.\n\n\n \n\n\n\n CoRR, abs/2006.00040. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"BicliquePaper\n  \n \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{GroshausGuedes2020,\n   title        =  {Biclique Graphs  of $K_3$-free Graphs  and Bipartite\n                  Graphs},\n   author       = {Marina Groshaus and André Luiz Pires Guedes},\n   year         = {2020},\n   eprint       = {2006.00040},\n   archiveprefix= {arXiv},\n   primaryclass = {cs.DM},\n   journal      = {CoRR},\n   volume       = {abs/2006.00040},\n   url          = {https://arxiv.org/abs/2006.00040}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Biclique Graphs of Interval Bigraphs.\n \n \n \n \n\n\n \n E. P. Cruz; M. Groshaus; A. L. P. Guedes; and J. P. Puppo.\n\n\n \n\n\n\n Discrete Applied Mathematics, 281: 134-143. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"BicliquePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\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
@Article{CruzGroshausGuedesPuppo2020,\n   title        = {Biclique Graphs of Interval Bigraphs},\n   journal      = {Discrete Applied Mathematics},\n   volume       = {281},\n   pages        = {134-143},\n   year         = {2020},\n   issn         = {0166-218X},\n   url                                                                 =\n                  {http://www.sciencedirect.com/science/article/pii/S0166218X20300755},\n   author       = {E.  P. Cruz and M.  Groshaus and A. L.  P. Guedes and\n                  J. P. Puppo},\n   _keywords    = {Universal2016},\n   _note        = {SI: LAGOS’17},\n   doi          = {10.1016/j.dam.2020.02.010},\n   keywords      =  {Bicliques,   Biclique  graphs,  Interval  bigraphs,\n                  Bipartite permutation graphs, Co-comparability graphs},\n   abstract     = {The biclique graph KB(G) is the intersection graph of\n                  all the bicliques of a graph G. The aim of our work is\n                  to  recognize  graphs  that  are  biclique  graphs  of\n                  interval bigraphs  (IBG). In this paper  we prove that\n                  KB(IBG)⊂K1,4-free  co-comparability  graphs.  We  also\n                  study the class of  biclique graphs of proper interval\n                  bigraphs (PIB). Recall that  PIB is equal to the class\n                  of bipartite  permutation graphs  (BPG). We  present a\n                  characterization  of  the  class KB(PIB)  and  of  the\n                  biclique graphs of  a subclass of PIB that  leads to a\n                  polynomial time recognition algorithm. We also present\n                  characterizations of  biclique graphs of  some classes\n                  such as  complete graphs, trees and  graphs with girth\n                  at least 5.}\n}\n\n
\n
\n\n\n
\n The biclique graph KB(G) is the intersection graph of all the bicliques of a graph G. The aim of our work is to recognize graphs that are biclique graphs of interval bigraphs (IBG). In this paper we prove that KB(IBG)⊂K1,4-free co-comparability graphs. We also study the class of biclique graphs of proper interval bigraphs (PIB). Recall that PIB is equal to the class of bipartite permutation graphs (BPG). We present a characterization of the class KB(PIB) and of the biclique graphs of a subclass of PIB that leads to a polynomial time recognition algorithm. We also present characterizations of biclique graphs of some classes such as complete graphs, trees and graphs with girth at least 5.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (12)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Novel Procedures for Graph Edge-colouring.\n \n \n \n \n\n\n \n Leandro Zatesko; Renato Carmo; and André Guedes.\n\n\n \n\n\n\n In Prêmio de Tese do LI Simpósio Brasileiro de Pesquisa Operacional, Campinas, GALOÁ, 2019. SBPO\n Prêmio: melhor de tese de doutorado\n\n\n\n
\n\n\n\n \n \n \"NovelPaper\n  \n \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{Zatesko2019CTDSBPO,\n   author       = {Leandro Zatesko and Renato Carmo and André Guedes},\n   title        = {Novel Procedures for Graph Edge-colouring},\n   booktitle    = {Prêmio de Tese  do LI Simpósio Brasileiro de Pesquisa\n                  Operacional},\n   location     = {Limeira},\n   year         = {2019},\n   _keywords    = {Universal2016},\n   issn         = {0000-0000},\n   publisher    = {SBPO},\n   address      = {Campinas, GALOÁ},\n   note         = {Prêmio: melhor de tese de doutorado},\n   _keywords    = {Universal2016},\n   url                                                                 =\n                  {https://proceedings.science/sbpo-2019/papers/novel-procedures-for-graph-edge-colouring?lang=pt-br}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Novel Procedures for Graph Edge-colouring.\n \n \n \n \n\n\n \n Leandro Zatesko; Renato Carmo; and André Guedes.\n\n\n \n\n\n\n In Anais do XXXII Concurso de Teses e Dissertações, Porto Alegre, RS, Brasil, 2019. SBC\n \n\n\n\n
\n\n\n\n \n \n \"NovelPaper\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{Zatesko2019CTDSBC,\n   author       = {Leandro Zatesko and Renato Carmo and André Guedes},\n   title        = {Novel Procedures for Graph Edge-colouring},\n   booktitle    = {Anais do XXXII Concurso de Teses e Dissertações},\n   location     = {Belém},\n   year         = {2019},\n   _keywords    = {Universal2016},\n   issn         = {0000-0000},\n   publisher    = {SBC},\n   address      = {Porto Alegre, RS, Brasil},\n   _keywords    = {Universal2016},\n   doi          = {10.5753/ctd.2019.6331},\n   url                                                                 =\n                  {https://sol.sbc.org.br/index.php/ctd/article/view/6331}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planejamento de caminhos 3D: Comparação dos algoritmos por grade 3D e grafo de visibilidade.\n \n \n \n \n\n\n \n C. A. Santos; and A. L. P. Guedes.\n\n\n \n\n\n\n In III Workshop de Pesquisa em Computação dos Campos Gerais, volume 3, pages 116-121, Ponta Grossa, Paraná, 2019. \n \n\n\n\n
\n\n\n\n \n \n \"Planejamento pdf\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{SantosGuedesWPCCG2019,\n   author       = {C. A. Santos and A. L. P. Guedes},\n   title         =   {Planejamento  de   caminhos  3D:   Comparação  dos\n                  algoritmos por grade 3D e grafo de visibilidade},\n   booktitle    =  {III Workshop  de Pesquisa  em Computação  dos Campos\n                  Gerais},\n   issn         = {2526-1371},\n   volume       = {3},\n   year         = {2019},\n   pages        = {116-121},\n   address      = {Ponta Grossa, Paraná},\n   abstract      = {Este  artigo descreve  o andamento  de uma  pesquisa\n                  focada em planejamento de  caminhos 3D.  O objetivo da\n                  pesquisa é encontrar  algoritmos de baixa complexidade\n                  computacional, capazes de gerar  um caminho próximo do\n                  ótimo  em um  ambiente controlado.   Os algoritmos  em\n                  estudo possuem como entrada a descrição do ambiente, e\n                  como saída o melhor caminho  entre os pontos de origem\n                  e de  destino.  As  abordagens por visibilidade  e por\n                  grade são comparadas em  ambientes simples. Também são\n                  propostas melhorias.   Palavras-chave: Planejamento de\n                  caminhos 3D, Grafo de visibilidade 3D, Grade 3D.},\n   _keywords    = {Universal2016},\n   url_pdf      = {http://www.wpccg.pro.br/wpccg2019/papers/paper_25}\n}\n\n
\n
\n\n\n
\n Este artigo descreve o andamento de uma pesquisa focada em planejamento de caminhos 3D. O objetivo da pesquisa é encontrar algoritmos de baixa complexidade computacional, capazes de gerar um caminho próximo do ótimo em um ambiente controlado. Os algoritmos em estudo possuem como entrada a descrição do ambiente, e como saída o melhor caminho entre os pontos de origem e de destino. As abordagens por visibilidade e por grade são comparadas em ambientes simples. Também são propostas melhorias. Palavras-chave: Planejamento de caminhos 3D, Grafo de visibilidade 3D, Grade 3D.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Algoritmos de planejamento de caminhos 3D.\n \n \n \n\n\n \n Cleiton Santos; and A. L. P. Guedes.\n\n\n \n\n\n\n In Proc. Computer on the beach, Florianópolis, 2019. \n \n\n\n\n
\n\n\n\n \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{SantosGuedes2019,\n   title        = {Algoritmos de planejamento de caminhos {3D}},\n   author       = {Cleiton Santos and A. L. P. Guedes},\n   year         = 2019,\n   booktitle    = {Proc. Computer on the beach},\n   address      = {Florianópolis},\n   _keywords    = {Universal2016}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Seleção Online de Features em Streaming Baseada em Alpha-Investing Para Dados de Ataques DDoS.\n \n \n \n \n\n\n \n Alissar Moussa; Michele Nogueira; and André Guedes.\n\n\n \n\n\n\n In Anais do XXIV Workshop de Gerência e Operação de Redes e Serviços, pages 43-56, Porto Alegre, RS, Brasil, 2019. SBC\n \n\n\n\n
\n\n\n\n \n \n \"SeleçãoPaper\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{MoussaNogueiraGuedes2019,\n   author       = {Alissar Moussa and Michele Nogueira and André Guedes},\n   title        =  {Seleção Online de  Features em Streaming  Baseada em\n                  Alpha-Investing Para Dados de Ataques DDoS},\n   booktitle     = {Anais  do XXIV  Workshop de  Gerência e  Operação de\n                  Redes e Serviços},\n   location     = {Gramado},\n   year         = {2019},\n   keywords     = {},\n   issn         = {2595-2722},\n   pages        = {43-56},\n   publisher    = {SBC},\n   address      = {Porto Alegre, RS, Brasil},\n   doi          = {10.5753/wgrs.2019.7682},\n   url                                                                 =\n                  {https://sol.sbc.org.br/index.php/wgrs/article/view/7682}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Subclasses of Circular Arc Bigraphs.\n \n \n \n \n\n\n \n M. Groshaus; A. L. P. Guedes; and F. S. Kolberg.\n\n\n \n\n\n\n In III Workshop de Pesquisa em Computação dos Campos Gerais, volume 3, pages 68-73, Ponta Grossa, Paraná, 2019. \n \n\n\n\n
\n\n\n\n \n \n \"On pdf\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{GroshausGuedesKolbergWPCCG2019,\n   author       = {M. Groshaus and A. L. P. Guedes and F. S. Kolberg},\n   title        = {On Subclasses of Circular Arc Bigraphs},\n   booktitle    =  {III Workshop  de Pesquisa  em Computação  dos Campos\n                  Gerais},\n   issn         = {2526-1371},\n   volume       = {3},\n   year         = {2019},\n   pages        = {68-73},\n   address      = {Ponta Grossa, Paraná},\n   abstract     = {Circular arc (CA)  bigraphs, a bipartite variation of\n                  circular arc  graphs, are bipartite graphs  such that,\n                  for each  of its partite  sets, there is  a one-to-one\n                  correspondence between  its elements  and a  family of\n                  arcs  such  that  arcs   from  the  opposing  families\n                  intersect precisely  if the corresponding  vertices in\n                  the  graph are  neighbors. In  this paper,  we present\n                  results  about different  subclasses  of circular  arc\n                  bigraphs, including  Helly and proper CA  bigraphs, as\n                  well  as  circular   convex  bipartite  (CCB)  graphs.\n                  Keywords:  Graph   classes,  Characterization,  Helly,\n                  Circular  arc  bigraphs,   Circular  convex  bipartite\n                  graphs.},\n   _keywords    = {Universal2016},\n   url_pdf      = {http://www.wpccg.pro.br/wpccg2019/papers/paper_21}\n}\n\n
\n
\n\n\n
\n Circular arc (CA) bigraphs, a bipartite variation of circular arc graphs, are bipartite graphs such that, for each of its partite sets, there is a one-to-one correspondence between its elements and a family of arcs such that arcs from the opposing families intersect precisely if the corresponding vertices in the graph are neighbors. In this paper, we present results about different subclasses of circular arc bigraphs, including Helly and proper CA bigraphs, as well as circular convex bipartite (CCB) graphs. Keywords: Graph classes, Characterization, Helly, Circular arc bigraphs, Circular convex bipartite graphs.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Anatome: Anatomy Teaching and Learning Designed for All.\n \n \n \n\n\n \n Márcia Valéria Rodrigues Ferreira; Laura Sánchez García; André Luiz Pires Guedes; Djanira Aparecida da Luz Veronez; Celia Regina Alves de Araújo Sandrini; and Carlos Eduardo de Araujo.\n\n\n \n\n\n\n In Proc. SAC, pages 474-483, Limassol, Cyprus, 2019. \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{Ferreira2019SAC,\n   title        =  {Anatome: Anatomy Teaching and  Learning Designed for\n                  All},\n   author       = {Ferreira, Márcia  Valéria Rodrigues and García, Laura\n                  Sánchez  and Guedes,  André  Luiz  Pires and  Veronez,\n                  Djanira Aparecida  da Luz  and Sandrini,  Celia Regina\n                  Alves de Araújo and Araujo, Carlos Eduardo de},\n   year         = 2019,\n   booktitle    = {Proc. SAC},\n   address      = {Limassol, Cyprus},\n   pages        = {474-483},\n   doi          = {10.1145/3297280.3297324}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Optimization System for Dynamic Flight Planning for Groups of Drones using Cooperation with Mobile Recharge Bases by Means of Multiagent System and Recursive Auctions.\n \n \n \n\n\n \n Robison C. Brito; José F. Loureiro; Eduardo Todt; and Andre L. P. Guedes.\n\n\n \n\n\n\n In 2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC), Milwaukee, Wisconsin, USA, 2019. IEEE\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{Brito2019,\n   title        =  {Optimization System for Dynamic  Flight Planning for\n                  Groups  of   Drones  using  Cooperation   with  Mobile\n                  Recharge  Bases  by  Means of  Multiagent  System  and\n                  Recursive Auctions},\n   author       =  {Robison C.  Brito  and José F. Loureiro  and Eduardo\n                  Todt and Andre L. P. Guedes},\n   booktitle     =   {2019  IEEE  43rd  Annual   Computer  Software  and\n                  Applications Conference (COMPSAC)},\n   publisher    = {IEEE},\n   year         = {2019},\n   address      = {Milwaukee, Wisconsin, USA},\n   _keywords    = {Universal2016},\n   doi          = {10.1109/COMPSAC.2019.10262}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Connectivity-based Decomposition for Graph Edge-colouring.\n \n \n \n \n\n\n \n Leandro Zatesko; João P. W. Bernardi; Sheila M. Almeida; Renato Carmo; and André L. P. Guedes.\n\n\n \n\n\n\n Matemática Contemporânea, 46: 156-164. 2019.\n 2018 – 8th Latin-American Workshop on Cliques in Graphs\n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n \n \"A pdf\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{ZateskoBernardiAlmeidaCarmoGuedes2019,\n   author       =  {Leandro Zatesko and  João P. W. Bernardi  and Sheila\n                  M. de Almeida and Renato Carmo and André L. P. Guedes},\n   title          =  {A   Connectivity-based  Decomposition   for  Graph\n                  Edge-colouring},\n   journal      = {Matemática Contemporânea},\n   issn         = {2317-6636},\n   volume       = {46},\n   year         = {2019},\n   abstract      = {We  show how  the  problem of  computing an  optimal\n                  edge-colouring of a graph G can be decomposed into the\n                  problem  of computing  optimal edge-colourings  of the\n                  biconnected  components of  G. That  is, once  optimal\n                  edge-colourings  of  the  biconnected  components  are\n                  independently   given,  they   can   be  adjusted   in\n                  polynomial  time  in  order   to  compose  an  optimal\n                  edge-colouring  of the  whole graph  G with  no colour\n                  conflicts. We use this  decomposition strategy to show\n                  that   a   long-standing   conjecture   (proposed   by\n                  Figueiredo,  Meidanis,  and  Mello  in  mid-1990s)  on\n                  edge-colouring chordal graphs of  odd maximum degree ∆\n                  holds when  ∆ =  3.  We discuss  further decomposition\n                  algorithms for graph edge-colouring.},\n   publisher    = {Sociedade Brasileira de Matemática},\n   pages        = {156-164},\n   doi          = {http://doi.org/10.21711/231766362020/rmc4616},\n   _keywords    = {Universal2016},\n   url          = {https://mc.sbm.org.br/volumes/volume-46/},\n   url_pdf                                                             =\n                  {https://mc.sbm.org.br/wp-content/uploads/sites/15/2019/12/P16.pdf},\n   note          = {2018  – 8th  Latin-American Workshop  on Cliques  in\n                  Graphs}\n}\n\n
\n
\n\n\n
\n We show how the problem of computing an optimal edge-colouring of a graph G can be decomposed into the problem of computing optimal edge-colourings of the biconnected components of G. That is, once optimal edge-colourings of the biconnected components are independently given, they can be adjusted in polynomial time in order to compose an optimal edge-colouring of the whole graph G with no colour conflicts. We use this decomposition strategy to show that a long-standing conjecture (proposed by Figueiredo, Meidanis, and Mello in mid-1990s) on edge-colouring chordal graphs of odd maximum degree ∆ holds when ∆ = 3. We discuss further decomposition algorithms for graph edge-colouring.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the chromatic index of complementary prisms.\n \n \n \n \n\n\n \n Leandro Zatesko; Renato Carmo; André Guedes; Alesom Zorzi; Raphael Machado; and Celina Figueiredo.\n\n\n \n\n\n\n Acta Mathematica Universitatis Comenianae, 88(3): 1071-1077. 2019.\n EUROCOMB'2019\n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{ZCGZMF2019,\n   author       = {Leandro Zatesko and Renato Carmo and André Guedes and\n                  Alesom   Zorzi   and   Raphael  Machado   and   Celina\n                  Figueiredo},\n   title        = {On the chromatic index of complementary prisms},\n   journal      = {Acta Mathematica Universitatis Comenianae},\n   volume       = {88},\n   number       = {3},\n   year         = {2019},\n   _keywords    = {Universal2016},\n   abstract      =  {This  paper addresses  the  edge-colouring  problem\n                  restricted  to   the  graph  class   of  complementary\n                  prisms. This graph class  includes the Petersen graph,\n                  a  very  important and  widely  studied  graph in  the\n                  context of graph edge-colouring and remarkable related\n                  open questions,  such as  the Overfull  Conjecture. We\n                  prove  that all  non-regular complementary  prisms are\n                  Class  1  and we  conjecture  that  the only  Class  2\n                  regular complementary prism is  the Petersen graph. We\n                  present evidences for this conjecture.},\n   issn         = {0862-9544},\n   pages        = {1071-1077},\n   url                                                                 =\n                  {http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1208},\n   note         = {EUROCOMB'2019}\n}\n\n
\n
\n\n\n
\n This paper addresses the edge-colouring problem restricted to the graph class of complementary prisms. This graph class includes the Petersen graph, a very important and widely studied graph in the context of graph edge-colouring and remarkable related open questions, such as the Overfull Conjecture. We prove that all non-regular complementary prisms are Class 1 and we conjecture that the only Class 2 regular complementary prism is the Petersen graph. We present evidences for this conjecture.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Subclasses of Circular-Arc Bigraphs: Helly, Normal and Proper.\n \n \n \n \n\n\n \n Marina Groshaus; André L.P. Guedes; and Fabricio Schiavon Kolberg.\n\n\n \n\n\n\n Electronic Notes in Theoretical Computer Science, 346: 497-509. 2019.\n The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019)\n\n\n\n
\n\n\n\n \n \n \"SubclassesPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\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
@Article{Kolberg2019,\n   title        =  {Subclasses of  Circular-Arc Bigraphs:  Helly, Normal\n                  and Proper},\n   journal      = {Electronic Notes in Theoretical Computer Science},\n   volume       = {346},\n   pages        = {497-509},\n   year         = {2019},\n   note         =  {The proceedings of  Lagos 2019, the tenth  Latin and\n                  American Algorithms, Graphs and Optimization Symposium\n                  (LAGOS 2019)},\n   _keywords    = {Universal2016},\n   organization = {UFMG},\n   issn         = {1571-0661},\n   doi          = {https://doi.org/10.1016/j.entcs.2019.08.044},\n   url                                                                 =\n                  {http://www.sciencedirect.com/science/article/pii/S1571066119300957},\n   author       =  {Marina Groshaus and  André L.P. Guedes  and Fabricio\n                  Schiavon Kolberg},\n   keywords     =  {Biclique, Circular-arc, recognition,  Helly, Normal,\n                  Proper},\n   abstract      = {The  class of  circular-arc graphs,  as well  as its\n                  Helly,  normal,   and  proper  subclasses,   has  been\n                  extensively studied  in the  literature.  Circular-arc\n                  bigraphs,  a   bipartite  variation   on  circular-arc\n                  graphs, remains  a relatively  new field, with  only a\n                  few  studies on  the  class and  its  proper and  unit\n                  subclasses  existing. In  this paper,  we introduce  a\n                  Helly subclass for circular-arc bigraphs, based on the\n                  concept  of bipartite-Helly  families,  and provide  a\n                  polynomial-time recognition algorithm  for it. We also\n                  introduce an  alternative proper  circular-arc bigraph\n                  subclass to the one in  the literature, as well as two\n                  different normal circular-arc bigraph subclasses based\n                  on the  definition of  normal circular-arc  graphs. We\n                  present  containment relations  between the  different\n                  proper and normal classes.}\n}\n\n
\n
\n\n\n
\n The class of circular-arc graphs, as well as its Helly, normal, and proper subclasses, has been extensively studied in the literature. Circular-arc bigraphs, a bipartite variation on circular-arc graphs, remains a relatively new field, with only a few studies on the class and its proper and unit subclasses existing. In this paper, we introduce a Helly subclass for circular-arc bigraphs, based on the concept of bipartite-Helly families, and provide a polynomial-time recognition algorithm for it. We also introduce an alternative proper circular-arc bigraph subclass to the one in the literature, as well as two different normal circular-arc bigraph subclasses based on the definition of normal circular-arc graphs. We present containment relations between the different proper and normal classes.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal.\n \n \n \n \n\n\n \n João Pedro W. Bernardi; Murilo V. G. Silva; André Luiz P. Guedes; and Leandro M. Zatesko.\n\n\n \n\n\n\n Electronic Notes in Theoretical Computer Science, 346: 125-133. 2019.\n The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019)\n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \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
@Article{Bernardi2019,\n   title        = {The Chromatic Index  of Proper Circular-arc Graphs of\n                  Odd Maximum Degree which are Chordal},\n   journal      = {Electronic Notes in Theoretical Computer Science},\n   volume       = {346},\n   pages        = {125-133},\n   year         = {2019},\n   note         =  {The proceedings of  Lagos 2019, the tenth  Latin and\n                  American Algorithms, Graphs and Optimization Symposium\n                  (LAGOS 2019)},\n   _keywords    = {Universal2016},\n   organization = {UFMG},\n   issn         = {1571-0661},\n   doi          = {https://doi.org/10.1016/j.entcs.2019.08.012},\n   url                                                                 =\n                  {http://www.sciencedirect.com/science/article/pii/S1571066119300623},\n   author       = {João Pedro W. Bernardi and Murilo V. G.  da Silva and\n                  André Luiz P. Guedes and Leandro M. Zatesko},\n   keywords        =   {Pullback,    circular-arc,   chromatic    index,\n                  edge-coloring, chordal},\n   abstract      = {The  complexity  of the  edge-coloring problem  when\n                  restricted  to chordal  graphs, listed  in the  famous\n                  D. Johnson's NP-completeness column  of 1985, is still\n                  undetermined.  A  conjecture of  Figueiredo, Meidanis,\n                  and Mello, open since the  late 1990s, states that all\n                  chordal graphs of odd  maximum degree Δ have chromatic\n                  index  equal to  Δ. This  conjecture has  already been\n                  proved  for  proper  interval graphs  (a  subclass  of\n                  proper circular-arc  ∩ chordal graphs)  of odd Δ  by a\n                  technique  called  pullback.   Using a  new  technique\n                  called  multi-pullback, we  show that  this conjecture\n                  holds for all proper  circular-arc ∩ chordal graphs of\n                  odd Δ. We also believe that this technique can be used\n                  for  further  results  on  edge-coloring  other  graph\n                  classes.}\n}\n\n
\n
\n\n\n
\n The complexity of the edge-coloring problem when restricted to chordal graphs, listed in the famous D. Johnson's NP-completeness column of 1985, is still undetermined. A conjecture of Figueiredo, Meidanis, and Mello, open since the late 1990s, states that all chordal graphs of odd maximum degree Δ have chromatic index equal to Δ. This conjecture has already been proved for proper interval graphs (a subclass of proper circular-arc ∩ chordal graphs) of odd Δ by a technique called pullback. Using a new technique called multi-pullback, we show that this conjecture holds for all proper circular-arc ∩ chordal graphs of odd Δ. We also believe that this technique can be used for further results on edge-coloring other graph classes.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Recolouring Procedure for Total Colouring.\n \n \n \n \n\n\n \n L. M. Zatesko; R. Carmo; and A. L. P. Guedes.\n\n\n \n\n\n\n In Proc. VIII Latin American Workshop on Cliques in Graphs, pages 31, Rio de Janeiro, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \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{ZateskoCarmoGuedesLAWCG2018,\n   title        = {A Recolouring Procedure for Total Colouring},\n   author       = {L. M. Zatesko and R. Carmo and A. L. P. Guedes},\n   year         = 2018,\n   language     = {english},\n   booktitle    =  {Proc.  VIII  Latin American  Workshop on  Cliques in\n                  Graphs},\n   address      = {Rio de Janeiro},\n   pages        = {31},\n   _keywords    = {Universal2016},\n   url                                                                 =\n                  {http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Upper Bounds for the Total Chromatic Number of Join Graphs and Cobipartite Graphs.\n \n \n \n\n\n \n Leandro M. Zatesko; Renato Carmo; and André L. P. Guedes.\n\n\n \n\n\n\n In Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,, pages 247-253, 2018. INSTICC, SciTePress\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
@InProceedings{ZateskoCarmoGuedesICORES2018,\n   author        =  {Leandro M.   Zatesko  and  Renato Carmo  and  André\n                  L. P. Guedes},\n   title        = {Upper  Bounds for the Total Chromatic  Number of Join\n                  Graphs and Cobipartite Graphs},\n   booktitle    =  {Proceedings of  the 7th International  Conference on\n                  Operations Research and Enterprise Systems - Volume 1:\n                  ICORES,},\n   year         = {2018},\n   pages        = {247-253},\n   publisher    = {SciTePress},\n   organization = {INSTICC},\n   doi          = {10.5220/0006627102470253},\n   isbn         = {978-989-758-285-1},\n   _keywords    = {Universal2016}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Biclique Graph of $K_3$-free Graphs are the Square of Some Graph.\n \n \n \n \n\n\n \n Marina Groshaus; and André L. P. Guedes.\n\n\n \n\n\n\n In Proc. VIII Latin American Workshop on Cliques in Graphs, pages 25, Rio de Janeiro, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \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{GroshausGuedesLAWCG2018,\n   title        =  {The Biclique  Graph of  {$K_3$}-free Graphs  are the\n                  Square of Some Graph},\n   author       = {Marina Groshaus and André L. P. Guedes},\n   year         = 2018,\n   language     = {english},\n   booktitle    =  {Proc.  VIII  Latin American  Workshop on  Cliques in\n                  Graphs},\n   address      = {Rio de Janeiro},\n   pages        = {25},\n   _keywords    = {Universal2016},\n   url                                                                 =\n                  {http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Circular-arc Bigraphs and the Helly subclass.\n \n \n \n \n\n\n \n Marina Groshaus; André Luiz Pires Guedes; and Fabricio Schiavon Kolberg.\n\n\n \n\n\n\n In Proc. VIII Latin American Workshop on Cliques in Graphs, pages 60, Rio de Janeiro, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"Circular-arcPaper\n  \n \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{GroshausGuedesKolbergLAWCG2018,\n   title        = {Circular-arc Bigraphs and the Helly subclass},\n   author        = {Marina  Groshaus  and André  Luiz  Pires Guedes  and\n                  Fabricio Schiavon Kolberg},\n   year         = 2018,\n   language     = {english},\n   booktitle    =  {Proc.  VIII  Latin American  Workshop on  Cliques in\n                  Graphs},\n   address      = {Rio de Janeiro},\n   pages        = {60},\n   _keywords    = {Universal2016},\n   url                                                                 =\n                  {http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Biclique Graphs of Interval Bigraphs and Circular-arc Bigraphs.\n \n \n \n \n\n\n \n E. P. Cruz; M. Groshaus; and A. L. P. Guedes.\n\n\n \n\n\n\n In Proc. VIII Latin American Workshop on Cliques in Graphs, pages 68, Rio de Janeiro, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"BicliquePaper\n  \n \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{CruzGroshausGuedesLAWCG2018,\n   title        = {Biclique Graphs of Interval Bigraphs and Circular-arc\n                  Bigraphs},\n   author       = {E. P. Cruz and M. Groshaus and A. L. P. Guedes},\n   year         = 2018,\n   language     = {english},\n   booktitle    =  {Proc.  VIII  Latin American  Workshop on  Cliques in\n                  Graphs},\n   address      = {Rio de Janeiro},\n   pages        = {68},\n   _keywords    = {Universal2016},\n   url                                                                 =\n                  {http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On a conjecture on edge-colouring join graphs.\n \n \n \n \n\n\n \n Leandro M. Zatesko; Renato Carmo; and André L. P. Guedes.\n\n\n \n\n\n\n In II Workshop de Pesquisa em Computação dos Campos Gerais, volume 2, pages 69-72, Ponta Grossa, Paraná, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"On pdf\n  \n \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{ZateskoCarmoGuedesWPCCG2017,\n   author        =  {Leandro M.   Zatesko  and  Renato Carmo  and  André\n                  L. P. Guedes},\n   title        = {On a conjecture on edge-colouring join graphs},\n   booktitle     = {II  Workshop de  Pesquisa em  Computação dos  Campos\n                  Gerais},\n   issn         = {2526-1371},\n   volume       = {2},\n   year         = {2017},\n   pages        = {69-72},\n   address      = {Ponta Grossa, Paraná},\n   _keywords    = {Universal2016},\n   url_pdf      = {http://www.wpccg.pro.br/wpccg2017/papers/paper_16}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Edge-colouring of triangle-free graphs with no proper majors.\n \n \n \n \n\n\n \n Leandro M. Zatesko; Renato Carmo; and André L. P. Guedes.\n\n\n \n\n\n\n In II Encontro de Teoria da Computação - ETC, São Paulo, Brasil, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"Edge-colouringPaper\n  \n \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{ZateskoCarmoGuedesETC2017,\n   author        =  {Leandro M.   Zatesko  and  Renato Carmo  and  André\n                  L. P. Guedes},\n   title        = {Edge-colouring of triangle-free graphs with no proper\n                  majors},\n   year         = 2017,\n   booktitle    = {II Encontro de Teoria da Computação - ETC, São Paulo,\n                  Brasil},\n   _keywords    = {Universal2016},\n   url                                                                 =\n                  {http://csbc2017.mackenzie.br/public/files/2-etc/artigos/13.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Biclique edge-choosability in some classes of graphs.\n \n \n \n \n\n\n \n Gabriel A. G. Sobral; Marina Groshaus; and André L. P. Guedes.\n\n\n \n\n\n\n In II Encontro de Teoria da Computação - ETC, São Paulo, Brasil, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"BicliquePaper\n  \n \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{SobralGroshausGuedesETC2017,\n   author       = {Gabriel  A. G.  Sobral and Marina  Groshaus and André\n                  L. P. Guedes},\n   title        = {Biclique edge-choosability in some classes of graphs},\n   year         = 2017,\n   booktitle    = {II Encontro de Teoria da Computação - ETC, São Paulo,\n                  Brasil},\n   _keywords    = {Universal2016},\n   url                                                                 =\n                  {http://csbc2017.mackenzie.br/public/files/2-etc/artigos/4.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Algoritmos de Varredura para Listagem de Bicliques Maximais em Modelos Bipartidos de Intervalos e Arco-Circulares.\n \n \n \n \n\n\n \n E. P. Cruz; M. Groshaus; and A. L. P. Guedes.\n\n\n \n\n\n\n In II Workshop de Pesquisa em Computação dos Campos Gerais, volume 2, pages 9-12, Ponta Grossa, Paraná, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"Algoritmos pdf\n  \n \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{CruzGroshausGuedesWPCCG2017,\n   author       = {E. P. Cruz and M. Groshaus and A. L. P. Guedes},\n   title        =  {Algoritmos de  Varredura para Listagem  de Bicliques\n                  Maximais  em   Modelos  Bipartidos  de   Intervalos  e\n                  Arco-Circulares},\n   booktitle     = {II  Workshop de  Pesquisa em  Computação dos  Campos\n                  Gerais},\n   issn         = {2526-1371},\n   volume       = {2},\n   year         = {2017},\n   pages        = {9-12},\n   address      = {Ponta Grossa, Paraná},\n   _keywords    = {Universal2016},\n   url_pdf      = {http://www.wpccg.pro.br/wpccg2017/papers/paper_6}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Biclique graph of bipartite permutation graphs.\n \n \n \n \n\n\n \n M. Groshaus; A. L. P. Guedes; and J. P. Puppo.\n\n\n \n\n\n\n Electronic Notes in Discrete Mathematics, 62: 33-38. 2017.\n LAGOS'17 – IX Latin and American Algorithms, Graphs and Optimization Symposium\n\n\n\n
\n\n\n\n \n \n \"BicliquePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{GroshausGuedesPuppo2017,\n   title        = {Biclique graph of bipartite permutation graphs},\n   journal      = {Electronic Notes in Discrete Mathematics},\n   volume       = {62},\n   pages        = {33-38},\n   year         = {2017},\n   note         = {LAGOS'17 – {IX} Latin and American Algorithms, Graphs\n                  and Optimization Symposium},\n   issn         = {1571-0653},\n   doi          = {10.1016/j.endm.2017.10.007},\n   url                                                                 =\n                  {https://www.sciencedirect.com/science/article/pii/S1571065317302457},\n   abstract_url                                                        =\n                  {https://lipn.univ-paris13.fr/Lagos2017/abstracts_final_short.pdf},\n   author       = {M. Groshaus and A. L. P. Guedes and J. P. Puppo},\n   keywords     = {Bicliques},\n   keywords     = {Biclique graphs},\n   keywords     = {Bipartite permutation graphs},\n   _keywords    = {Universal2016},\n   abstract     = {Abstract The biclique graph KB(G) is the intersection\n                  graph of bicliques  of a graph G. The aim  of our work\n                  is  to recognize  graphs that  are biclique  graphs of\n                  bipartite permutation  graphs. In this paper  we prove\n                  that  the biclique  graph of  a bipartite  permutation\n                  graph is a K1,4-free interval  graph, and we present a\n                  characterization of such graphs and a characterization\n                  of  a  subclass  that   leads  to  a  polynomial  time\n                  recognition algorithm.}\n}\n\n
\n
\n\n\n
\n Abstract The biclique graph KB(G) is the intersection graph of bicliques of a graph G. The aim of our work is to recognize graphs that are biclique graphs of bipartite permutation graphs. In this paper we prove that the biclique graph of a bipartite permutation graph is a K1,4-free interval graph, and we present a characterization of such graphs and a characterization of a subclass that leads to a polynomial time recognition algorithm.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On star and biclique edge-colorings.\n \n \n \n \n\n\n \n Simone Dantas; Marina Groshaus; André L. P. Guedes; Raphael C. S. Machado; Bernard Ries; and Diana Sasaki.\n\n\n \n\n\n\n International Transactions in Operational Research, 24(1–2): 339-346. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\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 \n \n\n\n\n
\n
@Article{DantasGroshausGuedesMachadoRiesSasaki2017,\n   author       = {Dantas, Simone and Groshaus, Marina and Guedes, André\n                  L. P. and Machado, Raphael C. S. and Ries, Bernard and\n                  Sasaki, Diana},\n   title        = {On star and biclique edge-colorings},\n   journal      = {International Transactions in Operational Research},\n   issn         = {1475-3995},\n   volume       = {24},\n   number       = {1--2},\n   url          = {http://dx.doi.org/10.1111/itor.12307},\n   doi          = {10.1111/itor.12307},\n   pages        = {339-346},\n   keywords     = {star edge-coloring, biclique edge-coloring, NP-hard},\n   year         = {2017}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Results on Circular-Arc Bigraphs.\n \n \n \n \n\n\n \n Fabricio S. Kolberg; Marina Groshaus; André L. P. Guedes; and Renato J. S. Carmo.\n\n\n \n\n\n\n In Anais do XXXVI Congresso da Sociedade Brasileira de Computação, Porto Alegre, Brasil, pages 864-867, Porto Alegre, 2016. EDIPUCRS\n I Encontro de Teoria da Computação - ETC\n\n\n\n
\n\n\n\n \n \n \"ResultsPaper\n  \n \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{KolbergGroshausGuedesCarmoETC2016,\n   author       =  {Fabricio S.  Kolberg  and Marina Groshaus  and André\n                  L. P. Guedes and Renato J. S. Carmo},\n   title        = {Results on Circular-Arc Bigraphs},\n   year         = 2016,\n   booktitle    = {Anais  do XXXVI Congresso da  Sociedade Brasileira de\n                  Computação, Porto Alegre, Brasil},\n   note         = {I Encontro de Teoria da Computação - ETC},\n   pages        = {864-867},\n   address      = {Porto Alegre},\n   publisher    = {EDIPUCRS},\n   url                                                                 =\n                  {https://editora.pucrs.br//anais/csbc/assets/2016/anais-csbc-2016.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Biclique Graph of a Subclass of Split Graphs.\n \n \n \n \n\n\n \n M. Groshaus; A. L. P. Guedes; and J. P. Puppo.\n\n\n \n\n\n\n In Latin American Workshop on cliques in graphs, La Plata, Argentina, pages 22, 2016. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \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{GroshausGuedesPuppo2016,\n   title        = {The Biclique Graph of a Subclass of Split Graphs},\n   author       = {M. Groshaus and A. L. P. Guedes and J. P. Puppo},\n   pages        = {22},\n   year         = 2016,\n   booktitle     = {Latin  American Workshop  on cliques  in graphs,  La\n                  Plata, Argentina},\n   url                                                                 =\n                  {http://www.mate.unlp.edu.ar/~liliana/lawclique_2016/prolist.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Almost every graph is divergent under the biclique operator.\n \n \n \n \n\n\n \n Marina Groshaus; André L. P. Guedes; and Leandro Montero.\n\n\n \n\n\n\n Discrete Applied Mathematics, 201: 130-140. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"AlmostPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{GroshausGuedesMontero2016,\n   title        =  {Almost every graph  is divergent under  the biclique\n                  operator},\n   journal      = {Discrete Applied Mathematics},\n   volume       = {201},\n   number       = {},\n   pages        = {130-140},\n   year         = {2016},\n   note         = {},\n   issn         = {0166-218X},\n   doi          = {10.1016/j.dam.2015.07.022},\n   url                                                                 =\n                  {http://www.sciencedirect.com/science/article/pii/S0166218X15003753},\n   author       =  {Marina Groshaus and  André L. P. Guedes  and Leandro\n                  Montero},\n   keywords     = {Bicliques},\n   keywords     = {Biclique graphs},\n   keywords     = {False-twin-free graphs},\n   keywords     = {Iterated graph operators},\n   keywords     = {Graph dynamics},\n   abstract     = {Abstract A biclique of a graph G is a maximal induced\n                  complete bipartite subgraph of  G . The biclique graph\n                  of G denoted by K B (  G ) , is the intersection graph\n                  of all the bicliques of G  . The biclique graph can be\n                  thought  as  an  operator  between the  class  of  all\n                  graphs. The iterated biclique graph  of G denoted by K\n                  B k  ( G  ) ,  is the graph  obtained by  applying the\n                  biclique  operator  k successive  times  to  G .   The\n                  associated problem is deciding  whether an input graph\n                  converges, diverges or is  periodic under the biclique\n                  operator  when  k  grows to  infinity.   All  possible\n                  behaviors were characterized recently and an O ( n 4 )\n                  algorithm for deciding the behavior of any graph under\n                  the biclique operator was also  given. In this work we\n                  prove new  structural results  of biclique  graphs. In\n                  particular, we prove  that every false-twin-free graph\n                  with at least 13  vertices is divergent. These results\n                  lead  to a  linear time  algorithm to  solve the  same\n                  problem.},\n   keywords     = {kwARG}\n}\n\n
\n
\n\n\n
\n Abstract A biclique of a graph G is a maximal induced complete bipartite subgraph of G . The biclique graph of G denoted by K B ( G ) , is the intersection graph of all the bicliques of G . The biclique graph can be thought as an operator between the class of all graphs. The iterated biclique graph of G denoted by K B k ( G ) , is the graph obtained by applying the biclique operator k successive times to G . The associated problem is deciding whether an input graph converges, diverges or is periodic under the biclique operator when k grows to infinity. All possible behaviors were characterized recently and an O ( n 4 ) algorithm for deciding the behavior of any graph under the biclique operator was also given. In this work we prove new structural results of biclique graphs. In particular, we prove that every false-twin-free graph with at least 13 vertices is divergent. These results lead to a linear time algorithm to solve the same problem.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Extensões e caracterizações de buscas para hipergrafos com arestas múltiplas.\n \n \n \n \n\n\n \n Silvio Luiz Bragatto Boss; Jair Donadelli; and André Luiz Pires Guedes.\n\n\n \n\n\n\n Revista Brasileira de Computação Aplicada, 8(2). 2016.\n \n\n\n\n
\n\n\n\n \n \n \"ExtensõesPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \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{BossDonadelliGuedes2016,\n   author        = {Silvio  Luiz Bragatto  Boss and  Jair Donadelli  and\n                  André Luiz Pires Guedes},\n   title          =  {Extensões   e  caracterizações   de  buscas   para\n                  hipergrafos com arestas múltiplas},\n   journal      = {Revista Brasileira de Computação Aplicada},\n   volume       = {8},\n   number       = {2},\n   year         = {2016},\n   url          = {http://seer.upf.br/index.php/rbca/article/view/5602},\n   doi          = {10.5335/rbca.v8i2.5602},\n   keywords     = {Algoritmos de buscas, Hipergrafos, Teoria dos grafos},\n   abstract     =  {Busca em grafos  é uma das técnicas  mais utilizadas\n                  para  o  projeto de  algoritmos  em  grafos.  Em  tais\n                  buscas, a  ordem em  que os vértices  de um  grafo são\n                  visitados definem uma enumeração nos vértices do grafo\n                  e uma caracterização dessas enumerações que, de acordo\n                  com  a  estratégia usada  na  busca,  tem se  mostrado\n                  importante  nas aplicações  de  algoritmos em  grafos.\n                  Neste trabalho generalizamos o  conceito de busca e as\n                  caracterizações,  bem conhecidas  no  caso de  grafos,\n                  para o caso de hipergrafo}\n}\n\n
\n
\n\n\n
\n Busca em grafos é uma das técnicas mais utilizadas para o projeto de algoritmos em grafos. Em tais buscas, a ordem em que os vértices de um grafo são visitados definem uma enumeração nos vértices do grafo e uma caracterização dessas enumerações que, de acordo com a estratégia usada na busca, tem se mostrado importante nas aplicações de algoritmos em grafos. Neste trabalho generalizamos o conceito de busca e as caracterizações, bem conhecidas no caso de grafos, para o caso de hipergrafo\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n A Context-Based Collaborative Framework to Build Sign Language Databases by Real Users.\n \n \n \n\n\n \n D. R. Antunes; A. L. P. Guedes; and L. García.\n\n\n \n\n\n\n In 9th International Conference on Universal Access in Human-Computer Interaction, UAHCI, volume 9176, of LNCS, pages 327-338, Los Angeles, 2015. Springer\n Universal Access in Human-Computer Interaction\n\n\n\n
\n\n\n\n \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{AntunesGuedesGarcia2015,\n   author        = {Antunes,  D.  R.   and Guedes,  A.  L.   P.  and  L.\n                  García},\n   title        = {A Context-Based Collaborative Framework to Build Sign\n                  Language Databases by Real Users},\n   booktitle    =  {9th International Conference on  Universal Access in\n                  Human-Computer Interaction, UAHCI},\n   year         = 2015,\n   volume       = 9176,\n   series       = {LNCS},\n   pages        = {327-338},\n   address      = {Los Angeles},\n   publisher    = {Springer},\n   note         = {Universal Access in Human-Computer Interaction}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Malicious Nodes Identification for Complex Network Based on Local Views.\n \n \n \n \n\n\n \n Grazielle Vernize; André Luiz Pires Guedes; and Luiz Carlos Pessoa Albini.\n\n\n \n\n\n\n The Computer Journal, 58(10): 2476-2491. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"MaliciousPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{Vernize2015,\n   author       = {Vernize,  Grazielle and Guedes, André  Luiz Pires and\n                  Albini, Luiz Carlos Pessoa},\n   title        =  {Malicious Nodes  Identification for  Complex Network\n                  Based on Local Views},\n   volume       = {58},\n   number       = {10},\n   pages        = {2476-2491},\n   year         = {2015},\n   url          = {https://doi.org/10.1093/comjnl/bxu086},\n   doi          = {10.1093/comjnl/bxu086},\n   abstract     =  {Several social,  biological and  information systems\n                  can be  described through complex network  models. All\n                  complex networks  display common  structural features,\n                  such  as the  small-world  and scale-free  properties.\n                  However,  the  presence  of selfish  and/or  malicious\n                  nodes can  damage the  network operation, as  they may\n                  attack the network in several different ways, like not\n                  cooperating,  or inserting,  modifying or  eliminating\n                  information   in   the  network.    Trust   evaluation\n                  algorithms  are  a  useful incentive  for  encouraging\n                  selfish  nodes  to  collaborate  or  even  to  isolate\n                  malicious ones.   Nodes that refrain  from cooperation\n                  or present a malicious  behavior get lower trust value\n                  and may be penalized as  other nodes tend to cooperate\n                  only with highly trusted  ones. This paper presents an\n                  algorithm to calculate the  number of malicious and/or\n                  selfish nodes  in a network  based on the  local trust\n                  views that  each node has about  their neighbors.  The\n                  algorithm points  out to  the network  manager exactly\n                  which nodes  they are.   Simulation results  over four\n                  real complex networks demonstrate the effectiveness of\n                  the proposed approach.  In  fact, it presents an error\n                  margin  smaller  than  15%  for 35  000  malicious  or\n                  selfish nodes  in a network  of 70 000 nodes.   If the\n                  number of  malicious nodes goes under  5000, the error\n                  margin is around one node.},\n   eprint                                                              =\n                  {https://academic.oup.com/comjnl/article-pdf/58/10/2476/5094772/bxu086.pdf},\n   journal      = {The Computer Journal},\n   keywords     = {kwARG}\n}\n\n
\n
\n\n\n
\n Several social, biological and information systems can be described through complex network models. All complex networks display common structural features, such as the small-world and scale-free properties. However, the presence of selfish and/or malicious nodes can damage the network operation, as they may attack the network in several different ways, like not cooperating, or inserting, modifying or eliminating information in the network. Trust evaluation algorithms are a useful incentive for encouraging selfish nodes to collaborate or even to isolate malicious ones. Nodes that refrain from cooperation or present a malicious behavior get lower trust value and may be penalized as other nodes tend to cooperate only with highly trusted ones. This paper presents an algorithm to calculate the number of malicious and/or selfish nodes in a network based on the local trust views that each node has about their neighbors. The algorithm points out to the network manager exactly which nodes they are. Simulation results over four real complex networks demonstrate the effectiveness of the proposed approach. In fact, it presents an error margin smaller than 15% for 35 000 malicious or selfish nodes in a network of 70 000 nodes. If the number of malicious nodes goes under 5000, the error margin is around one node.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Comparison of Graph Invariants in Predicting Fullerene Stability.\n \n \n \n \n\n\n \n Thiago H. A. Lemos; and André L. P. Guedes.\n\n\n \n\n\n\n MATCH Commun. Math. Comput. Chem., 74(3): 533-560. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"ComparisonPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{LemosGuedes2015,\n   title         =   {Comparison  of  Graph  Invariants   in  Predicting\n                  Fullerene Stability},\n   journal      = {MATCH Commun. Math. Comput. Chem.},\n   _journal_name=  {Communications  in   Mathematical  and  in  Computer\n                  Chemistry},\n   volume       = {74},\n   number       = {3},\n   pages        = {533-560},\n   year         = {2015},\n   issn         = {0340-6253},\n   url                                                                 =\n                  {http://match.pmf.kg.ac.rs/electronic_versions/Match74/n3/match74n3_533-560.pdf},\n   author       = {Thiago H. de A. Lemos and André L. P. Guedes},\n   keywords     = {Graphs, fullerenes, stability, invariants},\n   abstract      = {Fullerenes  are  molecules  constituted entirely  by\n                  tertiary carbon atoms, forming a surface that contains\n                  only  pentagonal  and  hexagonal  faces.   This  paper\n                  presents   a  comparison   of  some   graph  theoretic\n                  invariants in the context  of predicting the stability\n                  of fullerenes.  In particular: the Fowler-Manolopoulos\n                  criterion,  the   diameter,  the  Wiener   index,  the\n                  bipartite edge  frustration, the  independence number,\n                  the number of perfect matchings, the Fries number, and\n                  the  Taylor  number.   With  three  exceptions,  their\n                  values were computed for each fullerene isomer with up\n                  to  130 vertices,  and each  isolated pentagon  isomer\n                  with up to 160 vertices},\n   keywords     = {kwARG}\n}\n\n
\n
\n\n\n
\n Fullerenes are molecules constituted entirely by tertiary carbon atoms, forming a surface that contains only pentagonal and hexagonal faces. This paper presents a comparison of some graph theoretic invariants in the context of predicting the stability of fullerenes. In particular: the Fowler-Manolopoulos criterion, the diameter, the Wiener index, the bipartite edge frustration, the independence number, the number of perfect matchings, the Fries number, and the Taylor number. With three exceptions, their values were computed for each fullerene isomer with up to 130 vertices, and each isolated pentagon isomer with up to 160 vertices\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Um Modelo de Falhas em Cascata para Sistemas Globais de Gerenciamento de Identidades.\n \n \n \n\n\n \n Ricardo Macedo; Aldri Santos; André Luiz Pires Guedes; Michele Nogueira; and Yacine Ghamri-Doudane.\n\n\n \n\n\n\n In Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos, 2014, Florianópolis. XIX Workshop de Gerência e Operação de Redes e Serviços - SBRC 2014, 2014. \n \n\n\n\n
\n\n\n\n \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\n
\n
@InProceedings{Macedo2014,\n   title        = {Um Modelo de  Falhas em Cascata para Sistemas Globais\n                  de Gerenciamento de Identidades},\n   author       = {Macedo,  Ricardo and Santos, Aldri  and Guedes, André\n                  Luiz Pires  and Nogueira, Michele  and Ghamri-Doudane,\n                  Yacine},\n   year         = 2014,\n   booktitle     =  {Simpósio  Brasileiro  de Redes  de  Computadores  e\n                  Sistemas   Distribuídos,  2014,   Florianópolis.   XIX\n                  Workshop de Gerência e Operação  de Redes e Serviços -\n                  SBRC 2014},\n   keywords     = {kwARG}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A CPML-Signwriting Interpreter: A New form to Generate the Graphical Symbols of Signwriting.\n \n \n \n \n\n\n \n Carlos E. A. Iatskiu; Laura Sánchez García; Diego Roberto Antunes; and André Luiz Pires Guedes.\n\n\n \n\n\n\n In Constantine Stephanidis; and Margherita Antona., editor(s), Universal Access in Human-Computer Interaction. Design and Development Methods for Universal Access, volume 8513, of Lecture Notes in Computer Science, pages 357-368, 2014. Springer International Publishing\n \n\n\n\n
\n\n\n\n \n \n \"APaper\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\n
\n
@inproceedings{Iatskiu2014,\n   year         = {2014},\n   isbn         = {978-3-319-07436-8},\n   booktitle     =  {Universal  Access  in  Human-Computer  Interaction.\n                  Design and Development Methods for Universal Access},\n   volume       = {8513},\n   series       = {Lecture Notes in Computer Science},\n   editor       = {Stephanidis, Constantine and Antona, Margherita},\n   doi          = {10.1007/978-3-319-07437-5_34},\n   title         =  {A  CPML-Signwriting  Interpreter:  A  New  form  to\n                  Generate the Graphical Symbols of Signwriting},\n   url          = {http://dx.doi.org/10.1007/978-3-319-07437-5_34},\n   publisher    = {Springer International Publishing},\n   keywords      =  {Human-Computer  Interaction; Deaf  Culture;  Social\n                  Inclusion;   Computational   Tools  for   Citizenship;\n                  SignWriting; Computational Phonological Model},\n   author       = {Iatskiu,  Carlos E. A. and García,  Laura Sánchez and\n                  Antunes, Diego Roberto and Guedes, André Luiz Pires},\n   pages        = {357-368},\n   language     = {English},\n   keywords     = {kwARG}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2012\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Directed Hypergraphs.\n \n \n \n\n\n \n André Luiz Pires Guedes.\n\n\n \n\n\n\n maio 2012.\n Palestrante convidado no Workshop de Grafos e Aplicações, Rio de Janeiro, INMETRO\n\n\n\n
\n\n\n\n \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
@Unpublished{Guedes2012Palestra,\n   author       = {André Luiz Pires Guedes},\n   title        = {Directed Hypergraphs},\n   note          =  {Palestrante  convidado  no  Workshop  de  Grafos  e\n                  Aplicações, Rio de Janeiro, INMETRO},\n   day          = {25},\n   month        = {maio},\n   year         = {2012},\n   type         = {Palestra}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Feedback Vertex Set is NP-complete for Reducible Flow Hypergraphs.\n \n \n \n\n\n \n A. L. P. Guedes; L. Markenzon; and Luerbio Faria.\n\n\n \n\n\n\n In Latin American Workshop on Cliques in Graphs, pages 39, Buenos Aires, 2012. \n \n\n\n\n
\n\n\n\n \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{GuedesMarkenzonFaria2012,\n   title        =  {Feedback Vertex  Set is {NP}-complete  for Reducible\n                  Flow Hypergraphs},\n   author       =  {Guedes, A.   L.  P.  and  Markenzon, L.   and Faria,\n                  Luerbio},\n   pages        = {39},\n   year         = 2012,\n   address      = {Buenos Aires},\n   booktitle    = {Latin American Workshop on Cliques in Graphs}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Conceptual meta-environment for Deaf children Literacy challenge: How to design effective Artifacts for bilingualism construction.\n \n \n \n \n\n\n \n Cayley Guimaraes; Diego R. Antunes; Laura Sánchez García; André Luiz Pires Guedes; and Sueli Fernandes.\n\n\n \n\n\n\n In Sixth International Conference on Research Challenges in Information Science, RCIS, pages 1-12, Valencia, Spain, 2012. \n \n\n\n\n
\n\n\n\n \n \n \"ConceptualPaper\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\n
\n
@InProceedings{DBLP:conf/rcis/GuimaraesAGGF12,\n   author        = {Cayley  Guimaraes and  Diego R.   Antunes and  Laura\n                  S{á}nchez  García and  Andr{é} Luiz  Pires Guedes  and\n                  Sueli Fernandes},\n   title         =   {Conceptual  meta-environment  for   Deaf  children\n                  Literacy challenge: How  to design effective Artifacts\n                  for bilingualism construction},\n   booktitle    = {Sixth International Conference on Research Challenges\n                  in Information Science, RCIS},\n   address      = {Valencia, Spain},\n   year         = {2012},\n   pages        = {1-12},\n   url          = {http://dx.doi.org/10.1109/RCIS.2012.6240426},\n   doi          = {10.1109/RCIS.2012.6240426},\n   bibsource    = {DBLP, http://dblp.uni-trier.de},\n   keywords     = {kwARG}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2011\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Parallel Implementations of Gusfield's Cut Tree Algorithm.\n \n \n \n\n\n \n Jaime Cohen; Luiz A. Rodrigues; Fabiano Silva; Renato Carmo; André Luiz Pires Guedes; and Elias Procópio Duarte Jr..\n\n\n \n\n\n\n In 11th International Conference Algorithms and Architectures for Parallel Processing - ICA3PP (1), volume 7016, of Lecture Notes in Computer Science, pages 258-269, 2011. Springer\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\n
\n
@InProceedings{DBLP:conf/ica3pp/CohenRSCGD11,\n   author       = {Jaime  Cohen and Luiz A. Rodrigues  and Fabiano Silva\n                  and  Renato Carmo  and Andr{é}  Luiz Pires  Guedes and\n                  Elias Proc{ó}pio Duarte Jr.},\n   title         =  {Parallel  Implementations of  Gusfield's  Cut  Tree\n                  Algorithm},\n   booktitle      =  {11th   International  Conference   Algorithms  and\n                  Architectures for Parallel Processing - ICA3PP (1)},\n   publisher    = {Springer},\n   series       = {Lecture Notes in Computer Science},\n   volume       = {7016},\n   year         = {2011},\n   isbn         = {978-3-642-24649-4},\n   pages        = {258-269},\n   doi          = {10.1007/978-3-642-24650-0_22},\n   bibsource    = {DBLP, http://dblp.uni-trier.de},\n   keywords     = {kwARG}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Flow hypergraph reducibility.\n \n \n \n \n\n\n \n A. L. P. Guedes; L. Markenzon; and L. Faria.\n\n\n \n\n\n\n Discrete Applied Mathematics, 159(16): 1775-1785. 2011.\n 8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009)\n\n\n\n
\n\n\n\n \n \n \"FlowPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \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
@Article{Guedes11,\n   title        = {Flow hypergraph reducibility},\n   journal      = {Discrete Applied Mathematics},\n   volume       = {159},\n   number       = {16},\n   pages        = {1775-1785},\n   year         = {2011},\n   note           =  {8th   Cologne/Twente   Workshop   on  Graphs   and\n                  Combinatorial Optimization (CTW 2009)},\n   issn         = {0166-218X},\n   doi          = {DOI: 10.1016/j.dam.2011.02.006},\n   url                                                                 =\n                  {http://www.sciencedirect.com/science/article/pii/S0166218X11000862},\n   author       = {A. L. P. Guedes and L. Markenzon and L. Faria},\n   keywords     = {Directed hypergraphs, Flowgraphs, Graph reducibility},\n   abstract     = {Reducible  flowgraphs were first defined  by Allen in\n                  terms of  intervals; another  definition based  on two\n                  flowgraph transformations  was presented by  Hecht and\n                  Ullman.   In  this  paper,  we extend  the  notion  of\n                  reducibility to directed hypergraphs, proving that the\n                  interval  and the  transformation approaches  preserve\n                  the equivalence when applied to this family.},\n   keywords     = {kwARG}\n}\n\n
\n
\n\n\n
\n Reducible flowgraphs were first defined by Allen in terms of intervals; another definition based on two flowgraph transformations was presented by Hecht and Ullman. In this paper, we extend the notion of reducibility to directed hypergraphs, proving that the interval and the transformation approaches preserve the equivalence when applied to this family.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Recognition of Reducible Flow Hypergraphs.\n \n \n \n \n\n\n \n André Luiz Pires Guedes; Lilian Markenzon; and Luerbio Faria.\n\n\n \n\n\n\n In CTW 2009 - Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pages 229-232, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"RecognitionPaper\n  \n \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\n
\n
@InProceedings{Guedes09,\n   author       =  {Andr{é} Luiz Pires  Guedes and Lilian  Markenzon and\n                  Luerbio Faria},\n   title        = {Recognition of Reducible Flow Hypergraphs},\n   booktitle     = {CTW  2009 -  Proceedings of  the 8th  Cologne-Twente\n                  Workshop on Graphs and Combinatorial Optimization},\n   year         = {2009},\n   pages        = {229-232},\n   url                                                                 =\n                  {http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\\#page=241},\n   bibsource    = {DBLP, http://dblp.uni-trier.de},\n   keywords     = {kwARG}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Hierarquical Distributed Fault Diagnosis Algorithm Based on Clusters with Detours.\n \n \n \n \n\n\n \n Elias Procópio Duarte Jr.; Luiz Carlos Pessoa Albini; Alessandro Brawerman; and André Luiz Pires Guedes.\n\n\n \n\n\n\n In Latin American Network Operations and Management Symposium - LANOMS, Punta del Este, Uruguay, October 2009. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \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\n
\n
@InProceedings{DBLP:conf/lanoms/DuarteABG09,\n   author       =  {Elias Proc{ó}pio Duarte  Jr. and Luiz  Carlos Pessoa\n                  Albini and Alessandro Brawerman and Andr{é} Luiz Pires\n                  Guedes},\n   title        = {A Hierarquical  Distributed Fault Diagnosis Algorithm\n                  Based on Clusters with Detours},\n   booktitle     = {Latin  American  Network  Operations and  Management\n                  Symposium - LANOMS},\n   year         = {2009},\n   publisher    = {IEEE},\n   month        = {October},\n   address      = {Punta del Este, Uruguay},\n   url          = {http://dx.doi.org/10.1109/LANOMS.2009.5338797},\n   bibsource    = {DBLP, http://dblp.uni-trier.de},\n   keywords     = {kwARG}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2008\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Visualização de táticas para apoiar a aquisição de habilidades em jogos educacionais.\n \n \n \n\n\n \n L. C. F. Bueno; Alexandre Ibrahim Direne; A. L. P. Guedes; F. Silva; L. C. E. Bona; L. García; Marcos Alexandre Castilho; and M. S. Sunyé.\n\n\n \n\n\n\n In Anais do XXVIII Congresso da Sociedade Brasileira - XIV Workshop sobre Informática na Escola (WIE2008), volume 1, pages 380-389, Belém, 2008. \n Workshop sobre Informática na Escola (WIE)\n\n\n\n
\n\n\n\n \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{BuenoWIE2008,\n   author       = {Bueno,  L.  C.  F. and Direne,  Alexandre Ibrahim and\n                  Guedes, A. L. P. and Silva,  F. and Bona, L. C. E. and\n                  L. García  and Castilho,  Marcos Alexandre  and Sunyé,\n                  M. S.},\n   title        =  {Visualização de táticas  para apoiar a  aquisição de\n                  habilidades em jogos educacionais},\n   booktitle    = {Anais  do XXVIII Congresso da  Sociedade Brasileira -\n                  XIV Workshop sobre Informática na Escola (WIE2008)},\n   year         = {2008},\n   volume       = {1},\n   pages        = {380-389},\n   address      = {Belém},\n   note         = {Workshop sobre Informática na Escola (WIE)}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Flow Hypergraph Reducibility.\n \n \n \n \n\n\n \n A. L. P. Guedes; L. Markenzon; and L. Faria.\n\n\n \n\n\n\n Electronic Notes in Discrete Mathematics, 30: 255-260. 2008.\n LAGOS'07 - The IV Latin-American Algorithms, Graphs, and Optimization Symposium (2007)\n\n\n\n
\n\n\n\n \n \n \"FlowPaper\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\n
\n
@Article{Guedes07,\n   title        = {Flow Hypergraph Reducibility},\n   journal      = {Electronic Notes in Discrete Mathematics},\n   volume       = {30},\n   number       = {},\n   pages        = {255-260},\n   year         = {2008},\n   note         = {LAGOS'07 -  The IV Latin-American Algorithms, Graphs,\n                  and Optimization Symposium (2007)},\n   issn         = {1571-0653},\n   doi          = {DOI: 10.1016/j.endm.2008.01.044},\n   url                                                                 =\n                  {https://www.sciencedirect.com/science/article/abs/pii/S1571065308000450},\n   author       = {A. L. P. Guedes and L. Markenzon and L. Faria},\n   keywords     = {kwARG}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2007\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n A Utilização de Visualizações como Auxílio ao Ensino na Área de Programação.\n \n \n \n\n\n \n T. M. Preto; A. L. P. Guedes; and L. G. Cordeiro.\n\n\n \n\n\n\n In SBIE - Simpósio Brasileiro de Informática na Educação - Workshop de Ambientes de Apoio à Aprendizagem de Algoritmos e Programação, São Paulo, 2007. \n \n\n\n\n
\n\n\n\n \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{PretoGuedesCordeiro2007,\n   author       =  {Preto, T. M.  and  Guedes, A. L.  P.   and Cordeiro,\n                  L. G.},\n   title        = {A Utilização de  Visualizações como Auxílio ao Ensino\n                  na Área de Programação},\n   booktitle    = {SBIE - Simpósio Brasileiro de Informática na Educação\n                  - Workshop  de Ambientes  de Apoio  à Aprendizagem  de\n                  Algoritmos e Programação},\n   year         = {2007},\n   address      = {São Paulo}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Definição formal de táticas de Xadrez por meio da autoria incremental de conceitos heurísticos.\n \n \n \n\n\n \n A. Feitosa; Alexandre Ibrahim Direne; F. Silva; L. C. E. Bona; A. L. P. Guedes; Marcos Alexandre Castilho; M. S. Sunyé; and L. García.\n\n\n \n\n\n\n In SBIE - Simpósio Brasileiro de Informática na Educação, volume 1, pages 244-253, São Paulo, 2007. \n \n\n\n\n
\n\n\n\n \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{FeitosaSBIE2007,\n   author       = {Feitosa, A. and  Direne, Alexandre Ibrahim and Silva,\n                  F.  and Bona, L.  C.  E.   and Guedes, A.  L.  P.  and\n                  Castilho,  Marcos Alexandre  and  Sunyé,  M.  S.   and\n                  L. García},\n   title        =  {Definição formal  de táticas de  Xadrez por  meio da\n                  autoria incremental de conceitos heurísticos},\n   booktitle     =  {SBIE  -   Simpósio  Brasileiro  de  Informática  na\n                  Educação},\n   volume       = {1},\n   pages        = {244-253},\n   year         = {2007},\n   address      = {São Paulo}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Laboratórios de Informática com Software Livre para Atender Políticas Estaduais do Ensino Escolar.\n \n \n \n \n\n\n \n Marcos Castilho; Marcos Sunyé; Daniel Weingaertner; Luis Bona; Fabiano Silva; Carlos Carvalho; Laura García; André Guedes; and Alexandre Direne.\n\n\n \n\n\n\n In Anais do XXVII Congresso da Sociedade Brasileira de Computação - Workshop de Informática na Escola (WIE), volume 1, pages 208-215, Rio de Janeiro, 2007. \n \n\n\n\n
\n\n\n\n \n \n \"LaboratóriosPaper\n  \n \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{CastilhoWIE2007,\n   author        =   {Marcos  Castilho  and  Marcos   Sunyé  and  Daniel\n                  Weingaertner and  Luis de  Bona and Fabiano  Silva and\n                  Carlos Carvalho and Laura  García and André Guedes and\n                  Alexandre Direne},\n   title        =  {Laboratórios de Informática com  Software Livre para\n                  Atender Políticas Estaduais do Ensino Escolar},\n   booktitle    = {Anais  do XXVII Congresso da  Sociedade Brasileira de\n                  Computação - Workshop de Informática na Escola (WIE)},\n   year         = {2007},\n   volume       = {1},\n   pages        = {208-215},\n   url                                                                 =\n                  {https://br-ie.org/pub/index.php/wie/article/viewFile/949/935},\n   address      = {Rio de Janeiro},\n   abstract      =  {}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Ferramentas e Métodos para Apoiar o Ensino de Xadrez na Fronteira entre os Fundamentos e a Perícia.\n \n \n \n \n\n\n \n F. M. Aguiar; Alexandre Ibrahim Direne; L. C. E. Bona; F. Silva; Marcos Alexandre Castilho; A. L. P. Guedes; M. S. Sunyé; and L. García.\n\n\n \n\n\n\n In Anais do XXVII Congresso da Sociedade Brasileira de Computação - Workshop de Informática na Escola (WIE), volume 1, pages 380-387, Rio de Janeiro, 2007. \n \n\n\n\n
\n\n\n\n \n \n \"FerramentasPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{AguiarWIE2007,\n   author       = {Aguiar, F. M. and Direne, Alexandre Ibrahim and Bona,\n                  L. C. E. and Silva,  F. and Castilho, Marcos Alexandre\n                  and Guedes, A. L. P. and Sunyé, M. S. and L. García},\n   title        = {Ferramentas e Métodos  para Apoiar o Ensino de Xadrez\n                  na Fronteira entre os Fundamentos e a Perícia},\n   booktitle    = {Anais  do XXVII Congresso da  Sociedade Brasileira de\n                  Computação - Workshop de Informática na Escola (WIE)},\n   year         = {2007},\n   volume       = {1},\n   pages        = {380-387},\n   url                                                                 =\n                  {https://www.br-ie.org/pub/index.php/wie/article/view/942/928},\n   address      = {Rio de Janeiro},\n   abstract      =  {Resumo:  Esse  artigo  apresenta  um  protótipo  de\n                  software   que  tem   por   objetivo  ajudar   mestres\n                  enxadristas   no  ensino   de  suas   habilidades  aos\n                  iniciantes. A  necessidade de tal protótipo  partiu da\n                  constatação  das  vantagens  do   jogo  de  Xadrez  no\n                  desenvolvimento  do raciocínio  lógico  nos níveis  de\n                  ensino fundamental e  médio. Adicionalmente, há várias\n                  dificuldades   no   ensino   e  na   aprendizagem   de\n                  Xadrez.   Uma  busca   na  literatura   existente  foi\n                  realizada  e verificou-se  que só  recentemente alguns\n                  resultados   foram  produzidos   na   área  de   jogos\n                  educacionais  que   apoiam  o  ensino  de   Xadrez  na\n                  escolas. Todavia, tais resultados  ainda carecem de um\n                  modelo  pedagógico   que  diagnostique  as   ações  do\n                  aprendiz  ao longo  de toda  a partida  e promova  uma\n                  realimentação  mais  imediata  às ações  do  aluno.  É\n                  apresentada  uma sulução  factível  para tal  problema\n                  assim como  sua aplicação  no mundo  real por  meio do\n                  sistema  XadrEx.\n\n                  Abstract:  This paper  describes  a\n                  software  artefact  wich  aims at  helping  the  chess\n                  master in  teatching his/her skills to  beginners. The\n                  rationale of such artefact  emerged from past research\n                  claims  that  link  the  practice of  Chess  with  the\n                  advantages of  game playing for the  development human\n                  logic  reasoning  abilities. Additionally,  there  are\n                  many  complex   problems  in  teaching   and  learning\n                  Chess. A literature review  is presented, showing that\n                  only  recently, some  progress  has been  made in  the\n                  field   of  Educational   Games  that   support  Chess\n                  training. However, even  such novel contributions need\n                  more  elaborate  student  and  pedagogic  models  that\n                  embody  capacities  to  diagnose learner  actions  and\n                  provide  immediate feedback.  A feasible  solution for\n                  such problems  and its application through  the XadrEx\n                  prototype  to a  real world  scenario are  reported in\n                  this paper.}\n}\n\n
\n
\n\n\n
\n Resumo: Esse artigo apresenta um protótipo de software que tem por objetivo ajudar mestres enxadristas no ensino de suas habilidades aos iniciantes. A necessidade de tal protótipo partiu da constatação das vantagens do jogo de Xadrez no desenvolvimento do raciocínio lógico nos níveis de ensino fundamental e médio. Adicionalmente, há várias dificuldades no ensino e na aprendizagem de Xadrez. Uma busca na literatura existente foi realizada e verificou-se que só recentemente alguns resultados foram produzidos na área de jogos educacionais que apoiam o ensino de Xadrez na escolas. Todavia, tais resultados ainda carecem de um modelo pedagógico que diagnostique as ações do aprendiz ao longo de toda a partida e promova uma realimentação mais imediata às ações do aluno. É apresentada uma sulução factível para tal problema assim como sua aplicação no mundo real por meio do sistema XadrEx. Abstract: This paper describes a software artefact wich aims at helping the chess master in teatching his/her skills to beginners. The rationale of such artefact emerged from past research claims that link the practice of Chess with the advantages of game playing for the development human logic reasoning abilities. Additionally, there are many complex problems in teaching and learning Chess. A literature review is presented, showing that only recently, some progress has been made in the field of Educational Games that support Chess training. However, even such novel contributions need more elaborate student and pedagogic models that embody capacities to diagnose learner actions and provide immediate feedback. A feasible solution for such problems and its application through the XadrEx prototype to a real world scenario are reported in this paper.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Traçado automático de hipergrafos direcionados para gerência de projetos.\n \n \n \n\n\n \n Zeno Stivanin; and André Luiz Pires Guedes.\n\n\n \n\n\n\n Espaço Energia, 6: 1-12. 2007.\n \n\n\n\n
\n\n\n\n \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\n\n\n
\n
@Article{Zeno_COPEL2007,\n   author       = {Stivanin, Zeno and Guedes, André Luiz Pires},\n   title        =  {Traçado automático de hipergrafos  direcionados para\n                  gerência de projetos},\n   journal      = {Espaço Energia},\n   volume       = 6,\n   pages        = {1-12},\n   year         = 2007,\n   keywords     = {RNCL,kwARG}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2006\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Alternância entre competição e colaboração para promover o aprendizado por meio de heurísticas de jogos.\n \n \n \n\n\n \n Daniel Martineschen; Alexandre Ibrahim Direne; L. C. E. Bona; F. Silva; Marcos Alexandre Castilho; A. L. P. Guedes; and M. S. Sunyé.\n\n\n \n\n\n\n In Anais do XXVI Congresso da Sociedade Brasileira de Computação - WIE - Workshop sobre Informática na Escola, pages 1-10, Campo Grande, 2006. \n \n\n\n\n
\n\n\n\n \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{MartineschenWIE2006,\n   author       =  {Martineschen, Daniel  and Direne,  Alexandre Ibrahim\n                  and Bona, L. C. E.  and Silva, F. and Castilho, Marcos\n                  Alexandre and Guedes, A. L. P. and Sunyé, M. S.},\n   title         =  {Alternância  entre competição  e  colaboração  para\n                  promover  o aprendizado  por  meio  de heurísticas  de\n                  jogos},\n   booktitle    =  {Anais do XXVI  Congresso da Sociedade  Brasileira de\n                  Computação  -  WIE  - Workshop  sobre  Informática  na\n                  Escola},\n   year         = {2006},\n   pages        = {1-10},\n   address      = {Campo Grande}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Making government policies for education possible by means of Open Source technology: a successful case.\n \n \n \n\n\n \n Marcos Alexandre Castilho; M. S. Sunyé; D. Weingaertner; L. C. E. Bona; F. Silva; Alexandre Ibrahim Direne; L. García; A. L. P. Guedes; and C. Carvalho.\n\n\n \n\n\n\n In Miltiadis Lytras; and Ambjorn Naeve., editor(s), Open Source for Knowledge And Learning Management: Strategies Beyond Tool. Idea Group Publishing, 2006.\n \n\n\n\n
\n\n\n\n \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
@InCollection{Castilho2006Capitulo,\n   author       =  {Castilho, Marcos  Alexandre and  Sunyé, M.   S.  and\n                  D. Weingaertner and  Bona, L. C. E. and  Silva, F. and\n                  Direne, Alexandre  Ibrahim and  L. García  and Guedes,\n                  A. L. P. and C. Carvalho},\n   title        = {Making government  policies for education possible by\n                  means of Open Source technology: a successful case},\n   booktitle    =  {Open Source  for Knowledge And  Learning Management:\n                  Strategies Beyond Tool},\n   publisher    = {Idea Group Publishing},\n   editor       = {Miltiadis Lytras and Ambjorn Naeve},\n   year         = {2006}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Comparação de Estruturas de Dados para Subdivisões Planares Baseada em Transições.\n \n \n \n\n\n \n Pedro Ribeiro de Andrade Neto; and André Luiz Pires Guedes.\n\n\n \n\n\n\n RITA, 13(1): 23-41. julho 2006.\n \n\n\n\n
\n\n\n\n \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\n\n\n
\n
@Article{Pedro_RITA2006,\n   author       = {Andrade Neto, Pedro Ribeiro de and Guedes, André Luiz\n                  Pires},\n   title        =  {Comparação de  Estruturas de Dados  para Subdivisões\n                  Planares Baseada em Transições},\n   journal      = {RITA},\n   number       = 1,\n   volume       = 13,\n   month        = {julho},\n   year         = 2006,\n   pages        = {23-41},\n   keywords     = {RNCL,kwARG}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2005\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Reformulação Curricular dos Cursos de Educação Profissional do Setor Terciário - Informática - Departamento de Educação Profissional - Secretaria de Estado da Educação.\n \n \n \n \n\n\n \n Marcos A. Castilho; André Luiz Pires Guedes; and Roberto A. Hexsel.\n\n\n \n\n\n\n Technical Report RT-DINF 002/2005, Departamento de Informática - UFPR, 2005.\n \n\n\n\n
\n\n\n\n \n \n \"Reformulação pdf\n  \n \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 \n \n\n\n\n
\n
@TechReport{SEED05,\n   author       = {Castilho, Marcos A.  and Guedes, André Luiz Pires and\n                  Hexsel, Roberto A.},\n   title         =  {Reformulação  Curricular  dos  Cursos  de  Educação\n                  Profissional  do  Setor   Terciário  -  Informática  -\n                  Departamento de Educação  Profissional - Secretaria de\n                  Estado da Educação},\n   institution  = {Departamento de Informática - UFPR},\n   year         = 2005,\n   number       = {RT-DINF 002/2005},\n   keywords     = {RTEC,kwARG,kwLIC},\n   url_pdf                                                             =\n                  {http://www.inf.ufpr.br/ppginf/Relatorios_Tecnicos/RT_DINF002_2005.pdf},\n   _url_pdf                                                            =\n                  {http://www.inf.ufpr.br/andre/files/RT_DINF002_2005.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Linguagem e Ferramenta de Autoria para Promover o Desenvolvimento de Perícias em Xadrez.\n \n \n \n\n\n \n Celso Hartmann; Alexandre Direne; Luis Bona; Fabiano Silva; Gabriel Santos; André L. P. Guedes; Marcos Castilho; and Marcos Sunyé.\n\n\n \n\n\n\n In Neide Santos; and Fernanda Campos., editor(s), XVI SBIE - Simpósio Brasileiro de Informática na Educação (SBIE-2005), pages 656-665, Juiz de Fora, Brasil, Novembro 2005. SBC-UFJF\n \n\n\n\n
\n\n\n\n \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 \n \n\n\n\n
\n
@InProceedings{sbie05,\n   author       = {Hartmann, Celso and  Direne, Alexandre and Bona, Luis\n                  and Silva, Fabiano and dos Santos, Gabriel and Guedes,\n                  André L. P. and Castilho, Marcos and Sunyé, Marcos},\n   title        =  {Linguagem e  Ferramenta de  Autoria para  Promover o\n                  Desenvolvimento de Perícias em Xadrez},\n   booktitle     = {XVI  SBIE -  Simpósio Brasileiro  de Informática  na\n                  Educação (SBIE-2005)},\n   key          = {ISBN: 85-88279-48-7},\n   pages        = {656-665},\n   year         = 2005,\n   editor       = {Santos, Neide and Campos, Fernanda},\n   address      = {Juiz de Fora, Brasil},\n   month        = {Novembro},\n   publisher    = {SBC-UFJF},\n   keywords     = {CNCL,kwLIC,kwARG}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Possibilidades para Integração entre Matemática e Programação.\n \n \n \n\n\n \n T. M. Preto; V. M. Mariani; S. Scheer; and A. L. P. Guedes.\n\n\n \n\n\n\n In Anais do XXXIII Cobenge - Congresso Brasileiro de Ensino de Engenharia, Campina Grande, 2005. \n \n\n\n\n
\n\n\n\n \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{PretoMarianiScheerGuedes2005,\n   author       =  {Preto, T. M. and  Mariani, V. M. and  Scheer, S. and\n                  Guedes, A. L. P.},\n   title         = {Possibilidades  para Integração  entre Matemática  e\n                  Programação},\n   booktitle    =  {Anais do  XXXIII Cobenge  - Congresso  Brasileiro de\n                  Ensino de Engenharia},\n   year         = {2005},\n   address      = {Campina Grande}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Utilização do Maple, Matlab e Scilab nos Cursos de Engenharia.\n \n \n \n\n\n \n T. M. Preto; A. L. P. Guedes; and V. M. Mariani.\n\n\n \n\n\n\n In Anais do XXXIII Cobenge - Congresso Brasileiro de Ensino de Engenharia, Campina Grande, 2005. \n \n\n\n\n
\n\n\n\n \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{PretoGuedesMariani2005,\n   author       = {Preto, T. M. and Guedes, A. L. P. and Mariani, V. M.},\n   title        =  {Utilização do Maple,  Matlab e Scilab nos  Cursos de\n                  Engenharia},\n   booktitle    =  {Anais do  XXXIII Cobenge  - Congresso  Brasileiro de\n                  Ensino de Engenharia},\n   year         = {2005},\n   address      = {Campina Grande}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Linear Algorithm for Exact Pattern Matching in Planar Subdivisions.\n \n \n \n \n\n\n \n Pedro Ribeiro de Andrade Neto; and André Luiz Pires Guedes.\n\n\n \n\n\n\n In Maria Andréia Formico Rodrigues; and Alejandro César Frery., editor(s), Proceedings of SIBGRAPI 2005, XVIII Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens, pages 120-127, Los Alamitos, 2005. Brazilian Symposium on Computer Graphics and Image Processing, 18. (SIBGRAPI), IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n \n \"AAccessdate\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Pedro_SIBGRAPI05,\n   author       = {Andrade Neto, Pedro Ribeiro de and Guedes, André Luiz\n                  Pires},\n   title         = {A  Linear Algorithm  for Exact  Pattern Matching  in\n                  Planar Subdivisions},\n   booktitle     =   {Proceedings  of  SIBGRAPI  2005,   XVIII  Simpósio\n                  Brasileiro  de Computação  Gráfica e  Processamento de\n                  Imagens},\n   year         = 2005,\n   pages        = {120-127},\n          affiliation = "{Federal University of Paran{\\'a}}",\n               editor = "Rodrigues, Maria Andr{\\'e}ia Formico and Frery, Alejandro \n                         C{\\'e}sar",\n         organization = "Brazilian Symposium on Computer Graphics and Image Processing, 18. \n                         (SIBGRAPI)",\n            publisher = "IEEE Computer Society",\n              address = "Los Alamitos",\n             keywords = "sub-isomorphism, planar subdivisions.",\n             abstract = "Graph sub-isomorphism is a very common approach to solving pattern \n                         search problems, but this is a NP-complete problem. This way, it \n                         is necessary to invest in research of approximate solutions, or in \n                         special cases of the problem. Planar subdivisions can be \n                         considered as a special case of graphs, because, in addition to \n                         nodes and edges, there is a more rigid topology in relation to the \n                         order of the edges, arising to the concept of face. This work \n                         presents a linear algorithm for pattern search in planar \n                         subdivisions. The presented algorithm is based on a hybrid \n                         approach between the dual and the region adjacency graph (RAG) to \n                         represent the patterns, saving any additional storage cost. Thus, \n                         the patterns are looked over the search subdivision, using a \n                         region growing algorithm.",\n  conference-location = "Natal, RN, Brazil",\n      conference-year = "9-12 Oct. 2005",\n                  doi = "10.1109/SIBGRAPI.2005.5",\n                  url = "http://dx.doi.org/10.1109/SIBGRAPI.2005.5",\n             language = "en",\n                  ibi = "6qtX3pFwXQZeBBx/GHBVm",\n                  url = "http://urlib.net/ibi/6qtX3pFwXQZeBBx/GHBVm",\n           targetfile = "andradep_matchsubdivisions.pdf",\n        urlaccessdate = "2024, Mar. 07"\n}\n\n\n
\n
\n\n\n
\n Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approximate solutions, or in special cases of the problem. Planar subdivisions can be considered as a special case of graphs, because, in addition to nodes and edges, there is a more rigid topology in relation to the order of the edges, arising to the concept of face. This work presents a linear algorithm for pattern search in planar subdivisions. The presented algorithm is based on a hybrid approach between the dual and the region adjacency graph (RAG) to represent the patterns, saving any additional storage cost. Thus, the patterns are looked over the search subdivision, using a region growing algorithm.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Perfect subgraph/supergraph.\n \n \n \n \n\n\n \n Murilo V. G. Silva; and André L. P. Guedes.\n\n\n \n\n\n\n Electronic Notes in Discrete Mathematics, 19: 411-416. 2005.\n Proceedings of GRACO'2005 - II Brazilian Symposium of Graphs, Algorithms and Combinatorics, Angra dos Reis\n\n\n\n
\n\n\n\n \n \n \"PerfectPaper\n  \n \n \n \"Perfect pdf\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\n
\n
@Article{Silva2005,\n   author       = {Murilo V. G. da Silva and André L. P. Guedes},\n   title        = {Perfect subgraph/supergraph},\n   journal      = {Electronic Notes in Discrete Mathematics},\n   volume       = {19},\n   number       = {},\n   pages        = {411-416},\n   year         = {2005},\n   note         = {Proceedings of GRACO'2005 - II Brazilian Symposium of\n                  Graphs, Algorithms and Combinatorics, Angra dos Reis},\n   issn         = {1571-0653},\n   doi          = {DOI: 10.1016/j.endm.2005.05.001},\n   url                                                                 =\n                  {http://www.sciencedirect.com/science/article/B75GV-4G8MT0T-1X/2/37c4cf5b528983ecad5264241a544ad2},\n   url_pdf                                                             =\n                  {http://www.inf.ufpr.br/andre/files/SilvaGuedesGraco2005.pdf},\n   keywords     = {kwARG}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Directed Hypergraph Planarity.\n \n \n \n\n\n \n André Luiz Pires Guedes; and Lilian Markenzon.\n\n\n \n\n\n\n Pesquisa Operacional, 25(3): 383-390. setembro/dezembro 2005.\n \n\n\n\n
\n\n\n\n \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\n\n\n
\n
@Article{Guedes_Markenzon05,\n   author       = {Guedes, André Luiz Pires and Markenzon, Lilian},\n   title        = {Directed Hypergraph Planarity},\n   journal      = {Pesquisa Operacional},\n   volume       = 25,\n   number       = 3,\n   pages        = {383-390},\n   month        = {setembro/dezembro},\n   year         = 2005,\n   keywords     = {RNCL,kwARG}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2004\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Projeto Paraná Digital.\n \n \n \n \n\n\n \n Alexandre I. Direne; Andre Luiz Pires Guedes; Carlos Carvalho; Daniel Weingaertner; Fabiano Silva; Luciano Silva; Luis C. E. Bona; Marcos S. Sunye; and Marcos A. Castilho.\n\n\n \n\n\n\n Technical Report RT-DINF 004/2004, Departamento de Informática - UFPR, 2004.\n \n\n\n\n
\n\n\n\n \n \n \"Projeto ps\n  \n \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
@TechReport{ParanaDigital2004,\n   author       = {Direne, Alexandre I. and Guedes, Andre Luiz Pires and\n                  Carvalho,Carlos  and Weingaertner,  Daniel and  Silva,\n                  Fabiano and Silva,  Luciano and Bona, Luis  C.  E. and\n                  Sunye, Marcos S. and Castilho, Marcos A.},\n   title        = {Projeto Paraná Digital},\n   institution  = {Departamento de Informática - UFPR},\n   year         = 2004,\n   number       = {RT-DINF 004/2004},\n   url_ps                                                              =\n                  {https://www.acervodigital.ufpr.br/bitstream/handle/1884/473/tech_repport.ps}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Some Results on Perfect Subgraphs.\n \n \n \n \n\n\n \n Murilo V. G. Silva; and André Luiz Pires Guedes.\n\n\n \n\n\n\n Technical Report RT-DINF 002/2004, Departamento de Informática - UFPR, January 2004.\n \n\n\n\n
\n\n\n\n \n \n \"Some pdf\n  \n \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\n\n\n
\n
@TechReport{Guedes04,\n   author       = {Murilo V. G. da Silva and Guedes, André Luiz Pires},\n   title        = {Some Results on Perfect Subgraphs},\n   institution  = {Departamento de Informática - UFPR},\n   year         = 2004,\n   number       = {RT-DINF 002/2004},\n   month        = jan,\n   keywords     = {RTEC,kwARG},\n   url_pdf                                                             =\n                  {http://www.inf.ufpr.br/ppginf/Relatorios_Tecnicos/RT_DINF002_2004.pdf},\n   _url_pdf                                                            =\n                  {http://www.inf.ufpr.br/andre/files/RT_DINF002_2004.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computing the Minimum Cut and Maximum Flow of Undirected Graphs.\n \n \n \n \n\n\n \n Jonatan Schroeder; André Luiz Pires Guedes; and Elias Procópio Duarte Jr..\n\n\n \n\n\n\n Technical Report RT-DINF 003/2004, Departamento de Informática - UFPR, 2004.\n \n\n\n\n
\n\n\n\n \n \n \"Computing pdf\n  \n \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\n\n\n
\n
@TechReport{Elias2004,\n   author       = {Jonatan  Schroeder and Andr{é} Luiz  Pires Guedes and\n                  Elias Proc{ó}pio Duarte Jr.},\n   title         =  {Computing  the  Minimum Cut  and  Maximum  Flow  of\n                  Undirected Graphs},\n   institution  = {Departamento de Informática - UFPR},\n   year         = 2004,\n   number       = {RT-DINF 003/2004},\n   keywords     = {RTEC,kwARG},\n   url_pdf                                                             =\n                  {http://www.inf.ufpr.br/ppginf/Relatorios_Tecnicos/RT_DINF003_2004.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Conceitos e Ferramentas de Apoio ao Ensino de Xadrez nas Escolas Brasileiras.\n \n \n \n\n\n \n Alexandre I. Direne; Luis C. E. Bona; Fabiano Silva; Gabriel Santos; André L. P. Guedes; Marcos Castilho; Marcos S. Sunyé; C. Hartmann; Pedro R. de Andrade Neto; and S. Mello.\n\n\n \n\n\n\n In Proceedings of X WIE - Workshop sobre Informática na Escola, Salvador, 2004. \n \n\n\n\n
\n\n\n\n \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 \n \n\n\n\n
\n
@InProceedings{Xadrez_WIE04,\n   author       = {Direne, Alexandre I. and  Bona, Luis C. E. and Silva,\n                  Fabiano and  Santos, Gabriel  and Guedes, André  L. P.\n                  and  Castilho,  Marcos  and   Sunyé,  Marcos  S.   and\n                  Hartmann, C. and Andrade Neto,  Pedro R. de and Mello,\n                  S.},\n   title        = {Conceitos e Ferramentas  de Apoio ao Ensino de Xadrez\n                  nas Escolas Brasileiras},\n   booktitle    = {Proceedings of X  WIE - Workshop sobre Informática na\n                  Escola},\n   year         = 2004,\n   address      = {Salvador},\n   keywords     = {CNCL,kwLIC,kwARG}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A Petri net based representation for planning problems.\n \n \n \n\n\n \n Marcos Castilho; André L. P. Guedes; Tiago Lima; João Marynowski; Razer Montaño; Luis Künzle; and Fabiano Silva.\n\n\n \n\n\n\n In Booklet of International Planning Competition - IPC'04, pages 27-29, Whistler, British Columbia, Canada, June 2004. ICAPS'04\n \n\n\n\n
\n\n\n\n \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 \n \n\n\n\n
\n
@InProceedings{PETRIPLAN_IPC04,\n   author       = {Castilho, Marcos and  Guedes, André L.  P.  and Lima,\n                  Tiago  and Marynowski,  João  and  Montaño, Razer  and\n                  Künzle, Luis and Silva, Fabiano},\n   title         =  {A  Petri  net  based  representation  for  planning\n                  problems},\n   booktitle     =  {Booklet  of International  Planning  Competition  -\n                  IPC'04},\n   pages        = {27-29},\n   year         = 2004,\n   address      = {Whistler, British Columbia, Canada},\n   month        = {June},\n   organization = {ICAPS'04},\n   keywords     = {CICL,kwARG,kwLIC}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2003\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Hierarquical Distributed Diagnosis Algorithm Based on Clusters with Detours.\n \n \n \n \n\n\n \n Elias Procópio Duarte Jr.; Luiz Carlos Pessoa Albini; Alessandro Brawerman; and André Luiz Pires Guedes.\n\n\n \n\n\n\n Technical Report RT-DINF 002/2003, Departamento de Informática - UFPR, 2003.\n \n\n\n\n
\n\n\n\n \n \n \"A pdf\n  \n \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\n\n\n
\n
@TechReport{Elias2003,\n   author       =  {Elias Proc{ó}pio Duarte  Jr. and Luiz  Carlos Pessoa\n                  Albini and Alessandro Brawerman and Andr{é} Luiz Pires\n                  Guedes},\n   title        = {A Hierarquical  Distributed Diagnosis Algorithm Based\n                  on Clusters with Detours},\n   institution  = {Departamento de Informática - UFPR},\n   year         = 2003,\n   number       = {RT-DINF 002/2003},\n   keywords     = {RTEC,kwARG},\n   url_pdf                                                             =\n                  {http://www.inf.ufpr.br/ppginf/Relatorios_Tecnicos/RT_DINF002_2003.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Autoria e Interpretação Tutorial de Soluções Alternativas para Promover o Ensino de Programação de Computadores.\n \n \n \n \n\n\n \n G. Santos; A. I. Direne; and A. L. P. Guedes.\n\n\n \n\n\n\n In XIV SBIE - Simpósio Brasileiro de Informática na Educação, pages 623-632, nov 2003. \n \n\n\n\n
\n\n\n\n \n \n \"Autoria pdf\n  \n \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 \n \n\n\n\n
\n
@InProceedings{SantosDireneGuedes:2003,\n   author       = {G. Santos and A. I. Direne and A. L. P. Guedes},\n   title         =   {Autoria  e  Interpretação  Tutorial   de  Soluções\n                  Alternativas para Promover o  Ensino de Programação de\n                  Computadores},\n   booktitle     = {XIV  SBIE -  Simpósio Brasileiro  de Informática  na\n                  Educação},\n   pages        = {623-632},\n   month        = {nov},\n   year         = {2003},\n   url_pdf                                                             =\n                  {http://www.inf.ufpr.br/alexd/ARTIGOS_AUTORIA/SantosDireneGuedes2003.pdf},\n   keywords     = {CNCL,kwLIC,kwARG}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2002\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Cálculo de Trajetórias para o Futebol de Robôs.\n \n \n \n\n\n \n Leandro Nelinho Balico; Daniel Martineschen; M. V. G. Silva; Viviane Palodeto; Gabriel Santos; and A. L. P. Guedes.\n\n\n \n\n\n\n In Anais do X Evento de Iniciação Científica da UFPR (X EVINCI), pages 240, Curitiba, 2002. Editora da UFPR\n \n\n\n\n
\n\n\n\n \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{BalicoEVINCE2002,\n   author       = {Balico, Leandro  Nelinho and Martineschen, Daniel and\n                  Silva, M.   V.  G.  and Palodeto,  Viviane and Santos,\n                  Gabriel and Guedes, A. L. P.},\n   title        = {Cálculo de Trajetórias para o Futebol de Robôs},\n   booktitle    = {Anais do X Evento  de Iniciação Científica da UFPR (X\n                  EVINCI)},\n   year         = {2002},\n   pages        = {240},\n   address      = {Curitiba},\n   publisher    = {Editora da UFPR}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2001\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Hipergrafos Direcionados.\n \n \n \n \n\n\n \n André Luiz Pires Guedes.\n\n\n \n\n\n\n Ph.D. Thesis, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brasil, August 2001.\n Orientadora: Lilian Markenzon. Coorientador: Paulo Roberto Oliveira.\n\n\n\n
\n\n\n\n \n \n \"HipergrafosPaper\n  \n \n \n \"Hipergrafos pdf\n  \n \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 \n \n\n\n\n
\n
@PhdThesis{Guedes01,\n   author       = {Guedes, André Luiz Pires},\n   title        = {Hipergrafos Direcionados},\n   school       = {Universidade Federal do Rio de Janeiro},\n   year         = 2001,\n   type         = {D.{Sc}. Thesis},\n   note          = {Orientadora:  Lilian Markenzon.  Coorientador: Paulo\n                  Roberto Oliveira.},\n   address      = {Rio de Janeiro, RJ, Brasil},\n   month        = aug,\n   keywords     = {PhD-TH,kwIMAGO,kwARG},\n   url                                                                 =\n                  {https://www.cos.ufrj.br/index.php/pt-BR/publicacoes-pesquisa/details/15/879},\n   url_pdf      = {https://www.cos.ufrj.br/uploadfile/1364835764.pdf},\n   _file        = {http://www.inf.ufpr.br/andre/files/DScGuedes.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Introdução à Geometria Computacional.\n \n \n \n \n\n\n \n André Luiz Pires Guedes.\n\n\n \n\n\n\n Technical Report RT-DINF 002/2001, Departamento de Informática - UFPR, October 2001.\n \n\n\n\n
\n\n\n\n \n \n \"IntroduçãoPaper\n  \n \n \n \"Introdução pdf\n  \n \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 \n \n\n\n\n
\n
@TechReport{Guedes94,\n   author       = {Guedes, André Luiz Pires},\n   title        = {Introdução à Geometria Computacional},\n   institution  = {Departamento de Informática - UFPR},\n   year         = 2001,\n   number       = {RT-DINF 002/2001},\n   month        = oct,\n   keywords     = {RTEC,kwIMAGO,kwARG},\n   type         = {Apostila},\n   url          = {http://www.inf.ufpr.br/andre/geom/geom.html},\n   url_pdf                                                             =\n                  {http://www.inf.ufpr.br/ppginf/Relatorios_Tecnicos/RT_DINF002_2001.pdf},\n   _postscript                                                         =\n                  {http://www.inf.ufpr.br/andre/files/RT_DINF002_2001.ps.gz}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Directed Hypergraph Planarity.\n \n \n \n \n\n\n \n André Luiz Pires Guedes; and Lilian Markenzon.\n\n\n \n\n\n\n Technical Report RT-DINF 003/2001, Departamento de Informática - UFPR, December 2001.\n \n\n\n\n
\n\n\n\n \n \n \"Directed pdf\n  \n \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 \n \n\n\n\n
\n
@TechReport{Guedes01b,\n   author       = {Guedes, André Luiz Pires and Markenzon, Lilian},\n   title        = {Directed Hypergraph Planarity},\n   institution  = {Departamento de Informática - UFPR},\n   year         = 2001,\n   number       = {RT-DINF 003/2001},\n   month        = dec,\n   keywords     = {RTEC,kwIMAGO,kwARG},\n   url_pdf                                                             =\n                  {http://www.inf.ufpr.br/ppginf/Relatorios_Tecnicos/RT_DINF003_2001.pdf},\n   _postscript                                                         =\n                  {http://www.inf.ufpr.br/andre/files/RT_DINF003_2001.ps.gz}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1997\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Modelagem Paralela em Anel do “Ray Tracing”.\n \n \n \n \n\n\n \n Daniel Câmara; and André Guedes.\n\n\n \n\n\n\n In Anais Estendidos do IX Simpósio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho, pages 553-556, Porto Alegre, RS, Brasil, 1997. SBC\n \n\n\n\n
\n\n\n\n \n \n \"ModelagemPaper\n  \n \n \n \"Modelagem pdf\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 \n \n\n\n\n
\n
@inproceedings{sbac-pad_estendido,\n author = {Daniel Câmara and André Guedes},\n title = {Modelagem Paralela em Anel do “Ray Tracing”},\n booktitle = {Anais Estendidos do IX Simpósio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho},\n location = {Campos do Jordão/SP},\n year = {1997},\n keywords = {Ray Tracing, custo, átomo},\n issn = {0000-0000},\n pages = {553-556},\n publisher = {SBC},\n address = {Porto Alegre, RS, Brasil},\n doi = {10.5753/sbac-pad_estendido.1997.22655},\n url = {https://sol.sbc.org.br/index.php/sbac-pad_estendido/article/view/22655},\n url_pdf = {https://sol.sbc.org.br/index.php/sbac-pad_estendido/article/view/22655/22479}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Divisão Dinâmica em Anel do Cálculo do Ray Tracing.\n \n \n \n \n\n\n \n Daniel Câmara; and André L. P. Guedes.\n\n\n \n\n\n\n In Luiz Henrique de Figueiredo; and Marcio Lobo Netto., editor(s), X Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens (SIBGRAPI' 97) - Trabalhos de IC, Porto Alegre, 1997. Brazilian Symposium on Computer Graphics and Image Processing, 10. (SIBGRAPI), Sociedade Brasileira de Computação\n The conference was held in Campos de Jordão, SP, Brazil, from October 13 to 16.\n\n\n\n
\n\n\n\n \n \n \"Divisão pdf\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \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 Ray tracing is an algorithm to generate realistic images from three-dimensional scenes. The main goal of this paper is to give a parallel alternative to calculate the ray tracing, improving the traditional form, which is ineficient. We're going to show some ways to paralelize the algorithm and our solution, which consists of the dynamic division of the image plane among process organized in a structure similar to a ring network.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Uma representação poliédrica robusta para objetos segmentados em regiões aproximadas por planos.\n \n \n \n\n\n \n O. R. P. Bellon; A. L. P. Guedes; and C. L. Tozzi.\n\n\n \n\n\n\n In Anais do XXIV Seminário Integrado de Hardware e Software (SEMISH), pages 179-190, Brasília – DF, 1997. \n \n\n\n\n
\n\n\n\n \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\n\n\n
\n
@InProceedings{Bellon97b,\n   author       = {O. R. P. Bellon and A. L. P. Guedes and C. L. Tozzi},\n   title         = {Uma  representação poliédrica  robusta para  objetos\n                  segmentados em regiões aproximadas por planos},\n   booktitle     = {Anais  do  XXIV Seminário  Integrado  de Hardware  e\n                  Software (SEMISH)},\n   pages        = {179-190},\n   year         = 1997,\n   keywords     = {CNCL,kwLIC},\n   address      = {Brasília -- DF}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1996\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n A robust polyhedral representation for segmented objects in range images.\n \n \n \n\n\n \n O. R. P. Bellon; A. L. P. Guedes; and C. L. Tozzi.\n\n\n \n\n\n\n In Proceedings of the Fourth International Conference on Control, Automation, Robotics and Vision (ICARCV), pages 1021-1026, Westin Stamford - Singapore, 1996. \n \n\n\n\n
\n\n\n\n \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\n\n\n
\n
@InProceedings{Bellon96a,\n   author       = {O. R. P. Bellon and A. L. P. Guedes and C. L. Tozzi},\n   title         = {A  robust  polyhedral  representation for  segmented\n                  objects in range images},\n   booktitle    = {Proceedings of the Fourth International Conference on\n                  Control, Automation, Robotics and Vision (ICARCV)},\n   year         = 1996,\n   pages        = {1021-1026},\n   keywords     = {CICL,kwLIC},\n   address      = {Westin Stamford - Singapore}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1995\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Representação de Variedades Combinatórias de Dimensão $n$.\n \n \n \n \n\n\n \n André Luiz Pires Guedes.\n\n\n \n\n\n\n M.Sc. Thesis, COPPE/Engenharia de Sistemas e Computação - UFRJ, Rio de janeiro, RJ, janeiro 1995.\n Orientador: Ronaldo C. Marinho Persiano.\n\n\n\n
\n\n\n\n \n \n \"RepresentaçãoPaper\n  \n \n \n \"Representação pdf\n  \n \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\n\n\n
\n
@MastersThesis{Guedes95,\n   author       = {Guedes, André Luiz Pires},\n   title        = {Representação de Variedades Combinatórias de Dimensão\n                  $n$},\n   school       = {{COPPE}/Engenharia de Sistemas e Computação - {UFRJ}},\n   address      = {Rio de janeiro, RJ},\n   year         = 1995,\n   month        = {janeiro},\n   note         = {Orientador: Ronaldo C. Marinho Persiano.},\n   keywords     = {MSc-TH,kwIMAGO},\n   type         = {M.{Sc}. Thesis},\n   url                                                                 =\n                  {https://www.cos.ufrj.br/index.php/pt-BR/publicacoes-pesquisa/details/15/1557},\n   url_pdf      = {https://www.cos.ufrj.br/uploadfile/1368037158.pdf},\n   _file        = {http://www.inf.ufpr.br/andre/files/MSc-andre.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1991\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Modelagem Topológica de Variedades.\n \n \n \n\n\n \n A. L. P. Guedes; M. R. Ramirez; and Ronaldo Cesar Marinho Persiano.\n\n\n \n\n\n\n In I Seminário de Computação de Imagens - UNICAMP, Campinas - SP, 1991. \n \n\n\n\n
\n\n\n\n \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{GuedesRamirezPersiano1991,\n   author       = {Guedes, A. L.  P.  and Ramirez, M.  R.  and Persiano,\n                  Ronaldo Cesar Marinho},\n   title        = {Modelagem Topológica de Variedades},\n   booktitle    = {I Seminário de Computação de Imagens - UNICAMP},\n   year         = {1991},\n   address      = {Campinas - SP}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1990\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n MOD - Um Pequeno Modelador de Sólidos B-rep.\n \n \n \n\n\n \n André Luiz Pires Guedes; Milton Ramos Ramirez; and Ronaldo Marinho Persiano.\n\n\n \n\n\n\n In XIII Congresso Nacional de Matemática Aplicada e Computacional, pages 115, Águas de Lindóia - SP, 1990. \n \n\n\n\n
\n\n\n\n \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\n\n\n
\n
@InProceedings{Guedes90CNMAC,\n   author       =  {Guedes, André Luiz  Pires and Ramirez,  Milton Ramos\n                  and Persiano, Ronaldo Marinho},\n   title        = {{MOD} - Um Pequeno Modelador de Sólidos B-rep},\n   booktitle     = {XIII  Congresso  Nacional de  Matemática Aplicada  e\n                  Computacional},\n   year         = 1990,\n   pages        = {115},\n   address      = {Águas de Lindóia - SP},\n   keywords     = {CNCL,kwIMAGO}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n MOD - Um Pequeno Modelador de Sólidos B-rep.\n \n \n \n\n\n \n André Luiz Pires Guedes; Milton Ramos Ramirez; and Ronaldo Marinho Persiano.\n\n\n \n\n\n\n In Anais do SIBGRAPI'90, Gramado, RS, 1990. \n \n\n\n\n
\n\n\n\n \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
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1989\n \n \n (8)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n MOD - Um Pequeno Modelador de Sólidos B-rep.\n \n \n \n\n\n \n André Luiz Pires Guedes; and Milton Ramos Ramirez.\n\n\n \n\n\n\n Technical Report Instituto de Matemática - UFRJ, Rio de Janeiro, RJ, 1989.\n \n\n\n\n
\n\n\n\n \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
@TechReport{GuedesRamirez1989,\n   author       = {Guedes, André Luiz Pires and Ramirez, Milton Ramos},\n   title        = {{MOD} - Um Pequeno Modelador de Sólidos B-rep},\n   year         = {1989},\n   address      = {Rio de Janeiro, RJ},\n   type         = {Projeto final de curso},\n   institution  = {Instituto de Matemática - UFRJ}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Construção de Rosáceas.\n \n \n \n\n\n \n A. L. P. Guedes; and M. A. F. Rodrigues.\n\n\n \n\n\n\n In II Congresso Nacional de Iniciação Científica em Matemática, pages 68-73, Rio de Janeiro - RJ, 1989. \n \n\n\n\n
\n\n\n\n \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{GuedesRodrigues1989CNICM,\n   author       = {Guedes, A. L. P. and Rodrigues, M. A. F.},\n   title        = {Construção de Rosáceas},\n   booktitle     = {II  Congresso  Nacional de  Iniciação Científica  em\n                  Matemática},\n   year         = {1989},\n   pages        = {68-73},\n   address      = {Rio de Janeiro - RJ}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Construção de Rosáceas.\n \n \n \n\n\n \n A. L. P. Guedes; and M. A. F. Rodrigues.\n\n\n \n\n\n\n In Anais do XII CNMAC - Congresso Nacional de Matemática Aplicada e Computacional, pages 514-517, São José do Rio Preto - SP, 1989. \n \n\n\n\n
\n\n\n\n \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{GuedesRodrigues1989,\n   author       = {Guedes, A. L. P. and Rodrigues, M. A. F.},\n   title        = {Construção de Rosáceas},\n   booktitle    = {Anais do XII CNMAC - Congresso Nacional de Matemática\n                  Aplicada e Computacional},\n   year         = {1989},\n   pages        = {514-517},\n   address      = {São José do Rio Preto - SP}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Curvas de Nível.\n \n \n \n\n\n \n A. L. P. Guedes.\n\n\n \n\n\n\n In Semana de Matemática - UFES, Vitória - ES, 1989. \n \n\n\n\n
\n\n\n\n \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{Guedes1989nivelUFES,\n   author       = {Guedes, A. L. P.},\n   title        = {Curvas de Nível},\n   booktitle    = {Semana de Matemática - UFES},\n   year         = {1989},\n   address      = {Vitória - ES}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Curvas de Nível.\n \n \n \n\n\n \n A. L. P. Guedes.\n\n\n \n\n\n\n In XII Jornada de Iniciação Científica - UFRJ, Rio de Janeiro, 1989. \n \n\n\n\n
\n\n\n\n \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{Guedes1989nivelJornada,\n   author       = {Guedes, A. L. P.},\n   title        = {Curvas de Nível},\n   booktitle    = {XII Jornada de Iniciação Científica - UFRJ},\n   year         = {1989},\n   address      = {Rio de Janeiro}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Curvas de Nível.\n \n \n \n\n\n \n A. L. P. Guedes.\n\n\n \n\n\n\n In II Congresso Nacional de Iniciação Científica em Matemática, pages 102-104, Rio de Janeiro, 1989. \n \n\n\n\n
\n\n\n\n \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{Guedes1989nivel,\n   author       = {Guedes, A. L. P.},\n   title        = {Curvas de Nível},\n   booktitle     = {II  Congresso  Nacional de  Iniciação Científica  em\n                  Matemática},\n   year         = {1989},\n   pages        = {102-104},\n   address      = {Rio de Janeiro}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Interexp - Interpretador de Expressões.\n \n \n \n\n\n \n A. L. P. Guedes.\n\n\n \n\n\n\n In II Congresso Nacional de Iniciação Científica em Matemática, pages 146-151, Rio de Janeiro, 1989. \n \n\n\n\n
\n\n\n\n \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{Guedes1989interexp,\n   author       = {Guedes, A. L. P.},\n   title        = {Interexp - Interpretador de Expressões},\n   booktitle     = {II  Congresso  Nacional de  Iniciação Científica  em\n                  Matemática},\n   year         = {1989},\n   pages        = {146-151},\n   address      = {Rio de Janeiro}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n MOD - Um Pequeno Modelador de Sólidos B-rep.\n \n \n \n\n\n \n André Luiz Pires Guedes; Milton Ramos Ramirez; and Ronaldo Marinho Persiano.\n\n\n \n\n\n\n In XII Jornada de Iniciação Científica - UFRJ, Janeiro - RJ, 1989. \n \n\n\n\n
\n\n\n\n \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{Guedes1989MODJornada,\n   author       =  {Guedes, André Luiz  Pires and Ramirez,  Milton Ramos\n                  and Persiano, Ronaldo Marinho},\n   title        = {{MOD} - Um Pequeno Modelador de Sólidos B-rep},\n   booktitle    = {XII Jornada de Iniciação Científica - UFRJ},\n   year         = {1989},\n   address      = {Janeiro - RJ}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1988\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Introdução à Computação Gráfica - Gráfico de Funções.\n \n \n \n\n\n \n André L. P. Guedes; and T. V. Silva Filha.\n\n\n \n\n\n\n Technical Report Laboratório de Matemática Aplicada do IM/UFRJ, Rio de Janeiro - RJ, 1988.\n \n\n\n\n
\n\n\n\n \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
@TechReport{GuedesSilva1988Apostila,\n   author       = {André L. P. Guedes and T. V. da Silva Filha},\n   title        = {Introdução à Computação Gráfica - Gráfico de Funções},\n   institution  = {Laboratório de Matemática Aplicada do IM/UFRJ},\n   year         = {1988},\n   type         = {Apostila},\n   address      = {Rio de Janeiro - RJ}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Iniciação Científica, Informática e Intercâmbio.\n \n \n \n\n\n \n G. Malajovich; A. L. P. Guedes; and M. R. Ramirez.\n\n\n \n\n\n\n In I Congresso Nacional de Iniciação Científica em Matemática, Rio de Janeiro - RJ, 1988. \n \n\n\n\n
\n\n\n\n \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{MalajovichGuedesRamirez1988CNICM,\n   author       =  {Malajovich, G. and  Guedes, A.  L. P.   and Ramirez,\n                  M. R.},\n   title        = {Iniciação Científica, Informática e Intercâmbio},\n   booktitle     =  {I Congresso  Nacional  de  Iniciação Científica  em\n                  Matemática},\n   year         = {1988},\n   address      = {Rio de Janeiro - RJ}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Iniciação Científica, Informática e Intercâmbio.\n \n \n \n\n\n \n G. Malajovich; A. L. P. Guedes; and M. R. Ramirez.\n\n\n \n\n\n\n In 40a Reunião Anual da SBPC - Ciência e Cultura, pages 171, São Paulo, 1988. \n \n\n\n\n
\n\n\n\n \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{MalajovichGuedesRamirez1988,\n   author       =  {Malajovich, G. and  Guedes, A.  L. P.   and Ramirez,\n                  M. R.},\n   title        = {Iniciação Científica, Informática e Intercâmbio},\n   booktitle    = {40a Reunião Anual da SBPC - Ciência e Cultura},\n   year         = {1988},\n   pages        = {171},\n   address      = {São Paulo}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Introdução à Computação Gráfica - Gráfico de Funções.\n \n \n \n\n\n \n André L. P. Guedes; and T. V. Silva Filha.\n\n\n \n\n\n\n In I Congresso Nacional de Iniciação Científica em Matemática, Rio de Janeiro - RJ, 1988. \n \n\n\n\n
\n\n\n\n \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{GuedesSilva1988,\n   author       = {André L. P. Guedes and T. V. da Silva Filha},\n   title        = {Introdução à Computação Gráfica - Gráfico de Funções},\n   booktitle     =  {I Congresso  Nacional  de  Iniciação Científica  em\n                  Matemática},\n   year         = {1988},\n   address      = {Rio de Janeiro - RJ}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Gráficos no Computador - Sistema PLOTTER.\n \n \n \n\n\n \n A. L. P. Guedes.\n\n\n \n\n\n\n In I Congresso Nacional de Iniciação Científica em Matemática, Rio de Janeiro - RJ, 1988. \n \n\n\n\n
\n\n\n\n \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{Guedes1988PLOTTER,\n   author       = {Guedes, A. L. P.},\n   title        = {Gráficos no Computador - Sistema {PLOTTER}},\n   booktitle     =  {I Congresso  Nacional  de  Iniciação Científica  em\n                  Matemática},\n   year         = {1988},\n   address      = {Rio de Janeiro - RJ}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1987\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Gráficos no Computador - Sistema PLOTTER.\n \n \n \n\n\n \n A. L. P. Guedes.\n\n\n \n\n\n\n In X Jornada Interna de Iniciação Científica - UFRJ, Rio de Janeiro - RJ, 1987. \n \n\n\n\n
\n\n\n\n \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{Guedes1987,\n   author       = {Guedes, A. L. P.},\n   title        = {Gráficos no Computador - Sistema {PLOTTER}},\n   booktitle    = {X Jornada Interna de Iniciação Científica - UFRJ},\n   year         = {1987},\n   address      = {Rio de Janeiro - RJ}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1985\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Gráficos de Funções.\n \n \n \n\n\n \n A. L. P. Guedes.\n\n\n \n\n\n\n In VIII Jornada Interna de Iniciação Científica da UFRJ, pages 83, Rio de Janeiro, 1985. \n \n\n\n\n
\n\n\n\n \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{Guedes1985,\n   author       = {Guedes, A. L. P.},\n   title        = {Gráficos de Funções},\n   booktitle    = {VIII Jornada Interna de Iniciação Científica da UFRJ},\n   year         = {1985},\n   pages        = {83},\n   address      = {Rio de Janeiro}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n undefined\n \n \n (2)\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 In . \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 9 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
\n \n\n \n \n \n \n \n .\n \n \n \n\n\n \n .\n\n\n \n\n\n\n In . \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 9 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\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);