BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Carla Negri Lintzmayer (UFABC)
DTSTART:20200604T170000Z
DTEND:20200604T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/1
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/1/">Arborescências geradoras folhudas em DAGs</a>\nby Carla Ne
 gri Lintzmayer (UFABC) as part of Seminário Brasileiro de Grafos\, Algori
 tmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Rob Morris (IMPA)
DTSTART:20200618T170000Z
DTEND:20200618T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/2
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/2/">Asymmetric containers and additive combinatorics</a>\nby Ro
 b Morris (IMPA) as part of Seminário Brasileiro de Grafos\, Algoritmos e 
 Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jayme Luiz Szwarcfiter (UFRJ and UERJ)
DTSTART:20200625T170000Z
DTEND:20200625T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/3
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/3/">Dijkstra Graphs</a>\nby Jayme Luiz Szwarcfiter (UFRJ and UE
 RJ) as part of Seminário Brasileiro de Grafos\, Algoritmos e Combinatóri
 a\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Fabio Botler (UFRJ)
DTSTART:20200702T170000Z
DTEND:20200702T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/4
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/4/">Counting graph orientations with no directed triangles</a>\
 nby Fabio Botler (UFRJ) as part of Seminário Brasileiro de Grafos\, Algor
 itmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Paloma Lima (University of Bergen)
DTSTART:20200709T170000Z
DTEND:20200709T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/5
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/5/">Graph Square Roots of Small Distance from Degree One Graphs
 </a>\nby Paloma Lima (University of Bergen) as part of Seminário Brasilei
 ro de Grafos\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Roberto Parente (Universidade Federal da Bahia)
DTSTART:20200716T170000Z
DTEND:20200716T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/6
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/6/">Hitting time para k+1 arborescência</a>\nby Roberto Parent
 e (Universidade Federal da Bahia) as part of Seminário Brasileiro de Graf
 os\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Marina Groshaus (Universidade Tecnológica Federal do Paraná)
DTSTART:20200723T170000Z
DTEND:20200723T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/7
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/7/">A vida secreta das bicliques</a>\nby Marina Groshaus (Unive
 rsidade Tecnológica Federal do Paraná) as part of Seminário Brasileiro 
 de Grafos\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Uéverton Souza (UFF)
DTSTART:20200730T170000Z
DTEND:20200730T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/8
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/8/">Co-treewidth: The Treewidth of the Complement Graph as a Pa
 rameter</a>\nby Uéverton Souza (UFF) as part of Seminário Brasileiro de 
 Grafos\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Erika Coelho (UFG)
DTSTART:20200806T170000Z
DTEND:20200806T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/9
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/9/">P3-Hull number of graphs with diameter two</a>\nby Erika Co
 elho (UFG) as part of Seminário Brasileiro de Grafos\, Algoritmos e Combi
 natória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Walner Mendonça (University of Warwick)
DTSTART:20200813T170000Z
DTEND:20200813T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/10
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/10/">Particionando grafos completos coloridos em poucos subgraf
 os esparsos monocromáticos</a>\nby Walner Mendonça (University of Warwic
 k) as part of Seminário Brasileiro de Grafos\, Algoritmos e Combinatória
 \n\n\nAbstract\nGerencsér e Gyárfás provaram em 1967 que para qualquer 
 2-coloração das arestas de K_n\, é possível particionar V(K_n) em dois
  caminhos monocromáticos. Tal resultado\, cuja a prova é bastante simple
 s\, motivou inúmeros outros problemas desafiantes os quais têm sido obje
 tos de extensa pesquisa em combinatória extremal nos últimos anos. Por e
 xemplo\, Erdős\, Gyárfás e Pyber conjecturaram em 1991 que para toda r-
 coloração de K_n existem r caminhos monocromáticos particionando V(K_n)
 . Podemos também encontrar na literatura outras versões do problema onde
  ao invés de obtermos particionamento por caminhos\, foca-se em obter par
 ticionamento por árvores\, ciclos ou até mesmo potência de ciclos.\n\nG
 rinshpun e Sárközy estudaram uma versão mais geral do problema onde int
 eressa-se em particionar V(K_n) em subgrafos monocromáticos de grau limit
 ado. Eles provaram que para toda sequência de grafos S = (F_i\, i \\in \\
 mathbb{N}) com |F_i| = i e \\Delta(F_i) \\leq D\, o seguinte vale: para qu
 alquer 2-coloração das arestas de K_n é possivel particionar V(K_n) em 
 no máximo 2^{O(D \\log D)} cópias monocromáticas de grafos da sequênci
 a S. Eles conjecturaram que para r-colorações\, também deve ser verdade
  que é possível particionar V(K_n) em uma quantidade exponeical de cópi
 as monocromáticas de grafos da sequência S. Mais precisamente\, a conjec
 tura deles afirma que para todo inteiro positivo r\, existe uma constante 
 C=C(r) para o qual o seguinte vale: para qualquer r-coloração das aresta
 s de K_n\, é possível particionar V(K_n) em no máximo 2^{D^C} cópias m
 onocromáticas de grafos da sequência S. Neste trabalho apresentamos o pr
 imeiro progresso na conjecutra de Grinshpun e Sárközy estabelecendo um l
 imitante triplamente exponencial.\n\nEsta apresentação é baseado em um 
 trabalho conjunto com Jan Corsten (LSE\, UK).\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/10/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Leandro Zatesko (UTFPR)
