var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"http://www.inf.ufpr.br/teoria/universal2016/universal.bib\",\"fullnames\":\"1\",\"jsonp\":\"1\",\"host\":\"bibbase.org\",\"ssl\":false},\n      data: [{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Alane\",\"M.\"],\"propositions\":[\"de\"],\"lastnames\":[\"Lima\"],\"suffixes\":[]},{\"firstnames\":[\"Murilo\",\"V.\",\"G.\"],\"propositions\":[\"da\"],\"lastnames\":[\"Silva\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]}],\"title\":\"Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory\",\"year\":\"2020\",\"booktitle\":\"26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining\",\"bibtex\":\"@inproceedings{LimaSilvaVignatti2020-A,\\n  author = {Alane M. de Lima and Murilo V. G. da Silva and André L. Vignatti},\\n  title = {Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory},\\n  year = {2020},\\n  booktitle = {26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining},\\n}\\n\\n\",\"author_short\":[\"de Lima, A. M.\",\"da Silva, M. V. G.\",\"Vignatti, A. L.\"],\"key\":\"LimaSilvaVignatti2020-A\",\"id\":\"LimaSilvaVignatti2020-A\",\"bibbaseid\":\"delima-dasilva-vignatti-estimatingthepercolationcentralityoflargenetworksthroughpseudodimensiontheory-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Tighter Dual Bounds on the Least Cost Influence Problem\",\"year\":\"2020\",\"booktitle\":\"LII Simpósio Brasileiro de Pesquisa Operacional.\",\"author\":[{\"firstnames\":[\"Renato\",\"S.\"],\"propositions\":[\"de\"],\"lastnames\":[\"Melo\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]},{\"firstnames\":[\"Flávio\",\"K.\"],\"propositions\":[],\"lastnames\":[\"Miyazawa\"],\"suffixes\":[]},{\"firstnames\":[\"Matheus\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Ota\"],\"suffixes\":[]}],\"bibtex\":\"@inproceedings{Melo2020-A,\\ntitle = \\\" Tighter Dual Bounds on the Least Cost Influence Problem\\\",\\nyear = \\\"2020\\\",\\nbooktitle = \\\"LII Simpósio Brasileiro de Pesquisa Operacional.\\\",\\nauthor = \\\"Renato S. de Melo and André L. Vignatti and Flávio K. Miyazawa and Matheus J. Ota\\\"\\n}\\n\\n\",\"author_short\":[\"de Melo, R. S.\",\"Vignatti, A. L.\",\"Miyazawa, F. K.\",\"Ota, M. J.\"],\"key\":\"Melo2020-A\",\"id\":\"Melo2020-A\",\"bibbaseid\":\"demelo-vignatti-miyazawa-ota-tighterdualboundsontheleastcostinfluenceproblem-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Preprocessing Rules for Target Set Selection in Complex Networks\",\"year\":\"2020\",\"booktitle\":\"IX Brazilian Workshop on Social Network Analysis and Mining.\",\"author\":[{\"firstnames\":[\"Renato\",\"S.\"],\"propositions\":[\"de\"],\"lastnames\":[\"Melo\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]}],\"bibtex\":\"@inproceedings{Melo2020-B,\\ntitle = \\\"Preprocessing Rules for Target Set Selection in Complex Networks\\\",\\nyear = \\\"2020\\\",\\nbooktitle = \\\"IX Brazilian Workshop on Social Network Analysis and Mining.\\\",\\nauthor = \\\"Renato S. de Melo and André L. Vignatti\\\"\\n}\\n\\n\",\"author_short\":[\"de Melo, R. S.\",\"Vignatti, A. L.\"],\"key\":\"Melo2020-B\",\"id\":\"Melo2020-B\",\"bibbaseid\":\"demelo-vignatti-preprocessingrulesfortargetsetselectionincomplexnetworks-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Blocking the Spread of Misinformation in a Network under Distinct Cost Models\",\"year\":\"2020\",\"booktitle\":\"XII International Conference on Advances in Social Network Analysis and Mining.\",\"author\":[{\"firstnames\":[\"Fernando\",\"C.\"],\"propositions\":[],\"lastnames\":[\"Erd\"],\"suffixes\":[]},{\"firstnames\":[\"Murilo\",\"V.\",\"G.\"],\"propositions\":[\"da\"],\"lastnames\":[\"Silva\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]}],\"bibtex\":\"@inproceedings{Erd2020,\\ntitle = \\\"Blocking the Spread of Misinformation in a Network under Distinct Cost Models\\\",\\nyear = \\\"2020\\\",\\nbooktitle = \\\"XII International Conference on Advances in Social Network Analysis and Mining.\\\",\\nauthor = \\\"Fernando C. Erd and Murilo V. G. da Silva and André L. Vignatti\\\"\\n}\\n\\n\",\"author_short\":[\"Erd, F. C.\",\"da Silva, M. V. G.\",\"Vignatti, A. L.\"],\"key\":\"Erd2020\",\"id\":\"Erd2020\",\"bibbaseid\":\"erd-dasilva-vignatti-blockingthespreadofmisinformationinanetworkunderdistinctcostmodels-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Renato\"],\"propositions\":[],\"lastnames\":[\"Carmo\"],\"suffixes\":[]},{\"firstnames\":[\"Matheus\",\"Vinicius\"],\"propositions\":[],\"lastnames\":[\"Correa\"],\"suffixes\":[]},{\"firstnames\":[\"Alexandre\",\"Prusch\"],\"propositions\":[],\"lastnames\":[\"Züge\"],\"suffixes\":[]}],\"title\":\"Lexicographic Breadth First-Search and Branch and Bound Algorithms for the Maximum Clique Problem\",\"language\":\"english\",\"year\":\"2020\",\"booktitle\":\"Proc. IX Latin American Workshop on Cliques in Graphs\",\"address\":\"Rio de Janeiro\",\"bibtex\":\"@InProceedings{CarmoCorreaZuge20,\\n   author       = {Renato Carmo and Matheus Vinicius Correa and\\n                     Alexandre Prusch Züge},\\n   title        = {Lexicographic Breadth First-Search and Branch and\\n                     Bound Algorithms for the Maximum Clique Problem},\\n   language     = {english},\\n   year         = {2020},\\n   booktitle    = {Proc. IX Latin American Workshop on Cliques in\\n                     Graphs},\\n   address      = {Rio de Janeiro}\\n}\\n\\n\",\"author_short\":[\"Carmo, R.\",\"Correa, M. V.\",\"Züge, A. P.\"],\"key\":\"CarmoCorreaZuge20\",\"id\":\"CarmoCorreaZuge20\",\"bibbaseid\":\"carmo-correa-zge-lexicographicbreadthfirstsearchandbranchandboundalgorithmsforthemaximumcliqueproblem-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inbook\",\"type\":\"Book Chapter\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Alves\"],\"firstnames\":[\"G.\",\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Goncalves\"],\"firstnames\":[\"D.\",\"C.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Zuge\"],\"firstnames\":[\"Alexandre\",\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Beleti\",\"Jr.\"],\"firstnames\":[\"C.\",\"R.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Santiago\",\"Jr.\"],\"firstnames\":[\"R.\",\"M.\"],\"suffixes\":[]}],\"title\":\"As tecnologias digitais e o ensino de ciências e de computação na sociedade contemporânea\",\"chapter\":\"Projeto \\\"Por dentro do computador\\\": uma iniciativa de divulgação e popularização da arquitetura de computadores\",\"publisher\":\"Booknando Livros\",\"year\":\"2019\",\"optkey\":\"\",\"volume\":\"1\",\"number\":\"\",\"series\":\"\",\"address\":\"Palotina, PR\",\"edition\":\"\",\"month\":\"\",\"pages\":\"162-172\",\"note\":\"Organizado por Eliana Santana Lisbôa e Valdir Rosa\",\"annote\":\"\",\"bibtex\":\"@InBook{AlvesGoncalvesZugeBeletiSantiago2019,\\n   author       = {Alves, G. J. and Goncalves, D. C. M. and Zuge,\\n                     Alexandre P. and Beleti Jr., C. R. and Santiago\\n                     Jr., R. M.},\\n   title        = {As tecnologias digitais e o ensino de ciências e de\\n                     computação na sociedade contemporânea},\\n   chapter      = {Projeto \\\"Por dentro do computador\\\": uma iniciativa\\n                     de divulgação e popularização da arquitetura de\\n                     computadores},\\n   publisher    = {Booknando Livros},\\n   year         = {2019},\\n   optkey       = {},\\n   volume       = {1},\\n   number       = {},\\n   series       = {},\\n   type         = {Book Chapter},\\n   address      = {Palotina, PR},\\n   edition      = {},\\n   month        = {},\\n   pages        = {162-172},\\n   note         = {Organizado por Eliana Santana Lisbôa e Valdir Rosa},\\n   annote       = {}\\n}\\n\\n\",\"author_short\":[\"Alves, G. J.\",\"Goncalves, D. C. M.\",\"Zuge, A. P.\",\"Beleti Jr., C. R.\",\"Santiago Jr., R. M.\"],\"key\":\"AlvesGoncalvesZugeBeletiSantiago2019\",\"id\":\"AlvesGoncalvesZugeBeletiSantiago2019\",\"bibbaseid\":\"alves-goncalves-zuge-beletijr-santiagojr-astecnologiasdigitaiseoensinodecinciasedecomputaonasociedadecontempornea-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Beleti\",\"JR.\"],\"firstnames\":[\"C.\",\"R.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Goncalves\"],\"firstnames\":[\"D.\",\"C.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Valerio\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Zuge\"],\"firstnames\":[\"Alexandre\",\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Santiago\",\"JR.\"],\"firstnames\":[\"R.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Alves\"],\"firstnames\":[\"G.\",\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Alencar\"],\"firstnames\":[\"V.\",\"H.\",\"S.\"],\"suffixes\":[]}],\"title\":\"Popularizando a Computação: o desenvolvimento de recursos para a educação não-formal sobre Arquitetura de Computadores\",\"optcrossref\":\"\",\"optkey\":\"\",\"booktitle\":\"35° Seminário de Extensão Universitária da Região Sul - SEURS\",\"year\":\"2017\",\"editor\":[{\"firstnames\":[],\"propositions\":[],\"lastnames\":[\"UNILA\"],\"suffixes\":[]}],\"volume\":\"\",\"number\":\"\",\"series\":\"\",\"pages\":\"1248-1253\",\"month\":\"\",\"address\":\"Foz do Iguaçu\",\"organization\":\"UNILA\",\"publisher\":\"\",\"note\":\"\",\"annote\":\"\",\"bibtex\":\"@InProceedings{BeletiGoncalvesValerioZugeSantiagoAlvesAlencar2017,\\n   author       = {Beleti JR., C. R. and Goncalves, D. C. M. and\\n                     Valerio, M. and Zuge, Alexandre P. and Santiago\\n                     JR., R. M. and Alves, G. J. and Alencar,\\n                     V. H. S.},\\n   title        = {Popularizando a Computação: o desenvolvimento de\\n                     recursos para a educação não-formal sobre\\n                     Arquitetura de Computadores},\\n   optcrossref  = {},\\n   optkey       = {},\\n   booktitle    = {35° Seminário de Extensão Universitária da Região\\n                     Sul - SEURS},\\n   year         = {2017},\\n   editor       = {UNILA},\\n   volume       = {},\\n   number       = {},\\n   series       = {},\\n   pages        = {1248-1253},\\n   month        = {},\\n   address      = {Foz do Iguaçu},\\n   organization = {UNILA},\\n   publisher    = {},\\n   note         = {},\\n   annote       = {}\\n}\\n\\n\",\"author_short\":[\"Beleti JR., C. R.\",\"Goncalves, D. C. M.\",\"Valerio, M.\",\"Zuge, A. P.\",\"Santiago JR., R. M.\",\"Alves, G. J.\",\"Alencar, V. H. S.\"],\"editor_short\":[\"UNILA\"],\"key\":\"BeletiGoncalvesValerioZugeSantiagoAlvesAlencar2017\",\"id\":\"BeletiGoncalvesValerioZugeSantiagoAlvesAlencar2017\",\"bibbaseid\":\"beletijr-goncalves-valerio-zuge-santiagojr-alves-alencar-popularizandoacomputaoodesenvolvimentoderecursosparaaeducaonoformalsobrearquiteturadecomputadores-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Gabriel\",\"A.\",\"G.\"],\"propositions\":[],\"lastnames\":[\"Sobral\"],\"suffixes\":[]},{\"firstnames\":[\"Marina\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"title\":\"Biclique edge-choosability in some classes of graphs\",\"year\":\"2017\",\"booktitle\":\"II Encontro de Teoria da Computação - ETC, São Paulo, Brasil\",\"url\":\"http://csbc2017.mackenzie.br/public/files/2-etc/artigos/4.pdf\",\"bibtex\":\"@inproceedings{SobralGroshausGuedesETC2017,\\n  author = {Gabriel A. G. Sobral and Marina Groshaus and André 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, Brasil},\\n  url = {http://csbc2017.mackenzie.br/public/files/2-etc/artigos/4.pdf}\\n}\\n\\n\",\"author_short\":[\"Sobral, G. A. G.\",\"Groshaus, M.\",\"Guedes, A. L. P.\"],\"key\":\"SobralGroshausGuedesETC2017\",\"id\":\"SobralGroshausGuedesETC2017\",\"bibbaseid\":\"sobral-groshaus-guedes-bicliqueedgechoosabilityinsomeclassesofgraphs-2017\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://csbc2017.mackenzie.br/public/files/2-etc/artigos/4.pdf\"},\"metadata\":{\"authorlinks\":{\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Leandro\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]},{\"firstnames\":[\"Renato\"],\"propositions\":[],\"lastnames\":[\"Carmo\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"title\":\"Edge-colouring of triangle-free graphs with no proper majors\",\"year\":\"2017\",\"booktitle\":\"II Encontro de Teoria da Computação - ETC, São Paulo, Brasil\",\"url\":\"http://csbc2017.mackenzie.br/public/files/2-etc/artigos/13.pdf\",\"bibtex\":\"@inproceedings{ZateskoCarmoGuedesETC2017,\\n  author = {Leandro M. Zatesko and Renato Carmo and André L. P. Guedes},\\n  title = {Edge-colouring of triangle-free graphs with no proper majors},\\n  year = 2017,\\n  booktitle = {II Encontro de Teoria da Computação - ETC, São Paulo, Brasil},\\n  url = {http://csbc2017.mackenzie.br/public/files/2-etc/artigos/13.pdf}\\n}\\n\\n\",\"author_short\":[\"Zatesko, L. M.\",\"Carmo, R.\",\"Guedes, A. L. P.\"],\"key\":\"ZateskoCarmoGuedesETC2017\",\"id\":\"ZateskoCarmoGuedesETC2017\",\"bibbaseid\":\"zatesko-carmo-guedes-edgecolouringoftrianglefreegraphswithnopropermajors-2017\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://csbc2017.mackenzie.br/public/files/2-etc/artigos/13.pdf\"},\"metadata\":{\"authorlinks\":{\"zatesko, l\":\"https://pessoal.dainf.ct.utfpr.edu.br/zatesko/\",\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Biclique graph of bipartite permutation graphs\",\"journal\":\"Electronic Notes in Discrete Mathematics\",\"volume\":\"62\",\"pages\":\"33–38\",\"year\":\"2017\",\"note\":\"LAGOS'17 - IX Latin and American Algorithms, Graphs and Optimization.\",\"issn\":\"1571-0653\",\"doi\":\"10.1016/j.endm.2017.10.007\",\"url\":\"https://www.sciencedirect.com/science/article/pii/S1571065317302457\",\"abstract_url\":\"https://lipn.univ-paris13.fr/Lagos2017/abstracts_final_short.pdf\",\"author\":[{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"A.\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]},{\"firstnames\":[\"J.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Puppo\"],\"suffixes\":[]}],\"keywords\":\"Bipartite permutation graphs \",\"abstract\":\"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. \",\"bibtex\":\"@article{GroshausGuedesPuppo2017,\\ntitle = \\\"Biclique graph of bipartite permutation graphs\\\",\\njournal = \\\"Electronic Notes in Discrete Mathematics\\\",\\nvolume = \\\"62\\\",\\npages = \\\"33--38\\\",\\nyear = \\\"2017\\\",\\nnote = \\\"LAGOS'17 - {IX} Latin and American Algorithms, Graphs and Optimization.\\\",\\nissn = \\\"1571-0653\\\",\\ndoi = \\\"10.1016/j.endm.2017.10.007\\\",\\nurl = \\\"https://www.sciencedirect.com/science/article/pii/S1571065317302457\\\",\\nabstract_url = {https://lipn.univ-paris13.fr/Lagos2017/abstracts_final_short.pdf},\\nauthor = \\\"M. Groshaus and A. L. P. Guedes and J. P. Puppo\\\",\\nkeywords = \\\"Bicliques\\\",\\nkeywords = \\\"Biclique graphs\\\",\\nkeywords = \\\"Bipartite permutation graphs \\\",\\nabstract = \\\"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\",\"author_short\":[\"Groshaus, M.\",\"Guedes, A. L. P.\",\"Puppo, J. P.\"],\"key\":\"GroshausGuedesPuppo2017\",\"id\":\"GroshausGuedesPuppo2017\",\"bibbaseid\":\"groshaus-guedes-puppo-bicliquegraphofbipartitepermutationgraphs-2017\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.sciencedirect.com/science/article/pii/S1571065317302457\"},\"keyword\":[\"Bipartite permutation graphs\"],\"metadata\":{\"authorlinks\":{\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Leandro\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]},{\"firstnames\":[\"Renato\"],\"propositions\":[],\"lastnames\":[\"Carmo\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"title\":\"Upper Bounds for the Total Chromatic Number of Join Graphs and Cobipartite Graphs\",\"booktitle\":\"Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,\",\"year\":\"2018\",\"pages\":\"247-253\",\"publisher\":\"SciTePress\",\"organization\":\"INSTICC\",\"doi\":\"10.5220/0006627102470253\",\"isbn\":\"978-989-758-285-1\",\"bibtex\":\"@inproceedings{ZateskoCarmoGuedesICORES2018,\\nauthor={Leandro M. Zatesko and Renato Carmo and André L. P. Guedes},\\ntitle={Upper Bounds for the Total Chromatic Number of Join Graphs and Cobipartite Graphs},\\nbooktitle={Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},\\nyear={2018},\\npages={247-253},\\npublisher={SciTePress},\\norganization={INSTICC},\\ndoi={10.5220/0006627102470253},\\nisbn={978-989-758-285-1},\\n}\\n\\n\",\"author_short\":[\"Zatesko, L. M.\",\"Carmo, R.\",\"Guedes, A. L. P.\"],\"key\":\"ZateskoCarmoGuedesICORES2018\",\"id\":\"ZateskoCarmoGuedesICORES2018\",\"bibbaseid\":\"zatesko-carmo-guedes-upperboundsforthetotalchromaticnumberofjoingraphsandcobipartitegraphs-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"zatesko, l\":\"https://pessoal.dainf.ct.utfpr.edu.br/zatesko/\",\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"The Biclique Graph of $K_3$-free Graphs are the Square of Some Graph\",\"author\":[{\"firstnames\":[\"Marina\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"year\":\"2018\",\"language\":\"english\",\"booktitle\":\"Proc. VIII Latin American Workshop on Cliques in Graphs\",\"address\":\"Rio de Janeiro\",\"pages\":\"25\",\"url\":\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\",\"bibtex\":\"@inproceedings{GroshausGuedesLAWCG2018,\\n  title={The Biclique Graph of {$K_3$}-free Graphs are the 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 Graphs},\\n  address = {Rio de Janeiro},\\n  pages = {25},\\n  url = \\\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\\\"\\n}\\n\\n\",\"author_short\":[\"Groshaus, M.\",\"Guedes, A. L. P.\"],\"key\":\"GroshausGuedesLAWCG2018\",\"id\":\"GroshausGuedesLAWCG2018\",\"bibbaseid\":\"groshaus-guedes-thebicliquegraphofk3freegraphsarethesquareofsomegraph-2018\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"},\"metadata\":{\"authorlinks\":{\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"A Recolouring Procedure for Total Colouring\",\"author\":[{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]},{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Carmo\"],\"suffixes\":[]},{\"firstnames\":[\"A.\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"year\":\"2018\",\"language\":\"english\",\"booktitle\":\"Proc. VIII Latin American Workshop on Cliques in Graphs\",\"address\":\"Rio de Janeiro\",\"pages\":\"31\",\"url\":\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\",\"bibtex\":\"@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 Graphs},\\n  address = {Rio de Janeiro},\\n  pages = {31},\\n  url = \\\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\\\"\\n}\\n\\n\",\"author_short\":[\"Zatesko, L. M.\",\"Carmo, R.\",\"Guedes, A. L. P.\"],\"key\":\"ZateskoCarmoGuedesLAWCG2018\",\"id\":\"ZateskoCarmoGuedesLAWCG2018\",\"bibbaseid\":\"zatesko-carmo-guedes-arecolouringprocedurefortotalcolouring-2018\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"},\"metadata\":{\"authorlinks\":{\"zatesko, l\":\"https://pessoal.dainf.ct.utfpr.edu.br/zatesko/\",\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"A Decomposition for Edge-colouring\",\"author\":[{\"firstnames\":[\"Leandro\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]},{\"firstnames\":[\"João\",\"P.\",\"W.\"],\"propositions\":[],\"lastnames\":[\"Bernardi\"],\"suffixes\":[]},{\"firstnames\":[\"Sheila\",\"M.\"],\"propositions\":[\"de\"],\"lastnames\":[\"Almeida\"],\"suffixes\":[]},{\"firstnames\":[\"Renato\"],\"propositions\":[],\"lastnames\":[\"Carmo\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"year\":\"2018\",\"language\":\"english\",\"booktitle\":\"Proc. VIII Latin American Workshop on Cliques in Graphs\",\"address\":\"Rio de Janeiro\",\"url\":\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\",\"bibtex\":\"@inproceedings{ZateskoBernardiAlmeidaCarmoGuedesLAWCG2018,\\n  title={A Decomposition for Edge-colouring},\\n  author={Leandro Zatesko and João P. W. Bernardi and Sheila M. de Almeida and Renato Carmo and André L. P. Guedes},\\n  year      = 2018,\\n  language = {english},\\n  booktitle = {Proc. VIII Latin American Workshop on Cliques in Graphs},\\n  address = {Rio de Janeiro},\\n  url = \\\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\\\"\\n}\\n\\n\",\"author_short\":[\"Zatesko, L.\",\"Bernardi, J. P. W.\",\"de Almeida, S. M.\",\"Carmo, R.\",\"Guedes, A. L. P.\"],\"key\":\"ZateskoBernardiAlmeidaCarmoGuedesLAWCG2018\",\"id\":\"ZateskoBernardiAlmeidaCarmoGuedesLAWCG2018\",\"bibbaseid\":\"zatesko-bernardi-dealmeida-carmo-guedes-adecompositionforedgecolouring-2018\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Circular-arc Bigraphs and the Helly subclass\",\"author\":[{\"firstnames\":[\"Marina\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"Luiz\",\"Pires\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]},{\"firstnames\":[\"Fabricio\",\"Schiavon\"],\"propositions\":[],\"lastnames\":[\"Kolberg\"],\"suffixes\":[]}],\"year\":\"2018\",\"language\":\"english\",\"booktitle\":\"Proc. VIII Latin American Workshop on Cliques in Graphs\",\"address\":\"Rio de Janeiro\",\"pages\":\"60\",\"url\":\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\",\"bibtex\":\"@inproceedings{GroshausGuedesKolbergLAWCG2018,\\n  title={Circular-arc Bigraphs and the Helly subclass},\\n  author={Marina Groshaus and André Luiz Pires Guedes and Fabricio Schiavon Kolberg},\\n  year      = 2018,\\n  language = {english},\\n  booktitle = {Proc. VIII Latin American Workshop on Cliques in Graphs},\\n  address = {Rio de Janeiro},\\n  pages = {60},\\n  url = \\\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\\\"\\n}\\n\\n\",\"author_short\":[\"Groshaus, M.\",\"Guedes, A. L. P.\",\"Kolberg, F. S.\"],\"key\":\"GroshausGuedesKolbergLAWCG2018\",\"id\":\"GroshausGuedesKolbergLAWCG2018\",\"bibbaseid\":\"groshaus-guedes-kolberg-circulararcbigraphsandthehellysubclass-2018\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"},\"metadata\":{\"authorlinks\":{\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Biclique Graphs of Interval Bigraphs and Circular-arc Bigraphs\",\"author\":[{\"firstnames\":[\"E.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Cruz\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"A.\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"year\":\"2018\",\"language\":\"english\",\"booktitle\":\"Proc. VIII Latin American Workshop on Cliques in Graphs\",\"address\":\"Rio de Janeiro\",\"pages\":\"68\",\"url\":\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\",\"bibtex\":\"@inproceedings{CruzGroshausGuedesLAWCG2018,\\n  title={Biclique Graphs of Interval Bigraphs and Circular-arc 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 Graphs},\\n  address = {Rio de Janeiro},\\n  pages = {68},\\n  url = \\\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\\\"\\n}\\n\\n\",\"author_short\":[\"Cruz, E. P.\",\"Groshaus, M.\",\"Guedes, A. L. P.\"],\"key\":\"CruzGroshausGuedesLAWCG2018\",\"id\":\"CruzGroshausGuedesLAWCG2018\",\"bibbaseid\":\"cruz-groshaus-guedes-bicliquegraphsofintervalbigraphsandcirculararcbigraphs-2018\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"},\"metadata\":{\"authorlinks\":{\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Algoritmos de planejamento de caminhos 3D\",\"author\":[{\"firstnames\":[\"Cleiton\"],\"propositions\":[],\"lastnames\":[\"Santos\"],\"suffixes\":[]},{\"firstnames\":[\"A.\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"year\":\"2019\",\"booktitle\":\"Proc. Computer on the beach\",\"address\":\"Florianópolis\",\"bibtex\":\"@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}\\n\\n\",\"author_short\":[\"Santos, C.\",\"Guedes, A. L. P.\"],\"key\":\"SantosGuedes2019\",\"id\":\"SantosGuedes2019\",\"bibbaseid\":\"santos-guedes-algoritmosdeplanejamentodecaminhos3d-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Optimization System for Dynamic Flight Planning for Groups of Drones using Cooperation with Mobile Recharge Bases by Means of Multiagent System and Recursive Auctions\",\"author\":[{\"firstnames\":[\"Robison\",\"C.\"],\"propositions\":[],\"lastnames\":[\"Brito\"],\"suffixes\":[]},{\"firstnames\":[\"José\",\"F.\"],\"propositions\":[],\"lastnames\":[\"Loureiro\"],\"suffixes\":[]},{\"firstnames\":[\"Eduardo\"],\"propositions\":[],\"lastnames\":[\"Todt\"],\"suffixes\":[]},{\"firstnames\":[\"Andre\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"booktitle\":\"2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)\",\"publisher\":\"IEEE\",\"year\":\"2019\",\"address\":\"Milwaukee, Wisconsin, USA\",\"bibtex\":\"@inproceedings{Brito2019,\\n  title     = {Optimization System for Dynamic Flight Planning for Groups\\n               of Drones using Cooperation with Mobile Recharge Bases by\\n               Means of Multiagent System and Recursive Auctions},\\n  author    = {Robison C. Brito and José F. Loureiro and Eduardo Todt and Andre L. P. Guedes},\\n  booktitle = {2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)},\\n  publisher = {IEEE},\\n  year      = {2019},\\n  address   = {Milwaukee, Wisconsin, USA},\\n}\\n\\n\",\"author_short\":[\"Brito, R. C.\",\"Loureiro, J. F.\",\"Todt, E.\",\"Guedes, A. L. P.\"],\"key\":\"Brito2019\",\"id\":\"Brito2019\",\"bibbaseid\":\"brito-loureiro-todt-guedes-optimizationsystemfordynamicflightplanningforgroupsofdronesusingcooperationwithmobilerechargebasesbymeansofmultiagentsystemandrecursiveauctions-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"On comparing algorithms for the maximum clique problem\",\"journal\":\"Discrete Applied Mathematics\",\"volume\":\"247\",\"pages\":\"1-13\",\"year\":\"2018\",\"issn\":\"0166-218X\",\"doi\":\"10.1016/j.dam.2018.01.005\",\"url\":\"http://www.sciencedirect.com/science/article/pii/S0166218X18300167\",\"author\":[{\"firstnames\":[\"Alexandre\",\"Prusch\"],\"propositions\":[],\"lastnames\":[\"Züge\"],\"suffixes\":[]},{\"firstnames\":[\"Renato\"],\"propositions\":[],\"lastnames\":[\"Carmo\"],\"suffixes\":[]}],\"bibtex\":\"@Article{ZugeCarmo18,\\n   title        = {On comparing algorithms for the maximum clique\\n                     problem},\\n   journal      = {Discrete Applied Mathematics},\\n   volume       = {247},\\n   pages        = {1-13},\\n   year         = {2018},\\n   issn         = {0166-218X},\\n   doi          = {10.1016/j.dam.2018.01.005},\\n   url          = {http://www.sciencedirect.com/science/article/pii/S0166218X18300167},\\n   author       = {Alexandre Prusch Züge and Renato Carmo},\\n}\\n\\n\",\"author_short\":[\"Züge, A. P.\",\"Carmo, R.\"],\"key\":\"ZugeCarmo18\",\"id\":\"ZugeCarmo18\",\"bibbaseid\":\"zge-carmo-oncomparingalgorithmsforthemaximumcliqueproblem-2018\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.sciencedirect.com/science/article/pii/S0166218X18300167\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Renato\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Melo\"],\"suffixes\":[]},{\"firstnames\":[\"Andre\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]}],\"title\":\"A Preselection Algorithm for the Influence Maximization Problem in Power Law Graphs\",\"booktitle\":\"Proceedings of the 33rd Annual ACM Symposium on Applied Computing\",\"year\":\"2018\",\"pages\":\"1782–1789\",\"bibtex\":\"@inproceedings{Melo2018,\\n author = {Renato S. Melo and Andre L. Vignatti},\\n title = {A Preselection Algorithm for the Influence Maximization Problem in Power Law Graphs},\\n booktitle = {Proceedings of the 33rd Annual ACM Symposium on Applied Computing},\\n year = {2018},\\n pages = {1782--1789},\\n} \\n\\n\",\"author_short\":[\"Melo, R. S.\",\"Vignatti, A. L.\"],\"key\":\"Melo2018\",\"id\":\"Melo2018\",\"bibbaseid\":\"melo-vignatti-apreselectionalgorithmfortheinfluencemaximizationprobleminpowerlawgraphs-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Renato\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Melo\"],\"suffixes\":[]},{\"firstnames\":[\"Andre\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]},{\"firstnames\":[\"Arthur\",\"P.\",\"Da\"],\"propositions\":[],\"lastnames\":[\"Costa\"],\"suffixes\":[]},{\"firstnames\":[\"Felipe\"],\"propositions\":[\"do\"],\"lastnames\":[\"Nascimento\"],\"suffixes\":[]}],\"year\":\"2017\",\"booktitle\":\"Proceedings of the II Workshop de Pesquisa em Computação dos Campos Gerais\",\"month\":\"06\",\"pages\":\"37–40\",\"title\":\"Participação Feminina no Cinema Brasileiro: Análise Através de Redes Sociais\",\"bibtex\":\"@inproceedings{Melo2017,\\n  author = {Renato S. Melo and Andre L. Vignatti and Arthur P. Da Costa and Felipe do Nascimento},\\n  year = {2017},\\n  booktitle = {Proceedings of the II Workshop de Pesquisa em Computação dos Campos Gerais},\\n  month = {06},\\n  pages = {37--40},\\n  title = {Participação Feminina no Cinema Brasileiro: Análise Através de Redes Sociais}\\n}\\n\\n\",\"author_short\":[\"Melo, R. S.\",\"Vignatti, A. L.\",\"Costa, A. P. D.\",\"do Nascimento, F.\"],\"key\":\"Melo2017\",\"id\":\"Melo2017\",\"bibbaseid\":\"melo-vignatti-costa-donascimento-participaofemininanocinemabrasileiroanliseatravsderedessociais-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Bruno\",\"H.\"],\"propositions\":[],\"lastnames\":[\"Labres\"],\"suffixes\":[]},{\"firstnames\":[\"Andre\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]}],\"title\":\"Características Topológicas de Redes do Mundo Real\",\"booktitle\":\"Proceedings of the 26th Evento de Iniciação Científica da Universidade Federal do Paraná (EVINCI)\",\"year\":\"2018\",\"pages\":\"343\",\"bibtex\":\"@inproceedings{Labres2018a,\\n author = {Bruno H. Labres and Andre L. Vignatti},\\n title = {Características Topológicas de Redes do Mundo Real},\\n booktitle = {Proceedings of the 26th Evento de Iniciação Científica da Universidade Federal do Paraná (EVINCI)},\\n year = {2018},\\n pages = {343},\\n} \\n\\n\",\"author_short\":[\"Labres, B. H.\",\"Vignatti, A. L.\"],\"key\":\"Labres2018a\",\"id\":\"Labres2018a\",\"bibbaseid\":\"labres-vignatti-caractersticastopolgicasderedesdomundoreal-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"An Approximation Algorithm for the p-Hub Median Problem\",\"journal\":\"Electronic Notes in Discrete Mathematics\",\"volume\":\"62\",\"pages\":\"183–188\",\"year\":\"2017\",\"note\":\"LAGOS'17 - IX Latin and American Algorithms, Graphs and Optimization.\",\"author\":[{\"firstnames\":[\"Camile\",\"F.\"],\"propositions\":[],\"lastnames\":[\"Bordini\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]}],\"bibtex\":\"@article{Bordini2017,\\n  title = \\\"An Approximation Algorithm for the p-Hub Median Problem\\\",\\n  journal = \\\"Electronic Notes in Discrete Mathematics\\\",\\n  volume = \\\"62\\\",\\n  pages = \\\"183--188\\\",\\n  year = \\\"2017\\\",\\n  note = \\\"LAGOS'17 - {IX} Latin and American Algorithms, Graphs and Optimization.\\\",\\n  author = \\\"Camile F. Bordini and André L. Vignatti\\\",\\n}\\n\\n\",\"author_short\":[\"Bordini, C. F.\",\"Vignatti, A. L.\"],\"key\":\"Bordini2017\",\"id\":\"Bordini2017\",\"bibbaseid\":\"bordini-vignatti-anapproximationalgorithmforthephubmedianproblem-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"The Hidden Subgroup Problem and MKTP\",\"journal\":\"Theoretical Computer Science\",\"volume\":\"795\",\"pages\":\"204–212\",\"year\":\"2019\",\"author\":[{\"firstnames\":[\"Nicollas\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Sdroievski\"],\"suffixes\":[]},{\"firstnames\":[\"Murilo\",\"V.\",\"G.\"],\"propositions\":[\"da\"],\"lastnames\":[\"Silva\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]}],\"url\":\"https://doi.org/10.1016/j.tcs.2019.06.012\",\"doi\":\"10.1016/j.tcs.2019.06.012\",\"biburl\":\"https://dblp.org/rec/journals/tcs/SdroievskiSV19.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"bibtex\":\"@article{Sdroievski2019a,\\n  title = \\\"The Hidden Subgroup Problem and {MKTP}\\\",\\n  journal = \\\"Theoretical Computer Science\\\",\\n  volume    = {795},\\n  pages     = {204--212},\\n  year = \\\"2019\\\",\\n  author = \\\"Nicollas M. Sdroievski and Murilo V. G. da Silva and André L. Vignatti\\\",\\n  url       = {https://doi.org/10.1016/j.tcs.2019.06.012},\\n  doi       = {10.1016/j.tcs.2019.06.012},\\n  biburl    = {https://dblp.org/rec/journals/tcs/SdroievskiSV19.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Sdroievski, N. M.\",\"da Silva, M. V. G.\",\"Vignatti, A. L.\"],\"key\":\"Sdroievski2019a\",\"id\":\"Sdroievski2019a\",\"bibbaseid\":\"sdroievski-dasilva-vignatti-thehiddensubgroupproblemandmktp-2019\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1016/j.tcs.2019.06.012\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"E.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Cruz\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"A.\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"title\":\"Algoritmos de Varredura para Listagem de Bicliques Maximais em Modelos Bipartidos de Intervalos e Arco-Circulares\",\"booktitle\":\"II Workshop de Pesquisa em Computação dos Campos Gerais\",\"issn\":\"2526-1371\",\"volume\":\"2\",\"year\":\"2017\",\"pages\":\"9–12\",\"address\":\"Ponta Grossa, Paraná\",\"url_pdf\":\"http://www.wpccg.pro.br/wpccg2017/papers/paper_6\",\"bibtex\":\"@inproceedings{CruzGroshausGuedesWPCCG2017,\\n author = {E. P. Cruz and M. Groshaus and A. L. P. Guedes},\\n title = {Algoritmos de Varredura para Listagem de Bicliques Maximais em Modelos Bipartidos de Intervalos e Arco-Circulares},\\n booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},\\n issn = {2526-1371},\\n volume = {2},\\n year = {2017},\\n pages = {9--12},\\n address = {Ponta Grossa, Paraná},\\n url_pdf = {http://www.wpccg.pro.br/wpccg2017/papers/paper_6}\\n}\\n\\n\",\"author_short\":[\"Cruz, E. P.\",\"Groshaus, M.\",\"Guedes, A. L. P.\"],\"key\":\"CruzGroshausGuedesWPCCG2017\",\"id\":\"CruzGroshausGuedesWPCCG2017\",\"bibbaseid\":\"cruz-groshaus-guedes-algoritmosdevarreduraparalistagemdebicliquesmaximaisemmodelosbipartidosdeintervalosearcocirculares-2017\",\"role\":\"author\",\"urls\":{\" pdf\":\"http://www.wpccg.pro.br/wpccg2017/papers/paper_6\"},\"metadata\":{\"authorlinks\":{\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Leandro\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]},{\"firstnames\":[\"Renato\"],\"propositions\":[],\"lastnames\":[\"Carmo\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"title\":\"On a conjecture on edge-colouring join graphs\",\"booktitle\":\"II Workshop de Pesquisa em Computação dos Campos Gerais\",\"issn\":\"2526-1371\",\"volume\":\"2\",\"year\":\"2017\",\"pages\":\"69–72\",\"address\":\"Ponta Grossa, Paraná\",\"url_pdf\":\"http://www.wpccg.pro.br/wpccg2017/papers/paper_16\",\"bibtex\":\"@inproceedings{ZateskoCarmoGuedesWPCCG2017,\\n author = {Leandro M. Zatesko and Renato Carmo and André L. P. Guedes},\\n title = {On a conjecture on edge-colouring join graphs},\\n booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},\\n issn = {2526-1371},\\n volume = {2},\\n year = {2017},\\n pages = {69--72},\\n address = {Ponta Grossa, Paraná},\\n url_pdf = {http://www.wpccg.pro.br/wpccg2017/papers/paper_16}\\n}\\n\\n\",\"author_short\":[\"Zatesko, L. M.\",\"Carmo, R.\",\"Guedes, A. L. P.\"],\"key\":\"ZateskoCarmoGuedesWPCCG2017\",\"id\":\"ZateskoCarmoGuedesWPCCG2017\",\"bibbaseid\":\"zatesko-carmo-guedes-onaconjectureonedgecolouringjoingraphs-2017\",\"role\":\"author\",\"urls\":{\" pdf\":\"http://www.wpccg.pro.br/wpccg2017/papers/paper_16\"},\"metadata\":{\"authorlinks\":{\"zatesko, l\":\"https://pessoal.dainf.ct.utfpr.edu.br/zatesko/\",\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Structure and algorithms for (cap, even hole)-free graphs\",\"journal\":\"Discrete Mathematics\",\"volume\":\"341\",\"pages\":\"463-473\",\"year\":\"2018\",\"issn\":\"0012-365X\",\"doi\":\"https://doi.org/10.1016/j.disc.2017.09.013\",\"url\":\"https://www.sciencedirect.com/science/article/pii/S0012365X17303230?via%3Dihub\",\"author\":[{\"firstnames\":[\"Kathie\"],\"propositions\":[],\"lastnames\":[\"Cameron\"],\"suffixes\":[]},{\"firstnames\":[\"Murilo\",\"V.\",\"G.\"],\"propositions\":[\"da\"],\"lastnames\":[\"Silva\"],\"suffixes\":[]},{\"firstnames\":[\"Shenwei\"],\"propositions\":[],\"lastnames\":[\"Huang\"],\"suffixes\":[]},{\"firstnames\":[\"Kristina\"],\"propositions\":[],\"lastnames\":[\"Vuskovic\"],\"suffixes\":[]}],\"bibtex\":\"@Article{MuriloDM18,\\n   title        = {Structure and algorithms for (cap, even hole)-free graphs},\\n   journal      = {Discrete Mathematics},\\n   volume       = {341},\\n   pages        = {463-473},\\n   year         = {2018},\\n   issn         = {0012-365X},\\n   doi          = {https://doi.org/10.1016/j.disc.2017.09.013},\\n   url          = {https://www.sciencedirect.com/science/article/pii/S0012365X17303230?via%3Dihub},\\n   author       = {Kathie Cameron and Murilo V. G. da Silva and Shenwei Huang and Kristina Vuskovic},\\n}\\n\\n\\n\",\"author_short\":[\"Cameron, K.\",\"da Silva, M. V. G.\",\"Huang, S.\",\"Vuskovic, K.\"],\"key\":\"MuriloDM18\",\"id\":\"MuriloDM18\",\"bibbaseid\":\"cameron-dasilva-huang-vuskovic-structureandalgorithmsforcapevenholefreegraphs-2018\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.sciencedirect.com/science/article/pii/S0012365X17303230?via%3Dihub\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Subclasses of Circular-Arc Bigraphs: Helly, Normal and Proper\",\"journal\":\"Electronic Notes in Theoretical Computer Science\",\"volume\":\"346\",\"pages\":\"497 - 509\",\"year\":\"2019\",\"note\":\"The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019).\",\"_keywords\":\"Universal2016\",\"organization\":\"UFMG\",\"issn\":\"1571-0661\",\"doi\":\"https://doi.org/10.1016/j.entcs.2019.08.044\",\"url\":\"http://www.sciencedirect.com/science/article/pii/S1571066119300957\",\"author\":[{\"firstnames\":[\"Marina\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]},{\"firstnames\":[\"Fabricio\",\"Schiavon\"],\"propositions\":[],\"lastnames\":[\"Kolberg\"],\"suffixes\":[]}],\"keywords\":\"Biclique, Circular-arc, recognition, Helly, Normal, Proper\",\"abstract\":\"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.\",\"bibtex\":\"@article{Kolberg2019,\\ntitle = \\\"Subclasses of Circular-Arc Bigraphs: Helly, Normal and Proper\\\",\\njournal = \\\"Electronic Notes in Theoretical Computer Science\\\",\\nvolume = \\\"346\\\",\\npages = \\\"497 - 509\\\",\\nyear = \\\"2019\\\",\\nnote = \\\"The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019).\\\",\\n  _keywords =    {Universal2016},\\norganization={UFMG},\\nissn = \\\"1571-0661\\\",\\ndoi = \\\"https://doi.org/10.1016/j.entcs.2019.08.044\\\",\\nurl = \\\"http://www.sciencedirect.com/science/article/pii/S1571066119300957\\\",\\nauthor = \\\"Marina Groshaus and André L. P. Guedes and Fabricio Schiavon Kolberg\\\",\\nkeywords = \\\"Biclique, Circular-arc, recognition, Helly, Normal, Proper\\\",\\nabstract = \\\"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\",\"author_short\":[\"Groshaus, M.\",\"Guedes, A. L. P.\",\"Kolberg, F. S.\"],\"key\":\"Kolberg2019\",\"id\":\"Kolberg2019\",\"bibbaseid\":\"groshaus-guedes-kolberg-subclassesofcirculararcbigraphshellynormalandproper-2019\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.sciencedirect.com/science/article/pii/S1571066119300957\"},\"keyword\":[\"Biclique\",\"Circular-arc\",\"recognition\",\"Helly\",\"Normal\",\"Proper\"],\"metadata\":{\"authorlinks\":{\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal\",\"journal\":\"Electronic Notes in Theoretical Computer Science\",\"volume\":\"346\",\"pages\":\"125 - 133\",\"year\":\"2019\",\"note\":\"The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019).\",\"_keywords\":\"Universal2016\",\"organization\":\"UFMG\",\"issn\":\"1571-0661\",\"doi\":\"https://doi.org/10.1016/j.entcs.2019.08.012\",\"url\":\"http://www.sciencedirect.com/science/article/pii/S1571066119300623\",\"author\":[{\"firstnames\":[\"João\",\"Pedro\",\"W.\"],\"propositions\":[],\"lastnames\":[\"Bernardi\"],\"suffixes\":[]},{\"firstnames\":[\"Murilo\",\"V.\",\"G.\"],\"propositions\":[\"da\"],\"lastnames\":[\"Silva\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"Luiz\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]},{\"firstnames\":[\"Leandro\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]}],\"keywords\":\"Pullback, circular-arc, chromatic index, edge-coloring, chordal\",\"abstract\":\"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.\",\"bibtex\":\"@article{Bernardi2019,\\ntitle = \\\"The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal\\\",\\njournal = \\\"Electronic Notes in Theoretical Computer Science\\\",\\nvolume = \\\"346\\\",\\npages = \\\"125 - 133\\\",\\nyear = \\\"2019\\\",\\nnote = \\\"The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019).\\\",\\n  _keywords =    {Universal2016},\\norganization={UFMG},\\nissn = \\\"1571-0661\\\",\\ndoi = \\\"https://doi.org/10.1016/j.entcs.2019.08.012\\\",\\nurl = \\\"http://www.sciencedirect.com/science/article/pii/S1571066119300623\\\",\\nauthor = \\\"João Pedro W. Bernardi and Murilo V. G. da Silva and André Luiz P. Guedes and Leandro M. Zatesko\\\",\\nkeywords = \\\"Pullback, circular-arc, chromatic index, edge-coloring, chordal\\\",\\nabstract = \\\"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\",\"author_short\":[\"Bernardi, J. P. W.\",\"da Silva, M. V. G.\",\"Guedes, A. L. P.\",\"Zatesko, L. M.\"],\"key\":\"Bernardi2019\",\"id\":\"Bernardi2019\",\"bibbaseid\":\"bernardi-dasilva-guedes-zatesko-thechromaticindexofpropercirculararcgraphsofoddmaximumdegreewhicharechordal-2019\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.sciencedirect.com/science/article/pii/S1571066119300623\"},\"keyword\":[\"Pullback\",\"circular-arc\",\"chromatic index\",\"edge-coloring\",\"chordal\"],\"metadata\":{\"authorlinks\":{\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Leandro\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]},{\"firstnames\":[\"Renato\"],\"propositions\":[],\"lastnames\":[\"Carmo\"],\"suffixes\":[]},{\"firstnames\":[\"André\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]},{\"firstnames\":[\"Alesom\"],\"propositions\":[],\"lastnames\":[\"Zorzi\"],\"suffixes\":[]},{\"firstnames\":[\"Raphael\"],\"propositions\":[],\"lastnames\":[\"Machado\"],\"suffixes\":[]},{\"firstnames\":[\"Celina\"],\"propositions\":[],\"lastnames\":[\"Figueiredo\"],\"suffixes\":[]}],\"title\":\"On the chromatic index of complementary prisms\",\"journal\":\"Acta Mathematica Universitatis Comenianae\",\"volume\":\"88\",\"number\":\"3\",\"year\":\"2019\",\"_keywords\":\"Universal2016\",\"abstract\":\"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.\",\"issn\":\"0862-9544\",\"pages\":\"1071–1077\",\"url\":\"http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1208\",\"note\":\"EUROCOMB'2019.\",\"bibtex\":\"@article{ZCGZMF2019,\\n\\tauthor = {Leandro Zatesko and Renato Carmo and André Guedes and Alesom Zorzi and Raphael Machado and Celina Figueiredo},\\n\\ttitle = { On the chromatic index of complementary prisms},\\n\\tjournal = {Acta Mathematica Universitatis Comenianae},\\n\\tvolume = {88},\\n\\tnumber = {3},\\n\\tyear = {2019},\\n\\t_keywords = {Universal2016},\\n\\tabstract = {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\\tissn = {0862-9544},\\tpages = {1071--1077},\\turl = {http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1208},\\n        note = {EUROCOMB'2019.}\\n}\\n\\n\",\"author_short\":[\"Zatesko, L.\",\"Carmo, R.\",\"Guedes, A.\",\"Zorzi, A.\",\"Machado, R.\",\"Figueiredo, C.\"],\"key\":\"ZCGZMF2019\",\"id\":\"ZCGZMF2019\",\"bibbaseid\":\"zatesko-carmo-guedes-zorzi-machado-figueiredo-onthechromaticindexofcomplementaryprisms-2019\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1208\"},\"metadata\":{\"authorlinks\":{\"zatesko, l\":\"https://pessoal.dainf.ct.utfpr.edu.br/zatesko/\",\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"A.\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]},{\"firstnames\":[\"F.\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Kolberg\"],\"suffixes\":[]}],\"title\":\"On Subclasses of Circular Arc Bigraphs\",\"booktitle\":\"III Workshop de Pesquisa em Computação dos Campos Gerais\",\"issn\":\"2526-1371\",\"volume\":\"3\",\"year\":\"2019\",\"pages\":\"68–73\",\"address\":\"Ponta Grossa, Paraná\",\"abstract\":\"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.\",\"_keywords\":\"Universal2016\",\"url_pdf\":\"http://www.wpccg.pro.br/wpccg2019/papers/paper_21\",\"bibtex\":\"@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 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 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.\\nKeywords: Graph classes, Characterization, Helly, Circular arc bigraphs, Circular convex bipartite graphs.},\\n  _keywords =    {Universal2016},\\n url_pdf = {http://www.wpccg.pro.br/wpccg2019/papers/paper_21}\\n}\\n\\n\",\"author_short\":[\"Groshaus, M.\",\"Guedes, A. L. P.\",\"Kolberg, F. S.\"],\"key\":\"GroshausGuedesKolbergWPCCG2019\",\"id\":\"GroshausGuedesKolbergWPCCG2019\",\"bibbaseid\":\"groshaus-guedes-kolberg-onsubclassesofcirculararcbigraphs-2019\",\"role\":\"author\",\"urls\":{\" pdf\":\"http://www.wpccg.pro.br/wpccg2019/papers/paper_21\"},\"metadata\":{\"authorlinks\":{\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"C.\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Santos\"],\"suffixes\":[]},{\"firstnames\":[\"A.\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"title\":\"Planejamento de caminhos 3D: Comparação dos algoritmos por grade 3D e grafo de visibilidade\",\"booktitle\":\"III Workshop de Pesquisa em Computação dos Campos Gerais\",\"issn\":\"2526-1371\",\"volume\":\"3\",\"year\":\"2019\",\"pages\":\"116–121\",\"address\":\"Ponta Grossa, Paraná\",\"abstract\":\"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.\",\"_keywords\":\"Universal2016\",\"url_pdf\":\"http://www.wpccg.pro.br/wpccg2019/papers/paper_25\",\"bibtex\":\"@inproceedings{SantosGuedesWPCCG2019,\\n author = {C. A. Santos and A. L. P. Guedes},\\n title = {Planejamento de caminhos 3D: Comparação dos algoritmos por grade 3D e grafo de visibilidade},\\n booktitle = {III Workshop de Pesquisa em Computação dos Campos 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 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.\\nPalavras-chave: Planejamento de 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\",\"author_short\":[\"Santos, C. A.\",\"Guedes, A. L. P.\"],\"key\":\"SantosGuedesWPCCG2019\",\"id\":\"SantosGuedesWPCCG2019\",\"bibbaseid\":\"santos-guedes-planejamentodecaminhos3dcomparaodosalgoritmosporgrade3degrafodevisibilidade-2019\",\"role\":\"author\",\"urls\":{\" pdf\":\"http://www.wpccg.pro.br/wpccg2019/papers/paper_25\"},\"metadata\":{\"authorlinks\":{\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]},{\"firstnames\":[\"E.\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Vieira\"],\"suffixes\":[]}],\"title\":\"P = NP or 5-Snarks Exist\",\"language\":\"english\",\"year\":\"2019\",\"booktitle\":\"Proc. 3nd Workshop de Pesquisa em Computa ̧cão dos Campos Gerais (WPCCG '19)\",\"address\":\"Ponta Grossa, Brazil\",\"issn\":\"2526-1371\",\"url_pdf\":\"http://www.wpccg.pro.br/wpccg2019/papers/paper_38\",\"pages\":\"135–140\",\"bibtex\":\"@inproceedings{wpccg19-za,\\n  author = {L. M. Zatesko and E. A. Vieira},\\n  title = {P = NP or 5-Snarks Exist},\\n  language = {english},\\n  year = 2019,\\n  booktitle = {Proc. 3nd Workshop de Pesquisa em Computa\\\\c c\\\\~ao dos Campos Gerais (WPCCG '19)},\\n  address = {Ponta Grossa, Brazil},\\n  issn = {2526-1371},\\n  url_pdf = {http://www.wpccg.pro.br/wpccg2019/papers/paper_38},\\n  pages = {135--140}\\n}\\n\\n\",\"author_short\":[\"Zatesko, L. M.\",\"Vieira, E. A.\"],\"key\":\"wpccg19-za\",\"id\":\"wpccg19-za\",\"bibbaseid\":\"zatesko-vieira-pnpor5snarksexist-2019\",\"role\":\"author\",\"urls\":{\" pdf\":\"http://www.wpccg.pro.br/wpccg2019/papers/paper_38\"},\"metadata\":{\"authorlinks\":{\"zatesko, l\":\"https://pessoal.dainf.ct.utfpr.edu.br/zatesko/\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Leandro\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]},{\"firstnames\":[\"João\",\"P.\",\"W.\"],\"propositions\":[],\"lastnames\":[\"Bernardi\"],\"suffixes\":[]},{\"firstnames\":[\"Sheila\",\"M.\"],\"propositions\":[\"de\"],\"lastnames\":[\"Almeida\"],\"suffixes\":[]},{\"firstnames\":[\"Renato\"],\"propositions\":[],\"lastnames\":[\"Carmo\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"title\":\"A Connectivity-based Decomposition for Graph Edge-colouring\",\"journal\":\"Matemática Contemporânea\",\"issn\":\"2317-6636\",\"volume\":\"46\",\"year\":\"2019\",\"abstract\":\"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.\",\"publisher\":\"Sociedade Brasileira de Matemática\",\"pages\":\"156–164\",\"_keywords\":\"Universal2016\",\"url\":\"https://mc.sbm.org.br/volumes/volume-46/\",\"url_pdf\":\"https://mc.sbm.org.br/wp-content/uploads/sites/15/2019/12/P16.pdf\",\"_note\":\"2018 – 8th Latin-American Workshop on Cliques in Graphs.\",\"bibtex\":\"@article{ZateskoBernardiAlmeidaCarmoGuedes2019,\\n\\tauthor = {Leandro Zatesko and João P. W. Bernardi and Sheila M. de Almeida and Renato Carmo and André L. P. Guedes},\\n\\ttitle = {A Connectivity-based Decomposition for Graph Edge-colouring},\\n\\tjournal = {Matemática Contemporânea},\\n        issn = {2317-6636},\\n\\tvolume = {46},\\n\\tyear = {2019},\\n\\tabstract = {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        publisher = {Sociedade Brasileira de Matemática},\\n        pages = {156--164},\\n  _keywords =    {Universal2016},\\n        url = {https://mc.sbm.org.br/volumes/volume-46/},\\n        url_pdf = {https://mc.sbm.org.br/wp-content/uploads/sites/15/2019/12/P16.pdf},\\n        _note = {2018 – 8th Latin-American Workshop on Cliques in Graphs.}\\n}\\n\\n\\n\",\"author_short\":[\"Zatesko, L.\",\"Bernardi, J. P. W.\",\"de Almeida, S. M.\",\"Carmo, R.\",\"Guedes, A. L. P.\"],\"key\":\"ZateskoBernardiAlmeidaCarmoGuedes2019\",\"id\":\"ZateskoBernardiAlmeidaCarmoGuedes2019\",\"bibbaseid\":\"zatesko-bernardi-dealmeida-carmo-guedes-aconnectivitybaseddecompositionforgraphedgecolouring-2019\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://mc.sbm.org.br/volumes/volume-46/\",\" pdf\":\"https://mc.sbm.org.br/wp-content/uploads/sites/15/2019/12/P16.pdf\"},\"metadata\":{\"authorlinks\":{\"zatesko, l\":\"https://pessoal.dainf.ct.utfpr.edu.br/zatesko/\",\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Leandro\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]},{\"firstnames\":[\"Renato\"],\"propositions\":[],\"lastnames\":[\"Carmo\"],\"suffixes\":[]},{\"firstnames\":[\"André\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"title\":\"Novel Procedures for Graph Edge-colouring\",\"booktitle\":\"Anais do XXXII Concurso de Teses e Dissertações\",\"location\":\"Belém\",\"year\":\"2019\",\"issn\":\"0000-0000\",\"publisher\":\"SBC\",\"address\":\"Porto Alegre, RS, Brasil\",\"_keywords\":\"Universal2016\",\"doi\":\"10.5753/ctd.2019.6331\",\"url\":\"https://sol.sbc.org.br/index.php/ctd/article/view/6331\",\"bibtex\":\"@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 issn = {0000-0000},\\n publisher = {SBC},\\n address = {Porto Alegre, RS, Brasil},\\n  _keywords =    {Universal2016},\\n doi = {10.5753/ctd.2019.6331},\\n url = {https://sol.sbc.org.br/index.php/ctd/article/view/6331}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Zatesko, L.\",\"Carmo, R.\",\"Guedes, A.\"],\"key\":\"Zatesko2019CTDSBC\",\"id\":\"Zatesko2019CTDSBC\",\"bibbaseid\":\"zatesko-carmo-guedes-novelproceduresforgraphedgecolouring-2019\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://sol.sbc.org.br/index.php/ctd/article/view/6331\"},\"metadata\":{\"authorlinks\":{\"zatesko, l\":\"https://pessoal.dainf.ct.utfpr.edu.br/zatesko/\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Leandro\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]},{\"firstnames\":[\"Renato\"],\"propositions\":[],\"lastnames\":[\"Carmo\"],\"suffixes\":[]},{\"firstnames\":[\"André\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"title\":\"Novel Procedures for Graph Edge-colouring\",\"booktitle\":\"Prêmio de Tese do LI Simpósio Brasileiro de Pesquisa Operacional\",\"location\":\"Limeira\",\"year\":\"2019\",\"_keywords\":\"Universal2016\",\"issn\":\"0000-0000\",\"publisher\":\"SBPO\",\"address\":\"Campinas, GALOÁ\",\"note\":\"Prêmio: melhor de tese de doutorado.\",\"url\":\"https://proceedings.science/sbpo-2019/papers/novel-procedures-for-graph-edge-colouring?lang=pt-br\",\"bibtex\":\"@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 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 url = {https://proceedings.science/sbpo-2019/papers/novel-procedures-for-graph-edge-colouring?lang=pt-br}\\n}\\n\\n\",\"author_short\":[\"Zatesko, L.\",\"Carmo, R.\",\"Guedes, A.\"],\"key\":\"Zatesko2019CTDSBPO\",\"id\":\"Zatesko2019CTDSBPO\",\"bibbaseid\":\"zatesko-carmo-guedes-novelproceduresforgraphedgecolouring-2019\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://proceedings.science/sbpo-2019/papers/novel-procedures-for-graph-edge-colouring?lang=pt-br\"},\"metadata\":{\"authorlinks\":{\"zatesko, l\":\"https://pessoal.dainf.ct.utfpr.edu.br/zatesko/\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"A.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Lima\"],\"suffixes\":[]},{\"firstnames\":[\"M.\",\"V.\",\"G.\"],\"propositions\":[\"da\"],\"lastnames\":[\"Silva\"],\"suffixes\":[]},{\"firstnames\":[\"A.\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]}],\"title\":\"Recognizing Power-law Graphs by Machine Learning Algorithms using a Reduced Set of Structural Features\",\"booktitle\":\"Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC)\",\"location\":\"Salvador\",\"year\":\"2019\",\"_keywords\":\"Universal2016\",\"bibtex\":\"@inproceedings{LimaSilvaVignatti2019,\\n author = {A. M. Lima and M. V. G. da Silva and A. L. Vignatti},\\n title = {Recognizing Power-law Graphs by Machine Learning Algorithms using a Reduced Set of Structural Features},\\n booktitle = {Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC)},\\n location = {Salvador},\\n year = {2019},\\n _keywords = {Universal2016},\\n}\\n\\n\",\"author_short\":[\"Lima, A. M.\",\"da Silva, M. V. G.\",\"Vignatti, A. L.\"],\"key\":\"LimaSilvaVignatti2019\",\"id\":\"LimaSilvaVignatti2019\",\"bibbaseid\":\"lima-dasilva-vignatti-recognizingpowerlawgraphsbymachinelearningalgorithmsusingareducedsetofstructuralfeatures-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Biclique Graphs of Interval Bigraphs\",\"journal\":\"Discrete Applied Mathematics\",\"volume\":\"281\",\"pages\":\"134 - 143\",\"year\":\"2020\",\"issn\":\"0166-218X\",\"url\":\"http://www.sciencedirect.com/science/article/pii/S0166218X20300755\",\"author\":[{\"firstnames\":[\"E.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Cruz\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"A.\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]},{\"firstnames\":[\"J.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Puppo\"],\"suffixes\":[]}],\"_keywords\":\"Universal2016\",\"_note\":\"SI: LAGOS’17\",\"doi\":\"10.1016/j.dam.2020.02.010\",\"keywords\":\"Bicliques, Biclique graphs, Interval bigraphs, Bipartite permutation graphs, Co-comparability graphs\",\"abstract\":\"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.\",\"bibtex\":\"@article{CruzGroshausGuedesPuppo2020,\\ntitle = \\\"Biclique Graphs of Interval Bigraphs\\\",\\njournal = \\\"Discrete Applied Mathematics\\\",\\nvolume = \\\"281\\\",\\npages = \\\"134 - 143\\\",\\nyear = \\\"2020\\\",\\nissn = \\\"0166-218X\\\",\\nurl = \\\"http://www.sciencedirect.com/science/article/pii/S0166218X20300755\\\",\\nauthor = \\\"E. P. Cruz and M. Groshaus and A. L. P. Guedes and J. P. Puppo\\\",\\n_keywords =    {Universal2016},\\n_note = \\\"SI: LAGOS’17\\\",\\ndoi = {10.1016/j.dam.2020.02.010},\\nkeywords = \\\"Bicliques, Biclique graphs, Interval bigraphs, Bipartite permutation graphs, Co-comparability graphs\\\",\\nabstract = \\\"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\",\"author_short\":[\"Cruz, E. P.\",\"Groshaus, M.\",\"Guedes, A. L. P.\",\"Puppo, J. P.\"],\"key\":\"CruzGroshausGuedesPuppo2020\",\"id\":\"CruzGroshausGuedesPuppo2020\",\"bibbaseid\":\"cruz-groshaus-guedes-puppo-bicliquegraphsofintervalbigraphs-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.sciencedirect.com/science/article/pii/S0166218X20300755\"},\"keyword\":[\"Bicliques\",\"Biclique graphs\",\"Interval bigraphs\",\"Bipartite permutation graphs\",\"Co-comparability graphs\"],\"metadata\":{\"authorlinks\":{\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Intersection graph of maximal stars\",\"journal\":\"Discrete Applied Mathematics\",\"volume\":\"285\",\"pages\":\"567-580\",\"year\":\"2020\",\"issn\":\"0166-218X\",\"doi\":\"https://doi.org/10.1016/j.dam.2020.07.004\",\"url\":\"https://www.sciencedirect.com/science/article/pii/S0166218X20303504\",\"author\":[{\"firstnames\":[\"Guilherme\"],\"propositions\":[\"de\"],\"lastnames\":[\"C.\",\"M.\",\"Gomes\"],\"suffixes\":[]},{\"firstnames\":[\"Marina\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"Carlos\",\"V.\",\"G.\",\"C.\"],\"propositions\":[],\"lastnames\":[\"Lima\"],\"suffixes\":[]},{\"firstnames\":[\"Vinicius\",\"F.\"],\"propositions\":[\"dos Santos\"],\"lastnames\":[],\"suffixes\":[]}],\"keywords\":\"Intersection graphs, Stars, Star graphs, Cliques, Edge clique covers\",\"abstract\":\"A biclique of a graph G is an induced complete bipartite subgraph of G such that neither part is empty. A star is a biclique of G such that one part has exactly one vertex. The star graph of G is the intersection graph of the maximal stars of G. A graph H is star-critical if its star graph is different from the star graph of any of its proper induced subgraphs. We begin by showing that a star-critical pre-image of an n-vertex star graph has at most On2vertices. We then describe a Krausz-type characterization for star graphs. We combine these results to show that the problem of recognizing star graphs is in NP. We also present some properties of the class. In particular, we show that they are biconnected, that every edge belongs to at least one triangle, characterize the structures the pre-image must have in order to generate degree two vertices in its star graph, and bound the diameter of the star graph with respect to the diameter of its pre-image. Finally, we prove a monotonicity theorem, which we apply in order to list every star graph on at most eight vertices.\",\"bibtex\":\"@article{GomesGroshausLimaSantos2020,\\ntitle = {Intersection graph of maximal stars},\\njournal = {Discrete Applied Mathematics},\\nvolume = {285},\\npages = {567-580},\\nyear = {2020},\\nissn = {0166-218X},\\ndoi = {https://doi.org/10.1016/j.dam.2020.07.004},\\nurl = {https://www.sciencedirect.com/science/article/pii/S0166218X20303504},\\nauthor = {Guilherme de C. M. Gomes and Marina Groshaus and Carlos V. G. C. Lima and Vinicius F. {dos Santos}},\\nkeywords = {Intersection graphs, Stars, Star graphs, Cliques, Edge clique covers},\\nabstract = {A biclique of a graph G is an induced complete bipartite subgraph of G such that neither part is empty. A star is a biclique of G such that one part has exactly one vertex. The star graph of G is the intersection graph of the maximal stars of G. A graph H is star-critical if its star graph is different from the star graph of any of its proper induced subgraphs. We begin by showing that a star-critical pre-image of an n-vertex star graph has at most On2vertices. We then describe a Krausz-type characterization for star graphs. We combine these results to show that the problem of recognizing star graphs is in NP. We also present some properties of the class. In particular, we show that they are biconnected, that every edge belongs to at least one triangle, characterize the structures the pre-image must have in order to generate degree two vertices in its star graph, and bound the diameter of the star graph with respect to the diameter of its pre-image. Finally, we prove a monotonicity theorem, which we apply in order to list every star graph on at most eight vertices.}\\n}\\n\\n\",\"author_short\":[\"de C. M. Gomes, G.\",\"Groshaus, M.\",\"Lima, C. V. G. C.\",\"dos Santos , V. F.\"],\"key\":\"GomesGroshausLimaSantos2020\",\"id\":\"GomesGroshausLimaSantos2020\",\"bibbaseid\":\"decmgomes-groshaus-lima-dossantos-intersectiongraphofmaximalstars-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.sciencedirect.com/science/article/pii/S0166218X20303504\"},\"keyword\":[\"Intersection graphs\",\"Stars\",\"Star graphs\",\"Cliques\",\"Edge clique covers\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Edge-colouring graphs with bounded local degree sums\",\"journal\":\"Discrete Applied Mathematics\",\"volume\":\"281\",\"pages\":\"268 - 283\",\"year\":\"2020\",\"_keywords\":\"Universal2016\",\"_note\":\"SI: LAGOS’17\",\"issn\":\"0166-218X\",\"doi\":\"10.1016/j.dam.2020.03.044\",\"url\":\"http://www.sciencedirect.com/science/article/pii/S0166218X20301438\",\"author\":[{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]},{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Zorzi\"],\"suffixes\":[]},{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Carmo\"],\"suffixes\":[]},{\"firstnames\":[\"A.\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"keywords\":\"Colouring of graphs and hypergraphs, Vertex degrees, Graph algorithms, Graph theory\",\"abstract\":\"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.\",\"bibtex\":\"@article{Zatesko2020,\\ntitle = \\\"Edge-colouring graphs with bounded local degree sums\\\",\\njournal = \\\"Discrete Applied Mathematics\\\",\\nvolume = \\\"281\\\",\\npages = \\\"268 - 283\\\",\\nyear = \\\"2020\\\",\\n_keywords =    {Universal2016},\\n_note = \\\"SI: LAGOS’17\\\",\\nissn = \\\"0166-218X\\\",\\ndoi = \\\"10.1016/j.dam.2020.03.044\\\",\\nurl = \\\"http://www.sciencedirect.com/science/article/pii/S0166218X20301438\\\",\\nauthor = \\\"L. M. Zatesko and A. Zorzi and R. Carmo and A. L. P. Guedes\\\",\\nkeywords = \\\"Colouring of graphs and hypergraphs, Vertex degrees, Graph algorithms, Graph theory\\\",\\nabstract = \\\"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\",\"author_short\":[\"Zatesko, L. M.\",\"Zorzi, A.\",\"Carmo, R.\",\"Guedes, A. L. P.\"],\"key\":\"Zatesko2020\",\"id\":\"Zatesko2020\",\"bibbaseid\":\"zatesko-zorzi-carmo-guedes-edgecolouringgraphswithboundedlocaldegreesums-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.sciencedirect.com/science/article/pii/S0166218X20301438\"},\"keyword\":[\"Colouring of graphs and hypergraphs\",\"Vertex degrees\",\"Graph algorithms\",\"Graph theory\"],\"metadata\":{\"authorlinks\":{\"zatesko, l\":\"https://pessoal.dainf.ct.utfpr.edu.br/zatesko/\",\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":8,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Maske\"],\"firstnames\":[\"Charles\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cohen\"],\"firstnames\":[\"Jaime\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Duarte\",\"Jr\"],\"firstnames\":[\"Elias\"],\"suffixes\":[]}],\"year\":\"2020\",\"title\":\"Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions\",\"number\":\"82\",\"pages\":\"1601–1615\",\"journal\":\"Algorithmica\",\"doi\":\"10.1007/s00453-019-00658-6\",\"bibtex\":\"@article{MaskeCohenDuarte2020,\\nauthor = {Maske, Charles and Cohen, Jaime and Duarte Jr, Elias},\\nyear = {2020},\\ntitle = {Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions},\\nnumber = {82},\\npages = {1601--1615},\\njournal = {Algorithmica},\\ndoi = {10.1007/s00453-019-00658-6}\\n}\\n\\n\",\"author_short\":[\"Maske, C.\",\"Cohen, J.\",\"Duarte Jr, E.\"],\"key\":\"MaskeCohenDuarte2020\",\"id\":\"MaskeCohenDuarte2020\",\"bibbaseid\":\"maske-cohen-duartejr-speedingupthegomoryhuparallelcuttreealgorithmwithefficientgraphcontractions-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Uma Revisão sobre a Relação de BQP com Outras Classes de Complexidade Computacional\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hepp\"],\"firstnames\":[\"H\"],\"suffixes\":[]},{\"firstnames\":[\"Silva.\",\"M.\",\"V.\"],\"propositions\":[],\"lastnames\":[\"G.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"firstnames\":[\"L.M.\"],\"suffixes\":[]}],\"year\":\"2019\",\"booktitle\":\"Anais do III Workshop de Pesquisa em Computação dos Campos Gerais\",\"pages\":\"74-79\",\"bibtex\":\"@InProceedings{Hepp2019,\\n   title        = {Uma Revisão sobre a Relação de BQP com Outras\\n                     Classes de Complexidade Computacional},\\n   author       = {Hepp, H and Silva. M. V. G. and Zatesko, L.M.},\\n   year         = {2019},\\n   booktitle    = {Anais do III Workshop de Pesquisa em Computação dos\\n                     Campos Gerais},\\n   pages        = {74-79}\\n}\\n\\n\\n\",\"author_short\":[\"Hepp, H\",\"G., S. M. V.\",\"Zatesko, L.\"],\"key\":\"Hepp2019\",\"id\":\"Hepp2019\",\"bibbaseid\":\"hepp-g-zatesko-umarevisosobrearelaodebqpcomoutrasclassesdecomplexidadecomputacional-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Abordagem didático-pedagógica para o ensino de Arquitetura de Computadores em espaços educacionais não formais\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Macedo\"],\"firstnames\":[\"C.\",\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Alencar\"],\"firstnames\":[\"V.\",\"H.\",\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Beleti\",\"JR.\"],\"firstnames\":[\"C.\",\"R.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Zuge\"],\"firstnames\":[\"Alexandre\",\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Santiago\",\"JR.\"],\"firstnames\":[\"R.\",\"M.\"],\"suffixes\":[]}],\"year\":\"2018\",\"booktitle\":\"Proc. Computer on the beach\",\"address\":\"Florianópolis\",\"bibtex\":\"@InProceedings{MacedoAlencarBeletiZugeSantiago2018,\\n   title        = {Abordagem didático-pedagógica para o ensino de\\n                     Arquitetura de Computadores em espaços\\n                     educacionais não formais},\\n   author       = {Macedo, C. A. and Alencar, V. H. S. and Beleti JR.,\\n                     C. R. and Zuge, Alexandre P. and Santiago JR.,\\n                     R. M.},\\n   year         = {2018},\\n   booktitle    = {Proc. Computer on the beach},\\n   address      = {Florianópolis}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Macedo, C. A.\",\"Alencar, V. H. S.\",\"Beleti JR., C. R.\",\"Zuge, A. P.\",\"Santiago JR., R. M.\"],\"key\":\"MacedoAlencarBeletiZugeSantiago2018\",\"id\":\"MacedoAlencarBeletiZugeSantiago2018\",\"bibbaseid\":\"macedo-alencar-beletijr-zuge-santiagojr-abordagemdidticopedaggicaparaoensinodearquiteturadecomputadoresemespaoseducacionaisnoformais-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Moraes\"],\"firstnames\":[\"C.\",\"A.\",\"d.\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Santos\"],\"firstnames\":[\"C.\",\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Chabatura\",\"Neto\"],\"firstnames\":[\"F.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Moreira\"],\"firstnames\":[\"J.\",\"V.\"],\"suffixes\":[]}],\"title\":\"Capivara team description paper for the robocup brazil open flying robot league\",\"booktitle\":\"XVIII Latin American Robotics Competition (LARC) and XVII Brazilian Robotics Competition (CBR)\",\"location\":\"Rio Grande\",\"year\":\"2019\",\"_keywords\":\"Universal2016\",\"bibtex\":\"@inproceedings{MoraesSantosChabaturaMoreira2019,\\n author = {Moraes, C. A. d. L. and Santos, C. A. and Chabatura Neto, F. and Moreira, J. V.},\\n title = {Capivara team description paper for the robocup brazil open flying robot league},\\n booktitle = {XVIII Latin American Robotics Competition (LARC) and XVII Brazilian Robotics Competition (CBR)},\\n location = {Rio Grande},\\n year = {2019},\\n _keywords = {Universal2016},\\n}\\n\\n\",\"author_short\":[\"Moraes, C. A. d. L.\",\"Santos, C. A.\",\"Chabatura Neto, F.\",\"Moreira, J. V.\"],\"key\":\"MoraesSantosChabaturaMoreira2019\",\"id\":\"MoraesSantosChabaturaMoreira2019\",\"bibbaseid\":\"moraes-santos-chabaturaneto-moreira-capivarateamdescriptionpaperfortherobocupbrazilopenflyingrobotleague-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"Talk\",\"optkey\":\"\",\"author\":[{\"firstnames\":[\"Alane\",\"M.\"],\"propositions\":[\"de\"],\"lastnames\":[\"Lima\"],\"suffixes\":[]}],\"title\":\"Sample Complexity in Graph Problems\",\"howpublished\":\"Seminário apresentado na XV Escuela de Verano en Matemáticas Discretas\",\"year\":\"2020\",\"note\":\"\",\"annote\":\"\",\"bibtex\":\"@Misc{Lima2020-Chile,\\n   optkey       = {},\\n   author       = {Alane M. de Lima},\\n   title        = {Sample Complexity in Graph Problems},\\n   howpublished = {Seminário apresentado na XV Escuela de Verano en\\n                     Matemáticas Discretas},\\n   type         = {Talk},\\n   year         = {2020},\\n   note         = {},\\n   annote       = {}\\n}\\n\\n\",\"author_short\":[\"de Lima, A. M.\"],\"key\":\"Lima2020-Chile\",\"id\":\"Lima2020-Chile\",\"bibbaseid\":\"delima-samplecomplexityingraphproblems-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Estimando Centralidade de Percolação utilizando Amostragem e Teoria da Dimensão Vapnik-Chervonenkis\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Lima\"],\"firstnames\":[\"A.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Santos\"],\"firstnames\":[\"G.\",\"M.\"],\"suffixes\":[]},{\"firstnames\":[\"Silva.\",\"M.\",\"V.\"],\"propositions\":[],\"lastnames\":[\"G.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"firstnames\":[\"A.\",\"L.\"],\"suffixes\":[]}],\"year\":\"2019\",\"booktitle\":\"Anais do III Workshop de Pesquisa em Computação dos Campos Gerais\",\"pages\":\"86 - 91\",\"bibtex\":\"@inproceedings{Lima2019-A,\\n  title = {Estimando Centralidade de Percolação utilizando Amostragem e Teoria da Dimensão Vapnik-Chervonenkis},\\n  author = {Lima, A. M. and Santos, G. M. and Silva. M. V. G. and Vignatti, A. L.},  \\n  year = {2019},\\n  booktitle = {Anais do III Workshop de Pesquisa em Computação dos Campos Gerais},\\n  pages = {86 - 91}\\n}\\n\\n\",\"author_short\":[\"Lima, A. M.\",\"Santos, G. M.\",\"G., S. M. V.\",\"Vignatti, A. L.\"],\"key\":\"Lima2019-A\",\"id\":\"Lima2019-A\",\"bibbaseid\":\"lima-santos-g-vignatti-estimandocentralidadedepercolaoutilizandoamostragemeteoriadadimensovapnikchervonenkis-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Aparecimento de cliques em grafos aleatórios lei de potência no modelo de ligação preferencial\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Recksidler\",\"Jr\"],\"firstnames\":[\"D.\"],\"suffixes\":[]},{\"firstnames\":[\"Silva.\",\"M.\",\"V.\"],\"propositions\":[],\"lastnames\":[\"G.\"],\"suffixes\":[]}],\"year\":\"2019\",\"booktitle\":\"Anais do III Workshop de Pesquisa em Computação dos Campos Gerais\",\"pages\":\"74-79\",\"bibtex\":\"@InProceedings{Recksidler2019,\\n   title        = {Aparecimento de cliques em grafos aleatórios lei de\\n                     potência no modelo de ligação preferencial},\\n   author       = {Recksidler Jr, D. and Silva. M. V. G.},\\n   year         = {2019},\\n   booktitle    = {Anais do III Workshop de Pesquisa em Computação dos\\n                     Campos Gerais},\\n   pages        = {74-79}\\n}\\n\\n\\n\",\"author_short\":[\"Recksidler Jr, D.\",\"G., S. M. V.\"],\"key\":\"Recksidler2019\",\"id\":\"Recksidler2019\",\"bibbaseid\":\"recksidlerjr-g-aparecimentodecliquesemgrafosaleatriosleidepotncianomodelodeligaopreferencial-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Conhecimento Zero Estatístico e Reduções Eficientes para o Problema MKTP\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sdroievski\"],\"firstnames\":[\"Nicollas\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Da\",\"Silva\"],\"firstnames\":[\"Murilo\",\"V.\",\"G.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"firstnames\":[\"André\",\"L.\"],\"suffixes\":[]}],\"year\":\"2019\",\"booktitle\":\"Anais do XXXII Concurso de Teses e Dissertações da SBC\",\"pages\":\"\",\"bibtex\":\"@inproceedings{SdroievskiCTD-2019,\\n  title = {Conhecimento Zero Estatístico e Reduções Eficientes para o Problema MKTP},\\n  author = {Sdroievski, Nicollas M. and Da Silva, Murilo V. G. and Vignatti, André L.},  \\n  year = {2019},\\n  booktitle = {Anais do XXXII Concurso de Teses e Dissertações da SBC},\\n  pages = {}\\n}\\n\\n\\n\",\"author_short\":[\"Sdroievski, N. M.\",\"Da Silva, M. V. G.\",\"Vignatti, A. L.\"],\"key\":\"SdroievskiCTD-2019\",\"id\":\"SdroievskiCTD-2019\",\"bibbaseid\":\"sdroievski-dasilva-vignatti-conhecimentozeroestatsticoeredueseficientesparaoproblemamktp-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Martín\"],\"propositions\":[],\"lastnames\":[\"Rinemberg\"],\"suffixes\":[]},{\"firstnames\":[\"Francisco\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Soulignac\"],\"suffixes\":[]}],\"title\":\"The eternal dominating set problem for interval graphs\",\"journal\":\"Inf. Process. Lett.\",\"volume\":\"146\",\"pages\":\"27–29\",\"year\":\"2019\",\"url\":\"https://doi.org/10.1016/j.ipl.2019.01.013\",\"doi\":\"10.1016/j.ipl.2019.01.013\",\"timestamp\":\"Fri, 31 May 2019 09:51:13 +0200\",\"biburl\":\"https://dblp.org/rec/journals/ipl/RinembergS19.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"bibtex\":\"@article{RinembergSoulignac2019,\\n  author    = {Mart{\\\\'{\\\\i}}n Rinemberg and\\n               Francisco J. Soulignac},\\n  title     = {The eternal dominating set problem for interval graphs},\\n  journal   = {Inf. Process. Lett.},\\n  volume    = {146},\\n  pages     = {27--29},\\n  year      = {2019},\\n  url       = {https://doi.org/10.1016/j.ipl.2019.01.013},\\n  doi       = {10.1016/j.ipl.2019.01.013},\\n  timestamp = {Fri, 31 May 2019 09:51:13 +0200},\\n  biburl    = {https://dblp.org/rec/journals/ipl/RinembergS19.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Rinemberg, M.\",\"Soulignac, F. J.\"],\"key\":\"RinembergSoulignac2019\",\"id\":\"RinembergSoulignac2019\",\"bibbaseid\":\"rinemberg-soulignac-theeternaldominatingsetproblemforintervalgraphs-2019\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1016/j.ipl.2019.01.013\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Sigma Coloring on Powers of Paths and Some Families of Snarks\",\"author\":[{\"propositions\":[\"da\"],\"lastnames\":[\"Soledade\",\"Gonzaga\"],\"firstnames\":[\"Luis\",\"Gustavo\"],\"suffixes\":[]},{\"propositions\":[\"de\"],\"lastnames\":[\"Almeida\"],\"firstnames\":[\"Sheila\",\"Morais\"],\"suffixes\":[]}],\"journal\":\"Electronic Notes in Theoretical Computer Science\",\"volume\":\"346\",\"pages\":\"485–496\",\"year\":\"2019\",\"note\":\"The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019).\",\"publisher\":\"Elsevier\",\"bibtex\":\"@article{da2019sigma,\\n  title={Sigma Coloring on Powers of Paths and Some Families of Snarks},\\n  author={da Soledade Gonzaga, Luis Gustavo and de Almeida, Sheila Morais},\\n  journal={Electronic Notes in Theoretical Computer Science},\\n  volume={346},\\n  pages={485--496},\\n  year={2019},\\n  note = \\\"The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019).\\\",\\n  publisher={Elsevier}\\n}\\n\\n\",\"author_short\":[\"da Soledade Gonzaga, L. G.\",\"de Almeida, S. M.\"],\"key\":\"da2019sigma\",\"id\":\"da2019sigma\",\"bibbaseid\":\"dasoledadegonzaga-dealmeida-sigmacoloringonpowersofpathsandsomefamiliesofsnarks-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"AVD-edge coloring on powers of paths\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Omai\"],\"firstnames\":[\"Mayara\",\"M\"],\"suffixes\":[]},{\"propositions\":[\"de\"],\"lastnames\":[\"Almeida\"],\"firstnames\":[\"Sheila\",\"M\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sasaki\"],\"firstnames\":[\"Diana\"],\"suffixes\":[]}],\"journal\":\"Electronic Notes in Discrete Mathematics\",\"volume\":\"62\",\"pages\":\"273–278\",\"year\":\"2017\",\"note\":\"LAGOS'17 - IX Latin and American Algorithms, Graphs and Optimization.\",\"publisher\":\"Elsevier\",\"bibtex\":\"@article{omai2017avd,\\n  title={AVD-edge coloring on powers of paths},\\n  author={Omai, Mayara M and de Almeida, Sheila M and Sasaki, Diana},\\n  journal={Electronic Notes in Discrete Mathematics},\\n  volume={62},\\n  pages={273--278},\\n  year={2017},\\n  note = \\\"LAGOS'17 - {IX} Latin and American Algorithms, Graphs and Optimization.\\\",\\n  publisher={Elsevier}\\n}\\n\\n\",\"author_short\":[\"Omai, M. M\",\"de Almeida, S. M\",\"Sasaki, D.\"],\"key\":\"omai2017avd\",\"id\":\"omai2017avd\",\"bibbaseid\":\"omai-dealmeida-sasaki-avdedgecoloringonpowersofpaths-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"A.\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]},{\"firstnames\":[\"F.\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Kolberg\"],\"suffixes\":[]}],\"title\":\"On the Helly Subclasses of Interval Bigraphs and Circular Arc Bigraphs\",\"booktitle\":\"Proceedings of the 14th Latin American Theoretical Informatics Symposium\",\"year\":\"2020\",\"address\":\"São Paulo\",\"_keywords\":\"Universal2016\",\"bibtex\":\"@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 Circular Arc Bigraphs},\\n booktitle = {Proceedings of the 14th Latin American Theoretical Informatics Symposium},\\n year = {2020},\\n address = {São Paulo},\\n  _keywords =    {Universal2016},\\n}\\n\\n\",\"author_short\":[\"Groshaus, M.\",\"Guedes, A. L. P.\",\"Kolberg, F. S.\"],\"key\":\"GroshausGuedesKolbergLATIN2020\",\"id\":\"GroshausGuedesKolbergLATIN2020\",\"bibbaseid\":\"groshaus-guedes-kolberg-onthehellysubclassesofintervalbigraphsandcirculararcbigraphs-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"guedes, a\":\"https://www.inf.ufpr.br/andre/producao.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Biclique Graphs of K3-free Graphs and Bipartite Graphs\",\"year\":\"2021\",\"author\":[{\"firstnames\":[\"Marina\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"booktitle\":\"XI Latin and American Algorithms, Graphs and Optimization Symposium\",\"address\":\"São Paulo - online\",\"pages\":\"213–220\",\"bibtex\":\"@inproceedings{GroshausGuedes2021,\\ntitle = \\\"Biclique Graphs of K3-free Graphs and Bipartite Graphs\\\",\\nyear = \\\"2021\\\",\\nauthor = \\\"Marina Groshaus and André L. P. Guedes\\\",\\nbooktitle = {{XI} Latin and American Algorithms, Graphs and Optimization Symposium},\\naddress = {São Paulo - online},\\npages = {213--220},\\n}\\n\\n\",\"author_short\":[\"Groshaus, M.\",\"Guedes, A. L. P.\"],\"key\":\"GroshausGuedes2021\",\"id\":\"GroshausGuedes2021\",\"bibbaseid\":\"groshaus-guedes-bicliquegraphsofk3freegraphsandbipartitegraphs-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"On feedback vertex set in reducible flow hypergraphs\",\"year\":\"2021\",\"author\":[{\"firstnames\":[\"Luerbio\"],\"propositions\":[],\"lastnames\":[\"Faria\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]},{\"firstnames\":[\"Lilian\"],\"propositions\":[],\"lastnames\":[\"Markenzon\"],\"suffixes\":[]}],\"booktitle\":\"XI Latin and American Algorithms, Graphs and Optimization Symposium\",\"address\":\"São Paulo - online\",\"pages\":\"195–203\",\"bibtex\":\"@inproceedings{FariaGuedesMarkenzon2021,\\ntitle = \\\"On feedback vertex set in reducible flow hypergraphs\\\",\\nyear = \\\"2021\\\",\\nauthor = \\\"Luerbio Faria and André L. P. Guedes and Lilian Markenzon\\\",\\nbooktitle = {{XI} Latin and American Algorithms, Graphs and Optimization Symposium},\\naddress = {São Paulo - online},\\npages = {195--203},\\n}\\n\\n\",\"author_short\":[\"Faria, L.\",\"Guedes, A. L. P.\",\"Markenzon, L.\"],\"key\":\"FariaGuedesMarkenzon2021\",\"id\":\"FariaGuedesMarkenzon2021\",\"bibbaseid\":\"faria-guedes-markenzon-onfeedbackvertexsetinreducibleflowhypergraphs-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Rocha\"],\"suffixes\":[]},{\"firstnames\":[\"S.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Almeida\"],\"suffixes\":[]},{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]}],\"title\":\"A Near-tight Bound for the Rainbow Connection Number of Snake Graphs\",\"language\":\"english\",\"year\":\"2020\",\"booktitle\":\"Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)\",\"pages\":\"12\",\"url\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\",\"bibtex\":\"@inproceedings{lawcg20-raz,\\n  author = {A. Rocha and S. M. Almeida and L. M. Zatesko},\\n  title = {A Near-tight Bound for the Rainbow Connection Number of Snake Graphs},\\n  language = {english},\\n  year = 2020,\\n  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)},\\n  pages = 12,\\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}\\n}\\n\\n\",\"author_short\":[\"Rocha, A.\",\"Almeida, S. M.\",\"Zatesko, L. M.\"],\"key\":\"lawcg20-raz\",\"id\":\"lawcg20-raz\",\"bibbaseid\":\"rocha-almeida-zatesko-aneartightboundfortherainbowconnectionnumberofsnakegraphs-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"J.\",\"P.\",\"K.\"],\"propositions\":[],\"lastnames\":[\"Castilho\"],\"suffixes\":[]},{\"firstnames\":[\"C.\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Campos\"],\"suffixes\":[]},{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]}],\"title\":\"Rotulação $\\\\mathcal L(h, k)$ dos Sunlets\",\"year\":\"2020\",\"booktitle\":\"Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)\",\"pages\":\"19\",\"url\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\",\"bibtex\":\"@inproceedings{lawcg20-ccz,\\n  author = {J. P. K. Castilho and C. N. Campos and L. M. Zatesko},\\n  title = {Rotulação $\\\\mathcal L(h, k)$ dos Sunlets},\\n  year = 2020,\\n  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)},\\n  pages = 19,\\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}\\n}\\n\\n\",\"author_short\":[\"Castilho, J. P. K.\",\"Campos, C. N.\",\"Zatesko, L. M.\"],\"key\":\"lawcg20-ccz\",\"id\":\"lawcg20-ccz\",\"bibbaseid\":\"castilho-campos-zatesko-rotulaomathcallhkdossunlets-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Rocha\"],\"suffixes\":[]},{\"firstnames\":[\"S.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Almeida\"],\"suffixes\":[]},{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]}],\"title\":\"The Rainbow Connection Number of Triangular Snake Graphs\",\"year\":\"2020\",\"booktitle\":\"Proc. 40th Congress of the Brazilian Computer Society (CSBC '20/V ETC)\",\"address\":\"Porto Alegre, Brazil\",\"issn\":\"2595-6116\",\"pages\":\"65–68\",\"url\":\"https://sol.sbc.org.br/index.php/etc/article/view/11091\",\"bibtex\":\"@inproceedings{etc20aleffer,\\n  author = {A. Rocha and S. M. Almeida and L. M. Zatesko},\\n  title = {The Rainbow Connection Number of Triangular Snake Graphs},\\n  year = 2020,\\n  booktitle = {Proc. 40th Congress of the Brazilian Computer Society (CSBC '20/V ETC)},\\n  address = {Porto Alegre, Brazil},\\n  issn = {2595-6116},\\n  pages = {65--68},\\n  url = {https://sol.sbc.org.br/index.php/etc/article/view/11091}\\n}\\n\\n\",\"author_short\":[\"Rocha, A.\",\"Almeida, S. M.\",\"Zatesko, L. M.\"],\"key\":\"etc20aleffer\",\"id\":\"etc20aleffer\",\"bibbaseid\":\"rocha-almeida-zatesko-therainbowconnectionnumberoftriangularsnakegraphs-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://sol.sbc.org.br/index.php/etc/article/view/11091\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"E.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Cruz\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"A.\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"title\":\"Mutually Included Biclique Graphs of Interval Containment Bigraphs and Interval Bigraphs\",\"language\":\"english\",\"year\":\"2020\",\"booktitle\":\"Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)\",\"address\":\"Rio de Janeiro - online\",\"pages\":\"26\",\"url\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\",\"bibtex\":\"@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\",\"author_short\":[\"Cruz, E. P.\",\"Groshaus, M.\",\"Guedes, A. L. P.\"],\"key\":\"CruzGroshausGuedes2020\",\"id\":\"CruzGroshausGuedes2020\",\"bibbaseid\":\"cruz-groshaus-guedes-mutuallyincludedbicliquegraphsofintervalcontainmentbigraphsandintervalbigraphs-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"A.\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"title\":\"Recognition of Biclique Graphs: What we know so far\",\"language\":\"english\",\"year\":\"2020\",\"booktitle\":\"Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)\",\"address\":\"Rio de Janeiro - online\",\"pages\":\"27\",\"url\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\",\"bibtex\":\"@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}\\n\\n\",\"author_short\":[\"Groshaus, M.\",\"Guedes, A. L. P.\"],\"key\":\"GroshausGuedes2020\",\"id\":\"GroshausGuedes2020\",\"bibbaseid\":\"groshaus-guedes-recognitionofbicliquegraphswhatweknowsofar-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"A.\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]},{\"firstnames\":[\"F.\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Kolberg\"],\"suffixes\":[]}],\"title\":\"Subclass Hierarchy on Circular Arc Bigraphs\",\"language\":\"english\",\"year\":\"2020\",\"booktitle\":\"Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)\",\"pages\":\"28\",\"url\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\",\"bibtex\":\"@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% 2021\\n\\n\",\"author_short\":[\"Groshaus, M.\",\"Guedes, A. L. P.\",\"Kolberg, F. S.\"],\"key\":\"GroshausGuedesKolberg2020\",\"id\":\"GroshausGuedesKolberg2020\",\"bibbaseid\":\"groshaus-guedes-kolberg-subclasshierarchyoncirculararcbigraphs-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"misc\",\"author\":[{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Zorzi\"],\"suffixes\":[]},{\"firstnames\":[\"C.\",\"M.\",\"H.\"],\"propositions\":[],\"lastnames\":[\"Figueiredo\"],\"suffixes\":[]},{\"firstnames\":[\"R.\",\"C.\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Machado\"],\"suffixes\":[]},{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]},{\"firstnames\":[\"U.\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Souza\"],\"suffixes\":[]}],\"title\":\"Compositions, Decompositions, and Comformability for Total Coloring of Power of Cycle Graphs\",\"language\":\"english\",\"journal\":\"Discrete Appl. Math.\",\"url\":\"https://doi.org/10.1016/j.dam.2021.06.012\",\"year\":\"2021\",\"note\":\"In Press, to appear in Discrete Appl. Math.\",\"bibtex\":\"@misc{alesom21dam,\\n  author = {A. Zorzi and C. M. H. Figueiredo and R. C. S. Machado and L. M. Zatesko and U. S. Souza},\\n  title = {Compositions, Decompositions, and Comformability for Total Coloring of Power of Cycle Graphs},\\n  language = {english},\\n  journal = {Discrete Appl. Math.},\\n  url = {https://doi.org/10.1016/j.dam.2021.06.012},\\n  year = 2021,\\n  note = {In Press, to appear in Discrete Appl. Math.}\\n}\\n\\n\",\"author_short\":[\"Zorzi, A.\",\"Figueiredo, C. M. H.\",\"Machado, R. C. S.\",\"Zatesko, L. M.\",\"Souza, U. S.\"],\"key\":\"alesom21dam\",\"id\":\"alesom21dam\",\"bibbaseid\":\"zorzi-figueiredo-machado-zatesko-souza-compositionsdecompositionsandcomformabilityfortotalcoloringofpowerofcyclegraphs-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1016/j.dam.2021.06.012\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"misc\",\"author\":[{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Rocha\"],\"suffixes\":[]},{\"firstnames\":[\"S.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Almeida\"],\"suffixes\":[]},{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]}],\"title\":\"Rainbow connectivity and rainbow criticality on graph classes\",\"language\":\"english\",\"year\":\"2021\",\"journal\":\"Discrete Appl. Math.\",\"url\":\"https://doi.org/10.1016/j.dam.2021.04.017\",\"note\":\"In Press, to appear in Discrete Appl. Math.\",\"bibtex\":\"@misc{aleffer21dam,\\n  author = {A. Rocha and S. M. Almeida and L. M. Zatesko},\\n  title = {Rainbow connectivity and rainbow criticality on graph classes},\\n  language = {english},\\n  year = 2021,\\n  journal = {Discrete Appl. Math.},\\n  url = {https://doi.org/10.1016/j.dam.2021.04.017},\\n  note = {In Press, to appear in Discrete Appl. Math.}\\n}\\n\\n\\n\",\"author_short\":[\"Rocha, A.\",\"Almeida, S. M.\",\"Zatesko, L. M.\"],\"key\":\"aleffer21dam\",\"id\":\"aleffer21dam\",\"bibbaseid\":\"rocha-almeida-zatesko-rainbowconnectivityandrainbowcriticalityongraphclasses-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1016/j.dam.2021.04.017\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"J.\",\"P.\",\"K.\"],\"propositions\":[],\"lastnames\":[\"Castilho\"],\"suffixes\":[]},{\"firstnames\":[\"C.\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Campos\"],\"suffixes\":[]},{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]}],\"language\":\"portuguese\",\"year\":\"2021\",\"title\":\"Sobre Rotulações $\\\\mathcal L(h, k)$ de Caterpillars\",\"booktitle\":\"Proc. 41st Congress of the Brazilian Computer Society (CSBC '21/VI ETC)\",\"address\":\"Florianópolis, Brazil\",\"issn\":\"2595-6116\",\"url\":\"https://doi.org/10.5753/etc.2021.16381\",\"pages\":\"62–65\",\"bibtex\":\"@inproceedings{castilho21etc,\\n  author = {J. P. K. Castilho and C. N. Campos and L. M. Zatesko},\\n  language = {portuguese},\\n  year = 2021,\\n  title = {Sobre Rotulações $\\\\mathcal L(h, k)$ de Caterpillars},\\n  booktitle = {Proc. 41st Congress of the Brazilian Computer Society (CSBC '21/VI ETC)},\\n  address = {Florian\\\\'opolis, Brazil},\\n  issn = {2595-6116},\\n  url = {https://doi.org/10.5753/etc.2021.16381},\\n  pages = {62--65}\\n}\\n\\n\",\"author_short\":[\"Castilho, J. P. K.\",\"Campos, C. N.\",\"Zatesko, L. M.\"],\"key\":\"castilho21etc\",\"id\":\"castilho21etc\",\"bibbaseid\":\"castilho-campos-zatesko-sobrerotulaesmathcallhkdecaterpillars-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.5753/etc.2021.16381\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"H.\"],\"propositions\":[],\"lastnames\":[\"Hepp\"],\"suffixes\":[]},{\"firstnames\":[\"M.\",\"V.\",\"G.\"],\"propositions\":[],\"lastnames\":[\"Silva\"],\"suffixes\":[]},{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]}],\"language\":\"portuguese\",\"year\":\"2021\",\"title\":\"Um Algoritmo Quântico para um Problema de Distância Estatística\",\"booktitle\":\"Proc. 41st Congress of the Brazilian Computer Society (CSBC '21/VI ETC)\",\"address\":\"Florianópolis, Brazil\",\"issn\":\"2595-6116\",\"url\":\"https://doi.org/10.5753/etc.2021.16366\",\"pages\":\"1–4\",\"bibtex\":\"@inproceedings{henrique21etc,\\n  author = {H. Hepp and M. V. G. Silva and L. M. Zatesko},\\n  language = {portuguese},\\n  year = 2021,\\n  title = {Um Algoritmo Quântico para um Problema de Distância Estatística},\\n  booktitle = {Proc. 41st Congress of the Brazilian Computer Society (CSBC '21/VI ETC)},\\n  address = {Florian\\\\'opolis, Brazil},\\n  issn = {2595-6116},\\n  url = {https://doi.org/10.5753/etc.2021.16366},\\n  pages = {1--4}\\n}\\n\\n\",\"author_short\":[\"Hepp, H.\",\"Silva, M. V. G.\",\"Zatesko, L. M.\"],\"key\":\"henrique21etc\",\"id\":\"henrique21etc\",\"bibbaseid\":\"hepp-silva-zatesko-umalgoritmoqunticoparaumproblemadedistnciaestatstica-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.5753/etc.2021.16366\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"T.\",\"H.\",\"F.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Cunha\"],\"suffixes\":[]},{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]}],\"language\":\"english\",\"year\":\"2021\",\"title\":\"An Extended Adjacency Lemma for Graph Edge-Coloring\",\"booktitle\":\"Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)\",\"address\":\"Ponta Grossa, Brazil\",\"issn\":\"2526-1371\",\"pages\":\"43–47\",\"url\":\"http://www.wpccg.pro.br/volume004.html\",\"bibtex\":\"@inproceedings{thiago21wpccg,\\n  author = {T. H. F. M. Cunha and L. M. Zatesko},\\n  language = {english},\\n  year = 2021,\\n  title = {An Extended Adjacency Lemma for Graph Edge-Coloring},\\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},\\n  address = {Ponta Grossa, Brazil},\\n  issn = {2526-1371},\\n  pages = {43--47},\\n  url = {http://www.wpccg.pro.br/volume004.html}\\n}\\n\\n\",\"author_short\":[\"Cunha, T. H. F. M.\",\"Zatesko, L. M.\"],\"key\":\"thiago21wpccg\",\"id\":\"thiago21wpccg\",\"bibbaseid\":\"cunha-zatesko-anextendedadjacencylemmaforgraphedgecoloring-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.wpccg.pro.br/volume004.html\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"J.\",\"P.\",\"K.\"],\"propositions\":[],\"lastnames\":[\"Castilho\"],\"suffixes\":[]},{\"firstnames\":[\"C.\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Campos\"],\"suffixes\":[]},{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]}],\"language\":\"english\",\"year\":\"2021\",\"title\":\"Proper $\\\\mathcal L(h, k)$-labelling of Caterpillars and Multisunlets\",\"booktitle\":\"Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)\",\"address\":\"Ponta Grossa, Brazil\",\"issn\":\"2526-1371\",\"pages\":\"48–53\",\"url\":\"http://www.wpccg.pro.br/volume004.html\",\"bibtex\":\"@inproceedings{castilho21wpccg,\\n  author = {J. P. K. Castilho and C. N. Campos and L. M. Zatesko},\\n  language = {english},\\n  year = 2021,\\n  title = {Proper $\\\\mathcal L(h, k)$-labelling of Caterpillars and Multisunlets},\\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},\\n  address = {Ponta Grossa, Brazil},\\n  issn = {2526-1371},\\n  pages = {48--53},\\n  url = {http://www.wpccg.pro.br/volume004.html}\\n}\\n\\n\",\"author_short\":[\"Castilho, J. P. K.\",\"Campos, C. N.\",\"Zatesko, L. M.\"],\"key\":\"castilho21wpccg\",\"id\":\"castilho21wpccg\",\"bibbaseid\":\"castilho-campos-zatesko-propermathcallhklabellingofcaterpillarsandmultisunlets-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.wpccg.pro.br/volume004.html\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"M.\",\"G.\"],\"propositions\":[],\"lastnames\":[\"Dias\"],\"suffixes\":[]},{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]}],\"language\":\"english\",\"year\":\"2021\",\"title\":\"Grover's Quantum Algorithm and the Maximum Clique Problem\",\"booktitle\":\"Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)\",\"address\":\"Ponta Grossa, Brazil\",\"issn\":\"2526-1371\",\"pages\":\"54–59\",\"url\":\"http://www.wpccg.pro.br/volume004.html\",\"bibtex\":\"@inproceedings{matheus21wpccg,\\n  author = {M. G. Dias and L. M. Zatesko},\\n  language = {english},\\n  year = 2021,\\n  title = {Grover's Quantum Algorithm and the Maximum Clique Problem},\\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},\\n  address = {Ponta Grossa, Brazil},\\n  issn = {2526-1371},\\n  pages = {54--59},\\n  url = {http://www.wpccg.pro.br/volume004.html}\\n}\\n\\n\",\"author_short\":[\"Dias, M. G.\",\"Zatesko, L. M.\"],\"key\":\"matheus21wpccg\",\"id\":\"matheus21wpccg\",\"bibbaseid\":\"dias-zatesko-groversquantumalgorithmandthemaximumcliqueproblem-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.wpccg.pro.br/volume004.html\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Viviane\",\"Frida\"],\"propositions\":[],\"lastnames\":[\"Belli\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"year\":\"2021\",\"title\":\"Problemas de Otimização Utilizando o SCIP\",\"booktitle\":\"Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)\",\"address\":\"Ponta Grossa, Brazil\",\"issn\":\"2526-1371\",\"pages\":\"6\",\"url\":\"http://www.wpccg.pro.br/volume004.html\",\"bibtex\":\"@inproceedings{BelliGuedes21wpccg,\\n  author = {Viviane Frida Belli and André L. P. Guedes},\\n  year = 2021,\\n  title = {Problemas de Otimização Utilizando o SCIP},\\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},\\n  address = {Ponta Grossa, Brazil},\\n  issn = {2526-1371},\\n  pages = {6},\\n  url = {http://www.wpccg.pro.br/volume004.html}\\n}\\n\\n\",\"author_short\":[\"Belli, V. F.\",\"Guedes, A. L. P.\"],\"key\":\"BelliGuedes21wpccg\",\"id\":\"BelliGuedes21wpccg\",\"bibbaseid\":\"belli-guedes-problemasdeotimizaoutilizandooscip-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.wpccg.pro.br/volume004.html\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Raphael\",\"Bezerra\"],\"propositions\":[],\"lastnames\":[\"Xavier\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"Luiz\",\"Pires\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"year\":\"2021\",\"title\":\"A realidade das abordagens adaptadas em problemas de Otimização Global Contínua\",\"booktitle\":\"Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)\",\"address\":\"Ponta Grossa, Brazil\",\"issn\":\"2526-1371\",\"pages\":\"12\",\"url\":\"http://www.wpccg.pro.br/volume004.html\",\"bibtex\":\"@inproceedings{XavierGuedes21wpccg,\\n  author = {Raphael Bezerra Xavier and André Luiz Pires Guedes},\\n  year = 2021,\\n  title = {A realidade das abordagens adaptadas em problemas de Otimização Global Contínua},\\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},\\n  address = {Ponta Grossa, Brazil},\\n  issn = {2526-1371},\\n  pages = {12},\\n  url = {http://www.wpccg.pro.br/volume004.html}\\n}\\n\\n\",\"author_short\":[\"Xavier, R. B.\",\"Guedes, A. L. P.\"],\"key\":\"XavierGuedes21wpccg\",\"id\":\"XavierGuedes21wpccg\",\"bibbaseid\":\"xavier-guedes-arealidadedasabordagensadaptadasemproblemasdeotimizaoglobalcontnua-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.wpccg.pro.br/volume004.html\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Lucas\",\"F.\"],\"propositions\":[],\"lastnames\":[\"Glir\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"year\":\"2021\",\"title\":\"Reconhecimento de grafos IIC-comparabilidade\",\"booktitle\":\"Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)\",\"address\":\"Ponta Grossa, Brazil\",\"issn\":\"2526-1371\",\"pages\":\"13\",\"url\":\"http://www.wpccg.pro.br/volume004.html\",\"bibtex\":\"@inproceedings{GlirGuedes21wpccg,\\n  author = {Lucas F. Glir and André L. P. Guedes},\\n  year = 2021,\\n  title = {Reconhecimento de grafos IIC-comparabilidade},\\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},\\n  address = {Ponta Grossa, Brazil},\\n  issn = {2526-1371},\\n  pages = {13},\\n  url = {http://www.wpccg.pro.br/volume004.html}\\n}\\n\\n\",\"author_short\":[\"Glir, L. F.\",\"Guedes, A. L. P.\"],\"key\":\"GlirGuedes21wpccg\",\"id\":\"GlirGuedes21wpccg\",\"bibbaseid\":\"glir-guedes-reconhecimentodegrafosiiccomparabilidade-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.wpccg.pro.br/volume004.html\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Flávio\",\"Henrique\"],\"propositions\":[\"da\"],\"lastnames\":[\"Silva\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"year\":\"2021\",\"title\":\"Geração de grafo de cena utilizando teorema de causa e efeito na extração e classificação das propriedades\",\"booktitle\":\"Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)\",\"address\":\"Ponta Grossa, Brazil\",\"issn\":\"2526-1371\",\"pages\":\"3\",\"url\":\"http://www.wpccg.pro.br/volume004.html\",\"bibtex\":\"@inproceedings{SilvaGuedes21wpccg,\\n  author = {Flávio Henrique da Silva and André L. P. Guedes},\\n  year = 2021,\\n  title = {Geração de grafo de cena utilizando teorema de causa e efeito na extração e classificação das propriedades},\\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},\\n  address = {Ponta Grossa, Brazil},\\n  issn = {2526-1371},\\n  pages = {3},\\n  url = {http://www.wpccg.pro.br/volume004.html}\\n}\\n\\n\",\"author_short\":[\"da Silva, F. H.\",\"Guedes, A. L. P.\"],\"key\":\"SilvaGuedes21wpccg\",\"id\":\"SilvaGuedes21wpccg\",\"bibbaseid\":\"dasilva-guedes-geraodegrafodecenautilizandoteoremadecausaeefeitonaextraoeclassificaodaspropriedades-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.wpccg.pro.br/volume004.html\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Percolation centrality via Rademacher Complexity\",\"journal\":\"Discrete Applied Mathematics\",\"year\":\"2021\",\"doi\":\"https://doi.org/10.1016/j.dam.2021.07.023\",\"author\":[{\"firstnames\":[\"Alane\",\"M.\"],\"propositions\":[\"de Lima\"],\"lastnames\":[],\"suffixes\":[]},{\"firstnames\":[\"Murilo\",\"V.G.\"],\"propositions\":[\"da Silva\"],\"lastnames\":[],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]}],\"bibtex\":\"@article{Lima2021-A,\\ntitle = {Percolation centrality via Rademacher Complexity},\\njournal = {Discrete Applied Mathematics},\\nyear = {2021},\\ndoi = {https://doi.org/10.1016/j.dam.2021.07.023},\\nauthor = {Alane M. {de Lima} and Murilo V.G. {da Silva} and André L. Vignatti},\\n}\\n\\n\\n\\n\",\"author_short\":[\"de Lima , A. M.\",\"da Silva , M. V.\",\"Vignatti, A. L.\"],\"key\":\"Lima2021-A\",\"id\":\"Lima2021-A\",\"bibbaseid\":\"delima-dasilva-vignatti-percolationcentralityviarademachercomplexity-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"The generalized influence blocking maximization problem\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Erd\"],\"firstnames\":[\"Fernando\",\"C\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"firstnames\":[\"André\",\"L\"],\"suffixes\":[]},{\"propositions\":[\"da\"],\"lastnames\":[\"Silva\"],\"firstnames\":[\"Murilo\",\"VG\"],\"suffixes\":[]}],\"journal\":\"Social Network Analysis and Mining\",\"volume\":\"11\",\"number\":\"1\",\"pages\":\"1–17\",\"year\":\"2021\",\"publisher\":\"Springer\",\"bibtex\":\"@article{Erd2021-a,\\n  title={The generalized influence blocking maximization problem},\\n  author={Erd, Fernando C and Vignatti, Andr{\\\\'e} L and da Silva, Murilo VG},\\n  journal={Social Network Analysis and Mining},\\n  volume={11},\\n  number={1},\\n  pages={1--17},\\n  year={2021},\\n  publisher={Springer}\\n}\\n\\n\",\"author_short\":[\"Erd, F. C\",\"Vignatti, A. L\",\"da Silva, M. V.\"],\"key\":\"Erd2021-a\",\"id\":\"Erd2021-a\",\"bibbaseid\":\"erd-vignatti-dasilva-thegeneralizedinfluenceblockingmaximizationproblem-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Alane\"],\"propositions\":[],\"lastnames\":[\"Lima\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]},{\"firstnames\":[\"Murilo\"],\"propositions\":[],\"lastnames\":[\"Silva\"],\"suffixes\":[]}],\"title\":\"Problema APSP via Dimensão-VC e Médias de Rademacher\",\"booktitle\":\"Anais do VI Encontro de Teoria da Computação\",\"year\":\"2021\",\"pages\":\"13–16\",\"bibtex\":\"@inproceedings{Lima2021-B,\\n author = {Alane Lima and André L. Vignatti and Murilo Silva},\\n title = {Problema APSP via Dimensão-VC e Médias de Rademacher},\\n booktitle = {Anais do VI Encontro de Teoria da Computação},\\n year = {2021},\\n pages = {13--16},\\n}\\n\\n\\n\",\"author_short\":[\"Lima, A.\",\"Vignatti, A. L.\",\"Silva, M.\"],\"key\":\"Lima2021-B\",\"id\":\"Lima2021-B\",\"bibbaseid\":\"lima-vignatti-silva-problemaapspviadimensovcemdiasderademacher-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Alane\"],\"propositions\":[],\"lastnames\":[\"Lima\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]},{\"firstnames\":[\"Murilo\"],\"propositions\":[],\"lastnames\":[\"Silva\"],\"suffixes\":[]}],\"title\":\"A Deductive-Formal Derivation for the Preferential Attachment Metric for Link Prediction\",\"booktitle\":\"Anais do IV Workshop de Pesquisa em Computação dos Campos Gerais\",\"year\":\"2021\",\"pages\":\"31–36\",\"bibtex\":\"@inproceedings{Lima2021-C,\\n author = {Alane Lima and André L. Vignatti and Murilo Silva},\\n title = {A Deductive-Formal Derivation for the Preferential Attachment Metric for Link Prediction},\\n booktitle = {Anais do IV Workshop de Pesquisa em Computação dos Campos Gerais},\\n year = {2021},\\n pages = {31--36},\\n}\\n\\n\\n\",\"author_short\":[\"Lima, A.\",\"Vignatti, A. L.\",\"Silva, M.\"],\"key\":\"Lima2021-C\",\"id\":\"Lima2021-C\",\"bibbaseid\":\"lima-vignatti-silva-adeductiveformalderivationforthepreferentialattachmentmetricforlinkprediction-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Gomes\"],\"firstnames\":[\"Guilherme\",\"Castro\",\"Mendes\"],\"suffixes\":[]},{\"propositions\":[\"dos\"],\"lastnames\":[\"Santos\"],\"firstnames\":[\"Vinicius\",\"F.\"],\"suffixes\":[]},{\"propositions\":[\"da\"],\"lastnames\":[\"Silva\"],\"firstnames\":[\"Murilo\",\"V.\",\"G.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Szwarcfiter\"],\"firstnames\":[\"Jayme\",\"L.\"],\"suffixes\":[]}],\"title\":\"FPT and Kernelization Algorithms for the Induced Tree Problem \",\"booktitle\":\"Proceedings of International Conference on Algorithms and Complexity (CIAC 2021)\",\"year\":\"2021\",\"pages\":\"158–172 \",\"doi\":\"https://doi.org/10.1007/978-3-030-75242-2_11\",\"editor\":[{\"propositions\":[],\"lastnames\":[\"Calamoneri\"],\"firstnames\":[\"Tiziana\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Corò\"],\"firstnames\":[\"Federico\"],\"suffixes\":[]}],\"publisher\":\"Springer International Publishing\",\"bibtex\":\"@inproceedings{Gomes-CIAC2021,\\n author = {Gomes, Guilherme Castro Mendes and dos Santos, Vinicius F. and da Silva, Murilo V. G. and Szwarcfiter, Jayme L.  },\\n title = {{FPT} and Kernelization Algorithms for the Induced Tree Problem  },\\n booktitle = {Proceedings of International Conference on Algorithms and Complexity (CIAC 2021)},\\n year = {2021},\\n pages = { 158--172  },\\n doi = {https://doi.org/10.1007/978-3-030-75242-2_11},\\n editor=\\\"Calamoneri, Tiziana and Cor{\\\\`o}, Federico\\\",\\n publisher=\\\"Springer International Publishing\\\",\\n}\\n\\n\",\"author_short\":[\"Gomes, G. C. M.\",\"dos Santos, V. F.\",\"da Silva, M. V. G.\",\"Szwarcfiter, J. L.\"],\"editor_short\":[\"Calamoneri, T.\",\"Corò, F.\"],\"key\":\"Gomes-CIAC2021\",\"id\":\"Gomes-CIAC2021\",\"bibbaseid\":\"gomes-dossantos-dasilva-szwarcfiter-fptandkernelizationalgorithmsfortheinducedtreeproblem-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Biclique graphs of split graphs\",\"journal\":\"Discrete Applied Mathematics\",\"year\":\"2022\",\"issn\":\"0166-218X\",\"doi\":\"https://doi.org/10.1016/j.dam.2021.12.028\",\"url\":\"https://www.sciencedirect.com/science/article/pii/S0166218X2100514X\",\"author\":[{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"A.L.P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]},{\"firstnames\":[\"J.P.\"],\"propositions\":[],\"lastnames\":[\"Puppo\"],\"suffixes\":[]}],\"keywords\":\"Bicliques, Biclique graphs, Split graphs, Biclique-complete, -complete\",\"abstract\":\"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.\",\"bibtex\":\"@article{GroshausGuedesPuppo2022,\\ntitle = {Biclique graphs of split graphs},\\njournal = {Discrete Applied Mathematics},\\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},\\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\",\"author_short\":[\"Groshaus, M.\",\"Guedes, A.\",\"Puppo, J.\"],\"key\":\"GroshausGuedesPuppo2022\",\"id\":\"GroshausGuedesPuppo2022\",\"bibbaseid\":\"groshaus-guedes-puppo-bicliquegraphsofsplitgraphs-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.sciencedirect.com/science/article/pii/S0166218X2100514X\"},\"keyword\":[\"Bicliques\",\"Biclique graphs\",\"Split graphs\",\"Biclique-complete\",\"-complete\"],\"metadata\":{\"authorlinks\":{}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Total Coloring in Some Split-Comparability Graphs\",\"author\":[{\"propositions\":[\"da\"],\"lastnames\":[\"Soledade\",\"Gonzaga\"],\"firstnames\":[\"Luis\",\"Gustavo\"],\"suffixes\":[]},{\"propositions\":[\"de\"],\"lastnames\":[\"Almeida\"],\"firstnames\":[\"Sheila\",\"Morais\"],\"suffixes\":[]},{\"propositions\":[\"da Silva\"],\"lastnames\":[],\"firstnames\":[\"Cândida\",\"Nunes\"],\"suffixes\":[]},{\"propositions\":[\"de\"],\"lastnames\":[\"Sousa\",\"Cruz\"],\"firstnames\":[\"Jadder\",\"Bismarck\"],\"suffixes\":[]}],\"journal\":\"Matemática Contemporânea\",\"volume\":\"48\",\"publisher\":\"Sociedade Brasileira de Matemática\",\"pages\":\"94–104\",\"year\":\"2021\",\"bibtex\":\"@article{GASC21,\\n  title={Total Coloring in Some Split-Comparability Graphs},\\n  author={da Soledade Gonzaga, Luis Gustavo and de Almeida, Sheila Morais and {da Silva}, Cândida Nunes and de Sousa Cruz, Jadder Bismarck},\\n  journal={Matem{\\\\'a}tica Contempor{\\\\^a}nea},\\n  volume={48},\\n  publisher = {Sociedade Brasileira de Matemática},\\n  pages={94--104},\\n  year={2021}\\n}\\n\\n\",\"author_short\":[\"da Soledade Gonzaga, L. G.\",\"de Almeida, S. M.\",\"da Silva , C. N.\",\"de Sousa Cruz, J. B.\"],\"key\":\"GASC21\",\"id\":\"GASC21\",\"bibbaseid\":\"dasoledadegonzaga-dealmeida-dasilva-desousacruz-totalcoloringinsomesplitcomparabilitygraphs-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"The chromatic index of split-interval graphs\",\"journal\":\"Procedia Computer Science\",\"volume\":\"195\",\"pages\":\"325-333\",\"year\":\"2021\",\"note\":\"Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium.\",\"issn\":\"1877-0509\",\"doi\":\"https://doi.org/10.1016/j.procs.2021.11.040\",\"url\":\"https://www.sciencedirect.com/science/article/pii/S1877050921021797\",\"author\":[{\"firstnames\":[\"Luis\",\"Gustavo\"],\"propositions\":[\"da Soledade Gonzaga\"],\"lastnames\":[],\"suffixes\":[]},{\"firstnames\":[\"Sheila\",\"Morais\"],\"propositions\":[\"de Almeida\"],\"lastnames\":[],\"suffixes\":[]},{\"firstnames\":[\"da\",\"Cândida\",\"Nunes\"],\"propositions\":[],\"lastnames\":[\"Silva\"],\"suffixes\":[]},{\"firstnames\":[\"Jadder\",\"Bismarck\"],\"propositions\":[\"de Sousa Cruz\"],\"lastnames\":[],\"suffixes\":[]}],\"keywords\":\"Edge-coloring, split graphs, interval graphs\",\"bibtex\":\"@article{GACS21,\\ntitle = {The chromatic index of split-interval graphs},\\njournal = {Procedia Computer Science},\\nvolume = {195},\\npages = {325-333},\\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.040},\\nurl = {https://www.sciencedirect.com/science/article/pii/S1877050921021797},\\nauthor = {Luis Gustavo {da Soledade Gonzaga} and Sheila Morais {de Almeida} and da Cândida Nunes Silva and Jadder Bismarck {de Sousa Cruz}},\\nkeywords = {Edge-coloring, split graphs, interval graphs}\\n}\\n\\n\",\"author_short\":[\"da Soledade Gonzaga , L. G.\",\"de Almeida , S. M.\",\"Silva, d. C. N.\",\"de Sousa Cruz , J. B.\"],\"key\":\"GACS21\",\"id\":\"GACS21\",\"bibbaseid\":\"dasoledadegonzaga-dealmeida-silva-desousacruz-thechromaticindexofsplitintervalgraphs-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.sciencedirect.com/science/article/pii/S1877050921021797\"},\"keyword\":[\"Edge-coloring\",\"split graphs\",\"interval graphs\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Rocha\"],\"firstnames\":[\"Aleffer\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Almeida\"],\"firstnames\":[\"Sheila\",\"Morais\",\"de\"],\"suffixes\":[]}],\"title\":\"Criticalidade arco-íris em rodas e leques\",\"booktitle\":\"III Workshop de Pesquisa em Computação dos Campos Gerais\",\"issn\":\"2526-1371\",\"volume\":\"3\",\"year\":\"2019\",\"pages\":\"110–115\",\"address\":\"Ponta Grossa, Paraná\",\"bibtex\":\"@inproceedings{RoAlWPCCG19,\\n author = {Rocha, Aleffer and Almeida, Sheila Morais de},\\n title = {Criticalidade arco-íris em rodas e leques},\\n booktitle = {III Workshop de Pesquisa em Computação dos Campos Gerais},\\n issn = {2526-1371},\\n volume = {3},\\n year = {2019},\\n pages = {110--115},\\n address = {Ponta Grossa, Paraná}\\n }\\n \\n \",\"author_short\":[\"Rocha, A.\",\"Almeida, S. M. d.\"],\"key\":\"RoAlWPCCG19\",\"id\":\"RoAlWPCCG19\",\"bibbaseid\":\"rocha-almeida-criticalidadearcorisemrodaseleques-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[\"da\"],\"lastnames\":[\"Soledade\",\"Gonzaga\"],\"firstnames\":[\"Luis\",\"Gustavo\"],\"suffixes\":[]},{\"propositions\":[\"de\"],\"lastnames\":[\"Almeida\"],\"firstnames\":[\"Sheila\",\"Morais\"],\"suffixes\":[]}],\"title\":\"Coloração de arestas em grafos split-co-comparabilidade\",\"booktitle\":\"III Workshop de Pesquisa em Computação dos Campos Gerais\",\"issn\":\"2526-1371\",\"volume\":\"3\",\"year\":\"2019\",\"pages\":\"6\",\"address\":\"Ponta Grossa, Paraná\",\"bibtex\":\"@inproceedings{GoAlWPCCG19,\\n author = {da Soledade Gonzaga, Luis Gustavo and de Almeida, Sheila Morais},\\n title = {Coloração de arestas em grafos split-co-comparabilidade},\\n booktitle = {III Workshop de Pesquisa em Computação dos Campos Gerais},\\n issn = {2526-1371},\\n volume = {3},\\n year = {2019},\\n pages = {6},\\n address = {Ponta Grossa, Paraná}\\n }\\n \\n \\n \",\"author_short\":[\"da Soledade Gonzaga, L. G.\",\"de Almeida, S. M.\"],\"key\":\"GoAlWPCCG19\",\"id\":\"GoAlWPCCG19\",\"bibbaseid\":\"dasoledadegonzaga-dealmeida-coloraodearestasemgrafossplitcocomparabilidade-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Salgado\"],\"firstnames\":[\"Pedro\",\"Henrique\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Omai\"],\"firstnames\":[\"Mayara\",\"Midori\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Almeida\"],\"firstnames\":[\"Sheila\",\"Morais\",\"de\"],\"suffixes\":[]}],\"title\":\"Coloração total distinta na vizinhança em potências de caminho\",\"booktitle\":\"II Workshop de Pesquisa em Computação dos Campos Gerais\",\"issn\":\"2526-1371\",\"volume\":\"2\",\"year\":\"2017\",\"pages\":\"53–56\",\"address\":\"Ponta Grossa, Paraná\",\"bibtex\":\"@inproceedings{SOA17,\\n author = {Salgado, Pedro Henrique and Omai, Mayara Midori and Almeida, Sheila Morais de },\\n title = {Coloração total distinta na vizinhança em potências de caminho},\\n booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},\\n issn = {2526-1371},\\n volume = {2},\\n year = {2017},\\n pages = {53--56},\\n address = {Ponta Grossa, Paraná}\\n}\\n\\n\",\"author_short\":[\"Salgado, P. H.\",\"Omai, M. M.\",\"Almeida, S. M. d.\"],\"key\":\"SOA17\",\"id\":\"SOA17\",\"bibbaseid\":\"salgado-omai-almeida-coloraototaldistintanavizinhanaempotnciasdecaminho-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Rocha\"],\"firstnames\":[\"Aleffer\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Almeida\"],\"firstnames\":[\"Sheila\",\"Morais\",\"de\"],\"suffixes\":[]}],\"title\":\"Criticalidade arco-íris dos grafos resultantes de produto cartesiano de ciclos e caminhos\",\"booktitle\":\"II Workshop de Pesquisa em Computação dos Campos Gerais\",\"issn\":\"2526-1371\",\"volume\":\"2\",\"year\":\"2017\",\"pages\":\"49–52\",\"address\":\"Ponta Grossa, Paraná\",\"bibtex\":\"@inproceedings{RoAl17,\\n author = {Rocha, Aleffer and Almeida, Sheila Morais de},\\n title = {Criticalidade arco-íris dos grafos resultantes de produto cartesiano de ciclos e caminhos},\\n booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},\\n issn = {2526-1371},\\n volume = {2},\\n year = {2017},\\n pages = {49--52},\\n address = {Ponta Grossa, Paraná}\\n}\\n\\n\",\"author_short\":[\"Rocha, A.\",\"Almeida, S. M. d.\"],\"key\":\"RoAl17\",\"id\":\"RoAl17\",\"bibbaseid\":\"rocha-almeida-criticalidadearcorisdosgrafosresultantesdeprodutocartesianodeciclosecaminhos-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Rauch\"],\"firstnames\":[\"Thamirys\",\"Moreira\",\"dos\",\"Santos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Almeida\"],\"firstnames\":[\"Sheila\",\"Morais\",\"de\"],\"suffixes\":[]}],\"title\":\"Adjacente vertex distinguishing edge coloring on complete split graphs and split-indifference graphs\",\"booktitle\":\"II Workshop de Pesquisa em Computação dos Campos Gerais\",\"issn\":\"2526-1371\",\"volume\":\"2\",\"year\":\"2017\",\"pages\":\"45–48\",\"address\":\"Ponta Grossa, Paraná\",\"bibtex\":\"@inproceedings{RaAl17,\\n author = {Rauch, Thamirys Moreira dos Santos and Almeida, Sheila Morais de},\\n title = {Adjacente vertex distinguishing edge coloring on complete split graphs and split-indifference graphs},\\n booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},\\n issn = {2526-1371},\\n volume = {2},\\n year = {2017},\\n pages = {45--48},\\n address = {Ponta Grossa, Paraná}\\n}\\n\\n\",\"author_short\":[\"Rauch, T. M. d. S.\",\"Almeida, S. M. d.\"],\"key\":\"RaAl17\",\"id\":\"RaAl17\",\"bibbaseid\":\"rauch-almeida-adjacentevertexdistinguishingedgecoloringoncompletesplitgraphsandsplitindifferencegraphs-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Scaketti\"],\"firstnames\":[\"Matheus\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Almeida\"],\"firstnames\":[\"Sheila\",\"Morais\",\"de\"],\"suffixes\":[]}],\"title\":\"Coloração total distinta na vizinhança em grafos 4-partidos completos\",\"booktitle\":\"II Workshop de Pesquisa em Computação dos Campos Gerais\",\"issn\":\"2526-1371\",\"volume\":\"2\",\"year\":\"2017\",\"pages\":\"57–60\",\"address\":\"Ponta Grossa, Paraná\",\"bibtex\":\"@inproceedings{ScAl17,\\n author = {Scaketti, Matheus and Almeida, Sheila Morais de},\\n title = {Coloração total distinta na vizinhança em grafos 4-partidos completos},\\n booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},\\n issn = {2526-1371},\\n volume = {2},\\n year = {2017},\\n pages = {57--60},\\n address = {Ponta Grossa, Paraná}\\n}\\n\\n\",\"author_short\":[\"Scaketti, M.\",\"Almeida, S. M. d.\"],\"key\":\"ScAl17\",\"id\":\"ScAl17\",\"bibbaseid\":\"scaketti-almeida-coloraototaldistintanavizinhanaemgrafos4partidoscompletos-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Rocha\"],\"firstnames\":[\"Aleffer\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Almeida\"],\"firstnames\":[\"Sheila\",\"Morais\",\"de\"],\"suffixes\":[]}],\"title\":\"Coloração arco-íris em grafos resultantes de produto cartesiano\",\"year\":\"2017\",\"booktitle\":\"II Encontro de Teoria da Computação - ETC, São Paulo, Brasil\",\"bibtex\":\"@inproceedings{RoAlETC17,\\n  author = {Rocha, Aleffer and Almeida, Sheila Morais de},\\n  title = {Coloração arco-íris em grafos resultantes de produto cartesiano},\\n  year = 2017,\\n  booktitle = {II Encontro de Teoria da Computação - ETC, São Paulo, Brasil}\\n}\\n\\n\",\"author_short\":[\"Rocha, A.\",\"Almeida, S. M. d.\"],\"key\":\"RoAlETC17\",\"id\":\"RoAlETC17\",\"bibbaseid\":\"rocha-almeida-coloraoarcorisemgrafosresultantesdeprodutocartesiano-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Almeida\"],\"firstnames\":[\"Sheila\",\"Morais\",\"de\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sasaki\"],\"firstnames\":[\"Diana\"],\"suffixes\":[]}],\"title\":\"Reduced indifference graphs are type 1\",\"language\":\"english\",\"year\":\"2020\",\"booktitle\":\"Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)\",\"address\":\"Rio de Janeiro - online\",\"pages\":\"13\",\"url\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\",\"bibtex\":\"@inproceedings{SaAl20,\\n  author = {Almeida, Sheila Morais de and Sasaki, Diana},\\n  title = {Reduced indifference graphs are type 1},\\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 = 13,\\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}\\n}\\n\\n\",\"author_short\":[\"Almeida, S. M. d.\",\"Sasaki, D.\"],\"key\":\"SaAl20\",\"id\":\"SaAl20\",\"bibbaseid\":\"almeida-sasaki-reducedindifferencegraphsaretype1-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Luis\",\"Gustavo\"],\"propositions\":[\"da Soledade Gonzaga\"],\"lastnames\":[],\"suffixes\":[]},{\"firstnames\":[\"Sheila\",\"Morais\"],\"propositions\":[\"de\"],\"lastnames\":[\"Almeida\"],\"suffixes\":[]},{\"firstnames\":[\"da\",\"Cândida\",\"Nunes\"],\"propositions\":[],\"lastnames\":[\"Silva\"],\"suffixes\":[]},{\"firstnames\":[\"Jadder\",\"Bismarck\"],\"propositions\":[\"de Sousa Cruz\"],\"lastnames\":[],\"suffixes\":[]}],\"title\":\"Total Coloring in Some Split-Comparability Graphs\",\"language\":\"english\",\"year\":\"2020\",\"booktitle\":\"Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)\",\"address\":\"Rio de Janeiro - online\",\"pages\":\"15\",\"url\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\",\"bibtex\":\"@inproceedings{GASC20,\\n  author = {Luis Gustavo {da Soledade Gonzaga} and Sheila Morais de Almeida and da Cândida Nunes Silva and Jadder Bismarck {de Sousa Cruz}},\\n  title = {Total Coloring in Some Split-Comparability Graphs},\\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 = 15,\\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}\\n}\\n\\n\",\"author_short\":[\"da Soledade Gonzaga , L. G.\",\"de Almeida, S. M.\",\"Silva, d. C. N.\",\"de Sousa Cruz , J. B.\"],\"key\":\"GASC20\",\"id\":\"GASC20\",\"bibbaseid\":\"dasoledadegonzaga-dealmeida-silva-desousacruz-totalcoloringinsomesplitcomparabilitygraphs-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Correa\"],\"firstnames\":[\"Aleff\",\"Renan\",\"Pereira\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Almeida\"],\"firstnames\":[\"Sheila\",\"Morais\",\"de\"],\"suffixes\":[]}],\"title\":\"Strong pseudoachromatic number of split graphs\",\"language\":\"english\",\"year\":\"2020\",\"booktitle\":\"Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)\",\"address\":\"Rio de Janeiro - online\",\"pages\":\"11\",\"url\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\",\"bibtex\":\"@inproceedings{CoAl20,\\n  author = {Correa, Aleff Renan Pereira and Almeida, Sheila Morais de},\\n  title = {Strong pseudoachromatic number of split graphs},\\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 = 11,\\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}\\n}\\n\\n\",\"author_short\":[\"Correa, A. R. P.\",\"Almeida, S. M. d.\"],\"key\":\"CoAl20\",\"id\":\"CoAl20\",\"bibbaseid\":\"correa-almeida-strongpseudoachromaticnumberofsplitgraphs-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Equitable total coloring of graphs with universal vertex\",\"author\":[{\"firstnames\":[\"Mayara\",\"Midori\"],\"propositions\":[],\"lastnames\":[\"Omai\"],\"suffixes\":[]},{\"firstnames\":[\"Sheila\",\"Morais\"],\"propositions\":[\"de\"],\"lastnames\":[\"Almeida\"],\"suffixes\":[]}],\"year\":\"2018\",\"language\":\"english\",\"booktitle\":\"Proc. VIII Latin American Workshop on Cliques in Graphs\",\"address\":\"Rio de Janeiro\",\"pages\":\"30\",\"url\":\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\",\"bibtex\":\"@inproceedings{OASLAWCG2018,\\n  title={Equitable total coloring of graphs with universal vertex},\\n  author={Mayara Midori Omai and Sheila Morais de Almeida},\\n  year      = 2018,\\n  language = {english},\\n  booktitle = {Proc. VIII Latin American Workshop on Cliques in Graphs},\\n  address = {Rio de Janeiro},\\n  pages = {30},\\n  url = \\\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\\\"\\n}\\n\\n\",\"author_short\":[\"Omai, M. M.\",\"de Almeida, S. M.\"],\"key\":\"OASLAWCG2018\",\"id\":\"OASLAWCG2018\",\"bibbaseid\":\"omai-dealmeida-equitabletotalcoloringofgraphswithuniversalvertex-2018\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Neighbour-distinguishing edge-labellings and total-labellings of families of graphs\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Luiz\"],\"firstnames\":[\"A.\",\"G.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Almeida\"],\"firstnames\":[\"S.\",\"M.\",\"de\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Campos\"],\"firstnames\":[\"C.\",\"N.\"],\"suffixes\":[]}],\"year\":\"2017\",\"language\":\"english\",\"booktitle\":\"In: 17th Colourings, Independence and Domination Workshop on Graph Theory (CID 2017)\",\"address\":\"Piechowice\",\"bibtex\":\"@inproceedings{LAC17,\\n  title={Neighbour-distinguishing edge-labellings and total-labellings of families of graphs},\\n  author={Luiz, A. G. and Almeida, S. M. de and Campos, C. N.},\\n  year      = 2017,\\n  language = {english},\\n  booktitle = {In: 17th Colourings, Independence and Domination Workshop on Graph Theory (CID 2017)},\\n  address = {Piechowice}\\n}\\n\\n\",\"author_short\":[\"Luiz, A. G.\",\"Almeida, S. M. d.\",\"Campos, C. N.\"],\"key\":\"LAC17\",\"id\":\"LAC17\",\"bibbaseid\":\"luiz-almeida-campos-neighbourdistinguishingedgelabellingsandtotallabellingsoffamiliesofgraphs-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Matheus\"],\"propositions\":[],\"lastnames\":[\"Correa\"],\"suffixes\":[]},{\"firstnames\":[\"Renato\"],\"propositions\":[],\"lastnames\":[\"Carmo\"],\"suffixes\":[]},{\"firstnames\":[\"Alexandre\",\"Prusch\"],\"propositions\":[],\"lastnames\":[\"Züge\"],\"suffixes\":[]}],\"title\":\"Lexicographic Breadth First-Search and Branch and Bound Algorithms for the Maximum Clique Problem\",\"journal\":\"Matemática Contemporânea\",\"year\":\"2022\",\"optvolume\":\"48\",\"optpages\":\"240-252\",\"doi\":\"http://doi.org/10.21711/231766362021/rmc4824\",\"bibtex\":\"@Article{CorreaCarmoZuge22,\\n   author       = {Matheus Correa and Renato Carmo and Alexandre\\n                     Prusch Züge},\\n   title        = {Lexicographic Breadth First-Search and Branch and\\n                     Bound Algorithms for the Maximum Clique Problem},\\n   journal      = {Matemática Contemporânea},\\n   year         = {2022},\\n   optvolume    = {48},\\n   optpages     = {240-252},\\n   doi          = {http://doi.org/10.21711/231766362021/rmc4824}\\n}\\n\\n\",\"author_short\":[\"Correa, M.\",\"Carmo, R.\",\"Züge, A. P.\"],\"key\":\"CorreaCarmoZuge22\",\"id\":\"CorreaCarmoZuge22\",\"bibbaseid\":\"correa-carmo-zge-lexicographicbreadthfirstsearchandbranchandboundalgorithmsforthemaximumcliqueproblem-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Pietro\"],\"propositions\":[],\"lastnames\":[\"Cavassin\"],\"suffixes\":[]},{\"firstnames\":[\"Aleffer\"],\"propositions\":[],\"lastnames\":[\"Rocha\"],\"suffixes\":[]},{\"firstnames\":[\"Renato\"],\"propositions\":[],\"lastnames\":[\"Carmo\"],\"suffixes\":[]}],\"title\":\"Cálculo de raízes quadradas de grafos utilizando um resolvedor pseudo-booleano\",\"booktitle\":\"Anais do IV Workshop de Pesquisa em Computação dos Campos Gerais\",\"issn\":\"2526-1371\",\"volume\":\"4\",\"year\":\"2021\",\"pages\":\"25\",\"address\":\"Ponta Grossa, Paraná\",\"doi\":\"10.5281/zenodo.6090322\",\"url_pdf\":\"http://www.wpccg.pro.br/wpccg2021/papers/paper_40\",\"bibtex\":\"@InProceedings{CavassinRochaCarmo21,\\n   author       = {Pietro Cavassin and Aleffer Rocha and Renato Carmo},\\n   title        = {Cálculo de raízes quadradas de grafos utilizando um\\n                     resolvedor pseudo-booleano},\\n   booktitle    = {Anais do IV Workshop de Pesquisa em Computação dos\\n                     Campos Gerais},\\n   issn         = {2526-1371},\\n   volume       = {4},\\n   year         = {2021},\\n   pages        = {25},\\n   address      = {Ponta Grossa, Paraná},\\n   doi          = {10.5281/zenodo.6090322},\\n   url_pdf      = {http://www.wpccg.pro.br/wpccg2021/papers/paper_40}\\n}\\n\\n\",\"author_short\":[\"Cavassin, P.\",\"Rocha, A.\",\"Carmo, R.\"],\"key\":\"CavassinRochaCarmo21\",\"id\":\"CavassinRochaCarmo21\",\"bibbaseid\":\"cavassin-rocha-carmo-clculoderazesquadradasdegrafosutilizandoumresolvedorpseudobooleano-2021\",\"role\":\"author\",\"urls\":{\" pdf\":\"http://www.wpccg.pro.br/wpccg2021/papers/paper_40\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"firstnames\":[\"Marina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Montero\"],\"firstnames\":[\"Leandro\"],\"suffixes\":[]}],\"title\":\"Structural properties of biclique graphs and the distance formula\",\"url\":\"https://ajc.maths.uq.edu.au/pdf/81/ajc_v81_p301.pdf\",\"journal\":\"Australasian Journal of Combinatorics\",\"year\":\"2021\",\"volume\":\"81\",\"number\":\"2\",\"pages\":\"301–318\",\"bibtex\":\"@article{GroshausMonteroAJC2021,\\n\\tauthor = {Groshaus, Marina and Montero, Leandro},\\n\\ttitle = {Structural properties of biclique graphs and the distance formula},\\n\\turl= {https://ajc.maths.uq.edu.au/pdf/81/ajc_v81_p301.pdf},\\n\\tjournal = {Australasian Journal of Combinatorics},\\n\\tyear = 2021,\\n\\tvolume = 81,\\n\\tnumber = 2,\\n\\tpages = \\\"301--318\\\",\\n}\\n\\n\",\"author_short\":[\"Groshaus, M.\",\"Montero, L.\"],\"key\":\"GroshausMonteroAJC2021\",\"id\":\"GroshausMonteroAJC2021\",\"bibbaseid\":\"groshaus-montero-structuralpropertiesofbicliquegraphsandthedistanceformula-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://ajc.maths.uq.edu.au/pdf/81/ajc_v81_p301.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"}],\n      metadata: {\"authorlinks\":{}},\n      ownerID: undefined\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"universal.bib\" href=\"data:text/bibtex;base64,@inproceedings{LimaSilvaVignatti2020-A,
  author = {Alane M. de Lima and Murilo V. G. da Silva and André L. Vignatti},
  title = {Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory},
  year = {2020},
  booktitle = {26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining},
}



