{"id":7427,"date":"2024-02-03T23:10:24","date_gmt":"2024-02-03T23:10:24","guid":{"rendered":"https:\/\/csbc.sbc.org.br\/2024\/?page_id=7427"},"modified":"2024-07-09T21:58:18","modified_gmt":"2024-07-10T00:58:18","slug":"etc","status":"publish","type":"page","link":"https:\/\/csbc.sbc.org.br\/2024\/etc\/","title":{"rendered":"ETC – Encontro de Teoria da Computa\u00e7\u00e3o"},"content":{"rendered":"\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

ETC - 9\u00ba Encontro de Teoria da Computa\u00e7\u00e3o<\/span><\/h1>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\n\t\t\t\t\t\t<\/span>\n\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

Programa\u00e7\u00e3o<\/h2>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\n\t\t\t\t\t

Quarta-Feira (24\/07)
Local: Piso Superior - Sala Ip\u00ea Branco<\/span><\/span> <\/h2><\/span>\n\t\t\t\t\t\t\t\n\t\t\t<\/i><\/span>\n\t\t\t<\/i><\/span>\n\t\t<\/span>\n\n\t\t\t\t\t\t<\/summary>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\n\t\t\t\t\t

08:30<\/span><\/br>Abertura<\/b>
<\/span><\/br> <\/h2><\/span>\n\t\t\t\t\t\t\t\n\t\t\t<\/i><\/span>\n\t\t\t<\/i><\/span>\n\t\t<\/span>\n\n\t\t\t\t\t\t<\/summary>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

Abertura do ETC 2024<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/details>\n\t\t\t\t\t\t

\n\t\t\t\t\n\t\t\t\t\t

08:50<\/span><\/br>Palestra: Matheur\u00edsticas em Modelos Estendidos<\/b>
<\/span><\/br> <\/h2><\/span>\n\t\t\t\t\t\t\t\n\t\t\t<\/i><\/span>\n\t\t\t<\/i><\/span>\n\t\t<\/span>\n\n\t\t\t\t\t\t<\/summary>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\t\t\t\t\t\t\t\t\n\t\t
\n\t\t\t\n\t\t\t\t
\n\t\t\t\t\t\"\"\t\t\t\t<\/div>\n\t\t\t\n\n\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t

\n\t\t\t\t\t\t\t\t\t\t\tEdna Ayako Hoshino\t\t\t\t\t\t\t\t\t\t<\/h2>\n\t\t\t\t\t

Professora da Universidade Federal de Mato Grosso do Sul (UFMS)<\/p>\n\t\t\t\t\t\t\t\t\t\t

Resumo: <\/i>Formula\u00e7\u00f5es estendidas de programa\u00e7\u00e3o linear inteira fornecem limitantes duais mais apertados para alguns problemas de otimiza\u00e7\u00e3o combinat\u00f3ria, como problemas de roteamento de ve\u00edculos, problemas de empacotamento e problemas de colora\u00e7\u00e3o em grafos, quando comparadas com aquelas obtidas por formula\u00e7\u00f5es compactas. Diante dessa propriedade, uma pergunta natural \u00e9 \"como obter boas solu\u00e7\u00f5es para esses problemas a partir dos modelos estendidos?\". Heur\u00edsticas baseadas em programa\u00e7\u00e3o matem\u00e1tica, denominadas matheur\u00edsticas, n\u00e3o s\u00e3o um tema novo, mas t\u00eam recebido a aten\u00e7\u00e3o da comunidade acad\u00eamica nos \u00faltimos anos. Uma matheur\u00edstica baseada nos modelos estendidos e bem conhecida na literatura \u00e9 a heur\u00edstica de gera\u00e7\u00e3o de colunas. Nessa palestra discutirei alguns resultados de pesquisas, nas quais diferentes abordagens de matheur\u00edsticas s\u00e3o usadas para tirar proveito da qualidade dos limitantes dados pelos modelos estendidos. Um dos frameworks que propusemos consiste em uma matheur\u00edstica baseada no algoritmo exato branch-and-price, o qual denominamos \"branch-and-price parcial\". Ele re\u00fane algumas caracter\u00edsticas similares \u00e0 matheur\u00edstica de diving quando aplicado a modelos estendidos. Em outros trabalhos, n\u00f3s reduzimos o problema de encontrar boas solu\u00e7\u00f5es para problemas de otimiza\u00e7\u00e3o modelados por formula\u00e7\u00f5es estendidas a variantes do problema da mochila, as quais foram resolvidas por diferentes matheur\u00edsticas.<\/p>\n\t\t\t\t\t\t\t\t\t<\/div>\n\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\n\t\t\t\n\t\t\t\t<\/div>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/details>\n\t\t\t\t\t\t

\n\t\t\t\t\n\t\t\t\t\t

09:50<\/span><\/br>Sess\u00e3o 1<\/b>
<\/span><\/br> <\/h2><\/span>\n\t\t\t\t\t\t\t\n\t\t\t<\/i><\/span>\n\t\t\t<\/i><\/span>\n\t\t<\/span>\n\n\t\t\t\t\t\t<\/summary>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\n\n\n\t\n\n\t\n\t
Hor\u00e1rio<\/th>Apresenta\u00e7\u00e3o<\/th>\n<\/tr>\n<\/thead>\n
09:50 - 10:10<\/td>An Algebraic Model for Simulation of Percolation Decoherence on Quantum-Walk-Based Search Algorithms<\/b>
\nGabriel Mauricio Oswald Vieira (UFRJ), Rui Ald\u00e9 Lopes (UFRJ), Nelson Maculan (UFRJ), Franklin L. Marquezino (UFRJ)<\/td>\n<\/tr>\n
10:10 - 10:30<\/td>Problemas musicais - estrutura, propostas e complexidade<\/b>
\nLuerbio Faria, Natan Figueiredo (UERJ), Vinicius Fernandes dos Santos (UFMG)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/details>\n\t\t\t\t\t\t
\n\t\t\t\t\n\t\t\t\t\t

11:00<\/span><\/br>Sess\u00e3o 2<\/b>
<\/span><\/br> <\/h2><\/span>\n\t\t\t\t\t\t\t\n\t\t\t<\/i><\/span>\n\t\t\t<\/i><\/span>\n\t\t<\/span>\n\n\t\t\t\t\t\t<\/summary>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\n\n\n\t\n\n\t\n\t\n\t\n\t\n\t\n\t
Hor\u00e1rio<\/th>Apresenta\u00e7\u00e3o<\/th>\n<\/tr>\n<\/thead>\n
11:00 - 11:20<\/td>Infinite families of Kochol superpositions of Goldberg with Blowup snarks are Type 1<\/b>
\nGiovanna A.B. Penao (UFF), Miguel A. D. R. Palma (UFF), Simone Dantas (UFF), Diana Sasaki (UERJ)<\/td>\n<\/tr>\n
11:20 - 11:40<\/td>Graceful chromatic number of the first Blanu\u0161a snarks<\/b>
\nPaola T. Pantoja (UFF), Simone Dantas (UFF), At\u00edlio Gomes Luiz (UFC)<\/td>\n<\/tr>\n
11:40 - 12:00<\/td>Clique-Number of Timbral Graphs<\/b>
\nMarcia Cerioli (UFRJ), Luan Sim\u00f5es Cardoso (UFRJ), Petrucio Viana (UFF)<\/td>\n<\/tr>\n
12:00 - 12:20<\/td>An efficient algorithm to add up-links to a rooted tree to obtain a minimum cost 2-connected graph<\/b>
\nGabriel Morete de Azevedo (USP), Yoshiko Wakabayashi (USP)<\/td>\n<\/tr>\n
12:20 - 12:40<\/td>Colora\u00e7\u00e3o total equilibrada do snark Estrela Dupla<\/b>
\nRieli Araujo (UERJ), Diana Sasaki (UERJ)<\/td>\n<\/tr>\n
12:40 - 13:00<\/td>On the AVD-total chromatic number of circulant graphs<\/b>
\nMatheus Adauto (UFRJ), Mauro Nigro (UERJ)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/details>\n\t\t\t\t\t\t
\n\t\t\t\t\n\t\t\t\t\t

16:30<\/span><\/br>Sess\u00e3o 3<\/b>
<\/span><\/br> <\/h2><\/span>\n\t\t\t\t\t\t\t\n\t\t\t<\/i><\/span>\n\t\t\t<\/i><\/span>\n\t\t<\/span>\n\n\t\t\t\t\t\t<\/summary>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\n\n\n\t\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t
Hor\u00e1rio<\/th>Apresenta\u00e7\u00e3o<\/th>\n<\/tr>\n<\/thead>\n
16:30 - 16:50<\/td>Colora\u00e7\u00e3o de identifica\u00e7\u00e3o local no produto corona de ciclos e caminhos<\/b>
\nRobson Medrado de Oliveira (UFG), M\u00e1rcia R. Cappelle (UFG), Hebert da Silva Coelho (UFG)<\/td>\n<\/tr>\n
16:50 - 17:10<\/td>Hipergrafos de Dijkstra: Reconhecimento e Isomorfismo<\/b>
\nLeonardo de Almeida Cavadas (UERJ), Luerbio Faria, Lucila Maria de Souza Bento (UERJ), Jayme Luiz Szwarcfiter (UFRJ), Andr\u00e9 L. P. Guedes (UFPR), Lilian Markenzon (UFRJ)<\/td>\n<\/tr>\n
17:10 - 17:30<\/td>Complexidade de alguns par\u00e2metros na convexidade de ciclos<\/b>
\nCarlos Lima (UFCA), Thiago Marcilon (UFCA), Pedro Medeiros (UFC)<\/td>\n<\/tr>\n
17:30 - 17:50<\/td>Jogos de Convexidade em Grafos Direcionados<\/b>
\nSamuel Nascimento (IFCE), Jo\u00e3o Marcos Brito (UFC), Rudini Menezes Sampaio (UFC)<\/td>\n<\/tr>\n
17:50 - 18:10<\/td>Os grafos cordais comparabilidade como grafos de interse\u00e7\u00e3o<\/b>
\nRodrigo Fernandes Souto (UFRJ), Marcia Cerioli (UFRJ), Petrucio Viana (UFF)<\/td>\n<\/tr>\n
18:10 - 18:30<\/td>Representa\u00e7\u00f5es de grafos Split e Ciclo EPG em grades minimais<\/b>
\nJo\u00e3o Vitor Reis Dias (UFT), Tanilson Dias Santos (UFT)<\/td>\n<\/tr>\n
18:30 - 18h40<\/td>Foto oficial 1<\/b><\/td>\n<\/tr>\n
<\/td><\/td>\n<\/tr>\n
<\/td><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/details>\n\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/details>\n\t\t\t\t\t\t
\n\t\t\t\t\n\t\t\t\t\t

Quinta-Feira (25\/07)
Local: Piso Superior - Sala Ip\u00ea Branco<\/span><\/span> <\/h2><\/span>\n\t\t\t\t\t\t\t\n\t\t\t<\/i><\/span>\n\t\t\t<\/i><\/span>\n\t\t<\/span>\n\n\t\t\t\t\t\t<\/summary>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\n\t\t\t\t\t

08:30<\/span><\/br>Palestra: Resultados Recentes Acerca do Problema de Separa\u00e7\u00e3o por Caminhos<\/b>
<\/span><\/br> <\/h2><\/span>\n\t\t\t\t\t\t\t\n\t\t\t<\/i><\/span>\n\t\t\t<\/i><\/span>\n\t\t<\/span>\n\n\t\t\t\t\t\t<\/summary>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\t\t\t\t\t\t\t\t\n\t\t
\n\t\t\t\n\t\t\t\t
\n\t\t\t\t\t\"\"\t\t\t\t<\/div>\n\t\t\t\n\n\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t

\n\t\t\t\t\t\t\t\t\t\t\tGuilherme Oliveira Mota\t\t\t\t\t\t\t\t\t\t<\/h2>\n\t\t\t\t\t

Professor da Universidade de S\u00e3o Paulo (USP)<\/p>\n\t\t\t\t\t\t\t\t\t\t

Resumo: <\/i>Discutiremos o problema de separar as arestas de um grafo utilizando poucos caminhos, um problema cl\u00e1ssico que vem ganhando muita aten\u00e7\u00e3o recentemente. Dado um grafo, o objetivo \u00e9 encontrar uma fam\u00edlia pequena de caminhos tal que, para qualquer par de arestas e,f, h\u00e1 um caminho que cont\u00e9m a aresta e, mas n\u00e3o cont\u00e9m a aresta f, e outro caminho que cont\u00e9m a aresta e, mas n\u00e3o cont\u00e9m a aresta f. Apresentaremos as ideias envolvidas em alguns resultados recentes envolvendo esse problema e daremos algumas dire\u00e7\u00f5es de pesquisa poss\u00edveis. Somente conhecimento b\u00e1sico sobre grafos \u00e9 necess\u00e1rio.<\/p>\n\t\t\t\t\t\t\t\t\t<\/div>\n\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\n\t\t\t\n\t\t\t\t<\/div>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/details>\n\t\t\t\t\t\t

\n\t\t\t\t\n\t\t\t\t\t

09:30<\/span><\/br>Sess\u00e3o 4<\/b>
<\/span><\/br> <\/h2><\/span>\n\t\t\t\t\t\t\t\n\t\t\t<\/i><\/span>\n\t\t\t<\/i><\/span>\n\t\t<\/span>\n\n\t\t\t\t\t\t<\/summary>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\n\n\n\t\n\n\t\n\t\n\t
Hor\u00e1rio<\/th>Apresenta\u00e7\u00e3o<\/th>\n<\/tr>\n<\/thead>\n
09:30 - 09:50<\/td>The line graphs of M\u00f6bius ladder graphs are Type 1<\/b>
\nMauro Nigro (UERJ), Diana Sasaki (UERJ), Luerbio Faria (UERJ)<\/td>\n<\/tr>\n
09:50 - 10:10<\/td>Valid Paths, a short synthesis<\/b>
\nGustavo Machado Leal (UFG), Humberto Longo (UFG), Hebert da Silva Coelho (UFG), Leslie Foulds (UFG)<\/td>\n<\/tr>\n
10:10 - 10:30<\/td>Firefighters work better when the bandwidth is small<\/b>
\nS\u00e9rgio Fusquino (UERJ), Diana Sasaki (UERJ), Luerbio Faria (UERJ), Vinicius Fernandes dos Santos (UFMG)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/details>\n\t\t\t\t\t\t
\n\t\t\t\t\n\t\t\t\t\t

11:00<\/span><\/br>Sess\u00e3o 5<\/b>
<\/span><\/br> <\/h2><\/span>\n\t\t\t\t\t\t\t\n\t\t\t<\/i><\/span>\n\t\t\t<\/i><\/span>\n\t\t<\/span>\n\n\t\t\t\t\t\t<\/summary>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\n\n\n\t\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t
Hor\u00e1rio<\/th>Apresenta\u00e7\u00e3o<\/th>\n<\/tr>\n<\/thead>\n
11:00 - 11:20<\/td>Apresenta\u00e7\u00e3o de P\u00f4steres<\/b>
\n

    \n
  • Conjunto dominante independente aberto (OIND set) em produto lexicogr\u00e1fico de grafos<\/b><\/br>Lauane Mateus Oliveira de Moraes (UFG), Erika M. M. Coelho (UFG)<\/li>
    \n
    \n
  • Sobre a generaliza\u00e7\u00e3o do grafo da Torre de Hanoi<\/b><\/br>Lia Martins (UFAM), Jonas Costa (UFAM), Rosiane de Freitas (UFAM)<\/li>
    \n
    \n
  • Formaliza\u00e7\u00e3o e Verifica\u00e7\u00e3o em Coq do Algoritmo de Dijkstra<\/b><\/br>Jo\u00e3o Vitor Fr\u00f6hlich (UFMG), Karina Girardi Roggia (UFRGS), Paulo H. Torrens (UDESC)<\/li>
    \n
    \n
  • Solu\u00e7\u00f5es fact\u00edveis para o problema do caixeiro viajante com ve\u00edculo el\u00e9trico e janelas de tempo<\/b><\/br>Pedro Belin Castellucci (UFSC), Alvaro J. P. Franco (UFSC), Rafael de Santiago (UFSC)<\/li>
    \n<\/ul><\/td>\n<\/tr>\n
11:20 - 11:40<\/td>Um algoritmo branch-and-price para o problema de orienta\u00e7\u00e3o de times com conjuntos<\/b>
\nFrancisco Ferreira Lima Neto (UFMS), Pedro dos Santos Zanelato (UFMS), Pedro Paulo Ara\u00fajo de Paula e Silva (UFMS), Edna Hoshino (UFMS)<\/td>\n<\/tr>\n
11:40 - 12:00<\/td>Sobre o Problema do Caixeiro Viajante com Drone<\/b>
\nPedro Hokama (UNIFEI), Carla Negri Lintzmayer (UFABC), Mario C\u00e9sar San Felice (UFSCAR)<\/td>\n<\/tr>\n
12:00 - 12:20<\/td>Reduzindo para complexidade linear a solu\u00e7\u00e3o do TSP com datas de libera\u00e7\u00e3o em caminhos com dep\u00f3sito na extremidade<\/b>
\nThailsson de Andrade (UFAM), Rosiane de Freitas (UFAM)<\/td>\n<\/tr>\n
12:20 - 12:40<\/td>An\u00e1lise da Aloca\u00e7\u00e3o de Recursos em Smart Cities e Fog Computing abordando M\u00faltiplos Per\u00edodos e Servi\u00e7os<\/b>
\nMayron C\u00e9sar de Oliveira Moreira (UFLA), Samuel Moreira Ara\u00fajo (UFSJ), Geraldo Robson Mateus (UFMG)<\/td>\n<\/tr>\n
12:40 - 13:00<\/td>Large neighbourhood search para o problema do safe set<\/b>
\nJos\u00e9 Paulo Pedrosa (UFMS), Edna Hoshino (UFMS), Vagner Pedrotti (UFMS)<\/td>\n<\/tr>\n
13:00 - 13:10<\/td>Foto oficial 2<\/b><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/details>\n\t\t\t\t\t\t
\n\t\t\t\t\n\t\t\t\t\t

16:30<\/span><\/br>Sess\u00e3o 6<\/b>
<\/span><\/br> <\/h2><\/span>\n\t\t\t\t\t\t\t\n\t\t\t<\/i><\/span>\n\t\t\t<\/i><\/span>\n\t\t<\/span>\n\n\t\t\t\t\t\t<\/summary>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\n\n\n\t\n\n\t\n\t\n\t\n\t\n\t\n\t
Hor\u00e1rio<\/th>Apresenta\u00e7\u00e3o<\/th>\n<\/tr>\n<\/thead>\n
16:30 - 16:50<\/td>Em dire\u00e7\u00e3o a uma nova abordagem para colorir os v\u00e9rtices de um grafo usando Busca Monte Carlo em \u00c1rvore<\/b>
\nRaquel Marcolino de Souza (UERJ), Fabiano de Souza Oliveira (UERJ), Paulo Eustaquio Duarte Pinto (UERJ), Valmir Barbosa (UFRJ)<\/td>\n<\/tr>\n
16:50 - 17:10<\/td>3-atribui\u00e7\u00e3o de pap\u00e9is em produto forte de grafos bipartidos e grafos cordais sem folhas.<\/b>
\nGustavo Morais Medeiros (UFG), Julliano Rosa Nascimento (UFG)<\/td>\n<\/tr>\n
17:10 - 17:30<\/td>Caracteriza\u00e7\u00e3o de 2-atribui\u00e7\u00e3o de pap\u00e9is em produto corona de dois grafos<\/b>
\nJarlilson Guajajara (UFG), Julliano Rosa Nascimento (UFG)<\/td>\n<\/tr>\n
17:30 - 17:50<\/td>Generalizing the coloring game from caterpillars to trees<\/b>
\nMiguel A. D. R Palma (UFF), Ana Lu\u00edsa Carvalho Furtado (CEFET\/RJ), Simone Dantas (UFF), Celina M. H. Figueiredo (UFRJ)<\/td>\n<\/tr>\n
17:50 - 18:10<\/td>Encerramento e Premia\u00e7\u00e3o<\/b><\/td>\n<\/tr>\n
18:10 - 18:30<\/td>Reuni\u00e3o CEACO<\/b><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/details>\n\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/details>\n\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

\u00a0<\/h2>

Sobre o Evento<\/h2>

O Encontro de Teoria da Computa\u00e7\u00e3o<\/strong>, em sua nona edi\u00e7\u00e3o, tem se apresentado como um f\u00f3rum voltado para a grande \u00e1rea de Teoria da Computa\u00e7\u00e3o, proposto por membros da Comiss\u00e3o Especial em Algoritmos, Combinat\u00f3ria e Otimiza\u00e7\u00e3o (CE-ACO), com objetivo de promover uma maior divulga\u00e7\u00e3o da \u00e1rea para a comunidade brasileira de computa\u00e7\u00e3o e afins, atrav\u00e9s do principal evento da SBC, o CSBC.<\/p>

Esse evento \u00e9 voltado primeiramente para alunos em forma\u00e7\u00e3o, mas tamb\u00e9m visa proporcionar uma maior integra\u00e7\u00e3o entre os pesquisadores e profissionais que atuam na \u00e1rea, seja com enfoque em teoria pura ou em aplica\u00e7\u00f5es, estimulando a discuss\u00e3o da import\u00e2ncia dos fundamentos da computa\u00e7\u00e3o e sua aplica\u00e7\u00e3o direta no entendimento e resolu\u00e7\u00e3o de problemas das mais diversas \u00e1reas e segmentos de mercado.<\/p>

Convidamos a comunidade a compartilhar resultados de pesquisa por meio da submiss\u00e3o de resumos estendidos, abrangendo tanto pesquisas em n\u00edvel de p\u00f3s-gradua\u00e7\u00e3o como tamb\u00e9m inicia\u00e7\u00e3o cient\u00edfica na gradua\u00e7\u00e3o e tamb\u00e9m a prestigiar os trabalhos selecionados com sua presen\u00e7a nas apresenta\u00e7\u00f5es. O evento \u00e9 aberto para a comunidade, com especial interesse nos alunos em forma\u00e7\u00e3o de gradua\u00e7\u00e3o e de p\u00f3s-gradua\u00e7\u00e3o.<\/p>

\u00a0<\/h2>

T\u00f3picos de Interesse<\/h2>

Os t\u00f3picos de interesse incluem, mas n\u00e3o s\u00e3o limitados a:<\/p>