DTSTART:20200827T170000Z
DTEND:20200827T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/11
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/11/">On the edge of edge-coloring</a>\nby Leandro Zatesko (UTFP
 R) as part of Seminário Brasileiro de Grafos\, Algoritmos e Combinatória
 \n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lucas Colucci
DTSTART:20200820T170000Z
DTEND:20200820T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/12
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/12/">Coloração de arestas modulo k e generalizações</a>\nby
  Lucas Colucci as part of Seminário Brasileiro de Grafos\, Algoritmos e C
 ombinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/12/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ana Silva (UFC)
DTSTART:20200903T170000Z
DTEND:20200903T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/13
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/13/">Edge-disjoint Branchings in Temporal Digraphs</a>\nby Ana 
 Silva (UFC) as part of Seminário Brasileiro de Grafos\, Algoritmos e Comb
 inatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Gabriel Coutinho (UFMG)
DTSTART:20200910T170000Z
DTEND:20200910T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/14
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/14/">Eigenvalues between alpha and chi</a>\nby Gabriel Coutinho
  (UFMG) as part of Seminário Brasileiro de Grafos\, Algoritmos e Combinat
 ória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/14/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Júlio Araújo (UFC)
DTSTART:20200917T170000Z
DTEND:20200917T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/15
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/15/">Dual Parameterization of Weighted Coloring</a>\nby Júlio 
 Araújo (UFC) as part of Seminário Brasileiro de Grafos\, Algoritmos e Co
 mbinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/15/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Igor Carboni Oliveira (University of Warwick)
DTSTART:20200924T170000Z
DTEND:20200924T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/16
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/16/">Towards a theory of probabilistic data representation</a>\
 nby Igor Carboni Oliveira (University of Warwick) as part of Seminário Br
 asileiro de Grafos\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/16/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Vilmar Trevisan (UFRGS)
DTSTART:20201001T170000Z
DTEND:20201001T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/17
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/17/">Aplicações de relações de recorrência em Teoria Espec
 tral de Grafos</a>\nby Vilmar Trevisan (UFRGS) as part of Seminário Brasi
 leiro de Grafos\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/17/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Átila Arueira Jones (IF Sudeste MG - Juiz de Fora)
DTSTART:20201008T170000Z
DTEND:20201008T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/18
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/18/">Partição de Arestas em Cliques em Grafos (k\,l)</a>\nby 
 Átila Arueira Jones (IF Sudeste MG - Juiz de Fora) as part of Seminário 
 Brasileiro de Grafos\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/18/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Guilherme Gomes (UFMG)
DTSTART:20201015T170000Z
DTEND:20201015T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/19
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/19/">The (Parameterized) Complexity of Equitable Coloring</a>\n
 by Guilherme Gomes (UFMG) as part of Seminário Brasileiro de Grafos\, Alg
 oritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mateus de Oliveira Oliveira (University of Bergen)
DTSTART:20201022T170000Z
DTEND:20201022T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/20
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/20/">From Decomposition Based Dynamic Programming to Automated 
 Theorem Proving</a>\nby Mateus de Oliveira Oliveira (University of Bergen)
  as part of Seminário Brasileiro de Grafos\, Algoritmos e Combinatória\n
 \nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/20/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ignasi Sau (LIRMM\, Université de Montpellier\, CNRS)
DTSTART:20201029T170000Z
DTEND:20201029T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/21
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/21/">Reducing graph transversals via edge contractions</a>\nby 
 Ignasi Sau (LIRMM\, Université de Montpellier\, CNRS) as part of Seminár
 io Brasileiro de Grafos\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/21/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Fábio Protti (UFF)
DTSTART:20201105T170000Z
DTEND:20201105T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/22
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/22/">Decycling a graph: variants and special cases</a>\nby Fáb
 io Protti (UFF) as part of Seminário Brasileiro de Grafos\, Algoritmos e 
 Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/22/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Flávio Miyazawa (Unicamp)
DTSTART:20201112T170000Z
DTEND:20201112T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/23
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/23/">Algoritmos de aproximação para problemas de empacotament
 o</a>\nby Flávio Miyazawa (Unicamp) as part of Seminário Brasileiro de G
 rafos\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/23/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Cristina Fernandes (USP)
DTSTART:20210211T190000Z
DTEND:20210211T200000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/24
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/24/">Conjuntos independentes\, emparelhamentos e arborecências
  geradoras folhudas</a>\nby Cristina Fernandes (USP) as part of Seminário
  Brasileiro de Grafos\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/24/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Victor Campos (UFC)
DTSTART:20210225T190000Z
DTEND:20210225T200000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/25
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/25/">Um Survey sobre a Conjectura da Otimalidade Dinâmica</a>\
 nby Victor Campos (UFC) as part of Seminário Brasileiro de Grafos\, Algor
 itmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/25/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sheila Almeida (UTFPR)