@inproceedings{Melo2020-A,
title = " Tighter Dual Bounds on the Least Cost Influence Problem",
year = "2020",
booktitle = "LII Simpósio Brasileiro de Pesquisa Operacional.",
author = "Renato S. de Melo and André L. Vignatti and Flávio K. Miyazawa and Matheus J. Ota"
}



@inproceedings{Melo2020-B,
title = "Preprocessing Rules for Target Set Selection in Complex Networks",
year = "2020",
booktitle = "IX Brazilian Workshop on Social Network Analysis and Mining.",
author = "Renato S. de Melo and André L. Vignatti"
}



@inproceedings{Erd2020,
title = "Blocking the Spread of Misinformation in a Network under Distinct Cost Models",
year = "2020",
booktitle = "XII International Conference on Advances in Social Network Analysis and Mining.",
author = "Fernando C. Erd and Murilo V. G. da Silva and André L. Vignatti"
}



@InProceedings{CarmoCorreaZuge20,
   author       = {Renato Carmo and Matheus Vinicius Correa and
                     Alexandre Prusch Züge},
   title        = {Lexicographic Breadth First-Search and Branch and
                     Bound Algorithms for the Maximum Clique Problem},
   language     = {english},
   year         = {2020},
   booktitle    = {Proc. IX Latin American Workshop on Cliques in
                     Graphs},
   address      = {Rio de Janeiro}
}



