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/universal2021/universal.bib\",\"fullnames\":\"1\",\"jsonp\":\"1\",\"host\":\"bibbase.org\",\"ssl\":false},\n      data: [{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Biclique Graphs of K3-free Graphs and Bipartite Graphs\",\"author\":[{\"firstnames\":[\"Marina\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"journal\":\"Procedia Computer Science\",\"volume\":\"195\",\"year\":\"2021\",\"issn\":\"1877-0509\",\"url\":\"http://dx.doi.org/10.1016/j.procs.2021.11.029\",\"doi\":\"10.1016/j.procs.2021.11.029\",\"publisher\":\"Elsevier BV\",\"pages\":\"230–238\",\"note\":\"Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium.\",\"keywords\":\"Bicliques, Biclique graphs, Intersection graphs, Triangle-free graphs, Bipartite graphs, Comparability graphs, Power of a graph\",\"abstract\":\"A biclique of a graph is a maximal complete bipartite subgraph. The biclique graph of a graph G, KB(G), defined as the intersection graph of the bicliques of G, was introduced and characterized in 2010 by Groshaus and Szwarcfiter. However, this characterization does not lead to polynomial time recognition algorithms, and the time complexity of its recognition problem remains open. There are some works on this problem when restricted to some classes. In this work we give a characterization of the biclique graph of a K3-free graph G. We prove that KB(G) is the square graph of a particular graph which we call Mutually Included Biclique Graph of G, KBm(G). Although it does not lead to a polynomial time recognition algorithm, it gives a new tool to prove properties of biclique graphs (restricted to K3-free graphs) using known properties of square graphs. For instance we generalize a property about induced P3's in biclique graphs to a property about stars and proved a conjecture posted by Groshaus and Montero, when restricted to K3-free graphs. Also we give another characterization of the class of biclique graphs of bipartite graphs. We prove that KB(bipartite) = (IIC-comparability)2, where IIC-comparability is a subclass of comparability graphs that we call Interval Intersection Closed Comparability.\",\"bibtex\":\"@article{GroshausGuedesProcedia2021,\\ntitle        = \\\"Biclique Graphs of K3-free Graphs and Bipartite\\n                  Graphs\\\",\\n   author       = \\\"Marina Groshaus and André L. P. Guedes\\\",\\n   journal      = {Procedia Computer Science},\\n   volume       = {195},\\n   year         = \\\"2021\\\",\\n   ISSN         = {1877-0509},\\n   url          = {http://dx.doi.org/10.1016/j.procs.2021.11.029},\\n   DOI          = {10.1016/j.procs.2021.11.029},\\n   publisher    = {Elsevier BV},\\n   pages        = {230–238},\\n   note         = {Proceedings of the XI Latin and American Algorithms,\\n                  Graphs and Optimization Symposium.},\\n   keywords     = {Bicliques, Biclique graphs, Intersection graphs,\\n                  Triangle-free graphs, Bipartite graphs, Comparability\\n                  graphs, Power of a graph},\\n   abstract     = {A biclique of a graph is a maximal complete bipartite\\n                  subgraph.  The biclique graph of a graph G, KB(G),\\n                  defined as the intersection graph of the bicliques of\\n                  G, was introduced and characterized in 2010 by\\n                  Groshaus and Szwarcfiter. However, this\\n                  characterization does not lead to polynomial time\\n                  recognition algorithms, and the time complexity of its\\n                  recognition problem remains open. There are some works\\n                  on this problem when restricted to some classes. In\\n                  this work we give a characterization of the biclique\\n                  graph of a K3-free graph G. We prove that KB(G) is the\\n                  square graph of a particular graph which we call\\n                  Mutually Included Biclique Graph of G,\\n                  KBm(G). Although it does not lead to a polynomial time\\n                  recognition algorithm, it gives a new tool to prove\\n                  properties of biclique graphs (restricted to K3-free\\n                  graphs) using known properties of square graphs. For\\n                  instance we generalize a property about induced P3's\\n                  in biclique graphs to a property about stars and\\n                  proved a conjecture posted by Groshaus and Montero,\\n                  when restricted to K3-free graphs.  Also we give\\n                  another characterization of the class of biclique\\n                  graphs of bipartite graphs. We prove that\\n                  KB(bipartite) = (IIC-comparability)2, where\\n                  IIC-comparability is a subclass of comparability\\n                  graphs that we call Interval Intersection Closed\\n                  Comparability.}\\n}\\n\\n\",\"author_short\":[\"Groshaus, M.\",\"Guedes, A. L. P.\"],\"key\":\"GroshausGuedesProcedia2021\",\"id\":\"GroshausGuedesProcedia2021\",\"bibbaseid\":\"groshaus-guedes-bicliquegraphsofk3freegraphsandbipartitegraphs-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://dx.doi.org/10.1016/j.procs.2021.11.029\"},\"keyword\":[\"Bicliques\",\"Biclique graphs\",\"Intersection graphs\",\"Triangle-free graphs\",\"Bipartite graphs\",\"Comparability graphs\",\"Power of a graph\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"On feedback vertex set in reducible flow hypergraphs\",\"journal\":\"Procedia Computer Science\",\"volume\":\"195\",\"pages\":\"212-220\",\"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.027\",\"url\":\"https://www.sciencedirect.com/science/article/pii/S1877050921021669\",\"author\":[{\"firstnames\":[\"Luerbio\"],\"propositions\":[],\"lastnames\":[\"Faria\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]},{\"firstnames\":[\"Lilian\"],\"propositions\":[],\"lastnames\":[\"Markenzon\"],\"suffixes\":[]}],\"keywords\":\"directed hypergraphs, feedback vertex set, NP-complete, approximation algorithms\",\"abstract\":\"A directed hypergraph H = (V, A) is a finite set of vertices V and a set of hyper-arcs A, where each hyper-arc is an ordered pair of nonempty subsets of vertices. A flow hypergraph H = (V, A, s) is a triple, such that (V, A) is a directed hypergraph, s e V is a distinguished vertex such that s reaches every vertex of V. Reducible flow hypergraphs are a generalization of Hecht and Ullman’s reducible flowgraphs. The feedback vertex set (fvs) decision problem has a directed hypergraph H and an integer k ≥ 0 as input and the question is whether there is V'⊆V, |V' |≤k such that H\\\\V' is an acyclic directed hypergraph. It is known that fvs is polynomial time solvable for reducible flowgraphs. In this article we prove that fvs is NP-complete for reducible flow hypergraphs showing a reduction from 3-satisfiability problem with at most 3 occurrences per variable (3sat3-). We exhibit a polynomial-time ∆-approximation for fvs in reducible flow hypergraphs, where ∆ is the maximum number of hyper-arcs adjacent to a vertex of H.\",\"bibtex\":\"@article{FariaGuedesMarkenzonProcedia2021,\\ntitle = \\\"On feedback vertex set in reducible flow hypergraphs\\\",\\njournal = {Procedia Computer Science},\\nvolume = {195},\\npages = {212-220},\\nyear = {2021},\\nnote = {Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium.},\\nissn = {1877-0509},\\ndoi = {https://doi.org/10.1016/j.procs.2021.11.027},\\nurl = {https://www.sciencedirect.com/science/article/pii/S1877050921021669},\\nauthor = {Luerbio Faria and André L. P. Guedes and Lilian Markenzon},\\nkeywords = {directed hypergraphs, feedback vertex set, NP-complete, approximation algorithms},\\nabstract = {A directed hypergraph H = (V, A) is a finite set of vertices V and a set of hyper-arcs A, where each hyper-arc is an ordered pair of nonempty subsets of vertices. A flow hypergraph H = (V, A, s) is a triple, such that (V, A) is a directed hypergraph, s e V is a distinguished vertex such that s reaches every vertex of V. Reducible flow hypergraphs are a generalization of Hecht and Ullman’s reducible flowgraphs. The feedback vertex set (fvs) decision problem has a directed hypergraph H and an integer k ≥ 0 as input and the question is whether there is V'⊆V, |V' |≤k such that H\\\\V' is an acyclic directed hypergraph. It is known that fvs is polynomial time solvable for reducible flowgraphs. In this article we prove that fvs is NP-complete for reducible flow hypergraphs showing a reduction from 3-satisfiability problem with at most 3 occurrences per variable (3sat3-). We exhibit a polynomial-time ∆-approximation for fvs in reducible flow hypergraphs, where ∆ is the maximum number of hyper-arcs adjacent to a vertex of H.}\\n}\\n\\n\",\"author_short\":[\"Faria, L.\",\"Guedes, A. L. P.\",\"Markenzon, L.\"],\"key\":\"FariaGuedesMarkenzonProcedia2021\",\"id\":\"FariaGuedesMarkenzonProcedia2021\",\"bibbaseid\":\"faria-guedes-markenzon-onfeedbackvertexsetinreducibleflowhypergraphs-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.sciencedirect.com/science/article/pii/S1877050921021669\"},\"keyword\":[\"directed hypergraphs\",\"feedback vertex set\",\"NP-complete\",\"approximation algorithms\"],\"metadata\":{\"authorlinks\":{}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"On the Biclique Graphs of Circular Arc Bigraphs\",\"author\":[{\"firstnames\":[\"F.\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Kolberg\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"A.\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"language\":\"english\",\"booktitle\":\"Annals of the LAWCG '22 - Latin American Workshop on Cliques in Graphs\",\"pages\":\"92\",\"year\":\"2022\",\"address\":\"Curitiba\",\"url\":\"https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf\",\"bibtex\":\"@InProceedings{CruzGroshausGuedesLAWCG2022,\\n   title        = {On the Biclique Graphs of Circular Arc Bigraphs},\\n   author       = {F. S. Kolberg and M. Groshaus and A. L. P. Guedes},\\n   language     = {english},\\n   booktitle    =  {Annals of the LAWCG '22 - Latin American Workshop on\\n                  Cliques in Graphs},\\n   pages        = {92},\\n   year         = 2022,\\n   address      = {Curitiba},\\n   url          = {https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf}\\n}\\n\\n\",\"author_short\":[\"Kolberg, F. S.\",\"Groshaus, M.\",\"Guedes, A. L. P.\"],\"key\":\"CruzGroshausGuedesLAWCG2022\",\"id\":\"CruzGroshausGuedesLAWCG2022\",\"bibbaseid\":\"kolberg-groshaus-guedes-onthebicliquegraphsofcirculararcbigraphs-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"FPT algorithm for feedback vertex set in reducible flow hypergraphs\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Faria\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Guedes\"],\"firstnames\":[\"A.\",\"L.\",\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markenzon\"],\"firstnames\":[\"L.\"],\"suffixes\":[]}],\"language\":\"english\",\"booktitle\":\"Annals of the LAWCG '22 - Latin American Workshop on Cliques in Graphs\",\"pages\":\"70\",\"year\":\"2022\",\"address\":\"Curitiba\",\"url\":\"https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf\",\"bibtex\":\"@InProceedings{FariaGuedesMarkenzon2022,\\n   title        =  {FPT algorithm for feedback vertex set in reducible\\n                  flow hypergraphs},\\n   author       =  {Faria, L. and Guedes, A.  L.  P.  and Markenzon, L.},\\n   language     = {english},\\n   booktitle    =  {Annals of the LAWCG '22 - Latin American Workshop on\\n                  Cliques in Graphs},\\n   pages        = {70},\\n   year         = 2022,\\n   address      = {Curitiba},\\n   url          = {https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf}\\n}\\n\\n\",\"author_short\":[\"Faria, L.\",\"Guedes, A. L. P.\",\"Markenzon, L.\"],\"key\":\"FariaGuedesMarkenzon2022\",\"id\":\"FariaGuedesMarkenzon2022\",\"bibbaseid\":\"faria-guedes-markenzon-fptalgorithmforfeedbackvertexsetinreducibleflowhypergraphs-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Biclique Graphs of Interval Containment Bigraphs\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Cruz\"],\"firstnames\":[\"Edmilson\",\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"firstnames\":[\"Marina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Guedes\"],\"firstnames\":[\"André\",\"L.\",\"P.\"],\"suffixes\":[]}],\"journal\":\"Matemática Contemporânea\",\"issn\":\"2317-6636\",\"volume\":\"48\",\"pages\":\"221-230\",\"doi\":\"http://doi.org/10.21711/231766362021/rmc4822\",\"url\":\"https://mc.sbm.org.br/volumes/volume-48/\",\"url_pdf\":\"https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-22-vol-48.pdf\",\"year\":\"2022\",\"bibtex\":\"@article{CruzGroshausGuedes2022MC,\\n  title={Biclique Graphs of Interval Containment Bigraphs},\\n  author={Cruz, Edmilson P. and Groshaus, Marina and Guedes, Andr{\\\\'e} L. P.},\\n  journal={Matem{\\\\'a}tica Contempor{\\\\^a}nea},\\n  issn = {2317-6636},\\n  volume={48},\\n  pages={221-230},\\n  doi = {http://doi.org/10.21711/231766362021/rmc4822},\\n  url = {https://mc.sbm.org.br/volumes/volume-48/},\\n  url_pdf = {https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-22-vol-48.pdf},\\n  year={2022}\\n}\\n\\n\",\"author_short\":[\"Cruz, E. P.\",\"Groshaus, M.\",\"Guedes, A. L. P.\"],\"key\":\"CruzGroshausGuedes2022MC\",\"id\":\"CruzGroshausGuedes2022MC\",\"bibbaseid\":\"cruz-groshaus-guedes-bicliquegraphsofintervalcontainmentbigraphs-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://mc.sbm.org.br/volumes/volume-48/\",\" pdf\":\"https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-22-vol-48.pdf\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Subclass Hierarchy on Circular Arc Bigraphs\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"firstnames\":[\"Marina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Guedes\"],\"firstnames\":[\"André\",\"L.\",\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Kolberg\"],\"firstnames\":[\"Fabricio\",\"S.\"],\"suffixes\":[]}],\"journal\":\"Matemática Contemporânea\",\"issn\":\"2317-6636\",\"volume\":\"48\",\"pages\":\"74-83\",\"doi\":\"http://doi.org/10.21711/231766362021/rmc488\",\"url\":\"https://mc.sbm.org.br/volumes/volume-48/\",\"url_pdf\":\"https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-08-vol-48.pdf\",\"year\":\"2022\",\"bibtex\":\"@article{GroshausGuedesKolberg2022MC,\\n  title={Subclass Hierarchy on Circular Arc Bigraphs},\\n  author={Groshaus, Marina and Guedes, Andr{\\\\'e} L. P. and Kolberg, Fabricio S.},\\n  journal={Matem{\\\\'a}tica Contempor{\\\\^a}nea},\\n  issn = {2317-6636},\\n  volume={48},\\n  pages={74-83},\\n  doi = {http://doi.org/10.21711/231766362021/rmc488},\\n  url = {https://mc.sbm.org.br/volumes/volume-48/},\\n  url_pdf = {https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-08-vol-48.pdf},\\n  year={2022}\\n}\\n\\n\",\"author_short\":[\"Groshaus, M.\",\"Guedes, A. L. P.\",\"Kolberg, F. S.\"],\"key\":\"GroshausGuedesKolberg2022MC\",\"id\":\"GroshausGuedesKolberg2022MC\",\"bibbaseid\":\"groshaus-guedes-kolberg-subclasshierarchyoncirculararcbigraphs-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://mc.sbm.org.br/volumes/volume-48/\",\" pdf\":\"https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-08-vol-48.pdf\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Biclique graphs of split graphs\",\"journal\":\"Discrete Applied Mathematics\",\"volume\":\"323\",\"pages\":\"252-267\",\"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\",\"note\":\"LAGOS’19 – X Latin and American Algorithms, Graphs, and Optimization Symposium – Belo Horizonte, Minas Gerais, Brazil\",\"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},\\nvolume = {323},\\npages = {252-267},\\nyear = {2022},\\nissn = {0166-218X},\\ndoi = {https://doi.org/10.1016/j.dam.2021.12.028},\\nurl = {https://www.sciencedirect.com/science/article/pii/S0166218X2100514X},\\nauthor = {M. Groshaus and A.L.P. Guedes and J.P. Puppo},\\nkeywords = {Bicliques, Biclique graphs, Split graphs, Biclique-complete, -complete},\\nnote = {LAGOS’19 – X Latin and American Algorithms, Graphs, and Optimization Symposium – Belo Horizonte, Minas Gerais, Brazil},\\nabstract = {The biclique graph is the intersection graph of the bicliques of a graph. Its recognition problem is still open. In this paper we study the problem restricted to the class of split graphs. We define a class called nested separable split graphs and solve the recognition problem of biclique graphs of a subclass of the mentioned class. For that, we give a polynomial time algorithm with positive certificate. We also characterize nested split graphs and study properties of biclique graphs of split graphs. For example, we show that they are Hamiltonian. We also present a complexity result for recognizing graphs such that their biclique graphs are complete graphs, that is, we prove that the problem of recognizing biclique-complete graphs in co-NP-complete.}\\n}\\n\\n\",\"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\":\"Edge and Non-edge differentiated Biclique Graphs\",\"author\":[{\"firstnames\":[\"Edmilson\",\"Pereira\",\"Da\"],\"propositions\":[],\"lastnames\":[\"Cruz\"],\"suffixes\":[]},{\"firstnames\":[\"Marina\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"note\":\"XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023)\",\"journal\":\"Procedia Computer Science\",\"volume\":\"223\",\"year\":\"2023\",\"issn\":\"1877-0509\",\"url\":\"http://dx.doi.org/10.1016/j.procs.2023.08.213\",\"doi\":\"10.1016/j.procs.2023.08.213\",\"publisher\":\"Elsevier BV\",\"pages\":\"53–61\",\"bibtex\":\"@article{CruzGroshausGuedesProcedia2023,\\n        title = {Edge and Non-edge differentiated Biclique Graphs},\\n        author = {Edmilson Pereira Da Cruz and Marina Groshaus and André L. P. Guedes},\\n\\tnote={XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023)},\\n        journal={Procedia Computer Science},\\n        volume={223},\\n\\tyear={2023},\\n        ISSN={1877-0509},\\n        url={http://dx.doi.org/10.1016/j.procs.2023.08.213},\\n        DOI={10.1016/j.procs.2023.08.213},\\n        publisher={Elsevier BV},\\n        pages={53–61}\\n}\\n\\n\",\"author_short\":[\"Cruz, E. P. D.\",\"Groshaus, M.\",\"Guedes, A. L. P.\"],\"key\":\"CruzGroshausGuedesProcedia2023\",\"id\":\"CruzGroshausGuedesProcedia2023\",\"bibbaseid\":\"cruz-groshaus-guedes-edgeandnonedgedifferentiatedbicliquegraphs-2023\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://dx.doi.org/10.1016/j.procs.2023.08.213\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Biclique transversal and biclique independen set\",\"author\":[{\"firstnames\":[\"Marina\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"Juan\",\"Carlos\"],\"propositions\":[],\"lastnames\":[\"Terragno\"],\"suffixes\":[]}],\"note\":\"XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023)\",\"journal\":\"Procedia Computer Science\",\"volume\":\"223\",\"year\":\"2023\",\"issn\":\"1877-0509\",\"url\":\"https://doi.org/10.1016/j.procs.2023.08.223\",\"doi\":\"10.1016/j.procs.2023.08.223\",\"publisher\":\"Elsevier BV\",\"pages\":\"140–147\",\"bibtex\":\"@article{GroshausTerragnoProcedia2023,\\n        title = {Biclique transversal and biclique independen set},\\n        author = {Marina Groshaus and Juan Carlos Terragno},\\n\\tnote={XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023)},\\n        journal={Procedia Computer Science},\\n        volume={223},\\n\\tyear={2023},\\n        ISSN={1877-0509},\\n        url={https://doi.org/10.1016/j.procs.2023.08.223},\\n        DOI={10.1016/j.procs.2023.08.223},\\n        publisher={Elsevier BV},\\n        pages={140–147}\\n}\\n\\n\",\"author_short\":[\"Groshaus, M.\",\"Terragno, J. C.\"],\"key\":\"GroshausTerragnoProcedia2023\",\"id\":\"GroshausTerragnoProcedia2023\",\"bibbaseid\":\"groshaus-terragno-bicliquetransversalandbicliqueindependenset-2023\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1016/j.procs.2023.08.223\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"The hardness of recognising poorly matchable graphs and the hunting of the d-snark\",\"volume\":\"58\",\"issn\":\"2804-7303\",\"url\":\"http://dx.doi.org/10.1051/ro/2024068\",\"doi\":\"10.1051/ro/2024068\",\"number\":\"3\",\"journal\":\"RAIRO - Operations Research\",\"publisher\":\"EDP Sciences\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"firstnames\":[\"Leandro\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Carmo\"],\"firstnames\":[\"Renato\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Guedes\"],\"firstnames\":[\"André\",\"L.\",\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Machado\"],\"firstnames\":[\"Raphael\",\"C.\",\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Figueiredo\"],\"firstnames\":[\"Celina\",\"M.\",\"H.\"],\"suffixes\":[]}],\"year\":\"2024\",\"month\":\"May\",\"pages\":\"2055–2073\",\"bibtex\":\"@Article{ZateskoRAIRO2024,\\n   title        = {The hardness of recognising poorly matchable graphs\\n                  and the hunting of the d-snark},\\n   volume       = {58},\\n   issn         = {2804-7303},\\n   url          = {http://dx.doi.org/10.1051/ro/2024068},\\n   doi          = {10.1051/ro/2024068},\\n   number       = {3},\\n   journal      = {RAIRO - Operations Research},\\n   publisher    = {EDP Sciences},\\n   author       = {Zatesko, Leandro M. and Carmo, Renato and Guedes, André\\n                  L. P. and Machado, Raphael C. S. and Figueiredo,\\n                  Celina M. H.},\\n   year         = {2024},\\n   month        = may,\\n   pages        = {2055–2073}\\n}\\n\\n\",\"author_short\":[\"Zatesko, L. M.\",\"Carmo, R.\",\"Guedes, A. L. P.\",\"Machado, R. C. S.\",\"Figueiredo, C. M. H.\"],\"key\":\"ZateskoRAIRO2024\",\"id\":\"ZateskoRAIRO2024\",\"bibbaseid\":\"zatesko-carmo-guedes-machado-figueiredo-thehardnessofrecognisingpoorlymatchablegraphsandthehuntingofthedsnark-2024\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://dx.doi.org/10.1051/ro/2024068\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":6,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Characterisation and total colouring of bipartite graphs with at most three bicliques\",\"author\":[{\"firstnames\":[\"Gustavo\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Montanheiro\"],\"suffixes\":[]},{\"firstnames\":[\"Leandro\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"firstnames\":[\"Marina\"],\"suffixes\":[]}],\"journal\":\"Matemática Contemporânea\",\"issn\":\"2317-6636\",\"volume\":\"55\",\"pages\":\"105-113\",\"doi\":\"http://doi.org/10.21711/231766362023/rmc5512\",\"url\":\"https://mc.sbm.org.br/volumes/volume-55/\",\"url_pdf\":\"https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2023/12/Article-11.pdf\",\"year\":\"2022\",\"bibtex\":\"@article{MontanheiroZateskoGroshaus2023MC,\\n  title={Characterisation and total colouring of bipartite graphs with at most three bicliques},\\n  author={Gustavo L. Montanheiro and Leandro M. Zatesko and Groshaus, Marina},\\n  journal={Matem{\\\\'a}tica Contempor{\\\\^a}nea},\\n  issn = {2317-6636},\\n  volume={55},\\n  pages={105-113},\\n  doi = {http://doi.org/10.21711/231766362023/rmc5512},\\n  url = {https://mc.sbm.org.br/volumes/volume-55/},\\n  url_pdf = {https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2023/12/Article-11.pdf},\\n  year={2022}\\n}\\n\\n\",\"author_short\":[\"Montanheiro, G. L.\",\"Zatesko, L. M.\",\"Groshaus, M.\"],\"key\":\"MontanheiroZateskoGroshaus2023MC\",\"id\":\"MontanheiroZateskoGroshaus2023MC\",\"bibbaseid\":\"montanheiro-zatesko-groshaus-characterisationandtotalcolouringofbipartitegraphswithatmostthreebicliques-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://mc.sbm.org.br/volumes/volume-55/\",\" pdf\":\"https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2023/12/Article-11.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Structural properties of biclique graphs and the distance formula\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Montero\"],\"firstnames\":[\"Leandro\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"firstnames\":[\"Marina\"],\"suffixes\":[]}],\"journal\":\"Australasian Journal of Combinatorics\",\"issn\":\"2202-3518\",\"volume\":\"81\",\"number\":\"2\",\"pages\":\"301-318\",\"url_pdf\":\"https://ajc.maths.uq.edu.au/pdf/81/ajc_v81_p301.pdf\",\"year\":\"2021\",\"bibtex\":\"@article{MonteroGroshaus2021AJC,\\n  title={Structural properties of biclique graphs and the distance formula},\\n  author={Montero, Leandro and Groshaus, Marina},\\n  journal={Australasian Journal of Combinatorics},\\n  issn = {2202-3518},\\n  volume={81},\\n  number={2},\\n  pages={301-318},\\n  url_pdf = {https://ajc.maths.uq.edu.au/pdf/81/ajc_v81_p301.pdf},\\n  year={2021}\\n}\\n\\n\",\"author_short\":[\"Montero, L.\",\"Groshaus, M.\"],\"key\":\"MonteroGroshaus2021AJC\",\"id\":\"MonteroGroshaus2021AJC\",\"bibbaseid\":\"montero-groshaus-structuralpropertiesofbicliquegraphsandthedistanceformula-2021\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://ajc.maths.uq.edu.au/pdf/81/ajc_v81_p301.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Inclusion graphs of biclique parts of K3–free graphs\",\"author\":[{\"firstnames\":[\"Edmilson\",\"P.\"],\"propositions\":[\"da\"],\"lastnames\":[\"Cruz\"],\"suffixes\":[]},{\"firstnames\":[\"Marina\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"language\":\"english\",\"booktitle\":\"Annals of the 11th Latin American Workshop on Cliques in Graphs\",\"pages\":\"41\",\"year\":\"2024\",\"address\":\"Aquiraz\",\"url\":\"https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf\",\"bibtex\":\"@InProceedings{CruzGroshausGuedesLAWCG2024,\\n   title        = {Inclusion graphs of biclique parts of K3–free graphs},\\n   author       = {Edmilson P. da Cruz and Marina Groshaus and André L. P. Guedes},\\n   language     = {english},\\n   booktitle    =  {Annals of the 11th Latin American Workshop on Cliques in Graphs},\\n   pages        = {41},\\n   year         = 2024,\\n   address      = {Aquiraz},\\n   url          = {https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf}\\n}\\n\\n\",\"author_short\":[\"da Cruz, E. P.\",\"Groshaus, M.\",\"Guedes, A. L. P.\"],\"key\":\"CruzGroshausGuedesLAWCG2024\",\"id\":\"CruzGroshausGuedesLAWCG2024\",\"bibbaseid\":\"dacruz-groshaus-guedes-inclusiongraphsofbicliquepartsofk3freegraphs-2024\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"IIC-comparability graphs\",\"author\":[{\"firstnames\":[\"Marina\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]},{\"firstnames\":[\"André\",\"L.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"language\":\"english\",\"booktitle\":\"Annals of the 11th Latin American Workshop on Cliques in Graphs\",\"pages\":\"32\",\"year\":\"2024\",\"address\":\"Aquiraz\",\"url\":\"https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf\",\"bibtex\":\"@InProceedings{GroshausGuedesLAWCG2024,\\n   title        = {IIC-comparability graphs},\\n   author       = {Marina Groshaus and André L. P. Guedes},\\n   language     = {english},\\n   booktitle    =  {Annals of the 11th Latin American Workshop on Cliques in Graphs},\\n   pages        = {32},\\n   year         = 2024,\\n   address      = {Aquiraz},\\n   url          = {https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf}\\n}\\n\\n\",\"author_short\":[\"Groshaus, M.\",\"Guedes, A. L. P.\"],\"key\":\"GroshausGuedesLAWCG2024\",\"id\":\"GroshausGuedesLAWCG2024\",\"bibbaseid\":\"groshaus-guedes-iiccomparabilitygraphs-2024\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Dijkstra Hypergraphs\",\"author\":[{\"firstnames\":[\"Leonardo\"],\"propositions\":[],\"lastnames\":[\"Cavadas\"],\"suffixes\":[]},{\"firstnames\":[\"Luerbio\"],\"propositions\":[],\"lastnames\":[\"Faria\"],\"suffixes\":[]},{\"firstnames\":[\"Lucila\"],\"propositions\":[],\"lastnames\":[\"Bento\"],\"suffixes\":[]},{\"firstnames\":[\"Jayme\"],\"propositions\":[],\"lastnames\":[\"Szwarcfiter\"],\"suffixes\":[]},{\"firstnames\":[\"Lilian\"],\"propositions\":[],\"lastnames\":[\"Markenzon\"],\"suffixes\":[]},{\"firstnames\":[\"André\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]}],\"language\":\"english\",\"booktitle\":\"Annals of the 11th Latin American Workshop on Cliques in Graphs\",\"pages\":\"22\",\"year\":\"2024\",\"address\":\"Aquiraz\",\"url\":\"https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf\",\"bibtex\":\"@InProceedings{CavadasFariaBentoSzwarcfiterMarkenzonGuedesLAWCG2024,\\n   title        = {Dijkstra Hypergraphs},\\n   author       = {Leonardo Cavadas and Luerbio Faria and Lucila Bento and Jayme Szwarcfiter and Lilian Markenzon and André Guedes},\\n   language     = {english},\\n   booktitle    =  {Annals of the 11th Latin American Workshop on Cliques in Graphs},\\n   pages        = {22},\\n   year         = 2024,\\n   address      = {Aquiraz},\\n   url          = {https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf}\\n}\\n\\n\",\"author_short\":[\"Cavadas, L.\",\"Faria, L.\",\"Bento, L.\",\"Szwarcfiter, J.\",\"Markenzon, L.\",\"Guedes, A.\"],\"key\":\"CavadasFariaBentoSzwarcfiterMarkenzonGuedesLAWCG2024\",\"id\":\"CavadasFariaBentoSzwarcfiterMarkenzonGuedesLAWCG2024\",\"bibbaseid\":\"cavadas-faria-bento-szwarcfiter-markenzon-guedes-dijkstrahypergraphs-2024\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Leonardo\"],\"propositions\":[],\"lastnames\":[\"Cavadas\"],\"suffixes\":[]},{\"firstnames\":[\"Luerbio\"],\"propositions\":[],\"lastnames\":[\"Faria\"],\"suffixes\":[]},{\"firstnames\":[\"Lucila\"],\"propositions\":[],\"lastnames\":[\"Bento\"],\"suffixes\":[]},{\"firstnames\":[\"Jayme\"],\"propositions\":[],\"lastnames\":[\"Szwarcfiter\"],\"suffixes\":[]},{\"firstnames\":[\"André\"],\"propositions\":[],\"lastnames\":[\"Guedes\"],\"suffixes\":[]},{\"firstnames\":[\"Lilian\"],\"propositions\":[],\"lastnames\":[\"Markenzon\"],\"suffixes\":[]}],\"title\":\"Hipergrafos de Dijkstra: Reconhecimento e Isomorfismo\",\"booktitle\":\"Anais do IX Encontro de Teoria da Computação\",\"location\":\"Brasília/DF\",\"year\":\"2024\",\"keywords\":\"\",\"issn\":\"2595-6116\",\"pages\":\"105–109\",\"publisher\":\"SBC\",\"address\":\"Porto Alegre, RS, Brasil\",\"doi\":\"10.5753/etc.2024.2998\",\"url\":\"https://sol.sbc.org.br/index.php/etc/article/view/29315\",\"bibtex\":\"@inproceedings{CavadasFariaBentoSzwarcfiterGuedesMarkenzonETC2024,\\n author = {Leonardo Cavadas and Luerbio Faria and Lucila Bento and Jayme Szwarcfiter and André Guedes and Lilian Markenzon},\\n title = { Hipergrafos de Dijkstra: Reconhecimento e Isomorfismo},\\n booktitle = {Anais do IX Encontro de Teoria da Computação},\\n location = {Brasília/DF},\\n year = {2024},\\n keywords = {},\\n issn = {2595-6116},\\n pages = {105--109},\\n publisher = {SBC},\\n address = {Porto Alegre, RS, Brasil},\\n doi = {10.5753/etc.2024.2998},\\n url = {https://sol.sbc.org.br/index.php/etc/article/view/29315}\\n}\\n\\n\\n\",\"author_short\":[\"Cavadas, L.\",\"Faria, L.\",\"Bento, L.\",\"Szwarcfiter, J.\",\"Guedes, A.\",\"Markenzon, L.\"],\"key\":\"CavadasFariaBentoSzwarcfiterGuedesMarkenzonETC2024\",\"id\":\"CavadasFariaBentoSzwarcfiterGuedesMarkenzonETC2024\",\"bibbaseid\":\"cavadas-faria-bento-szwarcfiter-guedes-markenzon-hipergrafosdedijkstrareconhecimentoeisomorfismo-2024\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://sol.sbc.org.br/index.php/etc/article/view/29315\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"FPT and kernelization algorithms for the induced tree problem\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Gomes\"],\"firstnames\":[\"Guilherme\",\"Castro\",\"Mendes\"],\"suffixes\":[]},{\"propositions\":[\"dos\"],\"lastnames\":[\"Santos\"],\"firstnames\":[\"Vinicius\",\"F\"],\"suffixes\":[]},{\"propositions\":[\"da\"],\"lastnames\":[\"Silva\"],\"firstnames\":[\"Murilo\",\"VG\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Szwarcfiter\"],\"firstnames\":[\"Jayme\",\"L\"],\"suffixes\":[]}],\"booktitle\":\"International Conference on Algorithms and Complexity\",\"pages\":\"158–172\",\"year\":\"2021\",\"organization\":\"Springer\",\"bibtex\":\"@inproceedings{gomes2021fpt,\\n  title={FPT and kernelization algorithms for the induced tree problem},\\n  author={Gomes, Guilherme Castro Mendes and dos Santos, Vinicius F and da Silva, Murilo VG and Szwarcfiter, Jayme L},\\n  booktitle={International Conference on Algorithms and Complexity},\\n  pages={158--172},\\n  year={2021},\\n  organization={Springer}\\n}\\n\\n\",\"author_short\":[\"Gomes, G. C. M.\",\"dos Santos, V. F\",\"da Silva, M. V.\",\"Szwarcfiter, J. L\"],\"key\":\"gomes2021fpt\",\"id\":\"gomes2021fpt\",\"bibbaseid\":\"gomes-dossantos-dasilva-szwarcfiter-fptandkernelizationalgorithmsfortheinducedtreeproblem-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs\",\"author\":[{\"propositions\":[\"de\"],\"lastnames\":[\"Lima\"],\"firstnames\":[\"Alane\"],\"suffixes\":[]},{\"propositions\":[\"da\"],\"lastnames\":[\"Silva\"],\"firstnames\":[\"Murilo\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"firstnames\":[\"André\"],\"suffixes\":[]}],\"journal\":\"Journal of Graph Algorithms and Applications\",\"volume\":\"27\",\"number\":\"7\",\"pages\":\"603–619\",\"year\":\"2023\",\"bibtex\":\"@article{de2023range,\\n  title={A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs},\\n  author={de Lima, Alane and da Silva, Murilo and Vignatti, Andr{\\\\'e}},\\n  journal={Journal of Graph Algorithms and Applications},\\n  volume={27},\\n  number={7},\\n  pages={603--619},\\n  year={2023}\\n}\\n\\n\",\"author_short\":[\"de Lima, A.\",\"da Silva, M.\",\"Vignatti, A.\"],\"key\":\"de2023range\",\"id\":\"de2023range\",\"bibbaseid\":\"delima-dasilva-vignatti-arangespacewithconstantvcdimensionforallpairsshortestpathsingraphs-2023\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Percolation centrality via rademacher complexity\",\"author\":[{\"propositions\":[],\"lastnames\":[\"De\",\"Lima\"],\"firstnames\":[\"Alane\",\"M\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Da\",\"Silva\"],\"firstnames\":[\"Murilo\",\"VG\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"firstnames\":[\"André\",\"L\"],\"suffixes\":[]}],\"journal\":\"Discrete Applied Mathematics\",\"volume\":\"323\",\"pages\":\"201–216\",\"year\":\"2022\",\"publisher\":\"Elsevier\",\"bibtex\":\"@article{de2022percolation,\\n  title={Percolation centrality via rademacher complexity},\\n  author={De Lima, Alane M and Da Silva, Murilo VG and Vignatti, Andr{\\\\'e} L},\\n  journal={Discrete Applied Mathematics},\\n  volume={323},\\n  pages={201--216},\\n  year={2022},\\n  publisher={Elsevier}\\n}\\n\\n\",\"author_short\":[\"De Lima, A. M\",\"Da Silva, M. V.\",\"Vignatti, A. L\"],\"key\":\"de2022percolation\",\"id\":\"de2022percolation\",\"bibbaseid\":\"delima-dasilva-vignatti-percolationcentralityviarademachercomplexity-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Estimating the clustering coefficient using sample complexity analysis\",\"author\":[{\"propositions\":[\"de\"],\"lastnames\":[\"Lima\"],\"firstnames\":[\"Alane\",\"M\"],\"suffixes\":[]},{\"propositions\":[\"da\"],\"lastnames\":[\"Silva\"],\"firstnames\":[\"Murilo\",\"VG\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"firstnames\":[\"André\",\"L\"],\"suffixes\":[]}],\"booktitle\":\"Latin American Symposium on Theoretical Informatics\",\"pages\":\"328–341\",\"year\":\"2022\",\"organization\":\"Springer\",\"bibtex\":\"@inproceedings{de2022estimating,\\n  title={Estimating the clustering coefficient using sample complexity analysis},\\n  author={de Lima, Alane M and da Silva, Murilo VG and Vignatti, Andr{\\\\'e} L},\\n  booktitle={Latin American Symposium on Theoretical Informatics},\\n  pages={328--341},\\n  year={2022},\\n  organization={Springer}\\n}\\n\\n\",\"author_short\":[\"de Lima, A. M\",\"da Silva, M. V.\",\"Vignatti, A. L\"],\"key\":\"de2022estimating\",\"id\":\"de2022estimating\",\"bibbaseid\":\"delima-dasilva-vignatti-estimatingtheclusteringcoefficientusingsamplecomplexityanalysis-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]}],\"title\":\"Almost All Complementary Prisms Have Many Pairwise-disjoint Perfect Matchings\",\"language\":\"english\",\"year\":\"2024\",\"booktitle\":\"Proc. XI Latin American Workshop on Cliques in Graphs (LAWCG '24)\",\"address\":\"Aquiraz, Brazil\",\"url\":\"https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf\",\"pages\":\"77\",\"bibtex\":\"@inproceedings{lawcg24,\\n  author = {L. M. Zatesko},\\n  title = {Almost All Complementary Prisms Have Many\\nPairwise-disjoint Perfect Matchings},\\n  language = {english},\\n  year = 2024,\\n  booktitle = {Proc. XI Latin American Workshop on Cliques in Graphs\\n(LAWCG '24)},\\n  address = {Aquiraz, Brazil},\\n  url = {https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf},\\n  pages = {77}\\n}\\n\\n\",\"author_short\":[\"Zatesko, L. M.\"],\"key\":\"lawcg24\",\"id\":\"lawcg24\",\"bibbaseid\":\"zatesko-almostallcomplementaryprismshavemanypairwisedisjointperfectmatchings-2024\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"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\":\"2022\",\"volume\":\"323\",\"pages\":\"311–323\",\"bibtex\":\"@article{alesom21dam,\\n  author = {A. Zorzi and C. M. H. Figueiredo and R. C. S. Machado and\\nL. M. Zatesko and U. S. Souza},\\n  title = {Compositions, Decompositions, and Comformability for Total\\nColoring 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 = 2022,\\n  volume = {323},\\n  pages = {311--323}\\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-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1016/j.dam.2021.06.012\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"T.\",\"H.\",\"F.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Cunha\"],\"suffixes\":[]},{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]}],\"title\":\"A New Bound for the Sum of Squares of Degrees in a Class 2 Graph\",\"language\":\"english\",\"year\":\"2022\",\"booktitle\":\"Proc. X Latin American Workshop on Cliques in Graphs (LAWCG '22)\",\"address\":\"Curitiba\",\"pages\":\"104\",\"url\":\"https://www.lawcg.mat.br/lawcg22/ LAWCG_2022_book_of_abstracts.pdf\",\"bibtex\":\"@inproceedings{lawcg22-thiago,\\n  author = {T. H. F. M. Cunha and L. M. Zatesko},\\n  title = {A New Bound for the Sum of Squares of Degrees in a Class 2\\nGraph},\\n  language = {english},\\n  year = 2022,\\n  booktitle = {Proc. X Latin American Workshop on Cliques in Graphs\\n(LAWCG '22)},\\n  address = {Curitiba},\\n  pages = {104},\\n  url = {https://www.lawcg.mat.br/lawcg22/\\nLAWCG_2022_book_of_abstracts.pdf}\\n}\\n\\n\",\"author_short\":[\"Cunha, T. H. F. M.\",\"Zatesko, L. M.\"],\"key\":\"lawcg22-thiago\",\"id\":\"lawcg22-thiago\",\"bibbaseid\":\"cunha-zatesko-anewboundforthesumofsquaresofdegreesinaclass2graph-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg22/ LAWCG_2022_book_of_abstracts.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"G.\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Montanheiro\"],\"suffixes\":[]},{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]},{\"firstnames\":[\"M.\",\"E.\"],\"propositions\":[],\"lastnames\":[\"Groshaus\"],\"suffixes\":[]}],\"title\":\"On Total Colouring Bipartite Graphs with at Most Three Bicliques\",\"language\":\"english\",\"year\":\"2022\",\"booktitle\":\"Proc. X Latin American Workshop on Cliques in Graphs (LAWCG '22)\",\"address\":\"Curitiba\",\"pages\":\"48\",\"url\":\"https://www.lawcg.mat.br/lawcg22/ LAWCG_2022_book_of_abstracts.pdf\",\"bibtex\":\"@inproceedings{lawcg22-gustavo,\\n  author = {G. L. Montanheiro and L. M. Zatesko and M. E. Groshaus},\\n  title = {On Total Colouring Bipartite Graphs with at Most Three\\nBicliques},\\n  language = {english},\\n  year = 2022,\\n  booktitle = {Proc. X Latin American Workshop on Cliques in Graphs\\n(LAWCG '22)},\\n  address = {Curitiba},\\n  pages = {48},\\n  url = {https://www.lawcg.mat.br/lawcg22/\\nLAWCG_2022_book_of_abstracts.pdf}\\n}\\n\\n\",\"author_short\":[\"Montanheiro, G. L.\",\"Zatesko, L. M.\",\"Groshaus, M. E.\"],\"key\":\"lawcg22-gustavo\",\"id\":\"lawcg22-gustavo\",\"bibbaseid\":\"montanheiro-zatesko-groshaus-ontotalcolouringbipartitegraphswithatmostthreebicliques-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.lawcg.mat.br/lawcg22/ LAWCG_2022_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\":[]}],\"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\\n(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\":[\"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\\nCampos 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\\nMultisunlets},\\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos\\nCampos 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\\nProblem},\\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos\\nCampos 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\":[{\"propositions\":[],\"lastnames\":[\"Abner\",\"F.\",\"B.\",\"Costa\"],\"firstnames\":[\"Henrique\",\"Hepp\"],\"suffixes\":[\"Murilo\",\"V.G.\",\"da\",\"Silva\"]},{\"firstnames\":[\"Leandro\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]}],\"title\":\"The Hidden Subgroup Problem and Non-interactive Perfect Zero-Knowledge Proofs\",\"booktitle\":\"Anais do VIII Encontro de Teoria da Computação\",\"year\":\"2023\",\"keywords\":\"\",\"pages\":\"99–103\",\"publisher\":\"SBC\",\"address\":\"Porto Alegre, RS, Brasil\",\"doi\":\"10.5753/etc.2024.2998\",\"url\":\"https://sol.sbc.org.br/index.php/etc/article/view/29315\",\"bibtex\":\"@inproceedings{Costa2023ETC,\\n author = {Abner F. B. Costa, Henrique Hepp, Murilo V.G. da Silva and Leandro M. Zatesko},\\n title = {The Hidden Subgroup Problem and Non-interactive Perfect Zero-Knowledge Proofs},\\n booktitle = {Anais do VIII Encontro de Teoria da Computação},\\n year = {2023},\\n keywords = {},\\n pages = {99--103},\\n publisher = {SBC},\\n address = {Porto Alegre, RS, Brasil},\\n doi = {10.5753/etc.2024.2998},\\n url = {https://sol.sbc.org.br/index.php/etc/article/view/29315}\\n}\\n\\n\\n\\n\\n\",\"author_short\":[\"Abner F. B. Costa, H. H.\",\"Zatesko, L. M.\"],\"key\":\"Costa2023ETC\",\"id\":\"Costa2023ETC\",\"bibbaseid\":\"abnerfbcosta-zatesko-thehiddensubgroupproblemandnoninteractiveperfectzeroknowledgeproofs-2023\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://sol.sbc.org.br/index.php/etc/article/view/29315\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"misc\",\"author\":[{\"firstnames\":[\"H.\"],\"propositions\":[],\"lastnames\":[\"Hepp\"],\"suffixes\":[]},{\"firstnames\":[\"M.\",\"V.\",\"G.\"],\"propositions\":[],\"lastnames\":[\"Silva\"],\"suffixes\":[]},{\"firstnames\":[\"L.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Zatesko\"],\"suffixes\":[]}],\"title\":\"Oracle Separations for Non-adaptive Collapse-free Quantum Computing\",\"language\":\"english\",\"year\":\"2025\",\"journal\":\"Theor. Comput. Sci.\",\"note\":\"Theor. Comput. Sci. (In Press – https://doi.org/10.1016/j.tcs.2025.115078)\",\"url\":\"https://doi.org/10.1016/j.tcs.2025.115078\",\"bibtex\":\"@misc{hepp25,\\n  author = {H. Hepp and M. V. G. Silva and L. M. Zatesko},\\n  title = {Oracle Separations for Non-adaptive Collapse-free Quantum Computing},\\n  language = {english},\\n  year = 2025,\\n  journal = {Theor. Comput. Sci.},\\n  note = {Theor. Comput. Sci. (In Press  -- https://doi.org/10.1016/j.tcs.2025.115078)},\\n  url = {https://doi.org/10.1016/j.tcs.2025.115078}\\n}\\n\\n\\n\",\"author_short\":[\"Hepp, H.\",\"Silva, M. V. G.\",\"Zatesko, L. M.\"],\"key\":\"hepp25\",\"id\":\"hepp25\",\"bibbaseid\":\"hepp-silva-zatesko-oracleseparationsfornonadaptivecollapsefreequantumcomputing-2025\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1016/j.tcs.2025.115078\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":7,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[\"Alane\",\"M.\",\"de\"],\"lastnames\":[\"Lima\"],\"firstnames\":[\"Murilo\",\"V.\",\"G.\",\"da\",\"Silva\"],\"suffixes\":[]},{\"firstnames\":[\"Andre\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]}],\"language\":\"english\",\"year\":\"2021\",\"title\":\"A Deductive-Formal Derivation for the Preferential Attachment Metric for Link Prediction\",\"booktitle\":\"Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)\",\"address\":\"Ponta Grossa, Brazil\",\"issn\":\"2526-1371\",\"pages\":\"31–36\",\"url\":\"http://www.wpccg.pro.br/volume004.html\",\"bibtex\":\"@inproceedings{Lima21wpccg,\\n  author = {Alane M. de Lima, Murilo V. G. da Silva and Andre L. Vignatti},\\n  language = {english},\\n  year = 2021,\\n  title = {A Deductive-Formal Derivation for the Preferential Attachment Metric for Link Prediction},\\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos\\nCampos Gerais (WPCCG '21)},\\n  address = {Ponta Grossa, Brazil},\\n  issn = {2526-1371},\\n  pages = {31--36},\\n  url = {http://www.wpccg.pro.br/volume004.html}\\n}\\n\\n\\n\",\"author_short\":[\"Alane M. de Lima, M. V. G. d. S.\",\"Vignatti, A. L.\"],\"key\":\"Lima21wpccg\",\"id\":\"Lima21wpccg\",\"bibbaseid\":\"alanemdelima-vignatti-adeductiveformalderivationforthepreferentialattachmentmetricforlinkprediction-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.wpccg.pro.br/volume004.html\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[\"Alane\",\"M.\",\"de\"],\"lastnames\":[\"Lima\"],\"firstnames\":[\"Murilo\",\"V.\",\"G.\",\"da\",\"Silva\"],\"suffixes\":[]},{\"firstnames\":[\"Andre\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]}],\"language\":\"portuguese\",\"year\":\"2021\",\"title\":\"Problema APSP via Dimensão-VC e Médias de Rademacher\",\"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\":\"13–16\",\"bibtex\":\"@inproceedings{Lima21etc,\\n  author = {Alane M. de Lima, Murilo V. G. da Silva and Andre L. Vignatti},\\n  language = {portuguese},\\n  year = 2021,\\n  title = {Problema APSP via Dimensão-VC e Médias de Rademacher},\\n  booktitle = {Proc. 41st Congress of the Brazilian Computer Society\\n(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 = {13--16}\\n}\\n\\n\\n\",\"author_short\":[\"Alane M. de Lima, M. V. G. d. S.\",\"Vignatti, A. L.\"],\"key\":\"Lima21etc\",\"id\":\"Lima21etc\",\"bibbaseid\":\"alanemdelima-vignatti-problemaapspviadimensovcemdiasderademacher-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.5753/etc.2021.16381\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"The generalized influence blocking maximization problem\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fernando\",\"Erd\"],\"firstnames\":[\"Andre\",\"L.\",\"Vignatti\"],\"suffixes\":[]},{\"firstnames\":[\"Murilo\",\"V.G.\"],\"propositions\":[\"da\"],\"lastnames\":[\"Silva\"],\"suffixes\":[]}],\"journal\":\"Soc. Netw. Anal. Min.\",\"volume\":\"11\",\"pages\":\"55\",\"year\":\"2021\",\"publisher\":\"Springer Nature\",\"bibtex\":\"@article{erd21,\\n  title={The generalized influence blocking maximization problem},\\n  author={Fernando Erd, Andre L. Vignatti and Murilo V.G. da Silva},\\n  journal={Soc. Netw. Anal. Min.},\\n  volume={11},\\n  pages={55},\\n  year={2021},\\n  publisher={Springer Nature}\\n}\\n\\n\",\"author_short\":[\"Fernando Erd, A. L. V.\",\"da Silva, M. V.\"],\"key\":\"erd21\",\"id\":\"erd21\",\"bibbaseid\":\"fernandoerd-dasilva-thegeneralizedinfluenceblockingmaximizationproblem-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Fernando\"],\"propositions\":[],\"lastnames\":[\"Druszcz\"],\"suffixes\":[]},{\"firstnames\":[\"André\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]}],\"title\":\"Citation Analysis Disparity Between Sub-Areas of Brazilian Computer Science\",\"booktitle\":\"Anais do XIII Brazilian Workshop on Social Network Analysis and Mining\",\"location\":\"Brasília/DF\",\"year\":\"2024\",\"keywords\":\"\",\"issn\":\"2595-6094\",\"pages\":\"24–34\",\"publisher\":\"SBC\",\"address\":\"Porto Alegre, RS, Brasil\",\"doi\":\"10.5753/brasnam.2024.1922\",\"url\":\"https://sol.sbc.org.br/index.php/brasnam/article/view/29330\",\"bibtex\":\"@inproceedings{brasnam24,\\n author = {Fernando Druszcz and André Vignatti},\\n title = { Citation Analysis Disparity Between Sub-Areas of Brazilian Computer Science},\\n booktitle = {Anais do XIII Brazilian Workshop on Social Network Analysis and Mining},\\n location = {Brasília/DF},\\n year = {2024},\\n keywords = {},\\n issn = {2595-6094},\\n pages = {24--34},\\n publisher = {SBC},\\n address = {Porto Alegre, RS, Brasil},\\n doi = {10.5753/brasnam.2024.1922},\\n url = {https://sol.sbc.org.br/index.php/brasnam/article/view/29330}\\n}\\n\\n\",\"author_short\":[\"Druszcz, F.\",\"Vignatti, A.\"],\"key\":\"brasnam24\",\"id\":\"brasnam24\",\"bibbaseid\":\"druszcz-vignatti-citationanalysisdisparitybetweensubareasofbraziliancomputerscience-2024\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://sol.sbc.org.br/index.php/brasnam/article/view/29330\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[\"Alane\",\"M.\",\"de\"],\"lastnames\":[\"Lima\"],\"firstnames\":[\"Murilo\",\"V.\",\"G.\",\"da\",\"Silva\"],\"suffixes\":[]},{\"firstnames\":[\"Andre\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Vignatti\"],\"suffixes\":[]}],\"title\":\"Sample complexity in graph problems (contributed talk)\",\"language\":\"english\",\"year\":\"2021\",\"bibtex\":\"@inproceedings{canadam21,\\n  author = {Alane M. de Lima, Murilo V. G. da Silva and Andre L. Vignatti},\\n   title = {Sample complexity in graph problems (contributed talk)},\\n  language = {english},\\n  year = 2021\\n}\\n\\n\\n\\n\\n\",\"author_short\":[\"Alane M. de Lima, M. V. G. d. S.\",\"Vignatti, A. L.\"],\"key\":\"canadam21\",\"id\":\"canadam21\",\"bibbaseid\":\"alanemdelima-vignatti-samplecomplexityingraphproblemscontributedtalk-2021\",\"role\":\"author\",\"urls\":{},\"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,@article{GroshausGuedesProcedia2021,
title        = "Biclique Graphs of K3-free Graphs and Bipartite
                  Graphs",
   author       = "Marina Groshaus and André L. P. Guedes",
   journal      = {Procedia Computer Science},
   volume       = {195},
   year         = "2021",
   ISSN         = {1877-0509},
   url          = {http://dx.doi.org/10.1016/j.procs.2021.11.029},
   DOI          = {10.1016/j.procs.2021.11.029},
   publisher    = {Elsevier BV},
   pages        = {230–238},
   note         = {Proceedings of the XI Latin and American Algorithms,
                  Graphs and Optimization Symposium.},
   keywords     = {Bicliques, Biclique graphs, Intersection graphs,
                  Triangle-free graphs, Bipartite graphs, Comparability
                  graphs, Power of a graph},
   abstract     = {A biclique of a graph is a maximal complete bipartite
                  subgraph.  The biclique graph of a graph G, KB(G),
                  defined as the intersection graph of the bicliques of
                  G, was introduced and characterized in 2010 by
                  Groshaus and Szwarcfiter. However, this
                  characterization does not lead to polynomial time
                  recognition algorithms, and the time complexity of its
                  recognition problem remains open. There are some works
                  on this problem when restricted to some classes. In
                  this work we give a characterization of the biclique
                  graph of a K3-free graph G. We prove that KB(G) is the
                  square graph of a particular graph which we call
                  Mutually Included Biclique Graph of G,
                  KBm(G). Although it does not lead to a polynomial time
                  recognition algorithm, it gives a new tool to prove
                  properties of biclique graphs (restricted to K3-free
                  graphs) using known properties of square graphs. For
                  instance we generalize a property about induced P3's
                  in biclique graphs to a property about stars and
                  proved a conjecture posted by Groshaus and Montero,
                  when restricted to K3-free graphs.  Also we give
                  another characterization of the class of biclique
                  graphs of bipartite graphs. We prove that
                  KB(bipartite) = (IIC-comparability)2, where
                  IIC-comparability is a subclass of comparability
                  graphs that we call Interval Intersection Closed
                  Comparability.}
}



@article{FariaGuedesMarkenzonProcedia2021,
title = "On feedback vertex set in reducible flow hypergraphs",
journal = {Procedia Computer Science},
volume = {195},
pages = {212-220},
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.027},
url = {https://www.sciencedirect.com/science/article/pii/S1877050921021669},
author = {Luerbio Faria and André L. P. Guedes and Lilian Markenzon},
keywords = {directed hypergraphs, feedback vertex set, NP-complete, approximation algorithms},
abstract = {A directed hypergraph H = (V, A) is a finite set of vertices V and a set of hyper-arcs A, where each hyper-arc is an ordered pair of nonempty subsets of vertices. A flow hypergraph H = (V, A, s) is a triple, such that (V, A) is a directed hypergraph, s e V is a distinguished vertex such that s reaches every vertex of V. Reducible flow hypergraphs are a generalization of Hecht and Ullman’s reducible flowgraphs. The feedback vertex set (fvs) decision problem has a directed hypergraph H and an integer k ≥ 0 as input and the question is whether there is V'⊆V, |V' |≤k such that H\V' is an acyclic directed hypergraph. It is known that fvs is polynomial time solvable for reducible flowgraphs. In this article we prove that fvs is NP-complete for reducible flow hypergraphs showing a reduction from 3-satisfiability problem with at most 3 occurrences per variable (3sat3-). We exhibit a polynomial-time ∆-approximation for fvs in reducible flow hypergraphs, where ∆ is the maximum number of hyper-arcs adjacent to a vertex of H.}
}



@InProceedings{CruzGroshausGuedesLAWCG2022,
   title        = {On the Biclique Graphs of Circular Arc Bigraphs},
   author       = {F. S. Kolberg and M. Groshaus and A. L. P. Guedes},
   language     = {english},
   booktitle    =  {Annals of the LAWCG '22 - Latin American Workshop on
                  Cliques in Graphs},
   pages        = {92},
   year         = 2022,
   address      = {Curitiba},
   url          = {https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf}
}



@InProceedings{FariaGuedesMarkenzon2022,
   title        =  {FPT algorithm for feedback vertex set in reducible
                  flow hypergraphs},
   author       =  {Faria, L. and Guedes, A.  L.  P.  and Markenzon, L.},
   language     = {english},
   booktitle    =  {Annals of the LAWCG '22 - Latin American Workshop on
                  Cliques in Graphs},
   pages        = {70},
   year         = 2022,
   address      = {Curitiba},
   url          = {https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf}
}



@article{CruzGroshausGuedes2022MC,
  title={Biclique Graphs of Interval Containment Bigraphs},
  author={Cruz, Edmilson P. and Groshaus, Marina and Guedes, Andr{\'e} L. P.},
  journal={Matem{\'a}tica Contempor{\^a}nea},
  issn = {2317-6636},
  volume={48},
  pages={221-230},
  doi = {http://doi.org/10.21711/231766362021/rmc4822},
  url = {https://mc.sbm.org.br/volumes/volume-48/},
  url_pdf = {https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-22-vol-48.pdf},
  year={2022}
}



@article{GroshausGuedesKolberg2022MC,
  title={Subclass Hierarchy on Circular Arc Bigraphs},
  author={Groshaus, Marina and Guedes, Andr{\'e} L. P. and Kolberg, Fabricio S.},
  journal={Matem{\'a}tica Contempor{\^a}nea},
  issn = {2317-6636},
  volume={48},
  pages={74-83},
  doi = {http://doi.org/10.21711/231766362021/rmc488},
  url = {https://mc.sbm.org.br/volumes/volume-48/},
  url_pdf = {https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-08-vol-48.pdf},
  year={2022}
}



@article{GroshausGuedesPuppo2022,
title = {Biclique graphs of split graphs},
journal = {Discrete Applied Mathematics},
volume = {323},
pages = {252-267},
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},
note = {LAGOS’19 – X Latin and American Algorithms, Graphs, and Optimization Symposium – Belo Horizonte, Minas Gerais, Brazil},
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{CruzGroshausGuedesProcedia2023,
        title = {Edge and Non-edge differentiated Biclique Graphs},
        author = {Edmilson Pereira Da Cruz and Marina Groshaus and André L. P. Guedes},
	note={XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023)},
        journal={Procedia Computer Science},
        volume={223},
	year={2023},
        ISSN={1877-0509},
        url={http://dx.doi.org/10.1016/j.procs.2023.08.213},
        DOI={10.1016/j.procs.2023.08.213},
        publisher={Elsevier BV},
        pages={53–61}
}



@article{GroshausTerragnoProcedia2023,
        title = {Biclique transversal and biclique independen set},
        author = {Marina Groshaus and Juan Carlos Terragno},
	note={XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023)},
        journal={Procedia Computer Science},
        volume={223},
	year={2023},
        ISSN={1877-0509},
        url={https://doi.org/10.1016/j.procs.2023.08.223},
        DOI={10.1016/j.procs.2023.08.223},
        publisher={Elsevier BV},
        pages={140–147}
}



@Article{ZateskoRAIRO2024,
   title        = {The hardness of recognising poorly matchable graphs
                  and the hunting of the d-snark},
   volume       = {58},
   issn         = {2804-7303},
   url          = {http://dx.doi.org/10.1051/ro/2024068},
   doi          = {10.1051/ro/2024068},
   number       = {3},
   journal      = {RAIRO - Operations Research},
   publisher    = {EDP Sciences},
   author       = {Zatesko, Leandro M. and Carmo, Renato and Guedes, André
                  L. P. and Machado, Raphael C. S. and Figueiredo,
                  Celina M. H.},
   year         = {2024},
   month        = may,
   pages        = {2055–2073}
}



@article{MontanheiroZateskoGroshaus2023MC,
  title={Characterisation and total colouring of bipartite graphs with at most three bicliques},
  author={Gustavo L. Montanheiro and Leandro M. Zatesko and Groshaus, Marina},
  journal={Matem{\'a}tica Contempor{\^a}nea},
  issn = {2317-6636},
  volume={55},
  pages={105-113},
  doi = {http://doi.org/10.21711/231766362023/rmc5512},
  url = {https://mc.sbm.org.br/volumes/volume-55/},
  url_pdf = {https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2023/12/Article-11.pdf},
  year={2022}
}



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



@InProceedings{CruzGroshausGuedesLAWCG2024,
   title        = {Inclusion graphs of biclique parts of K3–free graphs},
   author       = {Edmilson P. da Cruz and Marina Groshaus and André L. P. Guedes},
   language     = {english},
   booktitle    =  {Annals of the 11th Latin American Workshop on Cliques in Graphs},
   pages        = {41},
   year         = 2024,
   address      = {Aquiraz},
   url          = {https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf}
}



@InProceedings{GroshausGuedesLAWCG2024,
   title        = {IIC-comparability graphs},
   author       = {Marina Groshaus and André L. P. Guedes},
   language     = {english},
   booktitle    =  {Annals of the 11th Latin American Workshop on Cliques in Graphs},
   pages        = {32},
   year         = 2024,
   address      = {Aquiraz},
   url          = {https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf}
}



@InProceedings{CavadasFariaBentoSzwarcfiterMarkenzonGuedesLAWCG2024,
   title        = {Dijkstra Hypergraphs},
   author       = {Leonardo Cavadas and Luerbio Faria and Lucila Bento and Jayme Szwarcfiter and Lilian Markenzon and André Guedes},
   language     = {english},
   booktitle    =  {Annals of the 11th Latin American Workshop on Cliques in Graphs},
   pages        = {22},
   year         = 2024,
   address      = {Aquiraz},
   url          = {https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf}
}



@inproceedings{CavadasFariaBentoSzwarcfiterGuedesMarkenzonETC2024,
 author = {Leonardo Cavadas and Luerbio Faria and Lucila Bento and Jayme Szwarcfiter and André Guedes and Lilian Markenzon},
 title = { Hipergrafos de Dijkstra: Reconhecimento e Isomorfismo},
 booktitle = {Anais do IX Encontro de Teoria da Computação},
 location = {Brasília/DF},
 year = {2024},
 keywords = {},
 issn = {2595-6116},
 pages = {105--109},
 publisher = {SBC},
 address = {Porto Alegre, RS, Brasil},
 doi = {10.5753/etc.2024.2998},
 url = {https://sol.sbc.org.br/index.php/etc/article/view/29315}
}




@inproceedings{gomes2021fpt,
  title={FPT and kernelization algorithms for the induced tree problem},
  author={Gomes, Guilherme Castro Mendes and dos Santos, Vinicius F and da Silva, Murilo VG and Szwarcfiter, Jayme L},
  booktitle={International Conference on Algorithms and Complexity},
  pages={158--172},
  year={2021},
  organization={Springer}
}



@article{de2023range,
  title={A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs},
  author={de Lima, Alane and da Silva, Murilo and Vignatti, Andr{\'e}},
  journal={Journal of Graph Algorithms and Applications},
  volume={27},
  number={7},
  pages={603--619},
  year={2023}
}



@article{de2022percolation,
  title={Percolation centrality via rademacher complexity},
  author={De Lima, Alane M and Da Silva, Murilo VG and Vignatti, Andr{\'e} L},
  journal={Discrete Applied Mathematics},
  volume={323},
  pages={201--216},
  year={2022},
  publisher={Elsevier}
}



@inproceedings{de2022estimating,
  title={Estimating the clustering coefficient using sample complexity analysis},
  author={de Lima, Alane M and da Silva, Murilo VG and Vignatti, Andr{\'e} L},
  booktitle={Latin American Symposium on Theoretical Informatics},
  pages={328--341},
  year={2022},
  organization={Springer}
}



@inproceedings{lawcg24,
  author = {L. M. Zatesko},
  title = {Almost All Complementary Prisms Have Many
Pairwise-disjoint Perfect Matchings},
  language = {english},
  year = 2024,
  booktitle = {Proc. XI Latin American Workshop on Cliques in Graphs
(LAWCG '24)},
  address = {Aquiraz, Brazil},
  url = {https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf},
  pages = {77}
}



@article{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 = 2022,
  volume = {323},
  pages = {311--323}
}



@inproceedings{lawcg22-thiago,
  author = {T. H. F. M. Cunha and L. M. Zatesko},
  title = {A New Bound for the Sum of Squares of Degrees in a Class 2
Graph},
  language = {english},
  year = 2022,
  booktitle = {Proc. X Latin American Workshop on Cliques in Graphs
(LAWCG '22)},
  address = {Curitiba},
  pages = {104},
  url = {https://www.lawcg.mat.br/lawcg22/
LAWCG_2022_book_of_abstracts.pdf}
}



@inproceedings{lawcg22-gustavo,
  author = {G. L. Montanheiro and L. M. Zatesko and M. E. Groshaus},
  title = {On Total Colouring Bipartite Graphs with at Most Three
Bicliques},
  language = {english},
  year = 2022,
  booktitle = {Proc. X Latin American Workshop on Cliques in Graphs
(LAWCG '22)},
  address = {Curitiba},
  pages = {48},
  url = {https://www.lawcg.mat.br/lawcg22/
LAWCG_2022_book_of_abstracts.pdf}
}



@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{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{Costa2023ETC,
 author = {Abner F. B. Costa, Henrique Hepp, Murilo V.G. da Silva and Leandro M. Zatesko},
 title = {The Hidden Subgroup Problem and Non-interactive Perfect Zero-Knowledge Proofs},
 booktitle = {Anais do VIII Encontro de Teoria da Computação},
 year = {2023},
 keywords = {},
 pages = {99--103},
 publisher = {SBC},
 address = {Porto Alegre, RS, Brasil},
 doi = {10.5753/etc.2024.2998},
 url = {https://sol.sbc.org.br/index.php/etc/article/view/29315}
}






@misc{hepp25,
  author = {H. Hepp and M. V. G. Silva and L. M. Zatesko},
  title = {Oracle Separations for Non-adaptive Collapse-free Quantum Computing},
  language = {english},
  year = 2025,
  journal = {Theor. Comput. Sci.},
  note = {Theor. Comput. Sci. (In Press  -- https://doi.org/10.1016/j.tcs.2025.115078)},
  url = {https://doi.org/10.1016/j.tcs.2025.115078}
}




@inproceedings{Lima21wpccg,
  author = {Alane M. de Lima, Murilo V. G. da Silva and Andre L. Vignatti},
  language = {english},
  year = 2021,
  title = {A Deductive-Formal Derivation for the Preferential Attachment Metric for Link Prediction},
  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos
Campos Gerais (WPCCG '21)},
  address = {Ponta Grossa, Brazil},
  issn = {2526-1371},
  pages = {31--36},
  url = {http://www.wpccg.pro.br/volume004.html}
}




@inproceedings{Lima21etc,
  author = {Alane M. de Lima, Murilo V. G. da Silva and Andre L. Vignatti},
  language = {portuguese},
  year = 2021,
  title = {Problema APSP via Dimensão-VC e Médias de Rademacher},
  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 = {13--16}
}




@article{erd21,
  title={The generalized influence blocking maximization problem},
  author={Fernando Erd, Andre L. Vignatti and Murilo V.G. da Silva},
  journal={Soc. Netw. Anal. Min.},
  volume={11},
  pages={55},
  year={2021},
  publisher={Springer Nature}
}



@inproceedings{brasnam24,
 author = {Fernando Druszcz and André Vignatti},
 title = { Citation Analysis Disparity Between Sub-Areas of Brazilian Computer Science},
 booktitle = {Anais do XIII Brazilian Workshop on Social Network Analysis and Mining},
 location = {Brasília/DF},
 year = {2024},
 keywords = {},
 issn = {2595-6094},
 pages = {24--34},
 publisher = {SBC},
 address = {Porto Alegre, RS, Brasil},
 doi = {10.5753/brasnam.2024.1922},
 url = {https://sol.sbc.org.br/index.php/brasnam/article/view/29330}
}



@inproceedings{canadam21,
  author = {Alane M. de Lima, Murilo V. G. da Silva and Andre L. Vignatti},
   title = {Sample complexity in graph problems (contributed talk)},
  language = {english},
  year = 2021
}




\">\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/universal2021/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/universal2021/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%2Funiversal2021%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%2Funiversal2021%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%2Funiversal2021%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_2025\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2025')\"\n      onkeypress=\"toggleGroup('group_2025')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2025</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"hepp-silva-zatesko-oracleseparationsfornonadaptivecollapsefreequantumcomputing-2025\">\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.2025.115078\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hepp-silva-zatesko-oracleseparationsfornonadaptivecollapsefreequantumcomputing-2025', 'https://doi.org/10.1016/j.tcs.2025.115078', event);\">\n    Oracle Separations for Non-adaptive Collapse-free Quantum Computing.\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   2025.\n  <span class=\"note\">Theor. Comput. Sci. (In Press – https://doi.org/10.1016/j.tcs.2025.115078)</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.2025.115078\"\n     onclick=\"log_download('hepp-silva-zatesko-oracleseparationsfornonadaptivecollapsefreequantumcomputing-2025', 'https://doi.org/10.1016/j.tcs.2025.115078', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Oracle Separations for Non-adaptive Collapse-free Quantum Computing [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-oracleseparationsfornonadaptivecollapsefreequantumcomputing-2025\"\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>7 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hepp-silva-zatesko-oracleseparationsfornonadaptivecollapsefreequantumcomputing-2025')\" -->\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{hepp25,\n  author = {H. Hepp and M. V. G. Silva and L. M. Zatesko},\n  title = {Oracle Separations for Non-adaptive Collapse-free Quantum Computing},\n  language = {english},\n  year = 2025,\n  journal = {Theor. Comput. Sci.},\n  note = {Theor. Comput. Sci. (In Press  -- https://doi.org/10.1016/j.tcs.2025.115078)},\n  url = {https://doi.org/10.1016/j.tcs.2025.115078}\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_2024\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2024')\"\n      onkeypress=\"toggleGroup('group_2024')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2024</span>\n      <span class=\"bibbase_group_count\">\n        \n        (7)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"zatesko-carmo-guedes-machado-figueiredo-thehardnessofrecognisingpoorlymatchablegraphsandthehuntingofthedsnark-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://dx.doi.org/10.1051/ro/2024068\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zatesko-carmo-guedes-machado-figueiredo-thehardnessofrecognisingpoorlymatchablegraphsandthehuntingofthedsnark-2024', 'http://dx.doi.org/10.1051/ro/2024068', event);\">\n    The hardness of recognising poorly matchable graphs and the hunting of the d-snark.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Leandro M. Zatesko;  Renato Carmo;  André L. P. Guedes;  Raphael C. S. Machado;  and  Celina M. H. Figueiredo.\n</span>\n\n  \n\n</span>\n\n  <i>RAIRO - Operations Research</i>, 58(3): 2055–2073. May 2024.\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://dx.doi.org/10.1051/ro/2024068\"\n     onclick=\"log_download('zatesko-carmo-guedes-machado-figueiredo-thehardnessofrecognisingpoorlymatchablegraphsandthehuntingofthedsnark-2024', 'http://dx.doi.org/10.1051/ro/2024068', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The hardness of recognising poorly matchable graphs and the hunting of the d-snark [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.1051/ro/2024068\"\n     onclick=\"log_download('zatesko-carmo-guedes-machado-figueiredo-thehardnessofrecognisingpoorlymatchablegraphsandthehuntingofthedsnark-2024', 'http://doi.org/10.1051/ro/2024068', 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-machado-figueiredo-thehardnessofrecognisingpoorlymatchablegraphsandthehuntingofthedsnark-2024\"\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>6 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zatesko-carmo-guedes-machado-figueiredo-thehardnessofrecognisingpoorlymatchablegraphsandthehuntingofthedsnark-2024')\" -->\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{ZateskoRAIRO2024,\n   title        = {The hardness of recognising poorly matchable graphs\n                  and the hunting of the d-snark},\n   volume       = {58},\n   issn         = {2804-7303},\n   url          = {http://dx.doi.org/10.1051/ro/2024068},\n   doi          = {10.1051/ro/2024068},\n   number       = {3},\n   journal      = {RAIRO - Operations Research},\n   publisher    = {EDP Sciences},\n   author       = {Zatesko, Leandro M. and Carmo, Renato and Guedes, André\n                  L. P. and Machado, Raphael C. S. and Figueiredo,\n                  Celina M. H.},\n   year         = {2024},\n   month        = may,\n   pages        = {2055–2073}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dacruz-groshaus-guedes-inclusiongraphsofbicliquepartsofk3freegraphs-2024\">\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/lawcg24/LAWCG2024-annals.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dacruz-groshaus-guedes-inclusiongraphsofbicliquepartsofk3freegraphs-2024', 'https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf', event);\">\n    Inclusion graphs of biclique parts of K3–free graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Edmilson P. Cruz;  Marina Groshaus;  and  André L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Annals of the 11th Latin American Workshop on Cliques in Graphs</i>, pages 41, Aquiraz,  2024. \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/lawcg24/LAWCG2024-annals.pdf\"\n     onclick=\"log_download('dacruz-groshaus-guedes-inclusiongraphsofbicliquepartsofk3freegraphs-2024', 'https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Inclusion graphs of biclique parts of K3–free 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/dacruz-groshaus-guedes-inclusiongraphsofbicliquepartsofk3freegraphs-2024\"\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('dacruz-groshaus-guedes-inclusiongraphsofbicliquepartsofk3freegraphs-2024')\" -->\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{CruzGroshausGuedesLAWCG2024,\n   title        = {Inclusion graphs of biclique parts of K3–free graphs},\n   author       = {Edmilson P. da Cruz and Marina Groshaus and André L. P. Guedes},\n   language     = {english},\n   booktitle    =  {Annals of the 11th Latin American Workshop on Cliques in Graphs},\n   pages        = {41},\n   year         = 2024,\n   address      = {Aquiraz},\n   url          = {https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"groshaus-guedes-iiccomparabilitygraphs-2024\">\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/lawcg24/LAWCG2024-annals.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'groshaus-guedes-iiccomparabilitygraphs-2024', 'https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf', event);\">\n    IIC-comparability graphs.\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>Annals of the 11th Latin American Workshop on Cliques in Graphs</i>, pages 32, Aquiraz,  2024. \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/lawcg24/LAWCG2024-annals.pdf\"\n     onclick=\"log_download('groshaus-guedes-iiccomparabilitygraphs-2024', 'https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"IIC-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/groshaus-guedes-iiccomparabilitygraphs-2024\"\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('groshaus-guedes-iiccomparabilitygraphs-2024')\" -->\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{GroshausGuedesLAWCG2024,\n   title        = {IIC-comparability graphs},\n   author       = {Marina Groshaus and André L. P. Guedes},\n   language     = {english},\n   booktitle    =  {Annals of the 11th Latin American Workshop on Cliques in Graphs},\n   pages        = {32},\n   year         = 2024,\n   address      = {Aquiraz},\n   url          = {https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cavadas-faria-bento-szwarcfiter-markenzon-guedes-dijkstrahypergraphs-2024\">\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/lawcg24/LAWCG2024-annals.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cavadas-faria-bento-szwarcfiter-markenzon-guedes-dijkstrahypergraphs-2024', 'https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf', event);\">\n    Dijkstra Hypergraphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Leonardo Cavadas;  Luerbio Faria;  Lucila Bento;  Jayme Szwarcfiter;  Lilian Markenzon;  and  André Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Annals of the 11th Latin American Workshop on Cliques in Graphs</i>, pages 22, Aquiraz,  2024. \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/lawcg24/LAWCG2024-annals.pdf\"\n     onclick=\"log_download('cavadas-faria-bento-szwarcfiter-markenzon-guedes-dijkstrahypergraphs-2024', 'https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Dijkstra Hypergraphs [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/cavadas-faria-bento-szwarcfiter-markenzon-guedes-dijkstrahypergraphs-2024\"\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('cavadas-faria-bento-szwarcfiter-markenzon-guedes-dijkstrahypergraphs-2024')\" -->\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{CavadasFariaBentoSzwarcfiterMarkenzonGuedesLAWCG2024,\n   title        = {Dijkstra Hypergraphs},\n   author       = {Leonardo Cavadas and Luerbio Faria and Lucila Bento and Jayme Szwarcfiter and Lilian Markenzon and André Guedes},\n   language     = {english},\n   booktitle    =  {Annals of the 11th Latin American Workshop on Cliques in Graphs},\n   pages        = {22},\n   year         = 2024,\n   address      = {Aquiraz},\n   url          = {https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cavadas-faria-bento-szwarcfiter-guedes-markenzon-hipergrafosdedijkstrareconhecimentoeisomorfismo-2024\">\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/29315\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cavadas-faria-bento-szwarcfiter-guedes-markenzon-hipergrafosdedijkstrareconhecimentoeisomorfismo-2024', 'https://sol.sbc.org.br/index.php/etc/article/view/29315', event);\">\n    Hipergrafos de Dijkstra: Reconhecimento e Isomorfismo.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Leonardo Cavadas;  Luerbio Faria;  Lucila Bento;  Jayme Szwarcfiter;  André Guedes;  and  Lilian Markenzon.\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do IX Encontro de Teoria da Computação</i>, pages 105–109, Porto Alegre, RS, Brasil,  2024. 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/etc/article/view/29315\"\n     onclick=\"log_download('cavadas-faria-bento-szwarcfiter-guedes-markenzon-hipergrafosdedijkstrareconhecimentoeisomorfismo-2024', 'https://sol.sbc.org.br/index.php/etc/article/view/29315', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Hipergrafos de Dijkstra: Reconhecimento e Isomorfismo [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/etc.2024.2998\"\n     onclick=\"log_download('cavadas-faria-bento-szwarcfiter-guedes-markenzon-hipergrafosdedijkstrareconhecimentoeisomorfismo-2024', 'http://doi.org/10.5753/etc.2024.2998', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cavadas-faria-bento-szwarcfiter-guedes-markenzon-hipergrafosdedijkstrareconhecimentoeisomorfismo-2024\"\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('cavadas-faria-bento-szwarcfiter-guedes-markenzon-hipergrafosdedijkstrareconhecimentoeisomorfismo-2024')\" -->\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{CavadasFariaBentoSzwarcfiterGuedesMarkenzonETC2024,\n author = {Leonardo Cavadas and Luerbio Faria and Lucila Bento and Jayme Szwarcfiter and André Guedes and Lilian Markenzon},\n title = { Hipergrafos de Dijkstra: Reconhecimento e Isomorfismo},\n booktitle = {Anais do IX Encontro de Teoria da Computação},\n location = {Brasília/DF},\n year = {2024},\n keywords = {},\n issn = {2595-6116},\n pages = {105--109},\n publisher = {SBC},\n address = {Porto Alegre, RS, Brasil},\n doi = {10.5753/etc.2024.2998},\n url = {https://sol.sbc.org.br/index.php/etc/article/view/29315}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"zatesko-almostallcomplementaryprismshavemanypairwisedisjointperfectmatchings-2024\">\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/lawcg24/LAWCG2024-annals.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zatesko-almostallcomplementaryprismshavemanypairwisedisjointperfectmatchings-2024', 'https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf', event);\">\n    Almost All Complementary Prisms Have Many Pairwise-disjoint Perfect Matchings.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   L. M. Zatesko.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. XI Latin American Workshop on Cliques in Graphs (LAWCG '24)</i>, pages 77, Aquiraz, Brazil,  2024. \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/lawcg24/LAWCG2024-annals.pdf\"\n     onclick=\"log_download('zatesko-almostallcomplementaryprismshavemanypairwisedisjointperfectmatchings-2024', 'https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Almost All Complementary Prisms Have Many Pairwise-disjoint Perfect Matchings [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-almostallcomplementaryprismshavemanypairwisedisjointperfectmatchings-2024\"\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-almostallcomplementaryprismshavemanypairwisedisjointperfectmatchings-2024')\" -->\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{lawcg24,\n  author = {L. M. Zatesko},\n  title = {Almost All Complementary Prisms Have Many\nPairwise-disjoint Perfect Matchings},\n  language = {english},\n  year = 2024,\n  booktitle = {Proc. XI Latin American Workshop on Cliques in Graphs\n(LAWCG &#x27;24)},\n  address = {Aquiraz, Brazil},\n  url = {https://www.lawcg.mat.br/lawcg24/LAWCG2024-annals.pdf},\n  pages = {77}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"druszcz-vignatti-citationanalysisdisparitybetweensubareasofbraziliancomputerscience-2024\">\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/brasnam/article/view/29330\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'druszcz-vignatti-citationanalysisdisparitybetweensubareasofbraziliancomputerscience-2024', 'https://sol.sbc.org.br/index.php/brasnam/article/view/29330', event);\">\n    Citation Analysis Disparity Between Sub-Areas of Brazilian Computer Science.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Fernando Druszcz;  and  André Vignatti.\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do XIII Brazilian Workshop on Social Network Analysis and Mining</i>, pages 24–34, Porto Alegre, RS, Brasil,  2024. 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/brasnam/article/view/29330\"\n     onclick=\"log_download('druszcz-vignatti-citationanalysisdisparitybetweensubareasofbraziliancomputerscience-2024', 'https://sol.sbc.org.br/index.php/brasnam/article/view/29330', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Citation Analysis Disparity Between Sub-Areas of Brazilian Computer Science [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/brasnam.2024.1922\"\n     onclick=\"log_download('druszcz-vignatti-citationanalysisdisparitybetweensubareasofbraziliancomputerscience-2024', 'http://doi.org/10.5753/brasnam.2024.1922', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/druszcz-vignatti-citationanalysisdisparitybetweensubareasofbraziliancomputerscience-2024\"\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('druszcz-vignatti-citationanalysisdisparitybetweensubareasofbraziliancomputerscience-2024')\" -->\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{brasnam24,\n author = {Fernando Druszcz and André Vignatti},\n title = { Citation Analysis Disparity Between Sub-Areas of Brazilian Computer Science},\n booktitle = {Anais do XIII Brazilian Workshop on Social Network Analysis and Mining},\n location = {Brasília/DF},\n year = {2024},\n keywords = {},\n issn = {2595-6094},\n pages = {24--34},\n publisher = {SBC},\n address = {Porto Alegre, RS, Brasil},\n doi = {10.5753/brasnam.2024.1922},\n url = {https://sol.sbc.org.br/index.php/brasnam/article/view/29330}\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_2023\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2023')\"\n      onkeypress=\"toggleGroup('group_2023')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2023</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cruz-groshaus-guedes-edgeandnonedgedifferentiatedbicliquegraphs-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://dx.doi.org/10.1016/j.procs.2023.08.213\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cruz-groshaus-guedes-edgeandnonedgedifferentiatedbicliquegraphs-2023', 'http://dx.doi.org/10.1016/j.procs.2023.08.213', event);\">\n    Edge and Non-edge differentiated Biclique Graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Edmilson Pereira Da Cruz;  Marina Groshaus;  and  André L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  <i>Procedia Computer Science</i>, 223: 53–61.  2023.\n  <span class=\"note\">XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023)</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://dx.doi.org/10.1016/j.procs.2023.08.213\"\n     onclick=\"log_download('cruz-groshaus-guedes-edgeandnonedgedifferentiatedbicliquegraphs-2023', 'http://dx.doi.org/10.1016/j.procs.2023.08.213', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Edge and Non-edge differentiated Biclique 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.procs.2023.08.213\"\n     onclick=\"log_download('cruz-groshaus-guedes-edgeandnonedgedifferentiatedbicliquegraphs-2023', 'http://doi.org/10.1016/j.procs.2023.08.213', 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-edgeandnonedgedifferentiatedbicliquegraphs-2023\"\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-edgeandnonedgedifferentiatedbicliquegraphs-2023')\" -->\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{CruzGroshausGuedesProcedia2023,\n        title = {Edge and Non-edge differentiated Biclique Graphs},\n        author = {Edmilson Pereira Da Cruz and Marina Groshaus and André L. P. Guedes},\n\tnote={XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023)},\n        journal={Procedia Computer Science},\n        volume={223},\n\tyear={2023},\n        ISSN={1877-0509},\n        url={http://dx.doi.org/10.1016/j.procs.2023.08.213},\n        DOI={10.1016/j.procs.2023.08.213},\n        publisher={Elsevier BV},\n        pages={53–61}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"groshaus-terragno-bicliquetransversalandbicliqueindependenset-2023\">\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.procs.2023.08.223\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'groshaus-terragno-bicliquetransversalandbicliqueindependenset-2023', 'https://doi.org/10.1016/j.procs.2023.08.223', event);\">\n    Biclique transversal and biclique independen set.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Marina Groshaus;  and  Juan Carlos Terragno.\n</span>\n\n  \n\n</span>\n\n  <i>Procedia Computer Science</i>, 223: 140–147.  2023.\n  <span class=\"note\">XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023)</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.procs.2023.08.223\"\n     onclick=\"log_download('groshaus-terragno-bicliquetransversalandbicliqueindependenset-2023', 'https://doi.org/10.1016/j.procs.2023.08.223', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Biclique transversal and biclique independen set [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.procs.2023.08.223\"\n     onclick=\"log_download('groshaus-terragno-bicliquetransversalandbicliqueindependenset-2023', 'http://doi.org/10.1016/j.procs.2023.08.223', 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-terragno-bicliquetransversalandbicliqueindependenset-2023\"\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-terragno-bicliquetransversalandbicliqueindependenset-2023')\" -->\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{GroshausTerragnoProcedia2023,\n        title = {Biclique transversal and biclique independen set},\n        author = {Marina Groshaus and Juan Carlos Terragno},\n\tnote={XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023)},\n        journal={Procedia Computer Science},\n        volume={223},\n\tyear={2023},\n        ISSN={1877-0509},\n        url={https://doi.org/10.1016/j.procs.2023.08.223},\n        DOI={10.1016/j.procs.2023.08.223},\n        publisher={Elsevier BV},\n        pages={140–147}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"delima-dasilva-vignatti-arangespacewithconstantvcdimensionforallpairsshortestpathsingraphs-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Alane Lima;  Murilo Silva;  and  André Vignatti.\n</span>\n\n  \n\n</span>\n\n  <i>Journal of Graph Algorithms and Applications</i>, 27(7): 603–619.  2023.\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-arangespacewithconstantvcdimensionforallpairsshortestpathsingraphs-2023\"\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-arangespacewithconstantvcdimensionforallpairsshortestpathsingraphs-2023')\" -->\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{de2023range,\n  title={A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs},\n  author={de Lima, Alane and da Silva, Murilo and Vignatti, Andr{\\&#x27;e}},\n  journal={Journal of Graph Algorithms and Applications},\n  volume={27},\n  number={7},\n  pages={603--619},\n  year={2023}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"abnerfbcosta-zatesko-thehiddensubgroupproblemandnoninteractiveperfectzeroknowledgeproofs-2023\">\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/29315\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'abnerfbcosta-zatesko-thehiddensubgroupproblemandnoninteractiveperfectzeroknowledgeproofs-2023', 'https://sol.sbc.org.br/index.php/etc/article/view/29315', event);\">\n    The Hidden Subgroup Problem and Non-interactive Perfect Zero-Knowledge Proofs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Henrique Hepp Abner F. B. Costa Murilo V.G. da Silva;  and  Leandro M. Zatesko.\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do VIII Encontro de Teoria da Computação</i>, pages 99–103, Porto Alegre, RS, Brasil,  2023. 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/etc/article/view/29315\"\n     onclick=\"log_download('abnerfbcosta-zatesko-thehiddensubgroupproblemandnoninteractiveperfectzeroknowledgeproofs-2023', 'https://sol.sbc.org.br/index.php/etc/article/view/29315', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The Hidden Subgroup Problem and Non-interactive Perfect Zero-Knowledge Proofs [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/etc.2024.2998\"\n     onclick=\"log_download('abnerfbcosta-zatesko-thehiddensubgroupproblemandnoninteractiveperfectzeroknowledgeproofs-2023', 'http://doi.org/10.5753/etc.2024.2998', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/abnerfbcosta-zatesko-thehiddensubgroupproblemandnoninteractiveperfectzeroknowledgeproofs-2023\"\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('abnerfbcosta-zatesko-thehiddensubgroupproblemandnoninteractiveperfectzeroknowledgeproofs-2023')\" -->\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{Costa2023ETC,\n author = {Abner F. B. Costa, Henrique Hepp, Murilo V.G. da Silva and Leandro M. Zatesko},\n title = {The Hidden Subgroup Problem and Non-interactive Perfect Zero-Knowledge Proofs},\n booktitle = {Anais do VIII Encontro de Teoria da Computação},\n year = {2023},\n keywords = {},\n pages = {99--103},\n publisher = {SBC},\n address = {Porto Alegre, RS, Brasil},\n doi = {10.5753/etc.2024.2998},\n url = {https://sol.sbc.org.br/index.php/etc/article/view/29315}\n}\n\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_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        (11)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"kolberg-groshaus-guedes-onthebicliquegraphsofcirculararcbigraphs-2022\">\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/lawcg22/LAWCG_2022_book_of_abstracts.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'kolberg-groshaus-guedes-onthebicliquegraphsofcirculararcbigraphs-2022', 'https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf', event);\">\n    On the Biclique Graphs of Circular Arc Bigraphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   F. S. Kolberg;  M. Groshaus;  and  A. L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  In <i>Annals of the LAWCG '22 - Latin American Workshop on Cliques in Graphs</i>, pages 92, Curitiba,  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.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf\"\n     onclick=\"log_download('kolberg-groshaus-guedes-onthebicliquegraphsofcirculararcbigraphs-2022', 'https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"On the Biclique Graphs of 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/kolberg-groshaus-guedes-onthebicliquegraphsofcirculararcbigraphs-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  &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('kolberg-groshaus-guedes-onthebicliquegraphsofcirculararcbigraphs-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;\">@InProceedings{CruzGroshausGuedesLAWCG2022,\n   title        = {On the Biclique Graphs of Circular Arc Bigraphs},\n   author       = {F. S. Kolberg and M. Groshaus and A. L. P. Guedes},\n   language     = {english},\n   booktitle    =  {Annals of the LAWCG &#x27;22 - Latin American Workshop on\n                  Cliques in Graphs},\n   pages        = {92},\n   year         = 2022,\n   address      = {Curitiba},\n   url          = {https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"faria-guedes-markenzon-fptalgorithmforfeedbackvertexsetinreducibleflowhypergraphs-2022\">\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/lawcg22/LAWCG_2022_book_of_abstracts.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'faria-guedes-markenzon-fptalgorithmforfeedbackvertexsetinreducibleflowhypergraphs-2022', 'https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf', event);\">\n    FPT algorithm for feedback vertex set in reducible flow hypergraphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   L. Faria;  A. L. P. Guedes;  and  L. Markenzon.\n</span>\n\n  \n\n</span>\n\n  In <i>Annals of the LAWCG '22 - Latin American Workshop on Cliques in Graphs</i>, pages 70, Curitiba,  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.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf\"\n     onclick=\"log_download('faria-guedes-markenzon-fptalgorithmforfeedbackvertexsetinreducibleflowhypergraphs-2022', 'https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"FPT algorithm for feedback vertex set in reducible flow hypergraphs [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/faria-guedes-markenzon-fptalgorithmforfeedbackvertexsetinreducibleflowhypergraphs-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('faria-guedes-markenzon-fptalgorithmforfeedbackvertexsetinreducibleflowhypergraphs-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;\">@InProceedings{FariaGuedesMarkenzon2022,\n   title        =  {FPT algorithm for feedback vertex set in reducible\n                  flow hypergraphs},\n   author       =  {Faria, L. and Guedes, A.  L.  P.  and Markenzon, L.},\n   language     = {english},\n   booktitle    =  {Annals of the LAWCG &#x27;22 - Latin American Workshop on\n                  Cliques in Graphs},\n   pages        = {70},\n   year         = 2022,\n   address      = {Curitiba},\n   url          = {https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cruz-groshaus-guedes-bicliquegraphsofintervalcontainmentbigraphs-2022\">\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/9/sites/9/2022/01/Article-22-vol-48.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cruz-groshaus-guedes-bicliquegraphsofintervalcontainmentbigraphs-2022', 'https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-22-vol-48.pdf', event);\">\n    Biclique Graphs of Interval Containment Bigraphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Edmilson P. Cruz;  Marina Groshaus;  and  André L. P. Guedes.\n</span>\n\n  \n\n</span>\n\n  <i>Matemática Contemporânea</i>, 48: 221-230.  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://mc.sbm.org.br/volumes/volume-48/\"\n     onclick=\"log_download('cruz-groshaus-guedes-bicliquegraphsofintervalcontainmentbigraphs-2022', 'https://mc.sbm.org.br/volumes/volume-48/', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Biclique Graphs of Interval Containment Bigraphs [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/9/sites/9/2022/01/Article-22-vol-48.pdf\"\n     onclick=\"log_download('cruz-groshaus-guedes-bicliquegraphsofintervalcontainmentbigraphs-2022', 'https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-22-vol-48.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Biclique Graphs of Interval Containment Bigraphs [pdf]\"\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/http://doi.org/10.21711/231766362021/rmc4822\"\n     onclick=\"log_download('cruz-groshaus-guedes-bicliquegraphsofintervalcontainmentbigraphs-2022', 'http://doi.org/http://doi.org/10.21711/231766362021/rmc4822', 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-bicliquegraphsofintervalcontainmentbigraphs-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  &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('cruz-groshaus-guedes-bicliquegraphsofintervalcontainmentbigraphs-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{CruzGroshausGuedes2022MC,\n  title={Biclique Graphs of Interval Containment Bigraphs},\n  author={Cruz, Edmilson P. and Groshaus, Marina and Guedes, Andr{\\&#x27;e} L. P.},\n  journal={Matem{\\&#x27;a}tica Contempor{\\^a}nea},\n  issn = {2317-6636},\n  volume={48},\n  pages={221-230},\n  doi = {http://doi.org/10.21711/231766362021/rmc4822},\n  url = {https://mc.sbm.org.br/volumes/volume-48/},\n  url_pdf = {https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-22-vol-48.pdf},\n  year={2022}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"groshaus-guedes-kolberg-subclasshierarchyoncirculararcbigraphs-2022\">\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/9/sites/9/2022/01/Article-08-vol-48.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'groshaus-guedes-kolberg-subclasshierarchyoncirculararcbigraphs-2022', 'https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-08-vol-48.pdf', event);\">\n    Subclass Hierarchy on Circular Arc Bigraphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Marina Groshaus;  André L. P. Guedes;  and  Fabricio S. Kolberg.\n</span>\n\n  \n\n</span>\n\n  <i>Matemática Contemporânea</i>, 48: 74-83.  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://mc.sbm.org.br/volumes/volume-48/\"\n     onclick=\"log_download('groshaus-guedes-kolberg-subclasshierarchyoncirculararcbigraphs-2022', 'https://mc.sbm.org.br/volumes/volume-48/', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Subclass Hierarchy on Circular Arc Bigraphs [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/9/sites/9/2022/01/Article-08-vol-48.pdf\"\n     onclick=\"log_download('groshaus-guedes-kolberg-subclasshierarchyoncirculararcbigraphs-2022', 'https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-08-vol-48.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=\" 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/http://doi.org/10.21711/231766362021/rmc488\"\n     onclick=\"log_download('groshaus-guedes-kolberg-subclasshierarchyoncirculararcbigraphs-2022', 'http://doi.org/http://doi.org/10.21711/231766362021/rmc488', 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-subclasshierarchyoncirculararcbigraphs-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  &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-kolberg-subclasshierarchyoncirculararcbigraphs-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{GroshausGuedesKolberg2022MC,\n  title={Subclass Hierarchy on Circular Arc Bigraphs},\n  author={Groshaus, Marina and Guedes, Andr{\\&#x27;e} L. P. and Kolberg, Fabricio S.},\n  journal={Matem{\\&#x27;a}tica Contempor{\\^a}nea},\n  issn = {2317-6636},\n  volume={48},\n  pages={74-83},\n  doi = {http://doi.org/10.21711/231766362021/rmc488},\n  url = {https://mc.sbm.org.br/volumes/volume-48/},\n  url_pdf = {https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2022/01/Article-08-vol-48.pdf},\n  year={2022}\n}\n\n</pre>\n</div>\n\n\n\n</div>\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>, 323: 252-267.  2022.\n  <span class=\"note\">LAGOS’19 – X Latin and American Algorithms, Graphs, and Optimization Symposium – Belo Horizonte, Minas Gerais, Brazil</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},\nvolume = {323},\npages = {252-267},\nyear = {2022},\nissn = {0166-218X},\ndoi = {https://doi.org/10.1016/j.dam.2021.12.028},\nurl = {https://www.sciencedirect.com/science/article/pii/S0166218X2100514X},\nauthor = {M. Groshaus and A.L.P. Guedes and J.P. Puppo},\nkeywords = {Bicliques, Biclique graphs, Split graphs, Biclique-complete, -complete},\nnote = {LAGOS’19 – X Latin and American Algorithms, Graphs, and Optimization Symposium – Belo Horizonte, Minas Gerais, Brazil},\nabstract = {The biclique graph is the intersection graph of the bicliques of a graph. Its recognition problem is still open. In this paper we study the problem restricted to the class of split graphs. We define a class called nested separable split graphs and solve the recognition problem of biclique graphs of a subclass of the mentioned class. For that, we give a polynomial time algorithm with positive certificate. We also characterize nested split graphs and study properties of biclique graphs of split graphs. For example, we show that they are Hamiltonian. We also present a complexity result for recognizing graphs such that their biclique graphs are complete graphs, that is, we prove that the problem of recognizing biclique-complete graphs in co-NP-complete.}\n}\n\n</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=\"montanheiro-zatesko-groshaus-characterisationandtotalcolouringofbipartitegraphswithatmostthreebicliques-2022\">\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/9/sites/9/2023/12/Article-11.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'montanheiro-zatesko-groshaus-characterisationandtotalcolouringofbipartitegraphswithatmostthreebicliques-2022', 'https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2023/12/Article-11.pdf', event);\">\n    Characterisation and total colouring of bipartite graphs with at most three bicliques.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Gustavo L. Montanheiro;  Leandro M. Zatesko;  and  Marina Groshaus.\n</span>\n\n  \n\n</span>\n\n  <i>Matemática Contemporânea</i>, 55: 105-113.  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://mc.sbm.org.br/volumes/volume-55/\"\n     onclick=\"log_download('montanheiro-zatesko-groshaus-characterisationandtotalcolouringofbipartitegraphswithatmostthreebicliques-2022', 'https://mc.sbm.org.br/volumes/volume-55/', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Characterisation and total colouring of bipartite graphs with at most three bicliques [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/9/sites/9/2023/12/Article-11.pdf\"\n     onclick=\"log_download('montanheiro-zatesko-groshaus-characterisationandtotalcolouringofbipartitegraphswithatmostthreebicliques-2022', 'https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2023/12/Article-11.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Characterisation and total colouring of bipartite graphs with at most three bicliques [pdf]\"\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/http://doi.org/10.21711/231766362023/rmc5512\"\n     onclick=\"log_download('montanheiro-zatesko-groshaus-characterisationandtotalcolouringofbipartitegraphswithatmostthreebicliques-2022', 'http://doi.org/http://doi.org/10.21711/231766362023/rmc5512', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/montanheiro-zatesko-groshaus-characterisationandtotalcolouringofbipartitegraphswithatmostthreebicliques-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('montanheiro-zatesko-groshaus-characterisationandtotalcolouringofbipartitegraphswithatmostthreebicliques-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{MontanheiroZateskoGroshaus2023MC,\n  title={Characterisation and total colouring of bipartite graphs with at most three bicliques},\n  author={Gustavo L. Montanheiro and Leandro M. Zatesko and Groshaus, Marina},\n  journal={Matem{\\&#x27;a}tica Contempor{\\^a}nea},\n  issn = {2317-6636},\n  volume={55},\n  pages={105-113},\n  doi = {http://doi.org/10.21711/231766362023/rmc5512},\n  url = {https://mc.sbm.org.br/volumes/volume-55/},\n  url_pdf = {https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2023/12/Article-11.pdf},\n  year={2022}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"delima-dasilva-vignatti-percolationcentralityviarademachercomplexity-2022\">\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 De Lima;  Murilo VG Da Silva;  and  André L Vignatti.\n</span>\n\n  \n\n</span>\n\n  <i>Discrete Applied Mathematics</i>, 323: 201–216.  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\n  \n  <a href=\"//bibbase.org/network/publication/delima-dasilva-vignatti-percolationcentralityviarademachercomplexity-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('delima-dasilva-vignatti-percolationcentralityviarademachercomplexity-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{de2022percolation,\n  title={Percolation centrality via rademacher complexity},\n  author={De Lima, Alane M and Da Silva, Murilo VG and Vignatti, Andr{\\&#x27;e} L},\n  journal={Discrete Applied Mathematics},\n  volume={323},\n  pages={201--216},\n  year={2022},\n  publisher={Elsevier}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"delima-dasilva-vignatti-estimatingtheclusteringcoefficientusingsamplecomplexityanalysis-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Estimating the clustering coefficient using sample complexity analysis.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Alane M Lima;  Murilo VG Silva;  and  André L Vignatti.\n</span>\n\n  \n\n</span>\n\n  In <i>Latin American Symposium on Theoretical Informatics</i>, pages 328–341,  2022. Springer\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-estimatingtheclusteringcoefficientusingsamplecomplexityanalysis-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('delima-dasilva-vignatti-estimatingtheclusteringcoefficientusingsamplecomplexityanalysis-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;\">@inproceedings{de2022estimating,\n  title={Estimating the clustering coefficient using sample complexity analysis},\n  author={de Lima, Alane M and da Silva, Murilo VG and Vignatti, Andr{\\&#x27;e} L},\n  booktitle={Latin American Symposium on Theoretical Informatics},\n  pages={328--341},\n  year={2022},\n  organization={Springer}\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-2022\">\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-2022', '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  <i>Discrete Appl. Math.</i>, 323: 311–323.  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://doi.org/10.1016/j.dam.2021.06.012\"\n     onclick=\"log_download('zorzi-figueiredo-machado-zatesko-souza-compositionsdecompositionsandcomformabilityfortotalcoloringofpowerofcyclegraphs-2022', '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-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('zorzi-figueiredo-machado-zatesko-souza-compositionsdecompositionsandcomformabilityfortotalcoloringofpowerofcyclegraphs-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{alesom21dam,\n  author = {A. Zorzi and C. M. H. Figueiredo and R. C. S. Machado and\nL. M. Zatesko and U. S. Souza},\n  title = {Compositions, Decompositions, and Comformability for Total\nColoring 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 = 2022,\n  volume = {323},\n  pages = {311--323}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cunha-zatesko-anewboundforthesumofsquaresofdegreesinaclass2graph-2022\">\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/lawcg22/ LAWCG_2022_book_of_abstracts.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cunha-zatesko-anewboundforthesumofsquaresofdegreesinaclass2graph-2022', 'https://www.lawcg.mat.br/lawcg22/ LAWCG_2022_book_of_abstracts.pdf', event);\">\n    A New Bound for the Sum of Squares of Degrees in a Class 2 Graph.\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. X Latin American Workshop on Cliques in Graphs (LAWCG '22)</i>, pages 104, Curitiba,  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.lawcg.mat.br/lawcg22/ LAWCG_2022_book_of_abstracts.pdf\"\n     onclick=\"log_download('cunha-zatesko-anewboundforthesumofsquaresofdegreesinaclass2graph-2022', 'https://www.lawcg.mat.br/lawcg22/ LAWCG_2022_book_of_abstracts.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A New Bound for the Sum of Squares of Degrees in a Class 2 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/cunha-zatesko-anewboundforthesumofsquaresofdegreesinaclass2graph-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('cunha-zatesko-anewboundforthesumofsquaresofdegreesinaclass2graph-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;\">@inproceedings{lawcg22-thiago,\n  author = {T. H. F. M. Cunha and L. M. Zatesko},\n  title = {A New Bound for the Sum of Squares of Degrees in a Class 2\nGraph},\n  language = {english},\n  year = 2022,\n  booktitle = {Proc. X Latin American Workshop on Cliques in Graphs\n(LAWCG &#x27;22)},\n  address = {Curitiba},\n  pages = {104},\n  url = {https://www.lawcg.mat.br/lawcg22/\nLAWCG_2022_book_of_abstracts.pdf}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"montanheiro-zatesko-groshaus-ontotalcolouringbipartitegraphswithatmostthreebicliques-2022\">\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/lawcg22/ LAWCG_2022_book_of_abstracts.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'montanheiro-zatesko-groshaus-ontotalcolouringbipartitegraphswithatmostthreebicliques-2022', 'https://www.lawcg.mat.br/lawcg22/ LAWCG_2022_book_of_abstracts.pdf', event);\">\n    On Total Colouring Bipartite Graphs with at Most Three Bicliques.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   G. L. Montanheiro;  L. M. Zatesko;  and  M. E. Groshaus.\n</span>\n\n  \n\n</span>\n\n  In <i>Proc. X Latin American Workshop on Cliques in Graphs (LAWCG '22)</i>, pages 48, Curitiba,  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.lawcg.mat.br/lawcg22/ LAWCG_2022_book_of_abstracts.pdf\"\n     onclick=\"log_download('montanheiro-zatesko-groshaus-ontotalcolouringbipartitegraphswithatmostthreebicliques-2022', 'https://www.lawcg.mat.br/lawcg22/ LAWCG_2022_book_of_abstracts.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"On Total Colouring Bipartite Graphs with at Most Three Bicliques [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/montanheiro-zatesko-groshaus-ontotalcolouringbipartitegraphswithatmostthreebicliques-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('montanheiro-zatesko-groshaus-ontotalcolouringbipartitegraphswithatmostthreebicliques-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;\">@inproceedings{lawcg22-gustavo,\n  author = {G. L. Montanheiro and L. M. Zatesko and M. E. Groshaus},\n  title = {On Total Colouring Bipartite Graphs with at Most Three\nBicliques},\n  language = {english},\n  year = 2022,\n  booktitle = {Proc. X Latin American Workshop on Cliques in Graphs\n(LAWCG &#x27;22)},\n  address = {Curitiba},\n  pages = {48},\n  url = {https://www.lawcg.mat.br/lawcg22/\nLAWCG_2022_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_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        (12)\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  <a href=\"http://dx.doi.org/10.1016/j.procs.2021.11.029\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'groshaus-guedes-bicliquegraphsofk3freegraphsandbipartitegraphs-2021', 'http://dx.doi.org/10.1016/j.procs.2021.11.029', event);\">\n    Biclique Graphs of K3-free Graphs and Bipartite Graphs.\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  <i>Procedia Computer Science</i>, 195: 230–238.  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=\"http://dx.doi.org/10.1016/j.procs.2021.11.029\"\n     onclick=\"log_download('groshaus-guedes-bicliquegraphsofk3freegraphsandbipartitegraphs-2021', 'http://dx.doi.org/10.1016/j.procs.2021.11.029', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Biclique Graphs of K3-free Graphs and Bipartite 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.procs.2021.11.029\"\n     onclick=\"log_download('groshaus-guedes-bicliquegraphsofk3freegraphsandbipartitegraphs-2021', 'http://doi.org/10.1016/j.procs.2021.11.029', 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-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  &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-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  \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{GroshausGuedesProcedia2021,\ntitle        = &quot;Biclique Graphs of K3-free Graphs and Bipartite\n                  Graphs&quot;,\n   author       = &quot;Marina Groshaus and André L. P. Guedes&quot;,\n   journal      = {Procedia Computer Science},\n   volume       = {195},\n   year         = &quot;2021&quot;,\n   ISSN         = {1877-0509},\n   url          = {http://dx.doi.org/10.1016/j.procs.2021.11.029},\n   DOI          = {10.1016/j.procs.2021.11.029},\n   publisher    = {Elsevier BV},\n   pages        = {230–238},\n   note         = {Proceedings of the XI Latin and American Algorithms,\n                  Graphs and Optimization Symposium.},\n   keywords     = {Bicliques, Biclique graphs, Intersection graphs,\n                  Triangle-free graphs, Bipartite graphs, Comparability\n                  graphs, Power of a graph},\n   abstract     = {A biclique of a graph is a maximal complete bipartite\n                  subgraph.  The biclique graph of a graph G, KB(G),\n                  defined as the intersection graph of the bicliques of\n                  G, was introduced and characterized in 2010 by\n                  Groshaus and Szwarcfiter. However, this\n                  characterization does not lead to polynomial time\n                  recognition algorithms, and the time complexity of its\n                  recognition problem remains open. There are some works\n                  on this problem when restricted to some classes. In\n                  this work we give a characterization of the biclique\n                  graph of a K3-free graph G. We prove that KB(G) is the\n                  square graph of a particular graph which we call\n                  Mutually Included Biclique Graph of G,\n                  KBm(G). Although it does not lead to a polynomial time\n                  recognition algorithm, it gives a new tool to prove\n                  properties of biclique graphs (restricted to K3-free\n                  graphs) using known properties of square graphs. For\n                  instance we generalize a property about induced P3&#x27;s\n                  in biclique graphs to a property about stars and\n                  proved a conjecture posted by Groshaus and Montero,\n                  when restricted to K3-free graphs.  Also we give\n                  another characterization of the class of biclique\n                  graphs of bipartite graphs. We prove that\n                  KB(bipartite) = (IIC-comparability)2, where\n                  IIC-comparability is a subclass of comparability\n                  graphs that we call Interval Intersection Closed\n                  Comparability.}\n}\n\n</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 is a maximal complete bipartite subgraph. The biclique graph of a graph G, KB(G), defined as the intersection graph of the bicliques of G, was introduced and characterized in 2010 by Groshaus and Szwarcfiter. However, this characterization does not lead to polynomial time recognition algorithms, and the time complexity of its recognition problem remains open. There are some works on this problem when restricted to some classes. In this work we give a characterization of the biclique graph of a K3-free graph G. We prove that KB(G) is the square graph of a particular graph which we call Mutually Included Biclique Graph of G, KBm(G). Although it does not lead to a polynomial time recognition algorithm, it gives a new tool to prove properties of biclique graphs (restricted to K3-free graphs) using known properties of square graphs. For instance we generalize a property about induced P3's in biclique graphs to a property about stars and proved a conjecture posted by Groshaus and Montero, when restricted to K3-free graphs. Also we give another characterization of the class of biclique graphs of bipartite graphs. We prove that KB(bipartite) = (IIC-comparability)2, where IIC-comparability is a subclass of comparability graphs that we call Interval Intersection Closed Comparability.\n</div>\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  <a href=\"https://www.sciencedirect.com/science/article/pii/S1877050921021669\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'faria-guedes-markenzon-onfeedbackvertexsetinreducibleflowhypergraphs-2021', 'https://www.sciencedirect.com/science/article/pii/S1877050921021669', event);\">\n    On feedback vertex set in reducible flow hypergraphs.\n  </a>\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  <i>Procedia Computer Science</i>, 195: 212-220.  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/S1877050921021669\"\n     onclick=\"log_download('faria-guedes-markenzon-onfeedbackvertexsetinreducibleflowhypergraphs-2021', 'https://www.sciencedirect.com/science/article/pii/S1877050921021669', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"On feedback vertex set in reducible flow hypergraphs [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.027\"\n     onclick=\"log_download('faria-guedes-markenzon-onfeedbackvertexsetinreducibleflowhypergraphs-2021', 'http://doi.org/https://doi.org/10.1016/j.procs.2021.11.027', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\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  &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>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  \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{FariaGuedesMarkenzonProcedia2021,\ntitle = &quot;On feedback vertex set in reducible flow hypergraphs&quot;,\njournal = {Procedia Computer Science},\nvolume = {195},\npages = {212-220},\nyear = {2021},\nnote = {Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium.},\nissn = {1877-0509},\ndoi = {https://doi.org/10.1016/j.procs.2021.11.027},\nurl = {https://www.sciencedirect.com/science/article/pii/S1877050921021669},\nauthor = {Luerbio Faria and André L. P. Guedes and Lilian Markenzon},\nkeywords = {directed hypergraphs, feedback vertex set, NP-complete, approximation algorithms},\nabstract = {A directed hypergraph H = (V, A) is a finite set of vertices V and a set of hyper-arcs A, where each hyper-arc is an ordered pair of nonempty subsets of vertices. A flow hypergraph H = (V, A, s) is a triple, such that (V, A) is a directed hypergraph, s e V is a distinguished vertex such that s reaches every vertex of V. Reducible flow hypergraphs are a generalization of Hecht and Ullman’s reducible flowgraphs. The feedback vertex set (fvs) decision problem has a directed hypergraph H and an integer k ≥ 0 as input and the question is whether there is V&#x27;⊆V, |V&#x27; |≤k such that H\\V&#x27; is an acyclic directed hypergraph. It is known that fvs is polynomial time solvable for reducible flowgraphs. In this article we prove that fvs is NP-complete for reducible flow hypergraphs showing a reduction from 3-satisfiability problem with at most 3 occurrences per variable (3sat3-). We exhibit a polynomial-time ∆-approximation for fvs in reducible flow hypergraphs, where ∆ is the maximum number of hyper-arcs adjacent to a vertex of H.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A directed hypergraph H = (V, A) is a finite set of vertices V and a set of hyper-arcs A, where each hyper-arc is an ordered pair of nonempty subsets of vertices. A flow hypergraph H = (V, A, s) is a triple, such that (V, A) is a directed hypergraph, s e V is a distinguished vertex such that s reaches every vertex of V. Reducible flow hypergraphs are a generalization of Hecht and Ullman’s reducible flowgraphs. The feedback vertex set (fvs) decision problem has a directed hypergraph H and an integer k ≥ 0 as input and the question is whether there is V'⊆V, |V' |≤k such that H\\V' is an acyclic directed hypergraph. It is known that fvs is polynomial time solvable for reducible flowgraphs. In this article we prove that fvs is NP-complete for reducible flow hypergraphs showing a reduction from 3-satisfiability problem with at most 3 occurrences per variable (3sat3-). We exhibit a polynomial-time ∆-approximation for fvs in reducible flow hypergraphs, where ∆ is the maximum number of hyper-arcs adjacent to a vertex of H.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"montero-groshaus-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', 'montero-groshaus-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   Leandro Montero;  and  Marina Groshaus.\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('montero-groshaus-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=\" 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/montero-groshaus-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('montero-groshaus-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{MonteroGroshaus2021AJC,\n  title={Structural properties of biclique graphs and the distance formula},\n  author={Montero, Leandro and Groshaus, Marina},\n  journal={Australasian Journal of Combinatorics},\n  issn = {2202-3518},\n  volume={81},\n  number={2},\n  pages={301-318},\n  url_pdf = {https://ajc.maths.uq.edu.au/pdf/81/ajc_v81_p301.pdf},\n  year={2021}\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 VG Silva;  and  Jayme L Szwarcfiter.\n</span>\n\n  \n\n</span>\n\n  In <i>International Conference on Algorithms and Complexity</i>, pages 158–172,  2021. Springer\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/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{gomes2021fpt,\n  title={FPT and kernelization algorithms for the induced tree problem},\n  author={Gomes, Guilherme Castro Mendes and dos Santos, Vinicius F and da Silva, Murilo VG and Szwarcfiter, Jayme L},\n  booktitle={International Conference on Algorithms and Complexity},\n  pages={158--172},\n  year={2021},\n  organization={Springer}\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\n(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=\"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\nCampos 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\nMultisunlets},\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos\nCampos 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\nProblem},\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos\nCampos 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=\"alanemdelima-vignatti-adeductiveformalderivationforthepreferentialattachmentmetricforlinkprediction-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', 'alanemdelima-vignatti-adeductiveformalderivationforthepreferentialattachmentmetricforlinkprediction-2021', 'http://www.wpccg.pro.br/volume004.html', event);\">\n    A Deductive-Formal Derivation for the Preferential Attachment Metric for Link Prediction.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Murilo V. G. da Silva Lima;  and  Andre L. Vignatti.\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 31–36, 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('alanemdelima-vignatti-adeductiveformalderivationforthepreferentialattachmentmetricforlinkprediction-2021', 'http://www.wpccg.pro.br/volume004.html', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A Deductive-Formal Derivation for the Preferential Attachment Metric for Link Prediction [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/alanemdelima-vignatti-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('alanemdelima-vignatti-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{Lima21wpccg,\n  author = {Alane M. de Lima, Murilo V. G. da Silva and Andre L. Vignatti},\n  language = {english},\n  year = 2021,\n  title = {A Deductive-Formal Derivation for the Preferential Attachment Metric for Link Prediction},\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos\nCampos Gerais (WPCCG &#x27;21)},\n  address = {Ponta Grossa, Brazil},\n  issn = {2526-1371},\n  pages = {31--36},\n  url = {http://www.wpccg.pro.br/volume004.html}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"alanemdelima-vignatti-problemaapspviadimensovcemdiasderademacher-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', 'alanemdelima-vignatti-problemaapspviadimensovcemdiasderademacher-2021', 'https://doi.org/10.5753/etc.2021.16381', event);\">\n    Problema APSP via Dimensão-VC e Médias de Rademacher.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Murilo V. G. da Silva Lima;  and  Andre L. Vignatti.\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 13–16, 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('alanemdelima-vignatti-problemaapspviadimensovcemdiasderademacher-2021', 'https://doi.org/10.5753/etc.2021.16381', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Problema APSP via Dimensão-VC e Médias de Rademacher [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/alanemdelima-vignatti-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('alanemdelima-vignatti-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{Lima21etc,\n  author = {Alane M. de Lima, Murilo V. G. da Silva and Andre L. Vignatti},\n  language = {portuguese},\n  year = 2021,\n  title = {Problema APSP via Dimensão-VC e Médias de Rademacher},\n  booktitle = {Proc. 41st Congress of the Brazilian Computer Society\n(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 = {13--16}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fernandoerd-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   Andre L. Vignatti Fernando Erd;  and  Murilo V.G. Silva.\n</span>\n\n  \n\n</span>\n\n  <i>Soc. Netw. Anal. Min.</i>, 11: 55.  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/fernandoerd-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('fernandoerd-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{erd21,\n  title={The generalized influence blocking maximization problem},\n  author={Fernando Erd, Andre L. Vignatti and Murilo V.G. da Silva},\n  journal={Soc. Netw. Anal. Min.},\n  volume={11},\n  pages={55},\n  year={2021},\n  publisher={Springer Nature}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"alanemdelima-vignatti-samplecomplexityingraphproblemscontributedtalk-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Sample complexity in graph problems (contributed talk).\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n   Murilo V. G. da Silva Lima;  and  Andre L. Vignatti.\n</span>\n\n  \n\n</span>\n\n  In  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/alanemdelima-vignatti-samplecomplexityingraphproblemscontributedtalk-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('alanemdelima-vignatti-samplecomplexityingraphproblemscontributedtalk-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{canadam21,\n  author = {Alane M. de Lima, Murilo V. G. da Silva and Andre L. Vignatti},\n   title = {Sample complexity in graph problems (contributed talk)},\n  language = {english},\n  year = 2021\n}\n\n\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);