DTSTART:20210311T190000Z
DTEND:20210311T200000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/26
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/26/">Coloração de arestas em grafos split: o que sabemos apó
 s 35 anos da coluna de Johnson</a>\nby Sheila Almeida (UTFPR) as part of S
 eminário Brasileiro de Grafos\, Algoritmos e Combinatória\n\nAbstract: T
 BA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/26/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Marcelo Campos (IMPA)
DTSTART:20210325T190000Z
DTEND:20210325T200000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/27
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/27/">Contando orientações de G(n\,p) sem C_r direcionado</a>\
 nby Marcelo Campos (IMPA) as part of Seminário Brasileiro de Grafos\, Alg
 oritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/27/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mitre Dourado (UFRJ)
DTSTART:20210408T190000Z
DTEND:20210408T200000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/28
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/28/">Sobre os números de Δ-intervalo e Δ-convexidade de graf
 os e produtos de grafos</a>\nby Mitre Dourado (UFRJ) as part of Seminário
  Brasileiro de Grafos\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/28/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Phablo Moura (UFMG)
DTSTART:20210422T190000Z
DTEND:20210422T200000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/29
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/29/">Partição de grafos em subgrafos conexos e balanceados</a
 >\nby Phablo Moura (UFMG) as part of Seminário Brasileiro de Grafos\, Alg
 oritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/29/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Márcia Cappelle (UFG)
DTSTART:20210506T190000Z
DTEND:20210506T200000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/30
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/30/">Algoritmos parametrizados para conjuntos dominantes locali
 zadores</a>\nby Márcia Cappelle (UFG) as part of Seminário Brasileiro de
  Grafos\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/30/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ana Karolinna Maia de Oliveira (UFC)
DTSTART:20210603T190000Z
DTEND:20210603T200000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/31
DESCRIPTION:by Ana Karolinna Maia de Oliveira (UFC) as part of Seminário 
 Brasileiro de Grafos\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/31/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Susanna Figueiredo de Rezende (Czech Academy of Sciences)
DTSTART:20210617T190000Z
DTEND:20210617T200000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/32
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/32/">"Pebble games" e algumas aplicações em complexidade comp
 utacional</a>\nby Susanna Figueiredo de Rezende (Czech Academy of Sciences
 ) as part of Seminário Brasileiro de Grafos\, Algoritmos e Combinatória\
 n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/32/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sebastián Urrutia (UFMG and Molde University College)
DTSTART:20210729T190000Z
DTEND:20210729T200000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/33
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/33/">Edge coloring: A natural model for sports scheduling</a>\n
 by Sebastián Urrutia (UFMG and Molde University College) as part of Semin
 ário Brasileiro de Grafos\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/33/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Renato Carmo (UFPR)
DTSTART:20210812T190000Z
DTEND:20210812T200000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/34
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/34/">A Vida Como Ela É: O Curioso Caso do Problema da Clique M
 áxima</a>\nby Renato Carmo (UFPR) as part of Seminário Brasileiro de Gra
 fos\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/34/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Flavia Bonomo (Universidad de Buenos Aires)
DTSTART:20210824T170000Z
DTEND:20210824T180000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/35
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/35/">Intersection models and forbidden pattern characterization
 s for k-thin and proper k-thin graphs</a>\nby Flavia Bonomo (Universidad d
 e Buenos Aires) as part of Seminário Brasileiro de Grafos\, Algoritmos e 
 Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/35/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Marilia Braga (Universität Bielefeld)
DTSTART:20210909T190000Z
DTEND:20210909T200000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/36
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/36/">Graph theoretical approach for genome comparison with larg
 e-scale mutations</a>\nby Marilia Braga (Universität Bielefeld) as part o
 f Seminário Brasileiro de Grafos\, Algoritmos e Combinatória\n\nAbstract
 : TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/36/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Bruno Pasqualotto Cavalar
DTSTART:20210916T190000Z
DTEND:20210916T200000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/37
DESCRIPTION:by Bruno Pasqualotto Cavalar as part of Seminário Brasileiro 
 de Grafos\, Algoritmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/37/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Renzo Gonzalo Gómez Diaz (Unicamp)
DTSTART:20220518T190000Z
DTEND:20220518T200000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/38
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/38/">t-spanners em grafos de grau limitado</a>\nby Renzo Gonzal
 o Gómez Diaz (Unicamp) as part of Seminário Brasileiro de Grafos\, Algor
 itmos e Combinatória\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/38/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Guilherme Fonseca (Aix-Marseille Université)
DTSTART:20220601T190000Z
DTEND:20220601T200000Z
DTSTAMP:20260404T111415Z
UID:SeminarisGrafos/39
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Semin
 arisGrafos/39/">Abordagem da equipe Shadoks para partição mínima em sub
 grafos de plano</a>\nby Guilherme Fonseca (Aix-Marseille Université) as p
 art of Seminário Brasileiro de Grafos\, Algoritmos e Combinatória\n\nAbs
 tract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/SeminarisGrafos/39/
END:VEVENT
END:VCALENDAR