@InBook{AlvesGoncalvesZugeBeletiSantiago2019,
   author       = {Alves, G. J. and Goncalves, D. C. M. and Zuge,
                     Alexandre P. and Beleti Jr., C. R. and Santiago
                     Jr., R. M.},
   title        = {As tecnologias digitais e o ensino de ciências e de
                     computação na sociedade contemporânea},
   chapter      = {Projeto "Por dentro do computador": uma iniciativa
                     de divulgação e popularização da arquitetura de
                     computadores},
   publisher    = {Booknando Livros},
   year         = {2019},
   optkey       = {},
   volume       = {1},
   number       = {},
   series       = {},
   type         = {Book Chapter},
   address      = {Palotina, PR},
   edition      = {},
   month        = {},
   pages        = {162-172},
   note         = {Organizado por Eliana Santana Lisbôa e Valdir Rosa},
   annote       = {}
}



@InProceedings{BeletiGoncalvesValerioZugeSantiagoAlvesAlencar2017,
   author       = {Beleti JR., C. R. and Goncalves, D. C. M. and
                     Valerio, M. and Zuge, Alexandre P. and Santiago
                     JR., R. M. and Alves, G. J. and Alencar,
                     V. H. S.},
   title        = {Popularizando a Computação: o desenvolvimento de
                     recursos para a educação não-formal sobre
                     Arquitetura de Computadores},
   optcrossref  = {},
   optkey       = {},
   booktitle    = {35° Seminário de Extensão Universitária da Região
                     Sul - SEURS},
   year         = {2017},
   editor       = {UNILA},
   volume       = {},
   number       = {},
   series       = {},
   pages        = {1248-1253},
   month        = {},
   address      = {Foz do Iguaçu},
   organization = {UNILA},
   publisher    = {},
   note         = {},
   annote       = {}
}



@inproceedings{SobralGroshausGuedesETC2017,
  author = {Gabriel A. G. Sobral and Marina Groshaus and André L. P. Guedes},
  title = {Biclique edge-choosability in some classes of graphs},
  year = 2017,
  booktitle = {II Encontro de Teoria da Computação - ETC, São Paulo, Brasil},
  url = {http://csbc2017.mackenzie.br/public/files/2-etc/artigos/4.pdf}
}



@inproceedings{ZateskoCarmoGuedesETC2017,
  author = {Leandro M. Zatesko and Renato Carmo and André L. P. Guedes},
  title = {Edge-colouring of triangle-free graphs with no proper majors},
  year = 2017,
  booktitle = {II Encontro de Teoria da Computação - ETC, São Paulo, Brasil},
  url = {http://csbc2017.mackenzie.br/public/files/2-etc/artigos/13.pdf}
}



@article{GroshausGuedesPuppo2017,
title = "Biclique graph of bipartite permutation graphs",
journal = "Electronic Notes in Discrete Mathematics",
volume = "62",
pages = "33--38",
year = "2017",
note = "LAGOS'17 - {IX} Latin and American Algorithms, Graphs and Optimization.",
issn = "1571-0653",
doi = "10.1016/j.endm.2017.10.007",
url = "https://www.sciencedirect.com/science/article/pii/S1571065317302457",
abstract_url = {https://lipn.univ-paris13.fr/Lagos2017/abstracts_final_short.pdf},
author = "M. Groshaus and A. L. P. Guedes and J. P. Puppo",
keywords = "Bicliques",
keywords = "Biclique graphs",
keywords = "Bipartite permutation graphs ",
abstract = "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. "
}



@inproceedings{ZateskoCarmoGuedesICORES2018,
author={Leandro M. Zatesko and Renato Carmo and André L. P. Guedes},
title={Upper Bounds for the Total Chromatic Number of Join Graphs and Cobipartite Graphs},
booktitle={Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2018},
pages={247-253},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006627102470253},
isbn={978-989-758-285-1},
}



@inproceedings{GroshausGuedesLAWCG2018,
  title={The Biclique Graph of {$K_3$}-free Graphs are the Square of Some Graph},
  author={Marina Groshaus and André L. P. Guedes},
  year      = 2018,
  language = {english},
  booktitle = {Proc. VIII Latin American Workshop on Cliques in Graphs},
  address = {Rio de Janeiro},
  pages = {25},
  url = "http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf"
}



@inproceedings{ZateskoCarmoGuedesLAWCG2018,
  title={A Recolouring Procedure for Total Colouring},
  author={L. M. Zatesko and R. Carmo and A. L. P. Guedes},
  year      = 2018,
  language = {english},
  booktitle = {Proc. VIII Latin American Workshop on Cliques in Graphs},
  address = {Rio de Janeiro},
  pages = {31},
  url = "http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf"
}



@inproceedings{ZateskoBernardiAlmeidaCarmoGuedesLAWCG2018,
  title={A Decomposition for Edge-colouring},
  author={Leandro Zatesko and João P. W. Bernardi and Sheila M. de Almeida and Renato Carmo and André L. P. Guedes},
  year      = 2018,
  language = {english},
  booktitle = {Proc. VIII Latin American Workshop on Cliques in Graphs},
  address = {Rio de Janeiro},
  url = "http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf"
}



@inproceedings{GroshausGuedesKolbergLAWCG2018,
  title={Circular-arc Bigraphs and the Helly subclass},
  author={Marina Groshaus and André Luiz Pires Guedes and Fabricio Schiavon Kolberg},
  year      = 2018,
  language = {english},
  booktitle = {Proc. VIII Latin American Workshop on Cliques in Graphs},
  address = {Rio de Janeiro},
  pages = {60},
  url = "http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf"
}



@inproceedings{CruzGroshausGuedesLAWCG2018,
  title={Biclique Graphs of Interval Bigraphs and Circular-arc Bigraphs},
  author={E. P. Cruz and M. Groshaus and A. L. P. Guedes},
  year      = 2018,
  language = {english},
  booktitle = {Proc. VIII Latin American Workshop on Cliques in Graphs},
  address = {Rio de Janeiro},
  pages = {68},
  url = "http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf"
}



@inproceedings{SantosGuedes2019,
  title={Algoritmos de planejamento de caminhos {3D}},
  author={Cleiton Santos and A. L. P. Guedes},
  year     = 2019,
  booktitle = {Proc. Computer on the beach},
  address = {Florianópolis},
}



@inproceedings{Brito2019,
  title     = {Optimization System for Dynamic Flight Planning for Groups
               of Drones using Cooperation with Mobile Recharge Bases by
               Means of Multiagent System and Recursive Auctions},
  author    = {Robison C. Brito and José F. Loureiro and Eduardo Todt and Andre L. P. Guedes},
  booktitle = {2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)},
  publisher = {IEEE},
  year      = {2019},
  address   = {Milwaukee, Wisconsin, USA},
}



@Article{ZugeCarmo18,
   title        = {On comparing algorithms for the maximum clique
                     problem},
   journal      = {Discrete Applied Mathematics},
   volume       = {247},
   pages        = {1-13},
   year         = {2018},
   issn         = {0166-218X},
   doi          = {10.1016/j.dam.2018.01.005},
   url          = {http://www.sciencedirect.com/science/article/pii/S0166218X18300167},
   author       = {Alexandre Prusch Züge and Renato Carmo},
}



@inproceedings{Melo2018,
 author = {Renato S. Melo and Andre L. Vignatti},
 title = {A Preselection Algorithm for the Influence Maximization Problem in Power Law Graphs},
 booktitle = {Proceedings of the 33rd Annual ACM Symposium on Applied Computing},
 year = {2018},
 pages = {1782--1789},
} 



@inproceedings{Melo2017,
  author = {Renato S. Melo and Andre L. Vignatti and Arthur P. Da Costa and Felipe do Nascimento},
  year = {2017},
  booktitle = {Proceedings of the II Workshop de Pesquisa em Computação dos Campos Gerais},
  month = {06},
  pages = {37--40},
  title = {Participação Feminina no Cinema Brasileiro: Análise Através de Redes Sociais}
}



@inproceedings{Labres2018a,
 author = {Bruno H. Labres and Andre L. Vignatti},
 title = {Características Topológicas de Redes do Mundo Real},
 booktitle = {Proceedings of the 26th Evento de Iniciação Científica da Universidade Federal do Paraná (EVINCI)},
 year = {2018},
 pages = {343},
} 



@article{Bordini2017,
  title = "An Approximation Algorithm for the p-Hub Median Problem",
  journal = "Electronic Notes in Discrete Mathematics",
  volume = "62",
  pages = "183--188",
  year = "2017",
  note = "LAGOS'17 - {IX} Latin and American Algorithms, Graphs and Optimization.",
  author = "Camile F. Bordini and André L. Vignatti",
}



@article{Sdroievski2019a,
  title = "The Hidden Subgroup Problem and {MKTP}",
  journal = "Theoretical Computer Science",
  volume    = {795},
  pages     = {204--212},
  year = "2019",
  author = "Nicollas M. Sdroievski and Murilo V. G. da Silva and André L. Vignatti",
  url       = {https://doi.org/10.1016/j.tcs.2019.06.012},
  doi       = {10.1016/j.tcs.2019.06.012},
  biburl    = {https://dblp.org/rec/journals/tcs/SdroievskiSV19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}



@inproceedings{CruzGroshausGuedesWPCCG2017,
 author = {E. P. Cruz and M. Groshaus and A. L. P. Guedes},
 title = {Algoritmos de Varredura para Listagem de Bicliques Maximais em Modelos Bipartidos de Intervalos e Arco-Circulares},
 booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},
 issn = {2526-1371},
 volume = {2},
 year = {2017},
 pages = {9--12},
 address = {Ponta Grossa, Paraná},
 url_pdf = {http://www.wpccg.pro.br/wpccg2017/papers/paper_6}
}



@inproceedings{ZateskoCarmoGuedesWPCCG2017,
 author = {Leandro M. Zatesko and Renato Carmo and André L. P. Guedes},
 title = {On a conjecture on edge-colouring join graphs},
 booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},
 issn = {2526-1371},
 volume = {2},
 year = {2017},
 pages = {69--72},
 address = {Ponta Grossa, Paraná},
 url_pdf = {http://www.wpccg.pro.br/wpccg2017/papers/paper_16}
}



@Article{MuriloDM18,
   title        = {Structure and algorithms for (cap, even hole)-free graphs},
   journal      = {Discrete Mathematics},
   volume       = {341},
   pages        = {463-473},
   year         = {2018},
   issn         = {0012-365X},
   doi          = {https://doi.org/10.1016/j.disc.2017.09.013},
   url          = {https://www.sciencedirect.com/science/article/pii/S0012365X17303230?via%3Dihub},
   author       = {Kathie Cameron and Murilo V. G. da Silva and Shenwei Huang and Kristina Vuskovic},
}




@article{Kolberg2019,
title = "Subclasses of Circular-Arc Bigraphs: Helly, Normal and Proper",
journal = "Electronic Notes in Theoretical Computer Science",
volume = "346",
pages = "497 - 509",
year = "2019",
note = "The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019).",
  _keywords =    {Universal2016},
organization={UFMG},
issn = "1571-0661",
doi = "https://doi.org/10.1016/j.entcs.2019.08.044",
url = "http://www.sciencedirect.com/science/article/pii/S1571066119300957",
author = "Marina Groshaus and André L. P. Guedes and Fabricio Schiavon Kolberg",
keywords = "Biclique, Circular-arc, recognition, Helly, Normal, Proper",
abstract = "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."
}



@article{Bernardi2019,
title = "The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal",
journal = "Electronic Notes in Theoretical Computer Science",
volume = "346",
pages = "125 - 133",
year = "2019",
note = "The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019).",
  _keywords =    {Universal2016},
organization={UFMG},
issn = "1571-0661",
doi = "https://doi.org/10.1016/j.entcs.2019.08.012",
url = "http://www.sciencedirect.com/science/article/pii/S1571066119300623",
author = "João Pedro W. Bernardi and Murilo V. G. da Silva and André Luiz P. Guedes and Leandro M. Zatesko",
keywords = "Pullback, circular-arc, chromatic index, edge-coloring, chordal",
abstract = "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."
}



@article{ZCGZMF2019,
	author = {Leandro Zatesko and Renato Carmo and André Guedes and Alesom Zorzi and Raphael Machado and Celina Figueiredo},
	title = { On the chromatic index of complementary prisms},
	journal = {Acta Mathematica Universitatis Comenianae},
	volume = {88},
	number = {3},
	year = {2019},
	_keywords = {Universal2016},
	abstract = {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.},
	issn = {0862-9544},	pages = {1071--1077},	url = {http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1208},
        note = {EUROCOMB'2019.}
}



@inproceedings{GroshausGuedesKolbergWPCCG2019,
 author = {M. Groshaus and A. L. P. Guedes and F. S. Kolberg},
 title = {On Subclasses of Circular Arc Bigraphs},
 booktitle = {III Workshop de Pesquisa em Computação dos Campos Gerais},
 issn = {2526-1371},
 volume = {3},
 year = {2019},
 pages = {68--73},
 address = {Ponta Grossa, Paraná},
 abstract = {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.},
  _keywords =    {Universal2016},
 url_pdf = {http://www.wpccg.pro.br/wpccg2019/papers/paper_21}
}



@inproceedings{SantosGuedesWPCCG2019,
 author = {C. A. Santos and A. L. P. Guedes},
 title = {Planejamento de caminhos 3D: Comparação dos algoritmos por grade 3D e grafo de visibilidade},
 booktitle = {III Workshop de Pesquisa em Computação dos Campos Gerais},
 issn = {2526-1371},
 volume = {3},
 year = {2019},
 pages = {116--121},
 address = {Ponta Grossa, Paraná},
 abstract = {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.},
  _keywords =    {Universal2016},
 url_pdf = {http://www.wpccg.pro.br/wpccg2019/papers/paper_25}
}



@inproceedings{wpccg19-za,
  author = {L. M. Zatesko and E. A. Vieira},
  title = {P = NP or 5-Snarks Exist},
  language = {english},
  year = 2019,
  booktitle = {Proc. 3nd Workshop de Pesquisa em Computa\c c\~ao dos Campos Gerais (WPCCG '19)},
  address = {Ponta Grossa, Brazil},
  issn = {2526-1371},
  url_pdf = {http://www.wpccg.pro.br/wpccg2019/papers/paper_38},
  pages = {135--140}
}



@article{ZateskoBernardiAlmeidaCarmoGuedes2019,
	author = {Leandro Zatesko and João P. W. Bernardi and Sheila M. de Almeida and Renato Carmo and André L. P. Guedes},
	title = {A Connectivity-based Decomposition for Graph Edge-colouring},
	journal = {Matemática Contemporânea},
        issn = {2317-6636},
	volume = {46},
	year = {2019},
	abstract = {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.},
        publisher = {Sociedade Brasileira de Matemática},
        pages = {156--164},
  _keywords =    {Universal2016},
        url = {https://mc.sbm.org.br/volumes/volume-46/},
        url_pdf = {https://mc.sbm.org.br/wp-content/uploads/sites/15/2019/12/P16.pdf},
        _note = {2018 – 8th Latin-American Workshop on Cliques in Graphs.}
}




@inproceedings{Zatesko2019CTDSBC,
 author = {Leandro Zatesko and Renato Carmo and André Guedes},
 title = {Novel Procedures for Graph Edge-colouring},
 booktitle = {Anais do XXXII Concurso de Teses e Dissertações},
 location = {Belém},
 year = {2019},
 issn = {0000-0000},
 publisher = {SBC},
 address = {Porto Alegre, RS, Brasil},
  _keywords =    {Universal2016},
 doi = {10.5753/ctd.2019.6331},
 url = {https://sol.sbc.org.br/index.php/ctd/article/view/6331}
}





@inproceedings{Zatesko2019CTDSBPO,
 author = {Leandro Zatesko and Renato Carmo and André Guedes},
 title = {Novel Procedures for Graph Edge-colouring},
 booktitle = {Prêmio de Tese do LI Simpósio Brasileiro de Pesquisa Operacional},
 location = {Limeira},
 year = {2019},
 _keywords = {Universal2016},
 issn = {0000-0000},
 publisher = {SBPO},
 address = {Campinas, GALOÁ},
 note = {Prêmio: melhor de tese de doutorado.},
 url = {https://proceedings.science/sbpo-2019/papers/novel-procedures-for-graph-edge-colouring?lang=pt-br}
}



@inproceedings{LimaSilvaVignatti2019,
 author = {A. M. Lima and M. V. G. da Silva and A. L. Vignatti},
 title = {Recognizing Power-law Graphs by Machine Learning Algorithms using a Reduced Set of Structural Features},
 booktitle = {Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC)},
 location = {Salvador},
 year = {2019},
 _keywords = {Universal2016},
}



@article{CruzGroshausGuedesPuppo2020,
title = "Biclique Graphs of Interval Bigraphs",
journal = "Discrete Applied Mathematics",
volume = "281",
pages = "134 - 143",
year = "2020",
issn = "0166-218X",
url = "http://www.sciencedirect.com/science/article/pii/S0166218X20300755",
author = "E. P. Cruz and M. Groshaus and A. L. P. Guedes and J. P. Puppo",
_keywords =    {Universal2016},
_note = "SI: LAGOS’17",
doi = {10.1016/j.dam.2020.02.010},
keywords = "Bicliques, Biclique graphs, Interval bigraphs, Bipartite permutation graphs, Co-comparability graphs",
abstract = "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."
}



@article{GomesGroshausLimaSantos2020,
title = {Intersection graph of maximal stars},
journal = {Discrete Applied Mathematics},
volume = {285},
pages = {567-580},
year = {2020},
issn = {0166-218X},
doi = {https://doi.org/10.1016/j.dam.2020.07.004},
url = {https://www.sciencedirect.com/science/article/pii/S0166218X20303504},
author = {Guilherme de C. M. Gomes and Marina Groshaus and Carlos V. G. C. Lima and Vinicius F. {dos Santos}},
keywords = {Intersection graphs, Stars, Star graphs, Cliques, Edge clique covers},
abstract = {A biclique of a graph G is an induced complete bipartite subgraph of G such that neither part is empty. A star is a biclique of G such that one part has exactly one vertex. The star graph of G is the intersection graph of the maximal stars of G. A graph H is star-critical if its star graph is different from the star graph of any of its proper induced subgraphs. We begin by showing that a star-critical pre-image of an n-vertex star graph has at most On2vertices. We then describe a Krausz-type characterization for star graphs. We combine these results to show that the problem of recognizing star graphs is in NP. We also present some properties of the class. In particular, we show that they are biconnected, that every edge belongs to at least one triangle, characterize the structures the pre-image must have in order to generate degree two vertices in its star graph, and bound the diameter of the star graph with respect to the diameter of its pre-image. Finally, we prove a monotonicity theorem, which we apply in order to list every star graph on at most eight vertices.}
}



@article{Zatesko2020,
title = "Edge-colouring graphs with bounded local degree sums",
journal = "Discrete Applied Mathematics",
volume = "281",
pages = "268 - 283",
year = "2020",
_keywords =    {Universal2016},
_note = "SI: LAGOS’17",
issn = "0166-218X",
doi = "10.1016/j.dam.2020.03.044",
url = "http://www.sciencedirect.com/science/article/pii/S0166218X20301438",
author = "L. M. Zatesko and A. Zorzi and R. Carmo and A. L. P. Guedes",
keywords = "Colouring of graphs and hypergraphs, Vertex degrees, Graph algorithms, Graph theory",
abstract = "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."
}



@article{MaskeCohenDuarte2020,
author = {Maske, Charles and Cohen, Jaime and Duarte Jr, Elias},
year = {2020},
title = {Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions},
number = {82},
pages = {1601--1615},
journal = {Algorithmica},
doi = {10.1007/s00453-019-00658-6}
}



@InProceedings{Hepp2019,
   title        = {Uma Revisão sobre a Relação de BQP com Outras
                     Classes de Complexidade Computacional},
   author       = {Hepp, H and Silva. M. V. G. and Zatesko, L.M.},
   year         = {2019},
   booktitle    = {Anais do III Workshop de Pesquisa em Computação dos
                     Campos Gerais},
   pages        = {74-79}
}




@InProceedings{MacedoAlencarBeletiZugeSantiago2018,
   title        = {Abordagem didático-pedagógica para o ensino de
                     Arquitetura de Computadores em espaços
                     educacionais não formais},
   author       = {Macedo, C. A. and Alencar, V. H. S. and Beleti JR.,
                     C. R. and Zuge, Alexandre P. and Santiago JR.,
                     R. M.},
   year         = {2018},
   booktitle    = {Proc. Computer on the beach},
   address      = {Florianópolis}
}





@inproceedings{MoraesSantosChabaturaMoreira2019,
 author = {Moraes, C. A. d. L. and Santos, C. A. and Chabatura Neto, F. and Moreira, J. V.},
 title = {Capivara team description paper for the robocup brazil open flying robot league},
 booktitle = {XVIII Latin American Robotics Competition (LARC) and XVII Brazilian Robotics Competition (CBR)},
 location = {Rio Grande},
 year = {2019},
 _keywords = {Universal2016},
}



@Misc{Lima2020-Chile,
   optkey       = {},
   author       = {Alane M. de Lima},
   title        = {Sample Complexity in Graph Problems},
   howpublished = {Seminário apresentado na XV Escuela de Verano en
                     Matemáticas Discretas},
   type         = {Talk},
   year         = {2020},
   note         = {},
   annote       = {}
}



@inproceedings{Lima2019-A,
  title = {Estimando Centralidade de Percolação utilizando Amostragem e Teoria da Dimensão Vapnik-Chervonenkis},
  author = {Lima, A. M. and Santos, G. M. and Silva. M. V. G. and Vignatti, A. L.},  
  year = {2019},
  booktitle = {Anais do III Workshop de Pesquisa em Computação dos Campos Gerais},
  pages = {86 - 91}
}



@InProceedings{Recksidler2019,
   title        = {Aparecimento de cliques em grafos aleatórios lei de
                     potência no modelo de ligação preferencial},
   author       = {Recksidler Jr, D. and Silva. M. V. G.},
   year         = {2019},
   booktitle    = {Anais do III Workshop de Pesquisa em Computação dos
                     Campos Gerais},
   pages        = {74-79}
}




@inproceedings{SdroievskiCTD-2019,
  title = {Conhecimento Zero Estatístico e Reduções Eficientes para o Problema MKTP},
  author = {Sdroievski, Nicollas M. and Da Silva, Murilo V. G. and Vignatti, André L.},  
  year = {2019},
  booktitle = {Anais do XXXII Concurso de Teses e Dissertações da SBC},
  pages = {}
}




@article{RinembergSoulignac2019,
  author    = {Mart{\'{\i}}n Rinemberg and
               Francisco J. Soulignac},
  title     = {The eternal dominating set problem for interval graphs},
  journal   = {Inf. Process. Lett.},
  volume    = {146},
  pages     = {27--29},
  year      = {2019},
  url       = {https://doi.org/10.1016/j.ipl.2019.01.013},
  doi       = {10.1016/j.ipl.2019.01.013},
  timestamp = {Fri, 31 May 2019 09:51:13 +0200},
  biburl    = {https://dblp.org/rec/journals/ipl/RinembergS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}



@article{da2019sigma,
  title={Sigma Coloring on Powers of Paths and Some Families of Snarks},
  author={da Soledade Gonzaga, Luis Gustavo and de Almeida, Sheila Morais},
  journal={Electronic Notes in Theoretical Computer Science},
  volume={346},
  pages={485--496},
  year={2019},
  note = "The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019).",
  publisher={Elsevier}
}



@article{omai2017avd,
  title={AVD-edge coloring on powers of paths},
  author={Omai, Mayara M and de Almeida, Sheila M and Sasaki, Diana},
  journal={Electronic Notes in Discrete Mathematics},
  volume={62},
  pages={273--278},
  year={2017},
  note = "LAGOS'17 - {IX} Latin and American Algorithms, Graphs and Optimization.",
  publisher={Elsevier}
}



@inproceedings{GroshausGuedesKolbergLATIN2020,
 author = {M. Groshaus and A. L. P. Guedes and F. S. Kolberg},
 title = {On the Helly Subclasses of Interval Bigraphs and Circular Arc Bigraphs},
 booktitle = {Proceedings of the 14th Latin American Theoretical Informatics Symposium},
 year = {2020},
 address = {São Paulo},
  _keywords =    {Universal2016},
}



@inproceedings{GroshausGuedes2021,
title = "Biclique Graphs of K3-free Graphs and Bipartite Graphs",
year = "2021",
author = "Marina Groshaus and André L. P. Guedes",
booktitle = {{XI} Latin and American Algorithms, Graphs and Optimization Symposium},
address = {São Paulo - online},
pages = {213--220},
}



@inproceedings{FariaGuedesMarkenzon2021,
title = "On feedback vertex set in reducible flow hypergraphs",
year = "2021",
author = "Luerbio Faria and André L. P. Guedes and Lilian Markenzon",
booktitle = {{XI} Latin and American Algorithms, Graphs and Optimization Symposium},
address = {São Paulo - online},
pages = {195--203},
}



@inproceedings{lawcg20-raz,
  author = {A. Rocha and S. M. Almeida and L. M. Zatesko},
  title = {A Near-tight Bound for the Rainbow Connection Number of Snake Graphs},
  language = {english},
  year = 2020,
  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)},
  pages = 12,
  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}
}



@inproceedings{lawcg20-ccz,
  author = {J. P. K. Castilho and C. N. Campos and L. M. Zatesko},
  title = {Rotulação $\mathcal L(h, k)$ dos Sunlets},
  year = 2020,
  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)},
  pages = 19,
  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}
}



@inproceedings{etc20aleffer,
  author = {A. Rocha and S. M. Almeida and L. M. Zatesko},
  title = {The Rainbow Connection Number of Triangular Snake Graphs},
  year = 2020,
  booktitle = {Proc. 40th Congress of the Brazilian Computer Society (CSBC '20/V ETC)},
  address = {Porto Alegre, Brazil},
  issn = {2595-6116},
  pages = {65--68},
  url = {https://sol.sbc.org.br/index.php/etc/article/view/11091}
}



@inproceedings{CruzGroshausGuedes2020,
  author = {E. P. Cruz and M. Groshaus and A. L. P. Guedes},
  title = {Mutually Included Biclique Graphs of Interval Containment Bigraphs and Interval Bigraphs},
  language = {english},
  year = 2020,
  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)},
  address = {Rio de Janeiro - online},
  pages = 26,
  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}
}



@inproceedings{GroshausGuedes2020,
  author = {M. Groshaus and A. L. P. Guedes},
  title = {Recognition of Biclique Graphs: What we know so far},
  language = {english},
  year = 2020,
  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)},
  address = {Rio de Janeiro - online},
  pages = 27,
  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}
}



@inproceedings{GroshausGuedesKolberg2020,
  author = {M. Groshaus and A. L. P. Guedes and F. S. Kolberg},
  title = {Subclass Hierarchy on Circular Arc Bigraphs},
  language = {english},
  year = 2020,
  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)},
  pages = 28,
  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}
}

% 2021



@misc{alesom21dam,
  author = {A. Zorzi and C. M. H. Figueiredo and R. C. S. Machado and L. M. Zatesko and U. S. Souza},
  title = {Compositions, Decompositions, and Comformability for Total Coloring of Power of Cycle Graphs},
  language = {english},
  journal = {Discrete Appl. Math.},
  url = {https://doi.org/10.1016/j.dam.2021.06.012},
  year = 2021,
  note = {In Press, to appear in Discrete Appl. Math.}
}



@misc{aleffer21dam,
  author = {A. Rocha and S. M. Almeida and L. M. Zatesko},
  title = {Rainbow connectivity and rainbow criticality on graph classes},
  language = {english},
  year = 2021,
  journal = {Discrete Appl. Math.},
  url = {https://doi.org/10.1016/j.dam.2021.04.017},
  note = {In Press, to appear in Discrete Appl. Math.}
}




@inproceedings{castilho21etc,
  author = {J. P. K. Castilho and C. N. Campos and L. M. Zatesko},
  language = {portuguese},
  year = 2021,
  title = {Sobre Rotulações $\mathcal L(h, k)$ de Caterpillars},
  booktitle = {Proc. 41st Congress of the Brazilian Computer Society (CSBC '21/VI ETC)},
  address = {Florian\'opolis, Brazil},
  issn = {2595-6116},
  url = {https://doi.org/10.5753/etc.2021.16381},
  pages = {62--65}
}



@inproceedings{henrique21etc,
  author = {H. Hepp and M. V. G. Silva and L. M. Zatesko},
  language = {portuguese},
  year = 2021,
  title = {Um Algoritmo Quântico para um Problema de Distância Estatística},
  booktitle = {Proc. 41st Congress of the Brazilian Computer Society (CSBC '21/VI ETC)},
  address = {Florian\'opolis, Brazil},
  issn = {2595-6116},
  url = {https://doi.org/10.5753/etc.2021.16366},
  pages = {1--4}
}



@inproceedings{thiago21wpccg,
  author = {T. H. F. M. Cunha and L. M. Zatesko},
  language = {english},
  year = 2021,
  title = {An Extended Adjacency Lemma for Graph Edge-Coloring},
  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},
  address = {Ponta Grossa, Brazil},
  issn = {2526-1371},
  pages = {43--47},
  url = {http://www.wpccg.pro.br/volume004.html}
}



@inproceedings{castilho21wpccg,
  author = {J. P. K. Castilho and C. N. Campos and L. M. Zatesko},
  language = {english},
  year = 2021,
  title = {Proper $\mathcal L(h, k)$-labelling of Caterpillars and Multisunlets},
  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},
  address = {Ponta Grossa, Brazil},
  issn = {2526-1371},
  pages = {48--53},
  url = {http://www.wpccg.pro.br/volume004.html}
}



@inproceedings{matheus21wpccg,
  author = {M. G. Dias and L. M. Zatesko},
  language = {english},
  year = 2021,
  title = {Grover's Quantum Algorithm and the Maximum Clique Problem},
  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},
  address = {Ponta Grossa, Brazil},
  issn = {2526-1371},
  pages = {54--59},
  url = {http://www.wpccg.pro.br/volume004.html}
}



@inproceedings{BelliGuedes21wpccg,
  author = {Viviane Frida Belli and André L. P. Guedes},
  year = 2021,
  title = {Problemas de Otimização Utilizando o SCIP},
  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},
  address = {Ponta Grossa, Brazil},
  issn = {2526-1371},
  pages = {6},
  url = {http://www.wpccg.pro.br/volume004.html}
}



@inproceedings{XavierGuedes21wpccg,
  author = {Raphael Bezerra Xavier and André Luiz Pires Guedes},
  year = 2021,
  title = {A realidade das abordagens adaptadas em problemas de Otimização Global Contínua},
  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},
  address = {Ponta Grossa, Brazil},
  issn = {2526-1371},
  pages = {12},
  url = {http://www.wpccg.pro.br/volume004.html}
}



@inproceedings{GlirGuedes21wpccg,
  author = {Lucas F. Glir and André L. P. Guedes},
  year = 2021,
  title = {Reconhecimento de grafos IIC-comparabilidade},
  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},
  address = {Ponta Grossa, Brazil},
  issn = {2526-1371},
  pages = {13},
  url = {http://www.wpccg.pro.br/volume004.html}
}



@inproceedings{SilvaGuedes21wpccg,
  author = {Flávio Henrique da Silva and André L. P. Guedes},
  year = 2021,
  title = {Geração de grafo de cena utilizando teorema de causa e efeito na extração e classificação das propriedades},
  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},
  address = {Ponta Grossa, Brazil},
  issn = {2526-1371},
  pages = {3},
  url = {http://www.wpccg.pro.br/volume004.html}
}



@article{Lima2021-A,
title = {Percolation centrality via Rademacher Complexity},
journal = {Discrete Applied Mathematics},
year = {2021},
doi = {https://doi.org/10.1016/j.dam.2021.07.023},
author = {Alane M. {de Lima} and Murilo V.G. {da Silva} and André L. Vignatti},
}





@article{Erd2021-a,
  title={The generalized influence blocking maximization problem},
  author={Erd, Fernando C and Vignatti, Andr{\'e} L and da Silva, Murilo VG},
  journal={Social Network Analysis and Mining},
  volume={11},
  number={1},
  pages={1--17},
  year={2021},
  publisher={Springer}
}



@inproceedings{Lima2021-B,
 author = {Alane Lima and André L. Vignatti and Murilo Silva},
 title = {Problema APSP via Dimensão-VC e Médias de Rademacher},
 booktitle = {Anais do VI Encontro de Teoria da Computação},
 year = {2021},
 pages = {13--16},
}




@inproceedings{Lima2021-C,
 author = {Alane Lima and André L. Vignatti and Murilo Silva},
 title = {A Deductive-Formal Derivation for the Preferential Attachment Metric for Link Prediction},
 booktitle = {Anais do IV Workshop de Pesquisa em Computação dos Campos Gerais},
 year = {2021},
 pages = {31--36},
}




@inproceedings{Gomes-CIAC2021,
 author = {Gomes, Guilherme Castro Mendes and dos Santos, Vinicius F. and da Silva, Murilo V. G. and Szwarcfiter, Jayme L.  },
 title = {{FPT} and Kernelization Algorithms for the Induced Tree Problem  },
 booktitle = {Proceedings of International Conference on Algorithms and Complexity (CIAC 2021)},
 year = {2021},
 pages = { 158--172  },
 doi = {https://doi.org/10.1007/978-3-030-75242-2_11},
 editor="Calamoneri, Tiziana and Cor{\`o}, Federico",
 publisher="Springer International Publishing",
}



@article{GroshausGuedesPuppo2022,
title = {Biclique graphs of split graphs},
journal = {Discrete Applied Mathematics},
year = {2022},
issn = {0166-218X},
doi = {https://doi.org/10.1016/j.dam.2021.12.028},
url = {https://www.sciencedirect.com/science/article/pii/S0166218X2100514X},
author = {M. Groshaus and A.L.P. Guedes and J.P. Puppo},
keywords = {Bicliques, Biclique graphs, Split graphs, Biclique-complete, -complete},
abstract = {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.}
}




@article{GASC21,
  title={Total Coloring in Some Split-Comparability Graphs},
  author={da Soledade Gonzaga, Luis Gustavo and de Almeida, Sheila Morais and {da Silva}, Cândida Nunes and de Sousa Cruz, Jadder Bismarck},
  journal={Matem{\'a}tica Contempor{\^a}nea},
  volume={48},
  publisher = {Sociedade Brasileira de Matemática},
  pages={94--104},
  year={2021}
}



@article{GACS21,
title = {The chromatic index of split-interval graphs},
journal = {Procedia Computer Science},
volume = {195},
pages = {325-333},
year = {2021},
note = {Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium.},
issn = {1877-0509},
doi = {https://doi.org/10.1016/j.procs.2021.11.040},
url = {https://www.sciencedirect.com/science/article/pii/S1877050921021797},
author = {Luis Gustavo {da Soledade Gonzaga} and Sheila Morais {de Almeida} and da Cândida Nunes Silva and Jadder Bismarck {de Sousa Cruz}},
keywords = {Edge-coloring, split graphs, interval graphs}
}



@inproceedings{RoAlWPCCG19,
 author = {Rocha, Aleffer and Almeida, Sheila Morais de},
 title = {Criticalidade arco-íris em rodas e leques},
 booktitle = {III Workshop de Pesquisa em Computação dos Campos Gerais},
 issn = {2526-1371},
 volume = {3},
 year = {2019},
 pages = {110--115},
 address = {Ponta Grossa, Paraná}
 }
 
 

@inproceedings{GoAlWPCCG19,
 author = {da Soledade Gonzaga, Luis Gustavo and de Almeida, Sheila Morais},
 title = {Coloração de arestas em grafos split-co-comparabilidade},
 booktitle = {III Workshop de Pesquisa em Computação dos Campos Gerais},
 issn = {2526-1371},
 volume = {3},
 year = {2019},
 pages = {6},
 address = {Ponta Grossa, Paraná}
 }
 
 
 

@inproceedings{SOA17,
 author = {Salgado, Pedro Henrique and Omai, Mayara Midori and Almeida, Sheila Morais de },
 title = {Coloração total distinta na vizinhança em potências de caminho},
 booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},
 issn = {2526-1371},
 volume = {2},
 year = {2017},
 pages = {53--56},
 address = {Ponta Grossa, Paraná}
}



@inproceedings{RoAl17,
 author = {Rocha, Aleffer and Almeida, Sheila Morais de},
 title = {Criticalidade arco-íris dos grafos resultantes de produto cartesiano de ciclos e caminhos},
 booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},
 issn = {2526-1371},
 volume = {2},
 year = {2017},
 pages = {49--52},
 address = {Ponta Grossa, Paraná}
}



@inproceedings{RaAl17,
 author = {Rauch, Thamirys Moreira dos Santos and Almeida, Sheila Morais de},
 title = {Adjacente vertex distinguishing edge coloring on complete split graphs and split-indifference graphs},
 booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},
 issn = {2526-1371},
 volume = {2},
 year = {2017},
 pages = {45--48},
 address = {Ponta Grossa, Paraná}
}



@inproceedings{ScAl17,
 author = {Scaketti, Matheus and Almeida, Sheila Morais de},
 title = {Coloração total distinta na vizinhança em grafos 4-partidos completos},
 booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},
 issn = {2526-1371},
 volume = {2},
 year = {2017},
 pages = {57--60},
 address = {Ponta Grossa, Paraná}
}



@inproceedings{RoAlETC17,
  author = {Rocha, Aleffer and Almeida, Sheila Morais de},
  title = {Coloração arco-íris em grafos resultantes de produto cartesiano},
  year = 2017,
  booktitle = {II Encontro de Teoria da Computação - ETC, São Paulo, Brasil}
}



@inproceedings{SaAl20,
  author = {Almeida, Sheila Morais de and Sasaki, Diana},
  title = {Reduced indifference graphs are type 1},
  language = {english},
  year = 2020,
  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)},
  address = {Rio de Janeiro - online},
  pages = 13,
  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}
}



@inproceedings{GASC20,
  author = {Luis Gustavo {da Soledade Gonzaga} and Sheila Morais de Almeida and da Cândida Nunes Silva and Jadder Bismarck {de Sousa Cruz}},
  title = {Total Coloring in Some Split-Comparability Graphs},
  language = {english},
  year = 2020,
  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)},
  address = {Rio de Janeiro - online},
  pages = 15,
  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}
}



@inproceedings{CoAl20,
  author = {Correa, Aleff Renan Pereira and Almeida, Sheila Morais de},
  title = {Strong pseudoachromatic number of split graphs},
  language = {english},
  year = 2020,
  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)},
  address = {Rio de Janeiro - online},
  pages = 11,
  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}
}



@inproceedings{OASLAWCG2018,
  title={Equitable total coloring of graphs with universal vertex},
  author={Mayara Midori Omai and Sheila Morais de Almeida},
  year      = 2018,
  language = {english},
  booktitle = {Proc. VIII Latin American Workshop on Cliques in Graphs},
  address = {Rio de Janeiro},
  pages = {30},
  url = "http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf"
}



@inproceedings{LAC17,
  title={Neighbour-distinguishing edge-labellings and total-labellings of families of graphs},
  author={Luiz, A. G. and Almeida, S. M. de and Campos, C. N.},
  year      = 2017,
  language = {english},
  booktitle = {In: 17th Colourings, Independence and Domination Workshop on Graph Theory (CID 2017)},
  address = {Piechowice}
}



@Article{CorreaCarmoZuge22,
   author       = {Matheus Correa and Renato Carmo and Alexandre
                     Prusch Züge},
   title        = {Lexicographic Breadth First-Search and Branch and
                     Bound Algorithms for the Maximum Clique Problem},
   journal      = {Matemática Contemporânea},
   year         = {2022},
   optvolume    = {48},
   optpages     = {240-252},
   doi          = {http://doi.org/10.21711/231766362021/rmc4824}
}



@InProceedings{CavassinRochaCarmo21,
   author       = {Pietro Cavassin and Aleffer Rocha and Renato Carmo},
   title        = {Cálculo de raízes quadradas de grafos utilizando um
                     resolvedor pseudo-booleano},
   booktitle    = {Anais do IV Workshop de Pesquisa em Computação dos
                     Campos Gerais},
   issn         = {2526-1371},
   volume       = {4},
   year         = {2021},
   pages        = {25},
   address      = {Ponta Grossa, Paraná},
   doi          = {10.5281/zenodo.6090322},
   url_pdf      = {http://www.wpccg.pro.br/wpccg2021/papers/paper_40}
}



@article{GroshausMonteroAJC2021,
	author = {Groshaus, Marina and Montero, Leandro},
	title = {Structural properties of biclique graphs and the distance formula},
	url= {https://ajc.maths.uq.edu.au/pdf/81/ajc_v81_p301.pdf},
	journal = {Australasian Journal of Combinatorics},
	year = 2021,
	volume = 81,
	number = 2,
	pages = "301--318",
}

\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=http://www.inf.ufpr.br/teoria/universal2016/universal.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=http://www.inf.ufpr.br/teoria/universal2016/universal.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=http%3A%2F%2Fwww.inf.ufpr.br%2Fteoria%2Funiversal2016%2Funiversal.bib&amp;fullnames=1&amp;jsonp=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=http%3A%2F%2Fwww.inf.ufpr.br%2Fteoria%2Funiversal2016%2Funiversal.bib&amp;fullnames=1&amp;jsonp=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=http%3A%2F%2Fwww.inf.ufpr.br%2Fteoria%2Funiversal2016%2Funiversal.bib&amp;fullnames=1&amp;jsonp=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\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      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. 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    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2022\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2022')\"\n      onkeypress=\"toggleGroup('group_2022')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2022</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"groshaus-guedes-puppo-bicliquegraphsofsplitgraphs-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0166218X2100514X\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'groshaus-guedes-puppo-bicliquegraphsofsplitgraphs-2022', 'https://www.sciencedirect.com/science/article/pii/S0166218X2100514X', event);\">\n    Biclique graphs of split graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   M. Groshaus;  A.L.P. Guedes;  and  J.P. Puppo.\n</span>\n\n  \n\n</span>\n\n  <i>Discrete Applied Mathematics</i>.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0166218X2100514X\"\n     onclick=\"log_download('groshaus-guedes-puppo-bicliquegraphsofsplitgraphs-2022', 'https://www.sciencedirect.com/science/article/pii/S0166218X2100514X', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Biclique graphs of split graphs [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/https://doi.org/10.1016/j.dam.2021.12.028\"\n     onclick=\"log_download('groshaus-guedes-puppo-bicliquegraphsofsplitgraphs-2022', 'http://doi.org/https://doi.org/10.1016/j.dam.2021.12.028', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/groshaus-guedes-puppo-bicliquegraphsofsplitgraphs-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('groshaus-guedes-puppo-bicliquegraphsofsplitgraphs-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{GroshausGuedesPuppo2022,\ntitle = {Biclique graphs of split graphs},\njournal = {Discrete Applied Mathematics},\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},\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</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\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</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"correa-carmo-zge-lexicographicbreadthfirstsearchandbranchandboundalgorithmsforthemaximumcliqueproblem-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Lexicographic Breadth First-Search and Branch and Bound Algorithms for the Maximum Clique Problem.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Matheus Correa;  Renato Carmo;  and  Alexandre Prusch Züge.\n</span>\n\n  \n\n</span>\n\n  <i>Matemática Contemporânea</i>.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/http://doi.org/10.21711/231766362021/rmc4824\"\n     onclick=\"log_download('correa-carmo-zge-lexicographicbreadthfirstsearchandbranchandboundalgorithmsforthemaximumcliqueproblem-2022', 'http://doi.org/http://doi.org/10.21711/231766362021/rmc4824', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/correa-carmo-zge-lexicographicbreadthfirstsearchandbranchandboundalgorithmsforthemaximumcliqueproblem-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('correa-carmo-zge-lexicographicbreadthfirstsearchandbranchandboundalgorithmsforthemaximumcliqueproblem-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{CorreaCarmoZuge22,\n   author       = {Matheus Correa and Renato Carmo and Alexandre\n                     Prusch Züge},\n   title        = {Lexicographic Breadth First-Search and Branch and\n                     Bound Algorithms for the Maximum Clique Problem},\n   journal      = {Matemática Contemporânea},\n   year         = {2022},\n   optvolume    = {48},\n   optpages     = {240-252},\n   doi          = {http://doi.org/10.21711/231766362021/rmc4824}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2021\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2021')\"\n      onkeypress=\"toggleGroup('group_2021')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2021</span>\n      <span class=\"bibbase_group_count\">\n        \n        (22)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"groshaus-guedes-bicliquegraphsofk3freegraphsandbipartitegraphs-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Biclique Graphs of K3-free Graphs and Bipartite Graphs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Marina Groshaus;  and  André L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>XI Latin and American Algorithms, Graphs and Optimization Symposium</i>, pages 213–220, São Paulo - online,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/groshaus-guedes-bicliquegraphsofk3freegraphsandbipartitegraphs-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('groshaus-guedes-bicliquegraphsofk3freegraphsandbipartitegraphs-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{GroshausGuedes2021,\ntitle = &quot;Biclique Graphs of K3-free Graphs and Bipartite Graphs&quot;,\nyear = &quot;2021&quot;,\nauthor = &quot;Marina Groshaus and André L. P. Guedes&quot;,\nbooktitle = {{XI} Latin and American Algorithms, Graphs and Optimization Symposium},\naddress = {São Paulo - online},\npages = {213--220},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"faria-guedes-markenzon-onfeedbackvertexsetinreducibleflowhypergraphs-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On feedback vertex set in reducible flow hypergraphs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Luerbio Faria;  André L. P. Guedes;  and  Lilian Markenzon.\n</span>\n\n  \n\n</span>\n\n  In <i>XI Latin and American Algorithms, Graphs and Optimization Symposium</i>, pages 195–203, São Paulo - online,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/faria-guedes-markenzon-onfeedbackvertexsetinreducibleflowhypergraphs-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('faria-guedes-markenzon-onfeedbackvertexsetinreducibleflowhypergraphs-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{FariaGuedesMarkenzon2021,\ntitle = &quot;On feedback vertex set in reducible flow hypergraphs&quot;,\nyear = &quot;2021&quot;,\nauthor = &quot;Luerbio Faria and André L. P. Guedes and Lilian Markenzon&quot;,\nbooktitle = {{XI} Latin and American Algorithms, Graphs and Optimization Symposium},\naddress = {São Paulo - online},\npages = {195--203},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"zorzi-figueiredo-machado-zatesko-souza-compositionsdecompositionsandcomformabilityfortotalcoloringofpowerofcyclegraphs-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1016/j.dam.2021.06.012\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zorzi-figueiredo-machado-zatesko-souza-compositionsdecompositionsandcomformabilityfortotalcoloringofpowerofcyclegraphs-2021', 'https://doi.org/10.1016/j.dam.2021.06.012', event);\">\n    Compositions, Decompositions, and Comformability for Total Coloring of Power of Cycle Graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   A. Zorzi;  C. M. H. Figueiredo;  R. C. S. Machado;  L. M. Zatesko;  and  U. S. Souza.\n</span>\n\n  \n\n</span>\n\n   2021.\n  <span class=\"note\">In Press, to appear in Discrete Appl. Math.</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1016/j.dam.2021.06.012\"\n     onclick=\"log_download('zorzi-figueiredo-machado-zatesko-souza-compositionsdecompositionsandcomformabilityfortotalcoloringofpowerofcyclegraphs-2021', 'https://doi.org/10.1016/j.dam.2021.06.012', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Compositions, Decompositions, and Comformability for Total Coloring of Power of Cycle Graphs [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zorzi-figueiredo-machado-zatesko-souza-compositionsdecompositionsandcomformabilityfortotalcoloringofpowerofcyclegraphs-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zorzi-figueiredo-machado-zatesko-souza-compositionsdecompositionsandcomformabilityfortotalcoloringofpowerofcyclegraphs-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@misc{alesom21dam,\n  author = {A. Zorzi and C. M. H. Figueiredo and R. C. S. Machado and L. M. Zatesko and U. S. Souza},\n  title = {Compositions, Decompositions, and Comformability for Total Coloring of Power of Cycle Graphs},\n  language = {english},\n  journal = {Discrete Appl. Math.},\n  url = {https://doi.org/10.1016/j.dam.2021.06.012},\n  year = 2021,\n  note = {In Press, to appear in Discrete Appl. Math.}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"rocha-almeida-zatesko-rainbowconnectivityandrainbowcriticalityongraphclasses-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1016/j.dam.2021.04.017\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'rocha-almeida-zatesko-rainbowconnectivityandrainbowcriticalityongraphclasses-2021', 'https://doi.org/10.1016/j.dam.2021.04.017', event);\">\n    Rainbow connectivity and rainbow criticality on graph classes.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   A. Rocha;  S. M. Almeida;  and  L. M. Zatesko.\n</span>\n\n  \n\n</span>\n\n   2021.\n  <span class=\"note\">In Press, to appear in Discrete Appl. Math.</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1016/j.dam.2021.04.017\"\n     onclick=\"log_download('rocha-almeida-zatesko-rainbowconnectivityandrainbowcriticalityongraphclasses-2021', 'https://doi.org/10.1016/j.dam.2021.04.017', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Rainbow connectivity and rainbow criticality on graph classes [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/rocha-almeida-zatesko-rainbowconnectivityandrainbowcriticalityongraphclasses-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('rocha-almeida-zatesko-rainbowconnectivityandrainbowcriticalityongraphclasses-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@misc{aleffer21dam,\n  author = {A. Rocha and S. M. Almeida and L. M. Zatesko},\n  title = {Rainbow connectivity and rainbow criticality on graph classes},\n  language = {english},\n  year = 2021,\n  journal = {Discrete Appl. Math.},\n  url = {https://doi.org/10.1016/j.dam.2021.04.017},\n  note = {In Press, to appear in Discrete Appl. Math.}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"castilho-campos-zatesko-sobrerotulaesmathcallhkdecaterpillars-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.5753/etc.2021.16381\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'castilho-campos-zatesko-sobrerotulaesmathcallhkdecaterpillars-2021', 'https://doi.org/10.5753/etc.2021.16381', event);\">\n    Sobre Rotulações $\\mathcal L(h, k)$ de Caterpillars.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   J. P. K. Castilho;  C. N. Campos;  and  L. M. Zatesko.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. 41st Congress of the Brazilian Computer Society (CSBC '21/VI ETC)</i>, pages 62–65, Florianópolis, Brazil,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.5753/etc.2021.16381\"\n     onclick=\"log_download('castilho-campos-zatesko-sobrerotulaesmathcallhkdecaterpillars-2021', 'https://doi.org/10.5753/etc.2021.16381', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Sobre Rotulações $\\mathcal L(h, k)$ de Caterpillars [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/castilho-campos-zatesko-sobrerotulaesmathcallhkdecaterpillars-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('castilho-campos-zatesko-sobrerotulaesmathcallhkdecaterpillars-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{castilho21etc,\n  author = {J. P. K. Castilho and C. N. Campos and L. M. Zatesko},\n  language = {portuguese},\n  year = 2021,\n  title = {Sobre Rotulações $\\mathcal L(h, k)$ de Caterpillars},\n  booktitle = {Proc. 41st Congress of the Brazilian Computer Society (CSBC &#x27;21/VI ETC)},\n  address = {Florian\\&#x27;opolis, Brazil},\n  issn = {2595-6116},\n  url = {https://doi.org/10.5753/etc.2021.16381},\n  pages = {62--65}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hepp-silva-zatesko-umalgoritmoqunticoparaumproblemadedistnciaestatstica-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.5753/etc.2021.16366\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hepp-silva-zatesko-umalgoritmoqunticoparaumproblemadedistnciaestatstica-2021', 'https://doi.org/10.5753/etc.2021.16366', event);\">\n    Um Algoritmo Quântico para um Problema de Distância Estatística.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   H. Hepp;  M. V. G. Silva;  and  L. M. Zatesko.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. 41st Congress of the Brazilian Computer Society (CSBC '21/VI ETC)</i>, pages 1–4, Florianópolis, Brazil,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.5753/etc.2021.16366\"\n     onclick=\"log_download('hepp-silva-zatesko-umalgoritmoqunticoparaumproblemadedistnciaestatstica-2021', 'https://doi.org/10.5753/etc.2021.16366', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Um Algoritmo Quântico para um Problema de Distância Estatística [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hepp-silva-zatesko-umalgoritmoqunticoparaumproblemadedistnciaestatstica-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hepp-silva-zatesko-umalgoritmoqunticoparaumproblemadedistnciaestatstica-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{henrique21etc,\n  author = {H. Hepp and M. V. G. Silva and L. M. Zatesko},\n  language = {portuguese},\n  year = 2021,\n  title = {Um Algoritmo Quântico para um Problema de Distância Estatística},\n  booktitle = {Proc. 41st Congress of the Brazilian Computer Society (CSBC &#x27;21/VI ETC)},\n  address = {Florian\\&#x27;opolis, Brazil},\n  issn = {2595-6116},\n  url = {https://doi.org/10.5753/etc.2021.16366},\n  pages = {1--4}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cunha-zatesko-anextendedadjacencylemmaforgraphedgecoloring-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.wpccg.pro.br/volume004.html\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cunha-zatesko-anextendedadjacencylemmaforgraphedgecoloring-2021', 'http://www.wpccg.pro.br/volume004.html', event);\">\n    An Extended Adjacency Lemma for Graph Edge-Coloring.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   T. H. F. M. Cunha;  and  L. M. Zatesko.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)</i>, pages 43–47, Ponta Grossa, Brazil,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.wpccg.pro.br/volume004.html\"\n     onclick=\"log_download('cunha-zatesko-anextendedadjacencylemmaforgraphedgecoloring-2021', 'http://www.wpccg.pro.br/volume004.html', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"An Extended Adjacency Lemma for Graph Edge-Coloring [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cunha-zatesko-anextendedadjacencylemmaforgraphedgecoloring-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cunha-zatesko-anextendedadjacencylemmaforgraphedgecoloring-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{thiago21wpccg,\n  author = {T. H. F. M. Cunha and L. M. Zatesko},\n  language = {english},\n  year = 2021,\n  title = {An Extended Adjacency Lemma for Graph Edge-Coloring},\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG &#x27;21)},\n  address = {Ponta Grossa, Brazil},\n  issn = {2526-1371},\n  pages = {43--47},\n  url = {http://www.wpccg.pro.br/volume004.html}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"castilho-campos-zatesko-propermathcallhklabellingofcaterpillarsandmultisunlets-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.wpccg.pro.br/volume004.html\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'castilho-campos-zatesko-propermathcallhklabellingofcaterpillarsandmultisunlets-2021', 'http://www.wpccg.pro.br/volume004.html', event);\">\n    Proper $\\mathcal L(h, k)$-labelling of Caterpillars and Multisunlets.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   J. P. K. Castilho;  C. N. Campos;  and  L. M. Zatesko.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)</i>, pages 48–53, Ponta Grossa, Brazil,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.wpccg.pro.br/volume004.html\"\n     onclick=\"log_download('castilho-campos-zatesko-propermathcallhklabellingofcaterpillarsandmultisunlets-2021', 'http://www.wpccg.pro.br/volume004.html', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Proper $\\mathcal L(h, k)$-labelling of Caterpillars and Multisunlets [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/castilho-campos-zatesko-propermathcallhklabellingofcaterpillarsandmultisunlets-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('castilho-campos-zatesko-propermathcallhklabellingofcaterpillarsandmultisunlets-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{castilho21wpccg,\n  author = {J. P. K. Castilho and C. N. Campos and L. M. Zatesko},\n  language = {english},\n  year = 2021,\n  title = {Proper $\\mathcal L(h, k)$-labelling of Caterpillars and Multisunlets},\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG &#x27;21)},\n  address = {Ponta Grossa, Brazil},\n  issn = {2526-1371},\n  pages = {48--53},\n  url = {http://www.wpccg.pro.br/volume004.html}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dias-zatesko-groversquantumalgorithmandthemaximumcliqueproblem-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.wpccg.pro.br/volume004.html\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dias-zatesko-groversquantumalgorithmandthemaximumcliqueproblem-2021', 'http://www.wpccg.pro.br/volume004.html', event);\">\n    Grover's Quantum Algorithm and the Maximum Clique Problem.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   M. G. Dias;  and  L. M. Zatesko.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)</i>, pages 54–59, Ponta Grossa, Brazil,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.wpccg.pro.br/volume004.html\"\n     onclick=\"log_download('dias-zatesko-groversquantumalgorithmandthemaximumcliqueproblem-2021', 'http://www.wpccg.pro.br/volume004.html', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Grover&#x27;s Quantum Algorithm and the Maximum Clique Problem [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dias-zatesko-groversquantumalgorithmandthemaximumcliqueproblem-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dias-zatesko-groversquantumalgorithmandthemaximumcliqueproblem-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{matheus21wpccg,\n  author = {M. G. Dias and L. M. Zatesko},\n  language = {english},\n  year = 2021,\n  title = {Grover&#x27;s Quantum Algorithm and the Maximum Clique Problem},\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG &#x27;21)},\n  address = {Ponta Grossa, Brazil},\n  issn = {2526-1371},\n  pages = {54--59},\n  url = {http://www.wpccg.pro.br/volume004.html}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"belli-guedes-problemasdeotimizaoutilizandooscip-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.wpccg.pro.br/volume004.html\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'belli-guedes-problemasdeotimizaoutilizandooscip-2021', 'http://www.wpccg.pro.br/volume004.html', event);\">\n    Problemas de Otimização Utilizando o SCIP.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Viviane Frida Belli;  and  André L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)</i>, pages 6, Ponta Grossa, Brazil,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.wpccg.pro.br/volume004.html\"\n     onclick=\"log_download('belli-guedes-problemasdeotimizaoutilizandooscip-2021', 'http://www.wpccg.pro.br/volume004.html', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Problemas de Otimização Utilizando o SCIP [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/belli-guedes-problemasdeotimizaoutilizandooscip-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('belli-guedes-problemasdeotimizaoutilizandooscip-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{BelliGuedes21wpccg,\n  author = {Viviane Frida Belli and André L. P. Guedes},\n  year = 2021,\n  title = {Problemas de Otimização Utilizando o SCIP},\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG &#x27;21)},\n  address = {Ponta Grossa, Brazil},\n  issn = {2526-1371},\n  pages = {6},\n  url = {http://www.wpccg.pro.br/volume004.html}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"xavier-guedes-arealidadedasabordagensadaptadasemproblemasdeotimizaoglobalcontnua-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.wpccg.pro.br/volume004.html\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'xavier-guedes-arealidadedasabordagensadaptadasemproblemasdeotimizaoglobalcontnua-2021', 'http://www.wpccg.pro.br/volume004.html', event);\">\n    A realidade das abordagens adaptadas em problemas de Otimização Global Contínua.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Raphael Bezerra Xavier;  and  André Luiz Pires Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)</i>, pages 12, Ponta Grossa, Brazil,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.wpccg.pro.br/volume004.html\"\n     onclick=\"log_download('xavier-guedes-arealidadedasabordagensadaptadasemproblemasdeotimizaoglobalcontnua-2021', 'http://www.wpccg.pro.br/volume004.html', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A realidade das abordagens adaptadas em problemas de Otimização Global Contínua [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/xavier-guedes-arealidadedasabordagensadaptadasemproblemasdeotimizaoglobalcontnua-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('xavier-guedes-arealidadedasabordagensadaptadasemproblemasdeotimizaoglobalcontnua-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{XavierGuedes21wpccg,\n  author = {Raphael Bezerra Xavier and André Luiz Pires Guedes},\n  year = 2021,\n  title = {A realidade das abordagens adaptadas em problemas de Otimização Global Contínua},\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG &#x27;21)},\n  address = {Ponta Grossa, Brazil},\n  issn = {2526-1371},\n  pages = {12},\n  url = {http://www.wpccg.pro.br/volume004.html}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"glir-guedes-reconhecimentodegrafosiiccomparabilidade-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.wpccg.pro.br/volume004.html\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'glir-guedes-reconhecimentodegrafosiiccomparabilidade-2021', 'http://www.wpccg.pro.br/volume004.html', event);\">\n    Reconhecimento de grafos IIC-comparabilidade.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Lucas F. Glir;  and  André L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)</i>, pages 13, Ponta Grossa, Brazil,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.wpccg.pro.br/volume004.html\"\n     onclick=\"log_download('glir-guedes-reconhecimentodegrafosiiccomparabilidade-2021', 'http://www.wpccg.pro.br/volume004.html', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Reconhecimento de grafos IIC-comparabilidade [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/glir-guedes-reconhecimentodegrafosiiccomparabilidade-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('glir-guedes-reconhecimentodegrafosiiccomparabilidade-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{GlirGuedes21wpccg,\n  author = {Lucas F. Glir and André L. P. Guedes},\n  year = 2021,\n  title = {Reconhecimento de grafos IIC-comparabilidade},\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG &#x27;21)},\n  address = {Ponta Grossa, Brazil},\n  issn = {2526-1371},\n  pages = {13},\n  url = {http://www.wpccg.pro.br/volume004.html}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dasilva-guedes-geraodegrafodecenautilizandoteoremadecausaeefeitonaextraoeclassificaodaspropriedades-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.wpccg.pro.br/volume004.html\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dasilva-guedes-geraodegrafodecenautilizandoteoremadecausaeefeitonaextraoeclassificaodaspropriedades-2021', 'http://www.wpccg.pro.br/volume004.html', event);\">\n    Geração de grafo de cena utilizando teorema de causa e efeito na extração e classificação das propriedades.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Flávio Henrique Silva;  and  André L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)</i>, pages 3, Ponta Grossa, Brazil,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.wpccg.pro.br/volume004.html\"\n     onclick=\"log_download('dasilva-guedes-geraodegrafodecenautilizandoteoremadecausaeefeitonaextraoeclassificaodaspropriedades-2021', 'http://www.wpccg.pro.br/volume004.html', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Geração de grafo de cena utilizando teorema de causa e efeito na extração e classificação das propriedades [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dasilva-guedes-geraodegrafodecenautilizandoteoremadecausaeefeitonaextraoeclassificaodaspropriedades-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dasilva-guedes-geraodegrafodecenautilizandoteoremadecausaeefeitonaextraoeclassificaodaspropriedades-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{SilvaGuedes21wpccg,\n  author = {Flávio Henrique da Silva and André L. P. Guedes},\n  year = 2021,\n  title = {Geração de grafo de cena utilizando teorema de causa e efeito na extração e classificação das propriedades},\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG &#x27;21)},\n  address = {Ponta Grossa, Brazil},\n  issn = {2526-1371},\n  pages = {3},\n  url = {http://www.wpccg.pro.br/volume004.html}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"delima-dasilva-vignatti-percolationcentralityviarademachercomplexity-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Percolation centrality via Rademacher Complexity.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Alane M.;  Murilo V.G.;  and  André L. Vignatti.\n</span>\n\n  \n\n</span>\n\n  <i>Discrete Applied Mathematics</i>.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/https://doi.org/10.1016/j.dam.2021.07.023\"\n     onclick=\"log_download('delima-dasilva-vignatti-percolationcentralityviarademachercomplexity-2021', 'http://doi.org/https://doi.org/10.1016/j.dam.2021.07.023', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/delima-dasilva-vignatti-percolationcentralityviarademachercomplexity-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('delima-dasilva-vignatti-percolationcentralityviarademachercomplexity-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Lima2021-A,\ntitle = {Percolation centrality via Rademacher Complexity},\njournal = {Discrete Applied Mathematics},\nyear = {2021},\ndoi = {https://doi.org/10.1016/j.dam.2021.07.023},\nauthor = {Alane M. {de Lima} and Murilo V.G. {da Silva} and André L. Vignatti},\n}\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"erd-vignatti-dasilva-thegeneralizedinfluenceblockingmaximizationproblem-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  The generalized influence blocking maximization problem.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Fernando C Erd;  André L Vignatti;  and  Murilo VG Silva.\n</span>\n\n  \n\n</span>\n\n  <i>Social Network Analysis and Mining</i>, 11(1): 1–17.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/erd-vignatti-dasilva-thegeneralizedinfluenceblockingmaximizationproblem-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('erd-vignatti-dasilva-thegeneralizedinfluenceblockingmaximizationproblem-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Erd2021-a,\n  title={The generalized influence blocking maximization problem},\n  author={Erd, Fernando C and Vignatti, Andr{\\&#x27;e} L and da Silva, Murilo VG},\n  journal={Social Network Analysis and Mining},\n  volume={11},\n  number={1},\n  pages={1--17},\n  year={2021},\n  publisher={Springer}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"lima-vignatti-silva-problemaapspviadimensovcemdiasderademacher-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Problema APSP via Dimensão-VC e Médias de Rademacher.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Alane Lima;  André L. Vignatti;  and  Murilo Silva.\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do VI Encontro de Teoria da Computação</i>, pages 13–16,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/lima-vignatti-silva-problemaapspviadimensovcemdiasderademacher-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('lima-vignatti-silva-problemaapspviadimensovcemdiasderademacher-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Lima2021-B,\n author = {Alane Lima and André L. Vignatti and Murilo Silva},\n title = {Problema APSP via Dimensão-VC e Médias de Rademacher},\n booktitle = {Anais do VI Encontro de Teoria da Computação},\n year = {2021},\n pages = {13--16},\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"lima-vignatti-silva-adeductiveformalderivationforthepreferentialattachmentmetricforlinkprediction-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Deductive-Formal Derivation for the Preferential Attachment Metric for Link Prediction.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Alane Lima;  André L. Vignatti;  and  Murilo Silva.\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do IV Workshop de Pesquisa em Computação dos Campos Gerais</i>, pages 31–36,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/lima-vignatti-silva-adeductiveformalderivationforthepreferentialattachmentmetricforlinkprediction-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('lima-vignatti-silva-adeductiveformalderivationforthepreferentialattachmentmetricforlinkprediction-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Lima2021-C,\n author = {Alane Lima and André L. Vignatti and Murilo Silva},\n title = {A Deductive-Formal Derivation for the Preferential Attachment Metric for Link Prediction},\n booktitle = {Anais do IV Workshop de Pesquisa em Computação dos Campos Gerais},\n year = {2021},\n pages = {31--36},\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gomes-dossantos-dasilva-szwarcfiter-fptandkernelizationalgorithmsfortheinducedtreeproblem-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  FPT and Kernelization Algorithms for the Induced Tree Problem .\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Guilherme Castro Mendes Gomes;  Vinicius F. Santos;  Murilo V. G. Silva;  and  Jayme L. Szwarcfiter.\n</span>\n\n  \n\n</span>\n\n  In  Tiziana Calamoneri;  and  Federico Corò., editor(s), <i>Proceedings of International Conference on Algorithms and Complexity (CIAC 2021)</i>, pages 158–172 ,  2021. Springer International Publishing\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/https://doi.org/10.1007/978-3-030-75242-2_11\"\n     onclick=\"log_download('gomes-dossantos-dasilva-szwarcfiter-fptandkernelizationalgorithmsfortheinducedtreeproblem-2021', 'http://doi.org/https://doi.org/10.1007/978-3-030-75242-2_11', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gomes-dossantos-dasilva-szwarcfiter-fptandkernelizationalgorithmsfortheinducedtreeproblem-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gomes-dossantos-dasilva-szwarcfiter-fptandkernelizationalgorithmsfortheinducedtreeproblem-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Gomes-CIAC2021,\n author = {Gomes, Guilherme Castro Mendes and dos Santos, Vinicius F. and da Silva, Murilo V. G. and Szwarcfiter, Jayme L.  },\n title = {{FPT} and Kernelization Algorithms for the Induced Tree Problem  },\n booktitle = {Proceedings of International Conference on Algorithms and Complexity (CIAC 2021)},\n year = {2021},\n pages = { 158--172  },\n doi = {https://doi.org/10.1007/978-3-030-75242-2_11},\n editor=&quot;Calamoneri, Tiziana and Cor{\\&#x60;o}, Federico&quot;,\n publisher=&quot;Springer International Publishing&quot;,\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dasoledadegonzaga-dealmeida-dasilva-desousacruz-totalcoloringinsomesplitcomparabilitygraphs-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Total Coloring in Some Split-Comparability Graphs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Luis Gustavo Soledade Gonzaga;  Sheila Morais Almeida;  Cândida Nunes;  and  Jadder Bismarck Sousa Cruz.\n</span>\n\n  \n\n</span>\n\n  <i>Matemática Contemporânea</i>, 48: 94–104.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dasoledadegonzaga-dealmeida-dasilva-desousacruz-totalcoloringinsomesplitcomparabilitygraphs-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dasoledadegonzaga-dealmeida-dasilva-desousacruz-totalcoloringinsomesplitcomparabilitygraphs-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{GASC21,\n  title={Total Coloring in Some Split-Comparability Graphs},\n  author={da Soledade Gonzaga, Luis Gustavo and de Almeida, Sheila Morais and {da Silva}, Cândida Nunes and de Sousa Cruz, Jadder Bismarck},\n  journal={Matem{\\&#x27;a}tica Contempor{\\^a}nea},\n  volume={48},\n  publisher = {Sociedade Brasileira de Matemática},\n  pages={94--104},\n  year={2021}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dasoledadegonzaga-dealmeida-silva-desousacruz-thechromaticindexofsplitintervalgraphs-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S1877050921021797\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dasoledadegonzaga-dealmeida-silva-desousacruz-thechromaticindexofsplitintervalgraphs-2021', 'https://www.sciencedirect.com/science/article/pii/S1877050921021797', event);\">\n    The chromatic index of split-interval graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Luis Gustavo;  Sheila Morais;  da Cândida Nunes Silva;  and  Jadder Bismarck.\n</span>\n\n  \n\n</span>\n\n  <i>Procedia Computer Science</i>, 195: 325-333.  2021.\n  <span class=\"note\">Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium.</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S1877050921021797\"\n     onclick=\"log_download('dasoledadegonzaga-dealmeida-silva-desousacruz-thechromaticindexofsplitintervalgraphs-2021', 'https://www.sciencedirect.com/science/article/pii/S1877050921021797', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The chromatic index of split-interval graphs [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/https://doi.org/10.1016/j.procs.2021.11.040\"\n     onclick=\"log_download('dasoledadegonzaga-dealmeida-silva-desousacruz-thechromaticindexofsplitintervalgraphs-2021', 'http://doi.org/https://doi.org/10.1016/j.procs.2021.11.040', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dasoledadegonzaga-dealmeida-silva-desousacruz-thechromaticindexofsplitintervalgraphs-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dasoledadegonzaga-dealmeida-silva-desousacruz-thechromaticindexofsplitintervalgraphs-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{GACS21,\ntitle = {The chromatic index of split-interval graphs},\njournal = {Procedia Computer Science},\nvolume = {195},\npages = {325-333},\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.040},\nurl = {https://www.sciencedirect.com/science/article/pii/S1877050921021797},\nauthor = {Luis Gustavo {da Soledade Gonzaga} and Sheila Morais {de Almeida} and da Cândida Nunes Silva and Jadder Bismarck {de Sousa Cruz}},\nkeywords = {Edge-coloring, split graphs, interval graphs}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cavassin-rocha-carmo-clculoderazesquadradasdegrafosutilizandoumresolvedorpseudobooleano-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.wpccg.pro.br/wpccg2021/papers/paper_40\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cavassin-rocha-carmo-clculoderazesquadradasdegrafosutilizandoumresolvedorpseudobooleano-2021', 'http://www.wpccg.pro.br/wpccg2021/papers/paper_40', event);\">\n    Cálculo de raízes quadradas de grafos utilizando um resolvedor pseudo-booleano.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Pietro Cavassin;  Aleffer Rocha;  and  Renato Carmo.\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do IV Workshop de Pesquisa em Computação dos Campos Gerais</i>, volume 4, pages 25, Ponta Grossa, Paraná,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.wpccg.pro.br/wpccg2021/papers/paper_40\"\n     onclick=\"log_download('cavassin-rocha-carmo-clculoderazesquadradasdegrafosutilizandoumresolvedorpseudobooleano-2021', 'http://www.wpccg.pro.br/wpccg2021/papers/paper_40', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Cálculo de raízes quadradas de grafos utilizando um resolvedor pseudo-booleano [link]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.5281/zenodo.6090322\"\n     onclick=\"log_download('cavassin-rocha-carmo-clculoderazesquadradasdegrafosutilizandoumresolvedorpseudobooleano-2021', 'http://doi.org/10.5281/zenodo.6090322', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cavassin-rocha-carmo-clculoderazesquadradasdegrafosutilizandoumresolvedorpseudobooleano-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cavassin-rocha-carmo-clculoderazesquadradasdegrafosutilizandoumresolvedorpseudobooleano-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{CavassinRochaCarmo21,\n   author       = {Pietro Cavassin and Aleffer Rocha and Renato Carmo},\n   title        = {Cálculo de raízes quadradas de grafos utilizando um\n                     resolvedor pseudo-booleano},\n   booktitle    = {Anais do IV Workshop de Pesquisa em Computação dos\n                     Campos Gerais},\n   issn         = {2526-1371},\n   volume       = {4},\n   year         = {2021},\n   pages        = {25},\n   address      = {Ponta Grossa, Paraná},\n   doi          = {10.5281/zenodo.6090322},\n   url_pdf      = {http://www.wpccg.pro.br/wpccg2021/papers/paper_40}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"groshaus-montero-structuralpropertiesofbicliquegraphsandthedistanceformula-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://ajc.maths.uq.edu.au/pdf/81/ajc_v81_p301.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'groshaus-montero-structuralpropertiesofbicliquegraphsandthedistanceformula-2021', 'https://ajc.maths.uq.edu.au/pdf/81/ajc_v81_p301.pdf', event);\">\n    Structural properties of biclique graphs and the distance formula.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Marina Groshaus;  and  Leandro Montero.\n</span>\n\n  \n\n</span>\n\n  <i>Australasian Journal of Combinatorics</i>, 81(2): 301–318.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://ajc.maths.uq.edu.au/pdf/81/ajc_v81_p301.pdf\"\n     onclick=\"log_download('groshaus-montero-structuralpropertiesofbicliquegraphsandthedistanceformula-2021', 'https://ajc.maths.uq.edu.au/pdf/81/ajc_v81_p301.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Structural properties of biclique graphs and the distance formula [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/groshaus-montero-structuralpropertiesofbicliquegraphsandthedistanceformula-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('groshaus-montero-structuralpropertiesofbicliquegraphsandthedistanceformula-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{GroshausMonteroAJC2021,\n\tauthor = {Groshaus, Marina and Montero, Leandro},\n\ttitle = {Structural properties of biclique graphs and the distance formula},\n\turl= {https://ajc.maths.uq.edu.au/pdf/81/ajc_v81_p301.pdf},\n\tjournal = {Australasian Journal of Combinatorics},\n\tyear = 2021,\n\tvolume = 81,\n\tnumber = 2,\n\tpages = &quot;301--318&quot;,\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</span>\n      <span class=\"bibbase_group_count\">\n        \n        (20)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"delima-dasilva-vignatti-estimatingthepercolationcentralityoflargenetworksthroughpseudodimensiontheory-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Alane M. Lima;  Murilo V. G. Silva;  and  André L. Vignatti.\n</span>\n\n  \n\n</span>\n\n  In <i>26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/delima-dasilva-vignatti-estimatingthepercolationcentralityoflargenetworksthroughpseudodimensiontheory-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('delima-dasilva-vignatti-estimatingthepercolationcentralityoflargenetworksthroughpseudodimensiontheory-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{LimaSilvaVignatti2020-A,\n  author = {Alane M. de Lima and Murilo V. G. da Silva and André L. Vignatti},\n  title = {Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory},\n  year = {2020},\n  booktitle = {26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"demelo-vignatti-miyazawa-ota-tighterdualboundsontheleastcostinfluenceproblem-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Tighter Dual Bounds on the Least Cost Influence Problem.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Renato S. Melo;  André L. Vignatti;  Flávio K. Miyazawa;  and  Matheus J. Ota.\n</span>\n\n  \n\n</span>\n\n  In <i>LII Simpósio Brasileiro de Pesquisa Operacional.</i>,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/demelo-vignatti-miyazawa-ota-tighterdualboundsontheleastcostinfluenceproblem-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('demelo-vignatti-miyazawa-ota-tighterdualboundsontheleastcostinfluenceproblem-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Melo2020-A,\ntitle = &quot; Tighter Dual Bounds on the Least Cost Influence Problem&quot;,\nyear = &quot;2020&quot;,\nbooktitle = &quot;LII Simpósio Brasileiro de Pesquisa Operacional.&quot;,\nauthor = &quot;Renato S. de Melo and André L. Vignatti and Flávio K. Miyazawa and Matheus J. Ota&quot;\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"demelo-vignatti-preprocessingrulesfortargetsetselectionincomplexnetworks-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Preprocessing Rules for Target Set Selection in Complex Networks.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Renato S. Melo;  and  André L. Vignatti.\n</span>\n\n  \n\n</span>\n\n  In <i>IX Brazilian Workshop on Social Network Analysis and Mining.</i>,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/demelo-vignatti-preprocessingrulesfortargetsetselectionincomplexnetworks-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('demelo-vignatti-preprocessingrulesfortargetsetselectionincomplexnetworks-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Melo2020-B,\ntitle = &quot;Preprocessing Rules for Target Set Selection in Complex Networks&quot;,\nyear = &quot;2020&quot;,\nbooktitle = &quot;IX Brazilian Workshop on Social Network Analysis and Mining.&quot;,\nauthor = &quot;Renato S. de Melo and André L. Vignatti&quot;\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"erd-dasilva-vignatti-blockingthespreadofmisinformationinanetworkunderdistinctcostmodels-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Blocking the Spread of Misinformation in a Network under Distinct Cost Models.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Fernando C. Erd;  Murilo V. G. Silva;  and  André L. Vignatti.\n</span>\n\n  \n\n</span>\n\n  In <i>XII International Conference on Advances in Social Network Analysis and Mining.</i>,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/erd-dasilva-vignatti-blockingthespreadofmisinformationinanetworkunderdistinctcostmodels-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('erd-dasilva-vignatti-blockingthespreadofmisinformationinanetworkunderdistinctcostmodels-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Erd2020,\ntitle = &quot;Blocking the Spread of Misinformation in a Network under Distinct Cost Models&quot;,\nyear = &quot;2020&quot;,\nbooktitle = &quot;XII International Conference on Advances in Social Network Analysis and Mining.&quot;,\nauthor = &quot;Fernando C. Erd and Murilo V. G. da Silva and André L. Vignatti&quot;\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"carmo-correa-zge-lexicographicbreadthfirstsearchandbranchandboundalgorithmsforthemaximumcliqueproblem-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Lexicographic Breadth First-Search and Branch and Bound Algorithms for the Maximum Clique Problem.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Renato Carmo;  Matheus Vinicius Correa;  and  Alexandre Prusch Züge.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. IX Latin American Workshop on Cliques in Graphs</i>, Rio de Janeiro,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/carmo-correa-zge-lexicographicbreadthfirstsearchandbranchandboundalgorithmsforthemaximumcliqueproblem-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('carmo-correa-zge-lexicographicbreadthfirstsearchandbranchandboundalgorithmsforthemaximumcliqueproblem-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{CarmoCorreaZuge20,\n   author       = {Renato Carmo and Matheus Vinicius Correa and\n                     Alexandre Prusch Züge},\n   title        = {Lexicographic Breadth First-Search and Branch and\n                     Bound Algorithms for the Maximum Clique Problem},\n   language     = {english},\n   year         = {2020},\n   booktitle    = {Proc. IX Latin American Workshop on Cliques in\n                     Graphs},\n   address      = {Rio de Janeiro}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cruz-groshaus-guedes-puppo-bicliquegraphsofintervalbigraphs-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S0166218X20300755\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cruz-groshaus-guedes-puppo-bicliquegraphsofintervalbigraphs-2020', 'http://www.sciencedirect.com/science/article/pii/S0166218X20300755', event);\">\n    Biclique Graphs of Interval Bigraphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   E. P. Cruz;  M. Groshaus;  A. L. P. Guedes;  and  J. P. Puppo.\n</span>\n\n  \n\n</span>\n\n  <i>Discrete Applied Mathematics</i>, 281: 134 - 143.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S0166218X20300755\"\n     onclick=\"log_download('cruz-groshaus-guedes-puppo-bicliquegraphsofintervalbigraphs-2020', 'http://www.sciencedirect.com/science/article/pii/S0166218X20300755', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Biclique Graphs of Interval Bigraphs [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.dam.2020.02.010\"\n     onclick=\"log_download('cruz-groshaus-guedes-puppo-bicliquegraphsofintervalbigraphs-2020', 'http://doi.org/10.1016/j.dam.2020.02.010', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cruz-groshaus-guedes-puppo-bicliquegraphsofintervalbigraphs-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cruz-groshaus-guedes-puppo-bicliquegraphsofintervalbigraphs-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{CruzGroshausGuedesPuppo2020,\ntitle = &quot;Biclique Graphs of Interval Bigraphs&quot;,\njournal = &quot;Discrete Applied Mathematics&quot;,\nvolume = &quot;281&quot;,\npages = &quot;134 - 143&quot;,\nyear = &quot;2020&quot;,\nissn = &quot;0166-218X&quot;,\nurl = &quot;http://www.sciencedirect.com/science/article/pii/S0166218X20300755&quot;,\nauthor = &quot;E. P. Cruz and M. Groshaus and A. L. P. Guedes and J. P. Puppo&quot;,\n_keywords =    {Universal2016},\n_note = &quot;SI: LAGOS’17&quot;,\ndoi = {10.1016/j.dam.2020.02.010},\nkeywords = &quot;Bicliques, Biclique graphs, Interval bigraphs, Bipartite permutation graphs, Co-comparability graphs&quot;,\nabstract = &quot;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.&quot;\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\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</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"decmgomes-groshaus-lima-dossantos-intersectiongraphofmaximalstars-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0166218X20303504\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'decmgomes-groshaus-lima-dossantos-intersectiongraphofmaximalstars-2020', 'https://www.sciencedirect.com/science/article/pii/S0166218X20303504', event);\">\n    Intersection graph of maximal stars.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Guilherme C. M. Gomes;  Marina Groshaus;  Carlos V. G. C. Lima;  and  Vinicius F..\n</span>\n\n  \n\n</span>\n\n  <i>Discrete Applied Mathematics</i>, 285: 567-580.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0166218X20303504\"\n     onclick=\"log_download('decmgomes-groshaus-lima-dossantos-intersectiongraphofmaximalstars-2020', 'https://www.sciencedirect.com/science/article/pii/S0166218X20303504', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Intersection graph of maximal stars [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/https://doi.org/10.1016/j.dam.2020.07.004\"\n     onclick=\"log_download('decmgomes-groshaus-lima-dossantos-intersectiongraphofmaximalstars-2020', 'http://doi.org/https://doi.org/10.1016/j.dam.2020.07.004', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/decmgomes-groshaus-lima-dossantos-intersectiongraphofmaximalstars-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('decmgomes-groshaus-lima-dossantos-intersectiongraphofmaximalstars-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{GomesGroshausLimaSantos2020,\ntitle = {Intersection graph of maximal stars},\njournal = {Discrete Applied Mathematics},\nvolume = {285},\npages = {567-580},\nyear = {2020},\nissn = {0166-218X},\ndoi = {https://doi.org/10.1016/j.dam.2020.07.004},\nurl = {https://www.sciencedirect.com/science/article/pii/S0166218X20303504},\nauthor = {Guilherme de C. M. Gomes and Marina Groshaus and Carlos V. G. C. Lima and Vinicius F. {dos Santos}},\nkeywords = {Intersection graphs, Stars, Star graphs, Cliques, Edge clique covers},\nabstract = {A biclique of a graph G is an induced complete bipartite subgraph of G such that neither part is empty. A star is a biclique of G such that one part has exactly one vertex. The star graph of G is the intersection graph of the maximal stars of G. A graph H is star-critical if its star graph is different from the star graph of any of its proper induced subgraphs. We begin by showing that a star-critical pre-image of an n-vertex star graph has at most On2vertices. We then describe a Krausz-type characterization for star graphs. We combine these results to show that the problem of recognizing star graphs is in NP. We also present some properties of the class. In particular, we show that they are biconnected, that every edge belongs to at least one triangle, characterize the structures the pre-image must have in order to generate degree two vertices in its star graph, and bound the diameter of the star graph with respect to the diameter of its pre-image. Finally, we prove a monotonicity theorem, which we apply in order to list every star graph on at most eight vertices.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A biclique of a graph G is an induced complete bipartite subgraph of G such that neither part is empty. A star is a biclique of G such that one part has exactly one vertex. The star graph of G is the intersection graph of the maximal stars of G. A graph H is star-critical if its star graph is different from the star graph of any of its proper induced subgraphs. We begin by showing that a star-critical pre-image of an n-vertex star graph has at most On2vertices. We then describe a Krausz-type characterization for star graphs. We combine these results to show that the problem of recognizing star graphs is in NP. We also present some properties of the class. In particular, we show that they are biconnected, that every edge belongs to at least one triangle, characterize the structures the pre-image must have in order to generate degree two vertices in its star graph, and bound the diameter of the star graph with respect to the diameter of its pre-image. Finally, we prove a monotonicity theorem, which we apply in order to list every star graph on at most eight vertices.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"zatesko-zorzi-carmo-guedes-edgecolouringgraphswithboundedlocaldegreesums-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S0166218X20301438\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zatesko-zorzi-carmo-guedes-edgecolouringgraphswithboundedlocaldegreesums-2020', 'http://www.sciencedirect.com/science/article/pii/S0166218X20301438', event);\">\n    Edge-colouring graphs with bounded local degree sums.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   L. M. Zatesko;  A. Zorzi;  R. Carmo;  and  A. L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  <i>Discrete Applied Mathematics</i>, 281: 268 - 283.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S0166218X20301438\"\n     onclick=\"log_download('zatesko-zorzi-carmo-guedes-edgecolouringgraphswithboundedlocaldegreesums-2020', 'http://www.sciencedirect.com/science/article/pii/S0166218X20301438', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Edge-colouring graphs with bounded local degree sums [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.dam.2020.03.044\"\n     onclick=\"log_download('zatesko-zorzi-carmo-guedes-edgecolouringgraphswithboundedlocaldegreesums-2020', 'http://doi.org/10.1016/j.dam.2020.03.044', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zatesko-zorzi-carmo-guedes-edgecolouringgraphswithboundedlocaldegreesums-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>8 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zatesko-zorzi-carmo-guedes-edgecolouringgraphswithboundedlocaldegreesums-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Zatesko2020,\ntitle = &quot;Edge-colouring graphs with bounded local degree sums&quot;,\njournal = &quot;Discrete Applied Mathematics&quot;,\nvolume = &quot;281&quot;,\npages = &quot;268 - 283&quot;,\nyear = &quot;2020&quot;,\n_keywords =    {Universal2016},\n_note = &quot;SI: LAGOS’17&quot;,\nissn = &quot;0166-218X&quot;,\ndoi = &quot;10.1016/j.dam.2020.03.044&quot;,\nurl = &quot;http://www.sciencedirect.com/science/article/pii/S0166218X20301438&quot;,\nauthor = &quot;L. M. Zatesko and A. Zorzi and R. Carmo and A. L. P. Guedes&quot;,\nkeywords = &quot;Colouring of graphs and hypergraphs, Vertex degrees, Graph algorithms, Graph theory&quot;,\nabstract = &quot;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)&lt;χ′(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.&quot;\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\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</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"maske-cohen-duartejr-speedingupthegomoryhuparallelcuttreealgorithmwithefficientgraphcontractions-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Charles Maske;  Jaime Cohen;  and  Elias Duarte Jr.\n</span>\n\n  \n\n</span>\n\n  <i>Algorithmica</i>, (82): 1601–1615.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/s00453-019-00658-6\"\n     onclick=\"log_download('maske-cohen-duartejr-speedingupthegomoryhuparallelcuttreealgorithmwithefficientgraphcontractions-2020', 'http://doi.org/10.1007/s00453-019-00658-6', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/maske-cohen-duartejr-speedingupthegomoryhuparallelcuttreealgorithmwithefficientgraphcontractions-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('maske-cohen-duartejr-speedingupthegomoryhuparallelcuttreealgorithmwithefficientgraphcontractions-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{MaskeCohenDuarte2020,\nauthor = {Maske, Charles and Cohen, Jaime and Duarte Jr, Elias},\nyear = {2020},\ntitle = {Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions},\nnumber = {82},\npages = {1601--1615},\njournal = {Algorithmica},\ndoi = {10.1007/s00453-019-00658-6}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"delima-samplecomplexityingraphproblems-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Sample Complexity in Graph Problems.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Alane M. Lima.\n</span>\n\n  \n\n</span>\n\n  Seminário apresentado na XV Escuela de Verano en Matemáticas Discretas,  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/delima-samplecomplexityingraphproblems-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('delima-samplecomplexityingraphproblems-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Misc{Lima2020-Chile,\n   optkey       = {},\n   author       = {Alane M. de Lima},\n   title        = {Sample Complexity in Graph Problems},\n   howpublished = {Seminário apresentado na XV Escuela de Verano en\n                     Matemáticas Discretas},\n   type         = {Talk},\n   year         = {2020},\n   note         = {},\n   annote       = {}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"groshaus-guedes-kolberg-onthehellysubclassesofintervalbigraphsandcirculararcbigraphs-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the Helly Subclasses of Interval Bigraphs and Circular Arc Bigraphs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   M. Groshaus;  A. L. P. Guedes;  and  F. S. Kolberg.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 14th Latin American Theoretical Informatics Symposium</i>, São Paulo,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/groshaus-guedes-kolberg-onthehellysubclassesofintervalbigraphsandcirculararcbigraphs-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('groshaus-guedes-kolberg-onthehellysubclassesofintervalbigraphsandcirculararcbigraphs-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@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 Circular Arc Bigraphs},\n booktitle = {Proceedings of the 14th Latin American Theoretical Informatics Symposium},\n year = {2020},\n address = {São Paulo},\n  _keywords =    {Universal2016},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"rocha-almeida-zatesko-aneartightboundfortherainbowconnectionnumberofsnakegraphs-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'rocha-almeida-zatesko-aneartightboundfortherainbowconnectionnumberofsnakegraphs-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event);\">\n    A Near-tight Bound for the Rainbow Connection Number of Snake Graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   A. Rocha;  S. M. Almeida;  and  L. M. Zatesko.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)</i>, pages 12,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"log_download('rocha-almeida-zatesko-aneartightboundfortherainbowconnectionnumberofsnakegraphs-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Near-tight Bound for the Rainbow Connection Number of Snake Graphs [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/rocha-almeida-zatesko-aneartightboundfortherainbowconnectionnumberofsnakegraphs-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('rocha-almeida-zatesko-aneartightboundfortherainbowconnectionnumberofsnakegraphs-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{lawcg20-raz,\n  author = {A. Rocha and S. M. Almeida and L. M. Zatesko},\n  title = {A Near-tight Bound for the Rainbow Connection Number of Snake Graphs},\n  language = {english},\n  year = 2020,\n  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG &#x27;20)},\n  pages = 12,\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"castilho-campos-zatesko-rotulaomathcallhkdossunlets-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'castilho-campos-zatesko-rotulaomathcallhkdossunlets-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event);\">\n    Rotulação $\\mathcal L(h, k)$ dos Sunlets.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   J. P. K. Castilho;  C. N. Campos;  and  L. M. Zatesko.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)</i>, pages 19,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"log_download('castilho-campos-zatesko-rotulaomathcallhkdossunlets-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Rotulação $\\mathcal L(h, k)$ dos Sunlets [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/castilho-campos-zatesko-rotulaomathcallhkdossunlets-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('castilho-campos-zatesko-rotulaomathcallhkdossunlets-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{lawcg20-ccz,\n  author = {J. P. K. Castilho and C. N. Campos and L. M. Zatesko},\n  title = {Rotulação $\\mathcal L(h, k)$ dos Sunlets},\n  year = 2020,\n  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG &#x27;20)},\n  pages = 19,\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"rocha-almeida-zatesko-therainbowconnectionnumberoftriangularsnakegraphs-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://sol.sbc.org.br/index.php/etc/article/view/11091\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'rocha-almeida-zatesko-therainbowconnectionnumberoftriangularsnakegraphs-2020', 'https://sol.sbc.org.br/index.php/etc/article/view/11091', event);\">\n    The Rainbow Connection Number of Triangular Snake Graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   A. Rocha;  S. M. Almeida;  and  L. M. Zatesko.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. 40th Congress of the Brazilian Computer Society (CSBC '20/V ETC)</i>, pages 65–68, Porto Alegre, Brazil,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://sol.sbc.org.br/index.php/etc/article/view/11091\"\n     onclick=\"log_download('rocha-almeida-zatesko-therainbowconnectionnumberoftriangularsnakegraphs-2020', 'https://sol.sbc.org.br/index.php/etc/article/view/11091', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The Rainbow Connection Number of Triangular Snake Graphs [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/rocha-almeida-zatesko-therainbowconnectionnumberoftriangularsnakegraphs-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('rocha-almeida-zatesko-therainbowconnectionnumberoftriangularsnakegraphs-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{etc20aleffer,\n  author = {A. Rocha and S. M. Almeida and L. M. Zatesko},\n  title = {The Rainbow Connection Number of Triangular Snake Graphs},\n  year = 2020,\n  booktitle = {Proc. 40th Congress of the Brazilian Computer Society (CSBC &#x27;20/V ETC)},\n  address = {Porto Alegre, Brazil},\n  issn = {2595-6116},\n  pages = {65--68},\n  url = {https://sol.sbc.org.br/index.php/etc/article/view/11091}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cruz-groshaus-guedes-mutuallyincludedbicliquegraphsofintervalcontainmentbigraphsandintervalbigraphs-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cruz-groshaus-guedes-mutuallyincludedbicliquegraphsofintervalcontainmentbigraphsandintervalbigraphs-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event);\">\n    Mutually Included Biclique Graphs of Interval Containment Bigraphs and Interval Bigraphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   E. P. Cruz;  M. Groshaus;  and  A. L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)</i>, pages 26, Rio de Janeiro - online,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"log_download('cruz-groshaus-guedes-mutuallyincludedbicliquegraphsofintervalcontainmentbigraphsandintervalbigraphs-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Mutually Included Biclique Graphs of Interval Containment Bigraphs and Interval Bigraphs [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cruz-groshaus-guedes-mutuallyincludedbicliquegraphsofintervalcontainmentbigraphsandintervalbigraphs-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cruz-groshaus-guedes-mutuallyincludedbicliquegraphsofintervalcontainmentbigraphsandintervalbigraphs-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@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 &#x27;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</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"groshaus-guedes-recognitionofbicliquegraphswhatweknowsofar-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'groshaus-guedes-recognitionofbicliquegraphswhatweknowsofar-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event);\">\n    Recognition of Biclique Graphs: What we know so far.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   M. Groshaus;  and  A. L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)</i>, pages 27, Rio de Janeiro - online,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"log_download('groshaus-guedes-recognitionofbicliquegraphswhatweknowsofar-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Recognition of Biclique Graphs: What we know so far [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/groshaus-guedes-recognitionofbicliquegraphswhatweknowsofar-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('groshaus-guedes-recognitionofbicliquegraphswhatweknowsofar-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@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 &#x27;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}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"groshaus-guedes-kolberg-subclasshierarchyoncirculararcbigraphs-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'groshaus-guedes-kolberg-subclasshierarchyoncirculararcbigraphs-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event);\">\n    Subclass Hierarchy on Circular Arc Bigraphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   M. Groshaus;  A. L. P. Guedes;  and  F. S. Kolberg.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)</i>, pages 28,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"log_download('groshaus-guedes-kolberg-subclasshierarchyoncirculararcbigraphs-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Subclass Hierarchy on Circular Arc Bigraphs [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/groshaus-guedes-kolberg-subclasshierarchyoncirculararcbigraphs-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('groshaus-guedes-kolberg-subclasshierarchyoncirculararcbigraphs-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@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 &#x27;20)},\n  pages = 28,\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}\n}\n\n% 2021\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"almeida-sasaki-reducedindifferencegraphsaretype1-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'almeida-sasaki-reducedindifferencegraphsaretype1-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event);\">\n    Reduced indifference graphs are type 1.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Sheila Morais de Almeida;  and  Diana Sasaki.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)</i>, pages 13, Rio de Janeiro - online,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"log_download('almeida-sasaki-reducedindifferencegraphsaretype1-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Reduced indifference graphs are type 1 [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/almeida-sasaki-reducedindifferencegraphsaretype1-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('almeida-sasaki-reducedindifferencegraphsaretype1-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{SaAl20,\n  author = {Almeida, Sheila Morais de and Sasaki, Diana},\n  title = {Reduced indifference graphs are type 1},\n  language = {english},\n  year = 2020,\n  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG &#x27;20)},\n  address = {Rio de Janeiro - online},\n  pages = 13,\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dasoledadegonzaga-dealmeida-silva-desousacruz-totalcoloringinsomesplitcomparabilitygraphs-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dasoledadegonzaga-dealmeida-silva-desousacruz-totalcoloringinsomesplitcomparabilitygraphs-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event);\">\n    Total Coloring in Some Split-Comparability Graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Luis Gustavo;  Sheila Morais Almeida;  da Cândida Nunes Silva;  and  Jadder Bismarck.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)</i>, pages 15, Rio de Janeiro - online,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"log_download('dasoledadegonzaga-dealmeida-silva-desousacruz-totalcoloringinsomesplitcomparabilitygraphs-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Total Coloring in Some Split-Comparability Graphs [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dasoledadegonzaga-dealmeida-silva-desousacruz-totalcoloringinsomesplitcomparabilitygraphs-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dasoledadegonzaga-dealmeida-silva-desousacruz-totalcoloringinsomesplitcomparabilitygraphs-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{GASC20,\n  author = {Luis Gustavo {da Soledade Gonzaga} and Sheila Morais de Almeida and da Cândida Nunes Silva and Jadder Bismarck {de Sousa Cruz}},\n  title = {Total Coloring in Some Split-Comparability Graphs},\n  language = {english},\n  year = 2020,\n  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG &#x27;20)},\n  address = {Rio de Janeiro - online},\n  pages = 15,\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"correa-almeida-strongpseudoachromaticnumberofsplitgraphs-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'correa-almeida-strongpseudoachromaticnumberofsplitgraphs-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event);\">\n    Strong pseudoachromatic number of split graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Aleff Renan Pereira Correa;  and  Sheila Morais de Almeida.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)</i>, pages 11, Rio de Janeiro - online,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf\"\n     onclick=\"log_download('correa-almeida-strongpseudoachromaticnumberofsplitgraphs-2020', 'https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Strong pseudoachromatic number of split graphs [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/correa-almeida-strongpseudoachromaticnumberofsplitgraphs-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('correa-almeida-strongpseudoachromaticnumberofsplitgraphs-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{CoAl20,\n  author = {Correa, Aleff Renan Pereira and Almeida, Sheila Morais de},\n  title = {Strong pseudoachromatic number of split graphs},\n  language = {english},\n  year = 2020,\n  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG &#x27;20)},\n  address = {Rio de Janeiro - online},\n  pages = 11,\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2019\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2019')\"\n      onkeypress=\"toggleGroup('group_2019')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2019</span>\n      <span class=\"bibbase_group_count\">\n        \n        (23)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"alves-goncalves-zuge-beletijr-santiagojr-astecnologiasdigitaiseoensinodecinciasedecomputaonasociedadecontempornea-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  As tecnologias digitais e o ensino de ciências e de computação na sociedade contemporânea.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   G. J. Alves;  D. C. M. Goncalves;  Alexandre P. Zuge;  C. R. Beleti Jr.;  and  R. M. Santiago Jr..\n</span>\n\n  \n\n</span>\n\n  Volume 1 . As tecnologias digitais e o ensino de ciências e de computação na sociedade contemporânea, pages 162-172. Booknando Livros, Palotina, PR,  2019.\n  <span class=\"note\">Organizado por Eliana Santana Lisbôa e Valdir Rosa</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/alves-goncalves-zuge-beletijr-santiagojr-astecnologiasdigitaiseoensinodecinciasedecomputaonasociedadecontempornea-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('alves-goncalves-zuge-beletijr-santiagojr-astecnologiasdigitaiseoensinodecinciasedecomputaonasociedadecontempornea-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InBook{AlvesGoncalvesZugeBeletiSantiago2019,\n   author       = {Alves, G. J. and Goncalves, D. C. M. and Zuge,\n                     Alexandre P. and Beleti Jr., C. R. and Santiago\n                     Jr., R. M.},\n   title        = {As tecnologias digitais e o ensino de ciências e de\n                     computação na sociedade contemporânea},\n   chapter      = {Projeto &quot;Por dentro do computador&quot;: uma iniciativa\n                     de divulgação e popularização da arquitetura de\n                     computadores},\n   publisher    = {Booknando Livros},\n   year         = {2019},\n   optkey       = {},\n   volume       = {1},\n   number       = {},\n   series       = {},\n   type         = {Book Chapter},\n   address      = {Palotina, PR},\n   edition      = {},\n   month        = {},\n   pages        = {162-172},\n   note         = {Organizado por Eliana Santana Lisbôa e Valdir Rosa},\n   annote       = {}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"santos-guedes-algoritmosdeplanejamentodecaminhos3d-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Algoritmos de planejamento de caminhos 3D.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Cleiton Santos;  and  A. L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. Computer on the beach</i>, Florianópolis,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/santos-guedes-algoritmosdeplanejamentodecaminhos3d-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('santos-guedes-algoritmosdeplanejamentodecaminhos3d-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@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}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"brito-loureiro-todt-guedes-optimizationsystemfordynamicflightplanningforgroupsofdronesusingcooperationwithmobilerechargebasesbymeansofmultiagentsystemandrecursiveauctions-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\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</span>\n\n  <span class=\"bibbase_paper_author\">\n   Robison C. Brito;  José F. Loureiro;  Eduardo Todt;  and  Andre L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)</i>, Milwaukee, Wisconsin, USA,  2019. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brito-loureiro-todt-guedes-optimizationsystemfordynamicflightplanningforgroupsofdronesusingcooperationwithmobilerechargebasesbymeansofmultiagentsystemandrecursiveauctions-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brito-loureiro-todt-guedes-optimizationsystemfordynamicflightplanningforgroupsofdronesusingcooperationwithmobilerechargebasesbymeansofmultiagentsystemandrecursiveauctions-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Brito2019,\n  title     = {Optimization System for Dynamic Flight Planning for Groups\n               of Drones using Cooperation with Mobile Recharge Bases by\n               Means of Multiagent System and Recursive Auctions},\n  author    = {Robison C. Brito and José F. Loureiro and Eduardo Todt and Andre L. P. Guedes},\n  booktitle = {2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)},\n  publisher = {IEEE},\n  year      = {2019},\n  address   = {Milwaukee, Wisconsin, USA},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sdroievski-dasilva-vignatti-thehiddensubgroupproblemandmktp-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1016/j.tcs.2019.06.012\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'sdroievski-dasilva-vignatti-thehiddensubgroupproblemandmktp-2019', 'https://doi.org/10.1016/j.tcs.2019.06.012', event);\">\n    The Hidden Subgroup Problem and MKTP.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Nicollas M. Sdroievski;  Murilo V. G. Silva;  and  André L. Vignatti.\n</span>\n\n  \n\n</span>\n\n  <i>Theoretical Computer Science</i>, 795: 204–212.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1016/j.tcs.2019.06.012\"\n     onclick=\"log_download('sdroievski-dasilva-vignatti-thehiddensubgroupproblemandmktp-2019', 'https://doi.org/10.1016/j.tcs.2019.06.012', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The Hidden Subgroup Problem and MKTP [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.tcs.2019.06.012\"\n     onclick=\"log_download('sdroievski-dasilva-vignatti-thehiddensubgroupproblemandmktp-2019', 'http://doi.org/10.1016/j.tcs.2019.06.012', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sdroievski-dasilva-vignatti-thehiddensubgroupproblemandmktp-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sdroievski-dasilva-vignatti-thehiddensubgroupproblemandmktp-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Sdroievski2019a,\n  title = &quot;The Hidden Subgroup Problem and {MKTP}&quot;,\n  journal = &quot;Theoretical Computer Science&quot;,\n  volume    = {795},\n  pages     = {204--212},\n  year = &quot;2019&quot;,\n  author = &quot;Nicollas M. Sdroievski and Murilo V. G. da Silva and André L. Vignatti&quot;,\n  url       = {https://doi.org/10.1016/j.tcs.2019.06.012},\n  doi       = {10.1016/j.tcs.2019.06.012},\n  biburl    = {https://dblp.org/rec/journals/tcs/SdroievskiSV19.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"groshaus-guedes-kolberg-subclassesofcirculararcbigraphshellynormalandproper-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S1571066119300957\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'groshaus-guedes-kolberg-subclassesofcirculararcbigraphshellynormalandproper-2019', 'http://www.sciencedirect.com/science/article/pii/S1571066119300957', event);\">\n    Subclasses of Circular-Arc Bigraphs: Helly, Normal and Proper.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Marina Groshaus;  André L. P. Guedes;  and  Fabricio Schiavon Kolberg.\n</span>\n\n  \n\n</span>\n\n  <i>Electronic Notes in Theoretical Computer Science</i>, 346: 497 - 509.  2019.\n  <span class=\"note\">The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019).</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S1571066119300957\"\n     onclick=\"log_download('groshaus-guedes-kolberg-subclassesofcirculararcbigraphshellynormalandproper-2019', 'http://www.sciencedirect.com/science/article/pii/S1571066119300957', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Subclasses of Circular-Arc Bigraphs: Helly, Normal and Proper [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/https://doi.org/10.1016/j.entcs.2019.08.044\"\n     onclick=\"log_download('groshaus-guedes-kolberg-subclassesofcirculararcbigraphshellynormalandproper-2019', 'http://doi.org/https://doi.org/10.1016/j.entcs.2019.08.044', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/groshaus-guedes-kolberg-subclassesofcirculararcbigraphshellynormalandproper-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('groshaus-guedes-kolberg-subclassesofcirculararcbigraphshellynormalandproper-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Kolberg2019,\ntitle = &quot;Subclasses of Circular-Arc Bigraphs: Helly, Normal and Proper&quot;,\njournal = &quot;Electronic Notes in Theoretical Computer Science&quot;,\nvolume = &quot;346&quot;,\npages = &quot;497 - 509&quot;,\nyear = &quot;2019&quot;,\nnote = &quot;The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019).&quot;,\n  _keywords =    {Universal2016},\norganization={UFMG},\nissn = &quot;1571-0661&quot;,\ndoi = &quot;https://doi.org/10.1016/j.entcs.2019.08.044&quot;,\nurl = &quot;http://www.sciencedirect.com/science/article/pii/S1571066119300957&quot;,\nauthor = &quot;Marina Groshaus and André L. P. Guedes and Fabricio Schiavon Kolberg&quot;,\nkeywords = &quot;Biclique, Circular-arc, recognition, Helly, Normal, Proper&quot;,\nabstract = &quot;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.&quot;\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\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</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bernardi-dasilva-guedes-zatesko-thechromaticindexofpropercirculararcgraphsofoddmaximumdegreewhicharechordal-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S1571066119300623\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bernardi-dasilva-guedes-zatesko-thechromaticindexofpropercirculararcgraphsofoddmaximumdegreewhicharechordal-2019', 'http://www.sciencedirect.com/science/article/pii/S1571066119300623', event);\">\n    The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   João Pedro W. Bernardi;  Murilo V. G. Silva;  André Luiz P. Guedes;  and  Leandro M. Zatesko.\n</span>\n\n  \n\n</span>\n\n  <i>Electronic Notes in Theoretical Computer Science</i>, 346: 125 - 133.  2019.\n  <span class=\"note\">The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019).</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S1571066119300623\"\n     onclick=\"log_download('bernardi-dasilva-guedes-zatesko-thechromaticindexofpropercirculararcgraphsofoddmaximumdegreewhicharechordal-2019', 'http://www.sciencedirect.com/science/article/pii/S1571066119300623', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/https://doi.org/10.1016/j.entcs.2019.08.012\"\n     onclick=\"log_download('bernardi-dasilva-guedes-zatesko-thechromaticindexofpropercirculararcgraphsofoddmaximumdegreewhicharechordal-2019', 'http://doi.org/https://doi.org/10.1016/j.entcs.2019.08.012', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bernardi-dasilva-guedes-zatesko-thechromaticindexofpropercirculararcgraphsofoddmaximumdegreewhicharechordal-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bernardi-dasilva-guedes-zatesko-thechromaticindexofpropercirculararcgraphsofoddmaximumdegreewhicharechordal-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Bernardi2019,\ntitle = &quot;The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal&quot;,\njournal = &quot;Electronic Notes in Theoretical Computer Science&quot;,\nvolume = &quot;346&quot;,\npages = &quot;125 - 133&quot;,\nyear = &quot;2019&quot;,\nnote = &quot;The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019).&quot;,\n  _keywords =    {Universal2016},\norganization={UFMG},\nissn = &quot;1571-0661&quot;,\ndoi = &quot;https://doi.org/10.1016/j.entcs.2019.08.012&quot;,\nurl = &quot;http://www.sciencedirect.com/science/article/pii/S1571066119300623&quot;,\nauthor = &quot;João Pedro W. Bernardi and Murilo V. G. da Silva and André Luiz P. Guedes and Leandro M. Zatesko&quot;,\nkeywords = &quot;Pullback, circular-arc, chromatic index, edge-coloring, chordal&quot;,\nabstract = &quot;The complexity of the edge-coloring problem when restricted to chordal graphs, listed in the famous D. Johnson&#x27;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.&quot;\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\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</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"zatesko-carmo-guedes-zorzi-machado-figueiredo-onthechromaticindexofcomplementaryprisms-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1208\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zatesko-carmo-guedes-zorzi-machado-figueiredo-onthechromaticindexofcomplementaryprisms-2019', 'http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1208', event);\">\n    On the chromatic index of complementary prisms.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Leandro Zatesko;  Renato Carmo;  André Guedes;  Alesom Zorzi;  Raphael Machado;  and  Celina Figueiredo.\n</span>\n\n  \n\n</span>\n\n  <i>Acta Mathematica Universitatis Comenianae</i>, 88(3): 1071–1077.  2019.\n  <span class=\"note\">EUROCOMB'2019.</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1208\"\n     onclick=\"log_download('zatesko-carmo-guedes-zorzi-machado-figueiredo-onthechromaticindexofcomplementaryprisms-2019', 'http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1208', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"On the chromatic index of complementary prisms [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zatesko-carmo-guedes-zorzi-machado-figueiredo-onthechromaticindexofcomplementaryprisms-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zatesko-carmo-guedes-zorzi-machado-figueiredo-onthechromaticindexofcomplementaryprisms-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ZCGZMF2019,\n\tauthor = {Leandro Zatesko and Renato Carmo and André Guedes and Alesom Zorzi and Raphael Machado and Celina Figueiredo},\n\ttitle = { On the chromatic index of complementary prisms},\n\tjournal = {Acta Mathematica Universitatis Comenianae},\n\tvolume = {88},\n\tnumber = {3},\n\tyear = {2019},\n\t_keywords = {Universal2016},\n\tabstract = {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\tissn = {0862-9544},\tpages = {1071--1077},\turl = {http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1208},\n        note = {EUROCOMB&#x27;2019.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\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</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"groshaus-guedes-kolberg-onsubclassesofcirculararcbigraphs-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.wpccg.pro.br/wpccg2019/papers/paper_21\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'groshaus-guedes-kolberg-onsubclassesofcirculararcbigraphs-2019', 'http://www.wpccg.pro.br/wpccg2019/papers/paper_21', event);\">\n    On Subclasses of Circular Arc Bigraphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   M. Groshaus;  A. L. P. Guedes;  and  F. S. Kolberg.\n</span>\n\n  \n\n</span>\n\n  In <i>III Workshop de Pesquisa em Computação dos Campos Gerais</i>, volume 3, pages 68–73, Ponta Grossa, Paraná,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.wpccg.pro.br/wpccg2019/papers/paper_21\"\n     onclick=\"log_download('groshaus-guedes-kolberg-onsubclassesofcirculararcbigraphs-2019', 'http://www.wpccg.pro.br/wpccg2019/papers/paper_21', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"On Subclasses of Circular Arc Bigraphs [link]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/groshaus-guedes-kolberg-onsubclassesofcirculararcbigraphs-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('groshaus-guedes-kolberg-onsubclassesofcirculararcbigraphs-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@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 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 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.\nKeywords: Graph classes, Characterization, Helly, Circular arc bigraphs, Circular convex bipartite graphs.},\n  _keywords =    {Universal2016},\n url_pdf = {http://www.wpccg.pro.br/wpccg2019/papers/paper_21}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\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</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"santos-guedes-planejamentodecaminhos3dcomparaodosalgoritmosporgrade3degrafodevisibilidade-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.wpccg.pro.br/wpccg2019/papers/paper_25\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'santos-guedes-planejamentodecaminhos3dcomparaodosalgoritmosporgrade3degrafodevisibilidade-2019', 'http://www.wpccg.pro.br/wpccg2019/papers/paper_25', event);\">\n    Planejamento de caminhos 3D: Comparação dos algoritmos por grade 3D e grafo de visibilidade.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   C. A. Santos;  and  A. L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>III Workshop de Pesquisa em Computação dos Campos Gerais</i>, volume 3, pages 116–121, Ponta Grossa, Paraná,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.wpccg.pro.br/wpccg2019/papers/paper_25\"\n     onclick=\"log_download('santos-guedes-planejamentodecaminhos3dcomparaodosalgoritmosporgrade3degrafodevisibilidade-2019', 'http://www.wpccg.pro.br/wpccg2019/papers/paper_25', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Planejamento de caminhos 3D: Comparação dos algoritmos por grade 3D e grafo de visibilidade [link]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/santos-guedes-planejamentodecaminhos3dcomparaodosalgoritmosporgrade3degrafodevisibilidade-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('santos-guedes-planejamentodecaminhos3dcomparaodosalgoritmosporgrade3degrafodevisibilidade-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{SantosGuedesWPCCG2019,\n author = {C. A. Santos and A. L. P. Guedes},\n title = {Planejamento de caminhos 3D: Comparação dos algoritmos por grade 3D e grafo de visibilidade},\n booktitle = {III Workshop de Pesquisa em Computação dos Campos 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 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.\nPalavras-chave: Planejamento de 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</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\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</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"zatesko-vieira-pnpor5snarksexist-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.wpccg.pro.br/wpccg2019/papers/paper_38\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zatesko-vieira-pnpor5snarksexist-2019', 'http://www.wpccg.pro.br/wpccg2019/papers/paper_38', event);\">\n    P = NP or 5-Snarks Exist.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   L. M. Zatesko;  and  E. A. Vieira.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. 3nd Workshop de Pesquisa em Computa ̧cão dos Campos Gerais (WPCCG '19)</i>, pages 135–140, Ponta Grossa, Brazil,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.wpccg.pro.br/wpccg2019/papers/paper_38\"\n     onclick=\"log_download('zatesko-vieira-pnpor5snarksexist-2019', 'http://www.wpccg.pro.br/wpccg2019/papers/paper_38', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"P = NP or 5-Snarks Exist [link]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zatesko-vieira-pnpor5snarksexist-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zatesko-vieira-pnpor5snarksexist-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{wpccg19-za,\n  author = {L. M. Zatesko and E. A. Vieira},\n  title = {P = NP or 5-Snarks Exist},\n  language = {english},\n  year = 2019,\n  booktitle = {Proc. 3nd Workshop de Pesquisa em Computa\\c c\\~ao dos Campos Gerais (WPCCG &#x27;19)},\n  address = {Ponta Grossa, Brazil},\n  issn = {2526-1371},\n  url_pdf = {http://www.wpccg.pro.br/wpccg2019/papers/paper_38},\n  pages = {135--140}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"zatesko-bernardi-dealmeida-carmo-guedes-aconnectivitybaseddecompositionforgraphedgecolouring-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://mc.sbm.org.br/wp-content/uploads/sites/15/2019/12/P16.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zatesko-bernardi-dealmeida-carmo-guedes-aconnectivitybaseddecompositionforgraphedgecolouring-2019', 'https://mc.sbm.org.br/wp-content/uploads/sites/15/2019/12/P16.pdf', event);\">\n    A Connectivity-based Decomposition for Graph Edge-colouring.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Leandro Zatesko;  João P. W. Bernardi;  Sheila M. Almeida;  Renato Carmo;  and  André L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  <i>Matemática Contemporânea</i>, 46: 156–164.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://mc.sbm.org.br/volumes/volume-46/\"\n     onclick=\"log_download('zatesko-bernardi-dealmeida-carmo-guedes-aconnectivitybaseddecompositionforgraphedgecolouring-2019', 'https://mc.sbm.org.br/volumes/volume-46/', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A Connectivity-based Decomposition for Graph Edge-colouring [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://mc.sbm.org.br/wp-content/uploads/sites/15/2019/12/P16.pdf\"\n     onclick=\"log_download('zatesko-bernardi-dealmeida-carmo-guedes-aconnectivitybaseddecompositionforgraphedgecolouring-2019', 'https://mc.sbm.org.br/wp-content/uploads/sites/15/2019/12/P16.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Connectivity-based Decomposition for Graph Edge-colouring [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zatesko-bernardi-dealmeida-carmo-guedes-aconnectivitybaseddecompositionforgraphedgecolouring-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zatesko-bernardi-dealmeida-carmo-guedes-aconnectivitybaseddecompositionforgraphedgecolouring-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ZateskoBernardiAlmeidaCarmoGuedes2019,\n\tauthor = {Leandro Zatesko and João P. W. Bernardi and Sheila M. de Almeida and Renato Carmo and André L. P. Guedes},\n\ttitle = {A Connectivity-based Decomposition for Graph Edge-colouring},\n\tjournal = {Matemática Contemporânea},\n        issn = {2317-6636},\n\tvolume = {46},\n\tyear = {2019},\n\tabstract = {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        publisher = {Sociedade Brasileira de Matemática},\n        pages = {156--164},\n  _keywords =    {Universal2016},\n        url = {https://mc.sbm.org.br/volumes/volume-46/},\n        url_pdf = {https://mc.sbm.org.br/wp-content/uploads/sites/15/2019/12/P16.pdf},\n        _note = {2018 – 8th Latin-American Workshop on Cliques in Graphs.}\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\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</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"zatesko-carmo-guedes-novelproceduresforgraphedgecolouring-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://sol.sbc.org.br/index.php/ctd/article/view/6331\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zatesko-carmo-guedes-novelproceduresforgraphedgecolouring-2019', 'https://sol.sbc.org.br/index.php/ctd/article/view/6331', event);\">\n    Novel Procedures for Graph Edge-colouring.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Leandro Zatesko;  Renato Carmo;  and  André Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do XXXII Concurso de Teses e Dissertações</i>, Porto Alegre, RS, Brasil,  2019. SBC\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://sol.sbc.org.br/index.php/ctd/article/view/6331\"\n     onclick=\"log_download('zatesko-carmo-guedes-novelproceduresforgraphedgecolouring-2019', 'https://sol.sbc.org.br/index.php/ctd/article/view/6331', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Novel Procedures for Graph Edge-colouring [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.5753/ctd.2019.6331\"\n     onclick=\"log_download('zatesko-carmo-guedes-novelproceduresforgraphedgecolouring-2019', 'http://doi.org/10.5753/ctd.2019.6331', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zatesko-carmo-guedes-novelproceduresforgraphedgecolouring-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zatesko-carmo-guedes-novelproceduresforgraphedgecolouring-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@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 issn = {0000-0000},\n publisher = {SBC},\n address = {Porto Alegre, RS, Brasil},\n  _keywords =    {Universal2016},\n doi = {10.5753/ctd.2019.6331},\n url = {https://sol.sbc.org.br/index.php/ctd/article/view/6331}\n}\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"zatesko-carmo-guedes-novelproceduresforgraphedgecolouring-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://proceedings.science/sbpo-2019/papers/novel-procedures-for-graph-edge-colouring?lang=pt-br\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zatesko-carmo-guedes-novelproceduresforgraphedgecolouring-2019', 'https://proceedings.science/sbpo-2019/papers/novel-procedures-for-graph-edge-colouring?lang=pt-br', event);\">\n    Novel Procedures for Graph Edge-colouring.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Leandro Zatesko;  Renato Carmo;  and  André Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Prêmio de Tese do LI Simpósio Brasileiro de Pesquisa Operacional</i>, Campinas, GALOÁ,  2019. SBPO\n  <span class=\"note\">Prêmio: melhor de tese de doutorado.</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://proceedings.science/sbpo-2019/papers/novel-procedures-for-graph-edge-colouring?lang=pt-br\"\n     onclick=\"log_download('zatesko-carmo-guedes-novelproceduresforgraphedgecolouring-2019', 'https://proceedings.science/sbpo-2019/papers/novel-procedures-for-graph-edge-colouring?lang=pt-br', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Novel Procedures for Graph Edge-colouring [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zatesko-carmo-guedes-novelproceduresforgraphedgecolouring-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zatesko-carmo-guedes-novelproceduresforgraphedgecolouring-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@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 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 url = {https://proceedings.science/sbpo-2019/papers/novel-procedures-for-graph-edge-colouring?lang=pt-br}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"lima-dasilva-vignatti-recognizingpowerlawgraphsbymachinelearningalgorithmsusingareducedsetofstructuralfeatures-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Recognizing Power-law Graphs by Machine Learning Algorithms using a Reduced Set of Structural Features.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   A. M. Lima;  M. V. G. Silva;  and  A. L. Vignatti.\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC)</i>,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/lima-dasilva-vignatti-recognizingpowerlawgraphsbymachinelearningalgorithmsusingareducedsetofstructuralfeatures-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('lima-dasilva-vignatti-recognizingpowerlawgraphsbymachinelearningalgorithmsusingareducedsetofstructuralfeatures-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{LimaSilvaVignatti2019,\n author = {A. M. Lima and M. V. G. da Silva and A. L. Vignatti},\n title = {Recognizing Power-law Graphs by Machine Learning Algorithms using a Reduced Set of Structural Features},\n booktitle = {Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC)},\n location = {Salvador},\n year = {2019},\n _keywords = {Universal2016},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hepp-g-zatesko-umarevisosobrearelaodebqpcomoutrasclassesdecomplexidadecomputacional-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Uma Revisão sobre a Relação de BQP com Outras Classes de Complexidade Computacional.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   H Hepp;  Silva. M. V. G.;  and  L.M. Zatesko.\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do III Workshop de Pesquisa em Computação dos Campos Gerais</i>, pages 74-79,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hepp-g-zatesko-umarevisosobrearelaodebqpcomoutrasclassesdecomplexidadecomputacional-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hepp-g-zatesko-umarevisosobrearelaodebqpcomoutrasclassesdecomplexidadecomputacional-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Hepp2019,\n   title        = {Uma Revisão sobre a Relação de BQP com Outras\n                     Classes de Complexidade Computacional},\n   author       = {Hepp, H and Silva. M. V. G. and Zatesko, L.M.},\n   year         = {2019},\n   booktitle    = {Anais do III Workshop de Pesquisa em Computação dos\n                     Campos Gerais},\n   pages        = {74-79}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"moraes-santos-chabaturaneto-moreira-capivarateamdescriptionpaperfortherobocupbrazilopenflyingrobotleague-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Capivara team description paper for the robocup brazil open flying robot league.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   C. A. d. L. Moraes;  C. A. Santos;  F. Chabatura Neto;  and  J. V. Moreira.\n</span>\n\n  \n\n</span>\n\n  In <i>XVIII Latin American Robotics Competition (LARC) and XVII Brazilian Robotics Competition (CBR)</i>,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/moraes-santos-chabaturaneto-moreira-capivarateamdescriptionpaperfortherobocupbrazilopenflyingrobotleague-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('moraes-santos-chabaturaneto-moreira-capivarateamdescriptionpaperfortherobocupbrazilopenflyingrobotleague-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{MoraesSantosChabaturaMoreira2019,\n author = {Moraes, C. A. d. L. and Santos, C. A. and Chabatura Neto, F. and Moreira, J. V.},\n title = {Capivara team description paper for the robocup brazil open flying robot league},\n booktitle = {XVIII Latin American Robotics Competition (LARC) and XVII Brazilian Robotics Competition (CBR)},\n location = {Rio Grande},\n year = {2019},\n _keywords = {Universal2016},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"lima-santos-g-vignatti-estimandocentralidadedepercolaoutilizandoamostragemeteoriadadimensovapnikchervonenkis-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Estimando Centralidade de Percolação utilizando Amostragem e Teoria da Dimensão Vapnik-Chervonenkis.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   A. M. Lima;  G. M. Santos;  Silva. M. V. G.;  and  A. L. Vignatti.\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do III Workshop de Pesquisa em Computação dos Campos Gerais</i>, pages 86 - 91,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/lima-santos-g-vignatti-estimandocentralidadedepercolaoutilizandoamostragemeteoriadadimensovapnikchervonenkis-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('lima-santos-g-vignatti-estimandocentralidadedepercolaoutilizandoamostragemeteoriadadimensovapnikchervonenkis-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Lima2019-A,\n  title = {Estimando Centralidade de Percolação utilizando Amostragem e Teoria da Dimensão Vapnik-Chervonenkis},\n  author = {Lima, A. M. and Santos, G. M. and Silva. M. V. G. and Vignatti, A. L.},  \n  year = {2019},\n  booktitle = {Anais do III Workshop de Pesquisa em Computação dos Campos Gerais},\n  pages = {86 - 91}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"recksidlerjr-g-aparecimentodecliquesemgrafosaleatriosleidepotncianomodelodeligaopreferencial-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Aparecimento de cliques em grafos aleatórios lei de potência no modelo de ligação preferencial.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   D. Recksidler Jr;  and  Silva. M. V. G..\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do III Workshop de Pesquisa em Computação dos Campos Gerais</i>, pages 74-79,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/recksidlerjr-g-aparecimentodecliquesemgrafosaleatriosleidepotncianomodelodeligaopreferencial-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('recksidlerjr-g-aparecimentodecliquesemgrafosaleatriosleidepotncianomodelodeligaopreferencial-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Recksidler2019,\n   title        = {Aparecimento de cliques em grafos aleatórios lei de\n                     potência no modelo de ligação preferencial},\n   author       = {Recksidler Jr, D. and Silva. M. V. G.},\n   year         = {2019},\n   booktitle    = {Anais do III Workshop de Pesquisa em Computação dos\n                     Campos Gerais},\n   pages        = {74-79}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sdroievski-dasilva-vignatti-conhecimentozeroestatsticoeredueseficientesparaoproblemamktp-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Conhecimento Zero Estatístico e Reduções Eficientes para o Problema MKTP.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Nicollas M. Sdroievski;  Murilo V. G. Da Silva;  and  André L. Vignatti.\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do XXXII Concurso de Teses e Dissertações da SBC</i>,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sdroievski-dasilva-vignatti-conhecimentozeroestatsticoeredueseficientesparaoproblemamktp-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sdroievski-dasilva-vignatti-conhecimentozeroestatsticoeredueseficientesparaoproblemamktp-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{SdroievskiCTD-2019,\n  title = {Conhecimento Zero Estatístico e Reduções Eficientes para o Problema MKTP},\n  author = {Sdroievski, Nicollas M. and Da Silva, Murilo V. G. and Vignatti, André L.},  \n  year = {2019},\n  booktitle = {Anais do XXXII Concurso de Teses e Dissertações da SBC},\n  pages = {}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"rinemberg-soulignac-theeternaldominatingsetproblemforintervalgraphs-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1016/j.ipl.2019.01.013\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'rinemberg-soulignac-theeternaldominatingsetproblemforintervalgraphs-2019', 'https://doi.org/10.1016/j.ipl.2019.01.013', event);\">\n    The eternal dominating set problem for interval graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Martín Rinemberg;  and  Francisco J. Soulignac.\n</span>\n\n  \n\n</span>\n\n  <i>Inf. Process. Lett.</i>, 146: 27–29.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1016/j.ipl.2019.01.013\"\n     onclick=\"log_download('rinemberg-soulignac-theeternaldominatingsetproblemforintervalgraphs-2019', 'https://doi.org/10.1016/j.ipl.2019.01.013', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The eternal dominating set problem for interval graphs [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.ipl.2019.01.013\"\n     onclick=\"log_download('rinemberg-soulignac-theeternaldominatingsetproblemforintervalgraphs-2019', 'http://doi.org/10.1016/j.ipl.2019.01.013', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/rinemberg-soulignac-theeternaldominatingsetproblemforintervalgraphs-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('rinemberg-soulignac-theeternaldominatingsetproblemforintervalgraphs-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{RinembergSoulignac2019,\n  author    = {Mart{\\&#x27;{\\i}}n Rinemberg and\n               Francisco J. Soulignac},\n  title     = {The eternal dominating set problem for interval graphs},\n  journal   = {Inf. Process. Lett.},\n  volume    = {146},\n  pages     = {27--29},\n  year      = {2019},\n  url       = {https://doi.org/10.1016/j.ipl.2019.01.013},\n  doi       = {10.1016/j.ipl.2019.01.013},\n  timestamp = {Fri, 31 May 2019 09:51:13 +0200},\n  biburl    = {https://dblp.org/rec/journals/ipl/RinembergS19.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dasoledadegonzaga-dealmeida-sigmacoloringonpowersofpathsandsomefamiliesofsnarks-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Sigma Coloring on Powers of Paths and Some Families of Snarks.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Luis Gustavo Soledade Gonzaga;  and  Sheila Morais Almeida.\n</span>\n\n  \n\n</span>\n\n  <i>Electronic Notes in Theoretical Computer Science</i>, 346: 485–496.  2019.\n  <span class=\"note\">The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019).</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dasoledadegonzaga-dealmeida-sigmacoloringonpowersofpathsandsomefamiliesofsnarks-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dasoledadegonzaga-dealmeida-sigmacoloringonpowersofpathsandsomefamiliesofsnarks-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{da2019sigma,\n  title={Sigma Coloring on Powers of Paths and Some Families of Snarks},\n  author={da Soledade Gonzaga, Luis Gustavo and de Almeida, Sheila Morais},\n  journal={Electronic Notes in Theoretical Computer Science},\n  volume={346},\n  pages={485--496},\n  year={2019},\n  note = &quot;The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019).&quot;,\n  publisher={Elsevier}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"rocha-almeida-criticalidadearcorisemrodaseleques-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Criticalidade arco-íris em rodas e leques.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Aleffer Rocha;  and  Sheila Morais de Almeida.\n</span>\n\n  \n\n</span>\n\n  In <i>III Workshop de Pesquisa em Computação dos Campos Gerais</i>, volume 3, pages 110–115, Ponta Grossa, Paraná,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/rocha-almeida-criticalidadearcorisemrodaseleques-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('rocha-almeida-criticalidadearcorisemrodaseleques-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{RoAlWPCCG19,\n author = {Rocha, Aleffer and Almeida, Sheila Morais de},\n title = {Criticalidade arco-íris em rodas e leques},\n booktitle = {III Workshop de Pesquisa em Computação dos Campos Gerais},\n issn = {2526-1371},\n volume = {3},\n year = {2019},\n pages = {110--115},\n address = {Ponta Grossa, Paraná}\n }\n \n </pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dasoledadegonzaga-dealmeida-coloraodearestasemgrafossplitcocomparabilidade-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Coloração de arestas em grafos split-co-comparabilidade.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Luis Gustavo Soledade Gonzaga;  and  Sheila Morais Almeida.\n</span>\n\n  \n\n</span>\n\n  In <i>III Workshop de Pesquisa em Computação dos Campos Gerais</i>, volume 3, pages 6, Ponta Grossa, Paraná,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dasoledadegonzaga-dealmeida-coloraodearestasemgrafossplitcocomparabilidade-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dasoledadegonzaga-dealmeida-coloraodearestasemgrafossplitcocomparabilidade-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{GoAlWPCCG19,\n author = {da Soledade Gonzaga, Luis Gustavo and de Almeida, Sheila Morais},\n title = {Coloração de arestas em grafos split-co-comparabilidade},\n booktitle = {III Workshop de Pesquisa em Computação dos Campos Gerais},\n issn = {2526-1371},\n volume = {3},\n year = {2019},\n pages = {6},\n address = {Ponta Grossa, Paraná}\n }\n \n \n </pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2018\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2018')\"\n      onkeypress=\"toggleGroup('group_2018')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2018</span>\n      <span class=\"bibbase_group_count\">\n        \n        (12)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"zatesko-carmo-guedes-upperboundsforthetotalchromaticnumberofjoingraphsandcobipartitegraphs-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Upper Bounds for the Total Chromatic Number of Join Graphs and Cobipartite Graphs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Leandro M. Zatesko;  Renato Carmo;  and  André L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,</i>, pages 247-253,  2018. INSTICC, SciTePress\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.5220/0006627102470253\"\n     onclick=\"log_download('zatesko-carmo-guedes-upperboundsforthetotalchromaticnumberofjoingraphsandcobipartitegraphs-2018', 'http://doi.org/10.5220/0006627102470253', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zatesko-carmo-guedes-upperboundsforthetotalchromaticnumberofjoingraphsandcobipartitegraphs-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zatesko-carmo-guedes-upperboundsforthetotalchromaticnumberofjoingraphsandcobipartitegraphs-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ZateskoCarmoGuedesICORES2018,\nauthor={Leandro M. Zatesko and Renato Carmo and André L. P. Guedes},\ntitle={Upper Bounds for the Total Chromatic Number of Join Graphs and Cobipartite Graphs},\nbooktitle={Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},\nyear={2018},\npages={247-253},\npublisher={SciTePress},\norganization={INSTICC},\ndoi={10.5220/0006627102470253},\nisbn={978-989-758-285-1},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"groshaus-guedes-thebicliquegraphofk3freegraphsarethesquareofsomegraph-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'groshaus-guedes-thebicliquegraphofk3freegraphsarethesquareofsomegraph-2018', 'http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf', event);\">\n    The Biclique Graph of $K_3$-free Graphs are the Square of Some Graph.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Marina Groshaus;  and  André L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. VIII Latin American Workshop on Cliques in Graphs</i>, pages 25, Rio de Janeiro,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"\n     onclick=\"log_download('groshaus-guedes-thebicliquegraphofk3freegraphsarethesquareofsomegraph-2018', 'http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Biclique Graph of $K_3$-free Graphs are the Square of Some Graph [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/groshaus-guedes-thebicliquegraphofk3freegraphsarethesquareofsomegraph-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('groshaus-guedes-thebicliquegraphofk3freegraphsarethesquareofsomegraph-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{GroshausGuedesLAWCG2018,\n  title={The Biclique Graph of {$K_3$}-free Graphs are the 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 Graphs},\n  address = {Rio de Janeiro},\n  pages = {25},\n  url = &quot;http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf&quot;\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"zatesko-carmo-guedes-arecolouringprocedurefortotalcolouring-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zatesko-carmo-guedes-arecolouringprocedurefortotalcolouring-2018', 'http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf', event);\">\n    A Recolouring Procedure for Total Colouring.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   L. M. Zatesko;  R. Carmo;  and  A. L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. VIII Latin American Workshop on Cliques in Graphs</i>, pages 31, Rio de Janeiro,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"\n     onclick=\"log_download('zatesko-carmo-guedes-arecolouringprocedurefortotalcolouring-2018', 'http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Recolouring Procedure for Total Colouring [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zatesko-carmo-guedes-arecolouringprocedurefortotalcolouring-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zatesko-carmo-guedes-arecolouringprocedurefortotalcolouring-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@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 Graphs},\n  address = {Rio de Janeiro},\n  pages = {31},\n  url = &quot;http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf&quot;\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"zatesko-bernardi-dealmeida-carmo-guedes-adecompositionforedgecolouring-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zatesko-bernardi-dealmeida-carmo-guedes-adecompositionforedgecolouring-2018', 'http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf', event);\">\n    A Decomposition for Edge-colouring.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Leandro Zatesko;  João P. W. Bernardi;  Sheila M. Almeida;  Renato Carmo;  and  André L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. VIII Latin American Workshop on Cliques in Graphs</i>, Rio de Janeiro,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"\n     onclick=\"log_download('zatesko-bernardi-dealmeida-carmo-guedes-adecompositionforedgecolouring-2018', 'http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Decomposition for Edge-colouring [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zatesko-bernardi-dealmeida-carmo-guedes-adecompositionforedgecolouring-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zatesko-bernardi-dealmeida-carmo-guedes-adecompositionforedgecolouring-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ZateskoBernardiAlmeidaCarmoGuedesLAWCG2018,\n  title={A Decomposition for Edge-colouring},\n  author={Leandro Zatesko and João P. W. Bernardi and Sheila M. de Almeida and Renato Carmo and André L. P. Guedes},\n  year      = 2018,\n  language = {english},\n  booktitle = {Proc. VIII Latin American Workshop on Cliques in Graphs},\n  address = {Rio de Janeiro},\n  url = &quot;http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf&quot;\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"groshaus-guedes-kolberg-circulararcbigraphsandthehellysubclass-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'groshaus-guedes-kolberg-circulararcbigraphsandthehellysubclass-2018', 'http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf', event);\">\n    Circular-arc Bigraphs and the Helly subclass.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Marina Groshaus;  André Luiz Pires Guedes;  and  Fabricio Schiavon Kolberg.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. VIII Latin American Workshop on Cliques in Graphs</i>, pages 60, Rio de Janeiro,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"\n     onclick=\"log_download('groshaus-guedes-kolberg-circulararcbigraphsandthehellysubclass-2018', 'http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Circular-arc Bigraphs and the Helly subclass [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/groshaus-guedes-kolberg-circulararcbigraphsandthehellysubclass-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('groshaus-guedes-kolberg-circulararcbigraphsandthehellysubclass-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{GroshausGuedesKolbergLAWCG2018,\n  title={Circular-arc Bigraphs and the Helly subclass},\n  author={Marina Groshaus and André Luiz Pires Guedes and Fabricio Schiavon Kolberg},\n  year      = 2018,\n  language = {english},\n  booktitle = {Proc. VIII Latin American Workshop on Cliques in Graphs},\n  address = {Rio de Janeiro},\n  pages = {60},\n  url = &quot;http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf&quot;\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cruz-groshaus-guedes-bicliquegraphsofintervalbigraphsandcirculararcbigraphs-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cruz-groshaus-guedes-bicliquegraphsofintervalbigraphsandcirculararcbigraphs-2018', 'http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf', event);\">\n    Biclique Graphs of Interval Bigraphs and Circular-arc Bigraphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   E. P. Cruz;  M. Groshaus;  and  A. L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. VIII Latin American Workshop on Cliques in Graphs</i>, pages 68, Rio de Janeiro,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"\n     onclick=\"log_download('cruz-groshaus-guedes-bicliquegraphsofintervalbigraphsandcirculararcbigraphs-2018', 'http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Biclique Graphs of Interval Bigraphs and Circular-arc Bigraphs [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cruz-groshaus-guedes-bicliquegraphsofintervalbigraphsandcirculararcbigraphs-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cruz-groshaus-guedes-bicliquegraphsofintervalbigraphsandcirculararcbigraphs-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{CruzGroshausGuedesLAWCG2018,\n  title={Biclique Graphs of Interval Bigraphs and Circular-arc 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 Graphs},\n  address = {Rio de Janeiro},\n  pages = {68},\n  url = &quot;http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf&quot;\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"zge-carmo-oncomparingalgorithmsforthemaximumcliqueproblem-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S0166218X18300167\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zge-carmo-oncomparingalgorithmsforthemaximumcliqueproblem-2018', 'http://www.sciencedirect.com/science/article/pii/S0166218X18300167', event);\">\n    On comparing algorithms for the maximum clique problem.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Alexandre Prusch Züge;  and  Renato Carmo.\n</span>\n\n  \n\n</span>\n\n  <i>Discrete Applied Mathematics</i>, 247: 1-13.  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S0166218X18300167\"\n     onclick=\"log_download('zge-carmo-oncomparingalgorithmsforthemaximumcliqueproblem-2018', 'http://www.sciencedirect.com/science/article/pii/S0166218X18300167', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"On comparing algorithms for the maximum clique problem [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.dam.2018.01.005\"\n     onclick=\"log_download('zge-carmo-oncomparingalgorithmsforthemaximumcliqueproblem-2018', 'http://doi.org/10.1016/j.dam.2018.01.005', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zge-carmo-oncomparingalgorithmsforthemaximumcliqueproblem-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zge-carmo-oncomparingalgorithmsforthemaximumcliqueproblem-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{ZugeCarmo18,\n   title        = {On comparing algorithms for the maximum clique\n                     problem},\n   journal      = {Discrete Applied Mathematics},\n   volume       = {247},\n   pages        = {1-13},\n   year         = {2018},\n   issn         = {0166-218X},\n   doi          = {10.1016/j.dam.2018.01.005},\n   url          = {http://www.sciencedirect.com/science/article/pii/S0166218X18300167},\n   author       = {Alexandre Prusch Züge and Renato Carmo},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"melo-vignatti-apreselectionalgorithmfortheinfluencemaximizationprobleminpowerlawgraphs-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Preselection Algorithm for the Influence Maximization Problem in Power Law Graphs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Renato S. Melo;  and  Andre L. Vignatti.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 33rd Annual ACM Symposium on Applied Computing</i>, pages 1782–1789,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/melo-vignatti-apreselectionalgorithmfortheinfluencemaximizationprobleminpowerlawgraphs-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('melo-vignatti-apreselectionalgorithmfortheinfluencemaximizationprobleminpowerlawgraphs-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Melo2018,\n author = {Renato S. Melo and Andre L. Vignatti},\n title = {A Preselection Algorithm for the Influence Maximization Problem in Power Law Graphs},\n booktitle = {Proceedings of the 33rd Annual ACM Symposium on Applied Computing},\n year = {2018},\n pages = {1782--1789},\n} \n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"labres-vignatti-caractersticastopolgicasderedesdomundoreal-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Características Topológicas de Redes do Mundo Real.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Bruno H. Labres;  and  Andre L. Vignatti.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 26th Evento de Iniciação Científica da Universidade Federal do Paraná (EVINCI)</i>, pages 343,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/labres-vignatti-caractersticastopolgicasderedesdomundoreal-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('labres-vignatti-caractersticastopolgicasderedesdomundoreal-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Labres2018a,\n author = {Bruno H. Labres and Andre L. Vignatti},\n title = {Características Topológicas de Redes do Mundo Real},\n booktitle = {Proceedings of the 26th Evento de Iniciação Científica da Universidade Federal do Paraná (EVINCI)},\n year = {2018},\n pages = {343},\n} \n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cameron-dasilva-huang-vuskovic-structureandalgorithmsforcapevenholefreegraphs-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0012365X17303230?via%3Dihub\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cameron-dasilva-huang-vuskovic-structureandalgorithmsforcapevenholefreegraphs-2018', 'https://www.sciencedirect.com/science/article/pii/S0012365X17303230?via%3Dihub', event);\">\n    Structure and algorithms for (cap, even hole)-free graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Kathie Cameron;  Murilo V. G. Silva;  Shenwei Huang;  and  Kristina Vuskovic.\n</span>\n\n  \n\n</span>\n\n  <i>Discrete Mathematics</i>, 341: 463-473.  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0012365X17303230?via%3Dihub\"\n     onclick=\"log_download('cameron-dasilva-huang-vuskovic-structureandalgorithmsforcapevenholefreegraphs-2018', 'https://www.sciencedirect.com/science/article/pii/S0012365X17303230?via%3Dihub', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Structure and algorithms for (cap, even hole)-free graphs [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/https://doi.org/10.1016/j.disc.2017.09.013\"\n     onclick=\"log_download('cameron-dasilva-huang-vuskovic-structureandalgorithmsforcapevenholefreegraphs-2018', 'http://doi.org/https://doi.org/10.1016/j.disc.2017.09.013', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cameron-dasilva-huang-vuskovic-structureandalgorithmsforcapevenholefreegraphs-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cameron-dasilva-huang-vuskovic-structureandalgorithmsforcapevenholefreegraphs-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{MuriloDM18,\n   title        = {Structure and algorithms for (cap, even hole)-free graphs},\n   journal      = {Discrete Mathematics},\n   volume       = {341},\n   pages        = {463-473},\n   year         = {2018},\n   issn         = {0012-365X},\n   doi          = {https://doi.org/10.1016/j.disc.2017.09.013},\n   url          = {https://www.sciencedirect.com/science/article/pii/S0012365X17303230?via%3Dihub},\n   author       = {Kathie Cameron and Murilo V. G. da Silva and Shenwei Huang and Kristina Vuskovic},\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"macedo-alencar-beletijr-zuge-santiagojr-abordagemdidticopedaggicaparaoensinodearquiteturadecomputadoresemespaoseducacionaisnoformais-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Abordagem didático-pedagógica para o ensino de Arquitetura de Computadores em espaços educacionais não formais.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   C. A. Macedo;  V. H. S. Alencar;  C. R. Beleti JR.;  Alexandre P. Zuge;  and  R. M. Santiago JR..\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. Computer on the beach</i>, Florianópolis,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/macedo-alencar-beletijr-zuge-santiagojr-abordagemdidticopedaggicaparaoensinodearquiteturadecomputadoresemespaoseducacionaisnoformais-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('macedo-alencar-beletijr-zuge-santiagojr-abordagemdidticopedaggicaparaoensinodearquiteturadecomputadoresemespaoseducacionaisnoformais-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{MacedoAlencarBeletiZugeSantiago2018,\n   title        = {Abordagem didático-pedagógica para o ensino de\n                     Arquitetura de Computadores em espaços\n                     educacionais não formais},\n   author       = {Macedo, C. A. and Alencar, V. H. S. and Beleti JR.,\n                     C. R. and Zuge, Alexandre P. and Santiago JR.,\n                     R. M.},\n   year         = {2018},\n   booktitle    = {Proc. Computer on the beach},\n   address      = {Florianópolis}\n}\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"omai-dealmeida-equitabletotalcoloringofgraphswithuniversalvertex-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'omai-dealmeida-equitabletotalcoloringofgraphswithuniversalvertex-2018', 'http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf', event);\">\n    Equitable total coloring of graphs with universal vertex.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Mayara Midori Omai;  and  Sheila Morais Almeida.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. VIII Latin American Workshop on Cliques in Graphs</i>, pages 30, Rio de Janeiro,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf\"\n     onclick=\"log_download('omai-dealmeida-equitabletotalcoloringofgraphswithuniversalvertex-2018', 'http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Equitable total coloring of graphs with universal vertex [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/omai-dealmeida-equitabletotalcoloringofgraphswithuniversalvertex-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('omai-dealmeida-equitabletotalcoloringofgraphswithuniversalvertex-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{OASLAWCG2018,\n  title={Equitable total coloring of graphs with universal vertex},\n  author={Mayara Midori Omai and Sheila Morais de Almeida},\n  year      = 2018,\n  language = {english},\n  booktitle = {Proc. VIII Latin American Workshop on Cliques in Graphs},\n  address = {Rio de Janeiro},\n  pages = {30},\n  url = &quot;http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf&quot;\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2017\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2017')\"\n      onkeypress=\"toggleGroup('group_2017')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2017</span>\n      <span class=\"bibbase_group_count\">\n        \n        (15)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"beletijr-goncalves-valerio-zuge-santiagojr-alves-alencar-popularizandoacomputaoodesenvolvimentoderecursosparaaeducaonoformalsobrearquiteturadecomputadores-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Popularizando a Computação: o desenvolvimento de recursos para a educação não-formal sobre Arquitetura de Computadores.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   C. R. Beleti JR.;  D. C. M. Goncalves;  M. Valerio;  Alexandre P. Zuge;  R. M. Santiago JR.;  G. J. Alves;  and  V. H. S. Alencar.\n</span>\n\n  \n\n</span>\n\n  In  UNILA., editor(s), <i>35° Seminário de Extensão Universitária da Região Sul - SEURS</i>, pages 1248-1253, Foz do Iguaçu,  2017. UNILA\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/beletijr-goncalves-valerio-zuge-santiagojr-alves-alencar-popularizandoacomputaoodesenvolvimentoderecursosparaaeducaonoformalsobrearquiteturadecomputadores-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('beletijr-goncalves-valerio-zuge-santiagojr-alves-alencar-popularizandoacomputaoodesenvolvimentoderecursosparaaeducaonoformalsobrearquiteturadecomputadores-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{BeletiGoncalvesValerioZugeSantiagoAlvesAlencar2017,\n   author       = {Beleti JR., C. R. and Goncalves, D. C. M. and\n                     Valerio, M. and Zuge, Alexandre P. and Santiago\n                     JR., R. M. and Alves, G. J. and Alencar,\n                     V. H. S.},\n   title        = {Popularizando a Computação: o desenvolvimento de\n                     recursos para a educação não-formal sobre\n                     Arquitetura de Computadores},\n   optcrossref  = {},\n   optkey       = {},\n   booktitle    = {35° Seminário de Extensão Universitária da Região\n                     Sul - SEURS},\n   year         = {2017},\n   editor       = {UNILA},\n   volume       = {},\n   number       = {},\n   series       = {},\n   pages        = {1248-1253},\n   month        = {},\n   address      = {Foz do Iguaçu},\n   organization = {UNILA},\n   publisher    = {},\n   note         = {},\n   annote       = {}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sobral-groshaus-guedes-bicliqueedgechoosabilityinsomeclassesofgraphs-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://csbc2017.mackenzie.br/public/files/2-etc/artigos/4.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'sobral-groshaus-guedes-bicliqueedgechoosabilityinsomeclassesofgraphs-2017', 'http://csbc2017.mackenzie.br/public/files/2-etc/artigos/4.pdf', event);\">\n    Biclique edge-choosability in some classes of graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Gabriel A. G. Sobral;  Marina Groshaus;  and  André L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>II Encontro de Teoria da Computação - ETC, São Paulo, Brasil</i>,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://csbc2017.mackenzie.br/public/files/2-etc/artigos/4.pdf\"\n     onclick=\"log_download('sobral-groshaus-guedes-bicliqueedgechoosabilityinsomeclassesofgraphs-2017', 'http://csbc2017.mackenzie.br/public/files/2-etc/artigos/4.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Biclique edge-choosability in some classes of graphs [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sobral-groshaus-guedes-bicliqueedgechoosabilityinsomeclassesofgraphs-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sobral-groshaus-guedes-bicliqueedgechoosabilityinsomeclassesofgraphs-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{SobralGroshausGuedesETC2017,\n  author = {Gabriel A. G. Sobral and Marina Groshaus and André 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, Brasil},\n  url = {http://csbc2017.mackenzie.br/public/files/2-etc/artigos/4.pdf}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"zatesko-carmo-guedes-edgecolouringoftrianglefreegraphswithnopropermajors-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://csbc2017.mackenzie.br/public/files/2-etc/artigos/13.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zatesko-carmo-guedes-edgecolouringoftrianglefreegraphswithnopropermajors-2017', 'http://csbc2017.mackenzie.br/public/files/2-etc/artigos/13.pdf', event);\">\n    Edge-colouring of triangle-free graphs with no proper majors.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Leandro M. Zatesko;  Renato Carmo;  and  André L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>II Encontro de Teoria da Computação - ETC, São Paulo, Brasil</i>,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://csbc2017.mackenzie.br/public/files/2-etc/artigos/13.pdf\"\n     onclick=\"log_download('zatesko-carmo-guedes-edgecolouringoftrianglefreegraphswithnopropermajors-2017', 'http://csbc2017.mackenzie.br/public/files/2-etc/artigos/13.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Edge-colouring of triangle-free graphs with no proper majors [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zatesko-carmo-guedes-edgecolouringoftrianglefreegraphswithnopropermajors-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zatesko-carmo-guedes-edgecolouringoftrianglefreegraphswithnopropermajors-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ZateskoCarmoGuedesETC2017,\n  author = {Leandro M. Zatesko and Renato Carmo and André L. P. Guedes},\n  title = {Edge-colouring of triangle-free graphs with no proper majors},\n  year = 2017,\n  booktitle = {II Encontro de Teoria da Computação - ETC, São Paulo, Brasil},\n  url = {http://csbc2017.mackenzie.br/public/files/2-etc/artigos/13.pdf}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"groshaus-guedes-puppo-bicliquegraphofbipartitepermutationgraphs-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S1571065317302457\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'groshaus-guedes-puppo-bicliquegraphofbipartitepermutationgraphs-2017', 'https://www.sciencedirect.com/science/article/pii/S1571065317302457', event);\">\n    Biclique graph of bipartite permutation graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   M. Groshaus;  A. L. P. Guedes;  and  J. P. Puppo.\n</span>\n\n  \n\n</span>\n\n  <i>Electronic Notes in Discrete Mathematics</i>, 62: 33–38.  2017.\n  <span class=\"note\">LAGOS'17 - IX Latin and American Algorithms, Graphs and Optimization.</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S1571065317302457\"\n     onclick=\"log_download('groshaus-guedes-puppo-bicliquegraphofbipartitepermutationgraphs-2017', 'https://www.sciencedirect.com/science/article/pii/S1571065317302457', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Biclique graph of bipartite permutation graphs [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.endm.2017.10.007\"\n     onclick=\"log_download('groshaus-guedes-puppo-bicliquegraphofbipartitepermutationgraphs-2017', 'http://doi.org/10.1016/j.endm.2017.10.007', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/groshaus-guedes-puppo-bicliquegraphofbipartitepermutationgraphs-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('groshaus-guedes-puppo-bicliquegraphofbipartitepermutationgraphs-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{GroshausGuedesPuppo2017,\ntitle = &quot;Biclique graph of bipartite permutation graphs&quot;,\njournal = &quot;Electronic Notes in Discrete Mathematics&quot;,\nvolume = &quot;62&quot;,\npages = &quot;33--38&quot;,\nyear = &quot;2017&quot;,\nnote = &quot;LAGOS&#x27;17 - {IX} Latin and American Algorithms, Graphs and Optimization.&quot;,\nissn = &quot;1571-0653&quot;,\ndoi = &quot;10.1016/j.endm.2017.10.007&quot;,\nurl = &quot;https://www.sciencedirect.com/science/article/pii/S1571065317302457&quot;,\nabstract_url = {https://lipn.univ-paris13.fr/Lagos2017/abstracts_final_short.pdf},\nauthor = &quot;M. Groshaus and A. L. P. Guedes and J. P. Puppo&quot;,\nkeywords = &quot;Bicliques&quot;,\nkeywords = &quot;Biclique graphs&quot;,\nkeywords = &quot;Bipartite permutation graphs &quot;,\nabstract = &quot;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. &quot;\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\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</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"melo-vignatti-costa-donascimento-participaofemininanocinemabrasileiroanliseatravsderedessociais-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Participação Feminina no Cinema Brasileiro: Análise Através de Redes Sociais.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Renato S. Melo;  Andre L. Vignatti;  Arthur P. Da Costa;  and  Felipe Nascimento.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the II Workshop de Pesquisa em Computação dos Campos Gerais</i>, pages 37–40, 06 2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/melo-vignatti-costa-donascimento-participaofemininanocinemabrasileiroanliseatravsderedessociais-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('melo-vignatti-costa-donascimento-participaofemininanocinemabrasileiroanliseatravsderedessociais-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Melo2017,\n  author = {Renato S. Melo and Andre L. Vignatti and Arthur P. Da Costa and Felipe do Nascimento},\n  year = {2017},\n  booktitle = {Proceedings of the II Workshop de Pesquisa em Computação dos Campos Gerais},\n  month = {06},\n  pages = {37--40},\n  title = {Participação Feminina no Cinema Brasileiro: Análise Através de Redes Sociais}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bordini-vignatti-anapproximationalgorithmforthephubmedianproblem-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An Approximation Algorithm for the p-Hub Median Problem.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Camile F. Bordini;  and  André L. Vignatti.\n</span>\n\n  \n\n</span>\n\n  <i>Electronic Notes in Discrete Mathematics</i>, 62: 183–188.  2017.\n  <span class=\"note\">LAGOS'17 - IX Latin and American Algorithms, Graphs and Optimization.</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bordini-vignatti-anapproximationalgorithmforthephubmedianproblem-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bordini-vignatti-anapproximationalgorithmforthephubmedianproblem-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Bordini2017,\n  title = &quot;An Approximation Algorithm for the p-Hub Median Problem&quot;,\n  journal = &quot;Electronic Notes in Discrete Mathematics&quot;,\n  volume = &quot;62&quot;,\n  pages = &quot;183--188&quot;,\n  year = &quot;2017&quot;,\n  note = &quot;LAGOS&#x27;17 - {IX} Latin and American Algorithms, Graphs and Optimization.&quot;,\n  author = &quot;Camile F. Bordini and André L. Vignatti&quot;,\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cruz-groshaus-guedes-algoritmosdevarreduraparalistagemdebicliquesmaximaisemmodelosbipartidosdeintervalosearcocirculares-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.wpccg.pro.br/wpccg2017/papers/paper_6\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cruz-groshaus-guedes-algoritmosdevarreduraparalistagemdebicliquesmaximaisemmodelosbipartidosdeintervalosearcocirculares-2017', 'http://www.wpccg.pro.br/wpccg2017/papers/paper_6', event);\">\n    Algoritmos de Varredura para Listagem de Bicliques Maximais em Modelos Bipartidos de Intervalos e Arco-Circulares.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   E. P. Cruz;  M. Groshaus;  and  A. L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>II Workshop de Pesquisa em Computação dos Campos Gerais</i>, volume 2, pages 9–12, Ponta Grossa, Paraná,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.wpccg.pro.br/wpccg2017/papers/paper_6\"\n     onclick=\"log_download('cruz-groshaus-guedes-algoritmosdevarreduraparalistagemdebicliquesmaximaisemmodelosbipartidosdeintervalosearcocirculares-2017', 'http://www.wpccg.pro.br/wpccg2017/papers/paper_6', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Algoritmos de Varredura para Listagem de Bicliques Maximais em Modelos Bipartidos de Intervalos e Arco-Circulares [link]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cruz-groshaus-guedes-algoritmosdevarreduraparalistagemdebicliquesmaximaisemmodelosbipartidosdeintervalosearcocirculares-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cruz-groshaus-guedes-algoritmosdevarreduraparalistagemdebicliquesmaximaisemmodelosbipartidosdeintervalosearcocirculares-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{CruzGroshausGuedesWPCCG2017,\n author = {E. P. Cruz and M. Groshaus and A. L. P. Guedes},\n title = {Algoritmos de Varredura para Listagem de Bicliques Maximais em Modelos Bipartidos de Intervalos e Arco-Circulares},\n booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},\n issn = {2526-1371},\n volume = {2},\n year = {2017},\n pages = {9--12},\n address = {Ponta Grossa, Paraná},\n url_pdf = {http://www.wpccg.pro.br/wpccg2017/papers/paper_6}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"zatesko-carmo-guedes-onaconjectureonedgecolouringjoingraphs-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.wpccg.pro.br/wpccg2017/papers/paper_16\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zatesko-carmo-guedes-onaconjectureonedgecolouringjoingraphs-2017', 'http://www.wpccg.pro.br/wpccg2017/papers/paper_16', event);\">\n    On a conjecture on edge-colouring join graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Leandro M. Zatesko;  Renato Carmo;  and  André L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>II Workshop de Pesquisa em Computação dos Campos Gerais</i>, volume 2, pages 69–72, Ponta Grossa, Paraná,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.wpccg.pro.br/wpccg2017/papers/paper_16\"\n     onclick=\"log_download('zatesko-carmo-guedes-onaconjectureonedgecolouringjoingraphs-2017', 'http://www.wpccg.pro.br/wpccg2017/papers/paper_16', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"On a conjecture on edge-colouring join graphs [link]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zatesko-carmo-guedes-onaconjectureonedgecolouringjoingraphs-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zatesko-carmo-guedes-onaconjectureonedgecolouringjoingraphs-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ZateskoCarmoGuedesWPCCG2017,\n author = {Leandro M. Zatesko and Renato Carmo and André L. P. Guedes},\n title = {On a conjecture on edge-colouring join graphs},\n booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},\n issn = {2526-1371},\n volume = {2},\n year = {2017},\n pages = {69--72},\n address = {Ponta Grossa, Paraná},\n url_pdf = {http://www.wpccg.pro.br/wpccg2017/papers/paper_16}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"omai-dealmeida-sasaki-avdedgecoloringonpowersofpaths-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  AVD-edge coloring on powers of paths.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Mayara M Omai;  Sheila M Almeida;  and  Diana Sasaki.\n</span>\n\n  \n\n</span>\n\n  <i>Electronic Notes in Discrete Mathematics</i>, 62: 273–278.  2017.\n  <span class=\"note\">LAGOS'17 - IX Latin and American Algorithms, Graphs and Optimization.</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/omai-dealmeida-sasaki-avdedgecoloringonpowersofpaths-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('omai-dealmeida-sasaki-avdedgecoloringonpowersofpaths-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{omai2017avd,\n  title={AVD-edge coloring on powers of paths},\n  author={Omai, Mayara M and de Almeida, Sheila M and Sasaki, Diana},\n  journal={Electronic Notes in Discrete Mathematics},\n  volume={62},\n  pages={273--278},\n  year={2017},\n  note = &quot;LAGOS&#x27;17 - {IX} Latin and American Algorithms, Graphs and Optimization.&quot;,\n  publisher={Elsevier}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"salgado-omai-almeida-coloraototaldistintanavizinhanaempotnciasdecaminho-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Coloração total distinta na vizinhança em potências de caminho.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Pedro Henrique Salgado;  Mayara Midori Omai;  and  Sheila Morais de Almeida.\n</span>\n\n  \n\n</span>\n\n  In <i>II Workshop de Pesquisa em Computação dos Campos Gerais</i>, volume 2, pages 53–56, Ponta Grossa, Paraná,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/salgado-omai-almeida-coloraototaldistintanavizinhanaempotnciasdecaminho-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('salgado-omai-almeida-coloraototaldistintanavizinhanaempotnciasdecaminho-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{SOA17,\n author = {Salgado, Pedro Henrique and Omai, Mayara Midori and Almeida, Sheila Morais de },\n title = {Coloração total distinta na vizinhança em potências de caminho},\n booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},\n issn = {2526-1371},\n volume = {2},\n year = {2017},\n pages = {53--56},\n address = {Ponta Grossa, Paraná}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"rocha-almeida-criticalidadearcorisdosgrafosresultantesdeprodutocartesianodeciclosecaminhos-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Criticalidade arco-íris dos grafos resultantes de produto cartesiano de ciclos e caminhos.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Aleffer Rocha;  and  Sheila Morais de Almeida.\n</span>\n\n  \n\n</span>\n\n  In <i>II Workshop de Pesquisa em Computação dos Campos Gerais</i>, volume 2, pages 49–52, Ponta Grossa, Paraná,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/rocha-almeida-criticalidadearcorisdosgrafosresultantesdeprodutocartesianodeciclosecaminhos-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('rocha-almeida-criticalidadearcorisdosgrafosresultantesdeprodutocartesianodeciclosecaminhos-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{RoAl17,\n author = {Rocha, Aleffer and Almeida, Sheila Morais de},\n title = {Criticalidade arco-íris dos grafos resultantes de produto cartesiano de ciclos e caminhos},\n booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},\n issn = {2526-1371},\n volume = {2},\n year = {2017},\n pages = {49--52},\n address = {Ponta Grossa, Paraná}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"rauch-almeida-adjacentevertexdistinguishingedgecoloringoncompletesplitgraphsandsplitindifferencegraphs-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Adjacente vertex distinguishing edge coloring on complete split graphs and split-indifference graphs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Thamirys Moreira dos Santos Rauch;  and  Sheila Morais de Almeida.\n</span>\n\n  \n\n</span>\n\n  In <i>II Workshop de Pesquisa em Computação dos Campos Gerais</i>, volume 2, pages 45–48, Ponta Grossa, Paraná,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/rauch-almeida-adjacentevertexdistinguishingedgecoloringoncompletesplitgraphsandsplitindifferencegraphs-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('rauch-almeida-adjacentevertexdistinguishingedgecoloringoncompletesplitgraphsandsplitindifferencegraphs-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{RaAl17,\n author = {Rauch, Thamirys Moreira dos Santos and Almeida, Sheila Morais de},\n title = {Adjacente vertex distinguishing edge coloring on complete split graphs and split-indifference graphs},\n booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},\n issn = {2526-1371},\n volume = {2},\n year = {2017},\n pages = {45--48},\n address = {Ponta Grossa, Paraná}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"scaketti-almeida-coloraototaldistintanavizinhanaemgrafos4partidoscompletos-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Coloração total distinta na vizinhança em grafos 4-partidos completos.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Matheus Scaketti;  and  Sheila Morais de Almeida.\n</span>\n\n  \n\n</span>\n\n  In <i>II Workshop de Pesquisa em Computação dos Campos Gerais</i>, volume 2, pages 57–60, Ponta Grossa, Paraná,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/scaketti-almeida-coloraototaldistintanavizinhanaemgrafos4partidoscompletos-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('scaketti-almeida-coloraototaldistintanavizinhanaemgrafos4partidoscompletos-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ScAl17,\n author = {Scaketti, Matheus and Almeida, Sheila Morais de},\n title = {Coloração total distinta na vizinhança em grafos 4-partidos completos},\n booktitle = {II Workshop de Pesquisa em Computação dos Campos Gerais},\n issn = {2526-1371},\n volume = {2},\n year = {2017},\n pages = {57--60},\n address = {Ponta Grossa, Paraná}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"rocha-almeida-coloraoarcorisemgrafosresultantesdeprodutocartesiano-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Coloração arco-íris em grafos resultantes de produto cartesiano.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Aleffer Rocha;  and  Sheila Morais de Almeida.\n</span>\n\n  \n\n</span>\n\n  In <i>II Encontro de Teoria da Computação - ETC, São Paulo, Brasil</i>,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/rocha-almeida-coloraoarcorisemgrafosresultantesdeprodutocartesiano-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('rocha-almeida-coloraoarcorisemgrafosresultantesdeprodutocartesiano-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{RoAlETC17,\n  author = {Rocha, Aleffer and Almeida, Sheila Morais de},\n  title = {Coloração arco-íris em grafos resultantes de produto cartesiano},\n  year = 2017,\n  booktitle = {II Encontro de Teoria da Computação - ETC, São Paulo, Brasil}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"luiz-almeida-campos-neighbourdistinguishingedgelabellingsandtotallabellingsoffamiliesofgraphs-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Neighbour-distinguishing edge-labellings and total-labellings of families of graphs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   A. G. Luiz;  S. M. de Almeida;  and  C. N. Campos.\n</span>\n\n  \n\n</span>\n\n  In <i>In: 17th Colourings, Independence and Domination Workshop on Graph Theory (CID 2017)</i>, Piechowice,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/luiz-almeida-campos-neighbourdistinguishingedgelabellingsandtotallabellingsoffamiliesofgraphs-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('luiz-almeida-campos-neighbourdistinguishingedgelabellingsandtotallabellingsoffamiliesofgraphs-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{LAC17,\n  title={Neighbour-distinguishing edge-labellings and total-labellings of families of graphs},\n  author={Luiz, A. G. and Almeida, S. M. de and Campos, C. N.},\n  year      = 2017,\n  language = {english},\n  booktitle = {In: 17th Colourings, Independence and Domination Workshop on Graph Theory (CID 2017)},\n  address = {Piechowice}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);