{"id":1089,"date":"2023-01-30T14:34:07","date_gmt":"2023-01-30T14:34:07","guid":{"rendered":"https:\/\/csbc.sbc.org.br\/2023\/?page_id=1089"},"modified":"2023-08-07T16:07:36","modified_gmt":"2023-08-07T16:07:36","slug":"etc","status":"publish","type":"page","link":"https:\/\/csbc.sbc.org.br\/2023\/etc\/","title":{"rendered":"ETC"},"content":{"rendered":"\t\t<div data-elementor-type=\"wp-page\" data-elementor-id=\"1089\" class=\"elementor elementor-1089\" data-elementor-post-type=\"page\">\n\t\t\t\t<div class=\"elementor-element elementor-element-39ceafef e-flex e-con-boxed e-con e-parent\" data-id=\"39ceafef\" data-element_type=\"container\" data-e-type=\"container\" data-settings=\"{&quot;background_background&quot;:&quot;video&quot;,&quot;background_video_link&quot;:&quot;https:\\\/\\\/csbc.sbc.org.br\\\/2023\\\/wp-content\\\/uploads\\\/2023\\\/01\\\/O-Circuito-27725.mp4&quot;,&quot;background_play_on_mobile&quot;:&quot;yes&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t<div class=\"elementor-background-video-container\">\n\t\t\t\t\t\t\t<video class=\"elementor-background-video-hosted\" role=\"presentation\" autoplay muted playsinline loop><\/video>\n\t\t\t\t\t<\/div>\t\t<div class=\"elementor-element elementor-element-d50e176 elementor-widget elementor-widget-heading\" data-id=\"d50e176\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<h2 class=\"elementor-heading-title elementor-size-default\">ETC - VIII Encontro de Teoria da Computa\u00e7\u00e3o<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-22bf223f elementor-widget-divider--view-line elementor-widget elementor-widget-divider\" data-id=\"22bf223f\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"divider.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<div class=\"elementor-divider\">\n\t\t\t<span class=\"elementor-divider-separator\">\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\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-5884282 e-flex e-con-boxed e-con e-parent\" data-id=\"5884282\" data-element_type=\"container\" data-e-type=\"container\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-a927925 elementor-widget__width-inherit e-n-tabs-mobile elementor-widget elementor-widget-n-tabs\" data-id=\"a927925\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"nested-tabs.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<div class=\"e-n-tabs\" data-widget-number=\"177371429\" aria-label=\"Abas. Abra itens com &quot;Enter&quot; ou &quot;Espa\u00e7o&quot;, feche com &quot;Escape&quot; e navegue usando as teclas de &quot;Seta&quot;.\">\n\t\t\t<div class=\"e-n-tabs-heading\" role=\"tablist\">\n\t\t\t\t\t<button id=\"e-n-tab-title-1773714291\" data-tab-title-id=\"e-n-tab-title-1773714291\" class=\"e-n-tab-title elementor-animation-sink\" aria-selected=\"true\" data-tab-index=\"1\" role=\"tab\" tabindex=\"0\" aria-controls=\"e-n-tab-content-1773714291\" style=\"--n-tabs-title-order: 1;\">\n\t\t\t\t\t\t<span class=\"e-n-tab-title-text\">\n\t\t\t\tSobre o evento\t\t\t<\/span>\n\t\t<\/button>\n\t\t\t\t<button id=\"e-n-tab-title-1773714292\" data-tab-title-id=\"e-n-tab-title-1773714292\" class=\"e-n-tab-title elementor-animation-sink\" aria-selected=\"false\" data-tab-index=\"2\" role=\"tab\" tabindex=\"-1\" aria-controls=\"e-n-tab-content-1773714292\" style=\"--n-tabs-title-order: 2;\">\n\t\t\t\t\t\t<span class=\"e-n-tab-title-text\">\n\t\t\t\tChamada de trabalhos\t\t\t<\/span>\n\t\t<\/button>\n\t\t\t\t<button id=\"e-n-tab-title-1773714293\" data-tab-title-id=\"e-n-tab-title-1773714293\" class=\"e-n-tab-title elementor-animation-sink\" aria-selected=\"false\" data-tab-index=\"3\" role=\"tab\" tabindex=\"-1\" aria-controls=\"e-n-tab-content-1773714293\" style=\"--n-tabs-title-order: 3;\">\n\t\t\t\t\t\t<span class=\"e-n-tab-title-text\">\n\t\t\t\tT\u00f3picos de Interesse\t\t\t<\/span>\n\t\t<\/button>\n\t\t\t\t<button id=\"e-n-tab-title-1773714294\" data-tab-title-id=\"e-n-tab-title-1773714294\" class=\"e-n-tab-title elementor-animation-sink\" aria-selected=\"false\" data-tab-index=\"4\" role=\"tab\" tabindex=\"-1\" aria-controls=\"e-n-tab-content-1773714294\" style=\"--n-tabs-title-order: 4;\">\n\t\t\t\t\t\t<span class=\"e-n-tab-title-text\">\n\t\t\t\tInstru\u00e7\u00f5es para submiss\u00e3o\t\t\t<\/span>\n\t\t<\/button>\n\t\t\t\t<button id=\"e-n-tab-title-1773714295\" data-tab-title-id=\"e-n-tab-title-1773714295\" class=\"e-n-tab-title elementor-animation-sink\" aria-selected=\"false\" data-tab-index=\"5\" role=\"tab\" tabindex=\"-1\" aria-controls=\"e-n-tab-content-1773714295\" style=\"--n-tabs-title-order: 5;\">\n\t\t\t\t\t\t<span class=\"e-n-tab-title-text\">\n\t\t\t\tDatas importantes\t\t\t<\/span>\n\t\t<\/button>\n\t\t\t\t<button id=\"e-n-tab-title-1773714296\" data-tab-title-id=\"e-n-tab-title-1773714296\" class=\"e-n-tab-title elementor-animation-sink\" aria-selected=\"false\" data-tab-index=\"6\" role=\"tab\" tabindex=\"-1\" aria-controls=\"e-n-tab-content-1773714296\" style=\"--n-tabs-title-order: 6;\">\n\t\t\t\t\t\t<span class=\"e-n-tab-title-text\">\n\t\t\t\tInscri\u00e7\u00e3o dos autores\t\t\t<\/span>\n\t\t<\/button>\n\t\t\t\t<button id=\"e-n-tab-title-1773714297\" data-tab-title-id=\"e-n-tab-title-1773714297\" class=\"e-n-tab-title elementor-animation-sink\" aria-selected=\"false\" data-tab-index=\"7\" role=\"tab\" tabindex=\"-1\" aria-controls=\"e-n-tab-content-1773714297\" style=\"--n-tabs-title-order: 7;\">\n\t\t\t\t\t\t<span class=\"e-n-tab-title-text\">\n\t\t\t\tPublica\u00e7\u00e3o de Trabalhos\t\t\t<\/span>\n\t\t<\/button>\n\t\t\t\t<button id=\"e-n-tab-title-1773714298\" data-tab-title-id=\"e-n-tab-title-1773714298\" class=\"e-n-tab-title elementor-animation-sink\" aria-selected=\"false\" data-tab-index=\"8\" role=\"tab\" tabindex=\"-1\" aria-controls=\"e-n-tab-content-1773714298\" style=\"--n-tabs-title-order: 8;\">\n\t\t\t\t\t\t<span class=\"e-n-tab-title-text\">\n\t\t\t\tPremia\u00e7\u00f5es\t\t\t<\/span>\n\t\t<\/button>\n\t\t\t\t<button id=\"e-n-tab-title-1773714299\" data-tab-title-id=\"e-n-tab-title-1773714299\" class=\"e-n-tab-title elementor-animation-sink\" aria-selected=\"false\" data-tab-index=\"9\" role=\"tab\" tabindex=\"-1\" aria-controls=\"e-n-tab-content-1773714299\" style=\"--n-tabs-title-order: 9;\">\n\t\t\t\t\t\t<span class=\"e-n-tab-title-text\">\n\t\t\t\tPrograma\u00e7\u00e3o\t\t\t<\/span>\n\t\t<\/button>\n\t\t\t\t<button id=\"e-n-tab-title-17737142910\" data-tab-title-id=\"e-n-tab-title-17737142910\" class=\"e-n-tab-title elementor-animation-sink\" aria-selected=\"false\" data-tab-index=\"10\" role=\"tab\" tabindex=\"-1\" aria-controls=\"e-n-tab-content-17737142910\" style=\"--n-tabs-title-order: 10;\">\n\t\t\t\t\t\t<span class=\"e-n-tab-title-text\">\n\t\t\t\tPalestras\t\t\t<\/span>\n\t\t<\/button>\n\t\t\t\t<button id=\"e-n-tab-title-17737142911\" data-tab-title-id=\"e-n-tab-title-17737142911\" class=\"e-n-tab-title elementor-animation-sink\" aria-selected=\"false\" data-tab-index=\"11\" role=\"tab\" tabindex=\"-1\" aria-controls=\"e-n-tab-content-17737142911\" style=\"--n-tabs-title-order: 11;\">\n\t\t\t\t\t\t<span class=\"e-n-tab-title-text\">\n\t\t\t\tOrganiza\u00e7\u00e3o\t\t\t<\/span>\n\t\t<\/button>\n\t\t\t\t\t<\/div>\n\t\t\t<div class=\"e-n-tabs-content\">\n\t\t\t\t<div id=\"e-n-tab-content-1773714291\" role=\"tabpanel\" aria-labelledby=\"e-n-tab-title-1773714291\" data-tab-index=\"1\" style=\"--n-tabs-title-order: 1;\" class=\"e-active elementor-element elementor-element-d4b1dc7 e-con-full e-flex e-con e-parent\" data-id=\"d4b1dc7\" data-element_type=\"container\" data-e-type=\"container\">\n\t\t\t\t<div class=\"elementor-element elementor-element-01df104 elementor-widget elementor-widget-text-editor\" data-id=\"01df104\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<p>O Encontro de Teoria da Computa\u00e7\u00e3o, em sua oitava 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><p>Esse evento \u00e9 voltado primeiramente para alunos em forma\u00e7\u00e3o, mas tamb\u00e9m visa a proporcionar uma maior integra\u00e7\u00e3o entre os pesquisadores e profissionais que atuam na \u00e1rea, seja com enfoque em teoria pura, seja 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><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.<\/p><p>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>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div id=\"e-n-tab-content-1773714292\" role=\"tabpanel\" aria-labelledby=\"e-n-tab-title-1773714292\" data-tab-index=\"2\" style=\"--n-tabs-title-order: 2;\" class=\" elementor-element elementor-element-58489f4 e-con-full e-flex e-con e-parent\" data-id=\"58489f4\" data-element_type=\"container\" data-e-type=\"container\">\n\t\t\t\t<div class=\"elementor-element elementor-element-e49b7a2 elementor-widget elementor-widget-text-editor\" data-id=\"e49b7a2\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<p>Convidamos a comunidade cient\u00edfica, em particular \u00e0queles atuando na \u00e1rea de teoria da computa\u00e7\u00e3o e \u00e1reas correlatas, a submeterem seus resultados de pesquisa, por meio de resumos estendidos, ao VIII Encontro de Teoria da Computa\u00e7\u00e3o, evento sat\u00e9lite do Congresso da Sociedade Brasileira de Computa\u00e7\u00e3o (CSBC). Trabalhos envolvendo alunos de p\u00f3s-gradua\u00e7\u00e3o ou gradua\u00e7\u00e3o s\u00e3o especialmente bem-vindos. Os trabalhos selecionados dever\u00e3o ser apresentados oralmente em sess\u00f5es t\u00e9cnicas do ETC 2023.<\/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<div id=\"e-n-tab-content-1773714293\" role=\"tabpanel\" aria-labelledby=\"e-n-tab-title-1773714293\" data-tab-index=\"3\" style=\"--n-tabs-title-order: 3;\" class=\" elementor-element elementor-element-8a4678d e-con-full e-flex e-con e-parent\" data-id=\"8a4678d\" data-element_type=\"container\" data-e-type=\"container\">\n\t\t\t\t<div class=\"elementor-element elementor-element-c1dca1d elementor-widget elementor-widget-text-editor\" data-id=\"c1dca1d\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<p>Os t\u00f3picos de interesse incluem, mas n\u00e3o s\u00e3o limitados a:\u00a0<\/p><ul><li><strong>Algoritmos<\/strong>: an\u00e1lise e projeto de algoritmos, algoritmos exatos, algoritmos de aproxima\u00e7\u00e3o, algoritmos probabil\u00edsticos, algoritmos parametrizados, algoritmos online, t\u00e9cnicas de decomposi\u00e7\u00e3o e balanceamento, algoritmos distribu\u00eddos e paralelos.<\/li><li><strong>Complexidade Computacional<\/strong>:\u00a0an\u00e1lise de problemas e algoritmos, NP-completude, redu\u00e7\u00f5es polinomiais, inaproximabilidade, classes de complexidade de tempo e espa\u00e7o, complexidade parametrizada, an\u00e1lise amortizada, abordagens l\u00f3gicas \u00e0 complexidade computacional, aplica\u00e7\u00f5es.<\/li><li><strong>Computabilidade<\/strong>:\u00a0modelos te\u00f3ricos de computa\u00e7\u00e3o,\u00a0m\u00e9todos e linguagens formais, aut\u00f4matos,\u00a0computabilidade de Turing e generaliza\u00e7\u00f5es, teoria da prova, teoria da recurs\u00e3o, redu\u00e7\u00f5es, decidibilidade, definibilidade, conjuntos enumer\u00e1veis,\u00a0sistemas de provas interativas,\u00a0matem\u00e1tica reversa, redes de Petri, aplica\u00e7\u00f5es.<\/li><li><strong>Otimiza\u00e7\u00e3o Combinat\u00f3ria<\/strong>: otimiza\u00e7\u00e3o em redes, programa\u00e7\u00e3o din\u00e2mica, estruturas combinat\u00f3rias, combinat\u00f3ria poli\u00e9drica, m\u00e9todos exatos e aproximativos, m\u00e9todos de busca global e de busca local, heur\u00edsticas, modelagem e aplica\u00e7\u00f5es.\u00a0<\/li><li><strong>Programa\u00e7\u00e3o Matem\u00e1tica<\/strong>:\u00a0programa\u00e7\u00e3o linear inteira e n\u00e3o-linear, programa\u00e7\u00e3o multiobjetivo, programa\u00e7\u00e3o por restri\u00e7\u00f5es, otimiza\u00e7\u00e3o estoc\u00e1stica, otimiza\u00e7\u00e3o robusta, formula\u00e7\u00f5es, decomposi\u00e7\u00f5es, m\u00e9todos de solu\u00e7\u00e3o exatos, heur\u00edsticos e h\u00edbridos.\u00a0<\/li><li><strong>Teoria dos Grafos e Combinat\u00f3ria<\/strong>:\u00a0problemas cl\u00e1ssicos, caracteriza\u00e7\u00e3o estrutural, reconhecimento, classes de grafos, estruturas proibidas, desenho e layout de grafos, teoria espectral, teoria extremal, grafos aleat\u00f3rios, algoritmos,\u00a0 complexidade, aplica\u00e7\u00f5es.<\/li><li><strong>Teoria da Informa\u00e7\u00e3o, N\u00fameros e Criptografia<\/strong>:\u00a0fundamentos, compress\u00e3o, teoria de c\u00f3digos,\u00a0corretores de erro, codifica\u00e7\u00e3o de fonte,\u00a0 sistemas num\u00e9ricos, aritm\u00e9tica modular, congru\u00eancias, divisibilidade, criptoan\u00e1lise, protocolos com seguran\u00e7a demonstr\u00e1vel, algoritmos, aplica\u00e7\u00f5es.<\/li><li><strong>Teoria dos Jogos e da Decis\u00e3o<\/strong>:\u00a0fundamentos, sistemas em equil\u00edbrio,\u00a0equil\u00edbrio de Nash,\u00a0domin\u00e2ncia, pre\u00e7o da anarquia e da estabilidade,\u00a0 leil\u00f5es e mecanismos, precifica\u00e7\u00e3o, estrat\u00e9gias competitivas, jogos cooperativos, jogos combinat\u00f3rios, pesquisa operacional, algoritmos, aplica\u00e7\u00f5es.<\/li><li><strong>Geometria Computacional<\/strong>:\u00a0algoritmos e estruturas de dados para problemas geom\u00e9tricos est\u00e1ticos e cin\u00e9ticos, espa\u00e7os m\u00e9tricos, geometria de dist\u00e2ncias, estruturas baseadas em propriedades geom\u00e9tricas, estruturas espaciais, aplica\u00e7\u00f5es.<\/li><li><strong>Aplica\u00e7\u00f5es e Problemas Pr\u00e1ticos<\/strong>:\u00a0aloca\u00e7\u00e3o de recursos,\u00a0apoio \u00e0 tomada de decis\u00e3o, biologia computacional, compiladores, economia, escalonamento, engenharias, estrutura molecular, pesquisa operacional, probabilidade e\u00a0estat\u00edstica,\u00a0\u00a0processos produtivos, reconhecimento de padr\u00f5es, redes de computadores, redes complexas, redes livres de escala e redes web,\u00a0rob\u00f3tica,\u00a0roteamento,\u00a0seguran\u00e7a de c\u00f3digo, sistemas e redes, sistemas paralelos e distribu\u00eddos, teoria de conjuntos, visualiza\u00e7\u00e3o de dados, aplica\u00e7\u00f5es com grandes massas de dados, aplica\u00e7\u00f5es din\u00e2micas, aplica\u00e7\u00f5es de tempo real.<\/li><\/ul>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div id=\"e-n-tab-content-1773714294\" role=\"tabpanel\" aria-labelledby=\"e-n-tab-title-1773714294\" data-tab-index=\"4\" style=\"--n-tabs-title-order: 4;\" class=\" elementor-element elementor-element-cd937db e-con-full e-flex e-con e-parent\" data-id=\"cd937db\" data-element_type=\"container\" data-e-type=\"container\">\n\t\t\t\t<div class=\"elementor-element elementor-element-4576255 elementor-widget-mobile__width-inherit elementor-widget elementor-widget-text-editor\" data-id=\"4576255\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<p><strong>Formato dos artigos<\/strong><\/p><p>Os trabalhos devem ser submetidos na forma de resumos estendidos, elaborados preferencialmente em LaTeX, seguindo o formato de artigos da SBC, dispon\u00edvel em\u00a0<a href=\"http:\/\/tinyurl.com\/sbc-template-artigos\">http:\/\/tinyurl.com\/sbc-template-artigos<\/a>. Devem ter no m\u00e1ximo 04 (quatro) p\u00e1ginas, sem incluir as refer\u00eancias.\u00a0<\/p><p>O artigo poder\u00e1 ter opcionalmente um ap\u00eandice, fora do limite de 4 p\u00e1ginas, contendo material de apoio adicional (como provas, detalhes de implementa\u00e7\u00e3o ou experimentos computacionais), que n\u00e3o puderam ser inclu\u00eddos no artigo submetido. O ap\u00eandice poder\u00e1 ser usado para fins de avalia\u00e7\u00e3o do trabalho, mas n\u00e3o far\u00e1 parte do texto publicado nos anais em caso de aceita\u00e7\u00e3o do artigo.<\/p><p><strong>Meio de submiss\u00e3o<\/strong><\/p><p>A submiss\u00e3o dos artigos ser\u00e1 eletr\u00f4nica, em formato PDF, e ser\u00e1 feita por meio do sistema JEMS a partir do link \u200b\u200b<a href=\"https:\/\/jems.sbc.org.br\/etc2023\">https:\/\/jems.sbc.org.br\/etc2023<\/a>.<\/p><p><strong>Processo de revis\u00e3o<\/strong><\/p><p>O trabalho submetido ser\u00e1 revisado com m\u00e9todo\u00a0<em>single-blind<\/em>\u00a0por pelo menos dois revisores, sejam membros do comit\u00ea de programa ou pesquisadores<strong>\u00a0por eles indicados.<\/strong><\/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<div id=\"e-n-tab-content-1773714295\" role=\"tabpanel\" aria-labelledby=\"e-n-tab-title-1773714295\" data-tab-index=\"5\" style=\"--n-tabs-title-order: 5;\" class=\" elementor-element elementor-element-c42398a e-con-full e-flex e-con e-parent\" data-id=\"c42398a\" data-element_type=\"container\" data-e-type=\"container\">\n\t\t\t\t<div class=\"elementor-element elementor-element-72df935 elementor-widget elementor-widget-text-editor\" data-id=\"72df935\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<ul><li>Limite para submiss\u00e3o dos trabalhos: <del>05\/03\/2023\u00a0 <\/del>\u00a0 &#8211;\u00a0 <del>20\/03\/2023 <\/del>\u00a0 &#8211;\u00a0 05\/04\/2023 (Final)<\/li><li>Notifica\u00e7\u00e3o dos trabalhos selecionados: <del>05\/05<\/del>\u00a0 &#8211; 20\/05\/2023<\/li><li>Data limite para envio das vers\u00f5es finais dos trabalhos: <del>16\/05<\/del>\u00a0 &#8211;\u00a0 28\/05\/2023<\/li><li>Prazo de inscri\u00e7\u00e3o autores(as): <del>16\/05<\/del>\u00a0 &#8211;\u00a0 05\/07\/2023<\/li><\/ul>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div id=\"e-n-tab-content-1773714296\" role=\"tabpanel\" aria-labelledby=\"e-n-tab-title-1773714296\" data-tab-index=\"6\" style=\"--n-tabs-title-order: 6;\" class=\" elementor-element elementor-element-7e6f97a e-con-full e-flex e-con e-parent\" data-id=\"7e6f97a\" data-element_type=\"container\" data-e-type=\"container\">\n\t\t\t\t<div class=\"elementor-element elementor-element-61e49ba elementor-widget elementor-widget-text-editor\" data-id=\"61e49ba\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<p>Para que um artigo aceito seja apresentado e inclu\u00eddo nos anais do evento, \u00e9 necess\u00e1rio que ao menos um dos autores do artigo realize a sua inscri\u00e7\u00e3o no evento. Cada inscri\u00e7\u00e3o na categoria profissional d\u00e1 direito \u00e0 publica\u00e7\u00e3o de um \u00fanico artigo, considerando qualquer um dos eventos-base ou eventos-sat\u00e9lite do CSBC. Autores com mais de um artigo aprovado em qualquer evento do CSBC dever\u00e3o pagar uma \u201ctaxa de publica\u00e7\u00e3o\u201d por artigo adicional. O valor dessa taxa pode ser visto na p\u00e1gina de inscri\u00e7\u00f5es do CSBC 2023.<\/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<div id=\"e-n-tab-content-1773714297\" role=\"tabpanel\" aria-labelledby=\"e-n-tab-title-1773714297\" data-tab-index=\"7\" style=\"--n-tabs-title-order: 7;\" class=\" elementor-element elementor-element-c95a846 e-con-full e-flex e-con e-parent\" data-id=\"c95a846\" data-element_type=\"container\" data-e-type=\"container\">\n\t\t\t\t<div class=\"elementor-element elementor-element-8fa1b2d elementor-widget elementor-widget-text-editor\" data-id=\"8fa1b2d\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<p>Os artigos aceitos ser\u00e3o publicados na SBC Open Lib, a biblioteca digital da SBC, na s\u00e9rie Anais do Encontro de Teoria da Computa\u00e7\u00e3o (ETC) dispon\u00edvel em <a href=\"https:\/\/sol.sbc.org.br\/index.php\/etc\" target=\"_blank\" rel=\"noopener\"><strong>https:\/\/sol.sbc.org.br\/index.php\/etc<\/strong><\/a>. Todos os artigos ser\u00e3o indexados com DOI.<\/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<div id=\"e-n-tab-content-1773714298\" role=\"tabpanel\" aria-labelledby=\"e-n-tab-title-1773714298\" data-tab-index=\"8\" style=\"--n-tabs-title-order: 8;\" class=\" elementor-element elementor-element-88bed29 e-con-full e-flex e-con e-parent\" data-id=\"88bed29\" data-element_type=\"container\" data-e-type=\"container\">\n\t\t\t\t<div class=\"elementor-element elementor-element-f9f087c elementor-widget elementor-widget-text-editor\" data-id=\"f9f087c\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<p>Os resumos estendidos submetidos ao ETC 2023 estar\u00e3o automaticamente concorrendo ao pr\u00eamio de melhor trabalho do evento, que ser\u00e1 escolhido por uma comiss\u00e3o especialmente designada para esse fim, composta por pelo menos tr\u00eas membros. A comiss\u00e3o levar\u00e1 em conta as avalia\u00e7\u00f5es dos revisores, al\u00e9m de sua pr\u00f3pria an\u00e1lise dos trabalhos.<\/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<div id=\"e-n-tab-content-1773714299\" role=\"tabpanel\" aria-labelledby=\"e-n-tab-title-1773714299\" data-tab-index=\"9\" style=\"--n-tabs-title-order: 9;\" class=\" elementor-element elementor-element-7739678 e-con-full e-flex e-con e-parent\" data-id=\"7739678\" data-element_type=\"container\" data-e-type=\"container\">\n\t\t\t\t<div class=\"elementor-element elementor-element-4d98745 elementor-widget elementor-widget-text-editor\" data-id=\"4d98745\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<div style=\"text-align: center;\"><span style=\"color: #000080;\"><strong>Programa\u00e7\u00e3o ETC<\/strong><\/span><\/div><div><div>\u00a0<\/div><div><table dir=\"ltr\" border=\"1\" cellspacing=\"0\" cellpadding=\"0\"><colgroup><col width=\"100\" \/><col width=\"100\" \/><col width=\"1509\" \/><\/colgroup><tbody><tr><td>ETC 2023<\/td><td>\u00a0<\/td><td>\u00a0<\/td><\/tr><tr><td>\u00a0<\/td><td>\u00a0<\/td><td>\u00a0<\/td><\/tr><tr><td>SEGUNDA<\/td><td>Sala<\/td><td>\u00a0<\/td><\/tr><tr><td>09:00 &#8211; 09:15<\/td><td>Carapibus<\/td><td>Abertura<\/td><\/tr><tr><td>09:15 &#8211; 10:05<\/td><td>Carapibus<\/td><td>Palestra do Anand Subramanian:\u00a0Hybrid iterated local search frameworks for classes of combinatorial optimization problems\u00a0(Chair: Manoel Camp\u00ealo)<\/td><\/tr><tr><td>10:05 &#8211; 10:30 A<\/td><td>Carapibus<\/td><td>Um QPTAS para o Problema de Empacotamento de C\u0131\u0301rculos em Linha* (Elisa Dell Arriva, Flavio Miyazawa)\u00a0(Chair: Manoel Camp\u00ealo)<\/td><\/tr><tr><td>10:05 &#8211; 10:30 B<\/td><td>Tabatinga<\/td><td>Novos resultados sobre colora\u00e7\u00e3o de arestas em grafos split: grafos split minimamente 3-admiss\u00edveis (Diego Ferraz, Sulamita Klein, Fernanda Couto)\u00a0(Chair: Guilherme Gomes)<\/td><\/tr><tr><td>10:30 &#8211; 11:00<\/td><td>\u00a0<\/td><td>COFFEE BREAK<\/td><\/tr><tr><td>11:00 &#8211; 11:25 A<\/td><td>Carapibus<\/td><td>PTAS para Problema do Empacotamento Soma M\u00ednima com Quadrados* (Rachel Vanucchi Saraiva,\u00a0Rafael Schouery)\u00a0(Chair da sess\u00e3o: Rafael Schouery)<\/td><\/tr><tr><td>11:25 &#8211; 11:50 A<\/td><td>Carapibus<\/td><td>Algoritmos de Aproxima\u00e7\u00e3o para o Problema de Extens\u00e3o de Quadrados Latinos Diagonais* (V\u00edtor Chagas, Flavio Miyazawa)<\/td><\/tr><tr><td>11:50 &#8211; 12:15 A<\/td><td>Carapibus<\/td><td>Complexidade parametrizada do problema de reconfigura\u00e7\u00e3o de separadores* (Guilherme de Castro Mendes Gomes, Vinicius dos Santos)<\/td><\/tr><tr><td>11:00 &#8211; 11:25 B<\/td><td>Tabatinga<\/td><td>Controlando o fogo nos fulerenos (S\u00e9rgio Fusquino, Diana Sasaki, Diego Nicodemos)\u00a0(Chair da sess\u00e3o: Diana Sasaki)<\/td><\/tr><tr><td>11:25 &#8211; 11:50 B<\/td><td>Tabatinga<\/td><td>Nota sobre o tempo m\u00ednimo de infec\u00e7\u00e3o em 2-neighbour bootstrap percolation em grids partindo de n+1 v\u00e9rtices (Matheus Pascoal, Fabricio Benevides)<\/td><\/tr><tr><td>11:50 &#8211; 12:15 B<\/td><td>Tabatinga<\/td><td>Modelo para Detec\u00e7\u00e3o de Pl\u00e1gio em Exerc\u00edcios de Programa\u00e7\u00e3o na Linguagem Python (Rafael Chaves, Kerven Albuquerque, Thiago Gouveia da Silva, Renato Chaves)<\/td><\/tr><tr><td>12:30 &#8211; 14:00<\/td><td>\u00a0<\/td><td>ALMO\u00c7O<\/td><\/tr><tr><td>14:00 &#8211; 14:50<\/td><td>Carapibus<\/td><td>Homenagem ao Nelson Maculan\u00a0(chair: Lucidio Formiga)<\/td><\/tr><tr><td>14:55 &#8211; 15:20 A<\/td><td>Carapibus<\/td><td>Um algoritmo gen\u00e9tico h\u00edbrido para o problema do caixeiro viajante com tempos de libera\u00e7\u00e3o* (Gabriel Soares,\u00a0Teobaldo Bulh\u00f5es J\u00fanior, Bruno Bruck)\u00a0(Chair da sess\u00e3o: Carla Lintzmayer)<\/td><\/tr><tr><td>15:20 &#8211; 15:45 A<\/td><td>Carapibus<\/td><td>MIP-Heuristics for the Capacitated Lot-Sizing with Hybrid Flow Shop Integration* (Diego Silva, Geraldo Robson Mateus)<\/td><\/tr><tr><td>15:45 &#8211; 16:10 A<\/td><td>Carapibus<\/td><td>Decomposi\u00e7\u00e3o de Fluxos em Digrafos Arco-Coloridos* (Cl\u00e1udio Carvalho Neto, Claudia Linhares Sales, Jonas Silva, Karolinna Maia)<\/td><\/tr><tr><td>16:10 &#8211; 16:35 A<\/td><td>Carapibus<\/td><td>On total coloring of small fullerene nanodiscs* (Mariana Cruz, Celina Figueiredo, Diana Sasaki,\u00a0Diane Castonguay)<\/td><\/tr><tr><td>16:35 &#8211; 17:00 A<\/td><td>Carapibus<\/td><td>Cobertura de grafos aleat\u00f3rios por caminhos multicoloridos (Ant\u00f4nio Fernandes, Guilherme Oliveira Mota, T\u00e1ssio Naia)<\/td><\/tr><tr><td>14:55 &#8211; 15:20 B<\/td><td>Tabatinga<\/td><td>The Hidden Subgroup Problem and Non-interactive Perfect Zero-Knowledge Proofs (Abner Costa, Henrique Hepp, Murilo da Silva, Leandro Zatesko)\u00a0(Chair da sess\u00e3o: Lehilton Pedrosa)<\/td><\/tr><tr><td>15:20 &#8211; 15:45 B<\/td><td>Tabatinga<\/td><td>An Introduction to the Complexity Class of Pure Nash Equilibrium (Victor Hugo Wirz,\u00a0Pedro Nuno Moura)<\/td><\/tr><tr><td>15:45 &#8211; 16:10 B<\/td><td>Tabatinga<\/td><td>Complexidade e Estrat\u00e9gias Vencedoras de Jogos de Convexidade em Grafos (Raquel Folz Cavalcante, Rosiane de Freitas,\u00a0Samuel Nascimento, Rudini Sampaio)<\/td><\/tr><tr><td>16:10 &#8211; 16:35 B<\/td><td>Tabatinga<\/td><td>O Problema do Caminho Positivo M\u00ednimo (Felipe Albuquerque Brito, Manoel Bezerra Campelo Neto, Tatiane Figueiredo)<\/td><\/tr><tr><td>16:35 &#8211; 17:00 B<\/td><td>Tabatinga<\/td><td>Freeze-Tag Remains NP-hard on Binary and Ternary Trees (Lehilton Lelis Chaves Pedrosa,\u00a0Lucas Silva)<\/td><\/tr><tr><td>17:00 &#8211; 17:30<\/td><td>\u00a0<\/td><td>COFFEE BREAK<\/td><\/tr><tr><td>17:30 &#8211; 18:30<\/td><td>Tabatinga<\/td><td>Reuni\u00e3o da CEACO<\/td><\/tr><tr><td>\u00a0<\/td><td>\u00a0<\/td><td>\u00a0<\/td><\/tr><tr><td>TER\u00c7A<\/td><td>Sala<\/td><td>\u00a0<\/td><\/tr><tr><td>09:00 &#8211; 09:15<\/td><td>Carapibus<\/td><td>Premia\u00e7\u00e3o<\/td><\/tr><tr><td>09:15 &#8211; 09:40 A<\/td><td>Carapibus<\/td><td>Colora\u00e7\u00e3o de identifica\u00e7\u00e3o local em produto Cartesiano (Robson Oliveira, M\u00e1rcia Cappelle, Hebert da Silva Coelho)\u00a0(Chair da sess\u00e3o: M\u00e1rcia Capelle)<\/td><\/tr><tr><td>09:40 &#8211; 10:05 A<\/td><td>Carapibus<\/td><td>Bounds on Identifying Codes in the Cartesian Product of a Path and a Star Graph (Juliana F\u00e9lix, M\u00e1rcia Cappelle)<\/td><\/tr><tr><td>10:05 &#8211; 10:30 A<\/td><td>Carapibus<\/td><td>On (acyclic) proper orientations and the cartesian product (J\u00falio C\u00e9sar Ara\u00fajo, Alexandre Cezar)<\/td><\/tr><tr><td>09:15 &#8211; 09:40 B<\/td><td>Areia Vermelha<\/td><td>Arredondamento de PL para o Problema de Localiza\u00e7\u00e3o de Instala\u00e7\u00f5es (Lehilton Lelis Chaves Pedrosa)\u00a0(Chair da sess\u00e3o: Teobaldo Leite Bulh\u00f5es)<\/td><\/tr><tr><td>09:40 &#8211; 10:05 B<\/td><td>Areia Vermelha<\/td><td>Eliminar Ciclos pela Remo\u00e7\u00e3o de um Emparelhamento Parametrizado pela Largura em \u00c1rvore \u00e9 FPT (Carlos Vin\u00edcius Gomes Costa Lima, Thiago Marcilon,\u00a0C\u00edcero Samuel Morais)<\/td><\/tr><tr><td>10:05 &#8211; 10:30 B<\/td><td>Areia Vermelha<\/td><td>Uma heur\u00edstica h\u00edbrida para o problema de escalonamento de tarefas em uma m\u00e1quina com tempos de setup dependentes da sequ\u00eancia e datas de libera\u00e7\u00e3o (Rafael Morais, Teobaldo Leite Bulh\u00f5es J\u00fanior,\u00a0Anand Subramanian)<\/td><\/tr><tr><td>10:30 &#8211; 11:00<\/td><td>\u00a0<\/td><td>COFFEE BREAK<\/td><\/tr><tr><td>11:00 &#8211; 11:25 A<\/td><td>Carapibus<\/td><td>As \u00e1rvores caracter\u00edsticas dos grafos cordais comparabilidade n\u00e3o possuem grau limitado (M\u00e1rcia Cerioli,\u00a0Rodrigo Souto, Petrucio Viana)\u00a0(Chair da sess\u00e3o: Wanderson Lomenha)<\/td><\/tr><tr><td>11:25 &#8211; 11:50 A<\/td><td>Carapibus<\/td><td>N\u00famero da sorte e grafos exoplanares livres de tri\u00e2ngulos (Maycon Sambinelli,\u00a0Fabio dos Santos de Souza)<\/td><\/tr><tr><td>11:50 &#8211; 12:15 A<\/td><td>Carapibus<\/td><td>Colora\u00e7\u00e3o caminho n\u00e3o repetitiva de ladders circulares (Jo\u00e3o Pedro de Souza, F\u00e1bio Botler, Wanderson Lomenha)<\/td><\/tr><tr><td>11:00 &#8211; 11:25 B<\/td><td>Areia Vermelha<\/td><td>Um Algoritmo H\u00edbrido para o Problema de Roteamento de Ve\u00edculos com Frota Heterog\u00eanea Robusto (Carlos Neves, Anand Subramanian, Pedro Munari)\u00a0(Chair da sess\u00e3o: Edna Hoshino)<\/td><\/tr><tr><td>11:25 &#8211; 11:50 B<\/td><td>Areia Vermelha<\/td><td>Um algoritmo populacional para o problema de flow shop com bloqueio e minimiza\u00e7\u00e3o do makespan (Ewerton Teixeira, Anand Subramanian, Hugo Kramer)<\/td><\/tr><tr><td>11:50 &#8211; 12:15 B<\/td><td>Areia Vermelha<\/td><td>Matheur\u00edsticas para o problema de roteamento de ve\u00edculos com pr\u00eamios (Francisco Ferreira Lima Neto, Vagner Pedrotti, Edna Hoshino)<\/td><\/tr><tr><td>12:30 &#8211; 14:00<\/td><td>\u00a0<\/td><td>ALMO\u00c7O<\/td><\/tr><tr><td>14:00-14:50<\/td><td>Carapibus<\/td><td>Palestra do Cl\u00e1udio L. Lucchesi:\u00a0Aplica\u00e7\u00f5es de Grafos Pfaffianos\u00a0(Chair: Vin\u00edcius dos Santos)<\/td><\/tr><tr><td>14:55-15:20 A<\/td><td>Carapibus<\/td><td>Some results on irregular decomposition of graphs (Carla Lintzmayer, Guilherme Oliveira Mota, Lucas Rocha, Maycon Sambinelli)\u00a0(Chair da sess\u00e3o: Jo\u00e3o Pedro de Souza)<\/td><\/tr><tr><td>15:20-15:45 A<\/td><td>Carapibus<\/td><td>Colora\u00e7\u00e3o total equilibrada dos snarks de Loupekine (Rieli Ara\u00fajo, Diana Sasaki)<\/td><\/tr><tr><td>15:45-16:10 A<\/td><td>Carapibus<\/td><td>On the conformable colorings of k-regular graphs (Mauro Nigro, Luerbio Faria, Diana Sasaki)<\/td><\/tr><tr><td>16:10-16:35 A<\/td><td>Carapibus<\/td><td>Propriedades de fecho de linguagens (C, D)-Fuzzy (Valdigleis Costa,\u00a0Antonio Farias, Benjamin Bedregal, Regivan Hugo Nunes Santiago)<\/td><\/tr><tr><td>16:35-17:00 A<\/td><td>Carapibus<\/td><td>5 Colora\u00e7\u00e3o Dist\u00e2ncia-2 em Fulerenes de Cintura 5 (Wanderson Lomenha,\u00a0Jo\u00e3o Pedro de Souza, Diego Nicodemos)<\/td><\/tr><tr><td>14:55-15:20 B<\/td><td>Areia Vermelha<\/td><td>Minimum Diameter Trees Subject to a Budget Constraint (Amanda Azevedo, Abilio Lucena)\u00a0(Chair da sess\u00e3o: Anand Subramanian)<\/td><\/tr><tr><td>15:20-15:45 B<\/td><td>Areia Vermelha<\/td><td>Formula\u00e7\u00e3o matem\u00e1tica para o problema da \u00e1rvore $t$-spanner de custo m\u00ednimo (Gabriel Sousa, Manoel Bezerra Campelo Neto)<\/td><\/tr><tr><td>15:45-16:10 B<\/td><td>Areia Vermelha<\/td><td>Uma abordagem exata unificada para um conjunto de variantes do problema de roteamento de ve\u00edculos com coleta e entrega simult\u00e2neas (Rafael Praxedes,\u00a0Teobaldo Bulh\u00f5es J\u00fanior, Anand Subramanian, Eduardo Barboza)<\/td><\/tr><tr><td>16:10-16:35 B<\/td><td>Areia Vermelha<\/td><td>Formulac\u00f5es para o Problema da Compra M\u00ednima (Sandro Uliana, Rafael Schouery)<\/td><\/tr><tr><td>16:35-17:00 B<\/td><td>Areia Vermelha<\/td><td>Um Modelo de Otimiza\u00e7\u00e3o para um Problema Real de Programa\u00e7\u00e3o de Hor\u00e1rios de Trens Urbanos (Renata Mendes, Anand Subramanian, Bruno Bruck, Teobaldo Bulh\u00f5es J\u00fanior)<\/td><\/tr><\/tbody><\/table><\/div><\/div>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div id=\"e-n-tab-content-17737142910\" role=\"tabpanel\" aria-labelledby=\"e-n-tab-title-17737142910\" data-tab-index=\"10\" style=\"--n-tabs-title-order: 10;\" class=\" elementor-element elementor-element-63f289f e-con-full e-flex e-con e-parent\" data-id=\"63f289f\" data-element_type=\"container\" data-e-type=\"container\">\n\t\t\t\t<div class=\"elementor-element elementor-element-3d3b27b elementor-widget elementor-widget-text-editor\" data-id=\"3d3b27b\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<p><strong><span style=\"color: #000080;\">Palestra do Anand Subramanian<\/span><\/strong><br \/><span style=\"color: #000080;\">Title: Hybrid iterated local search frameworks for classes of combinatorial optimization problems<\/span><\/p><p>Abstract: In this talk, we present two frameworks based on the iterated local search (ILS) metaheuristic for solving classes of combinatorial optimization problems. The first framework consists of a combination of ILS and the randomized variable neighborhood descent (RVND) procedure, whereas the second one is a matheuristic approach that integrates ILS, RVND and a mathematical programming-based procedure. We consider classes of problems that can be represented using a single sequence of elements (e.g., variants of the traveling salesman problem, single machine scheduling problems), multiple sequences of elements (e.g., vehicle routing problems, parallel machine scheduling problems), and multiple sets of elements (e.g., clustering problems). Moreover, we provide guidelines on how to efficiently perform move evaluation and feasibility checking during local search, as well as efficient mechanisms to improve computational performance.<\/p><p>\u00a0<\/p><p><strong><span style=\"color: #000080;\">Palestra do Cl\u00e1udio L. Lucchesi<br \/><\/span><\/strong><span style=\"color: #000080;\">T\u00edtulo: Aplica\u00e7\u00f5es de Grafos Pfaffianos<br \/><br \/><\/span>Resumo: Esta palestra \u00e9 primariamente de divulga\u00e7\u00e3o. Ser\u00e1 apresentado um algoritmo polinomial para o reconhecimento de grafos bipartidos Pfaffianos, devido a McCuaig e, independentemente, a Robertson, Seymour e Thomas. Ser\u00e3o ent\u00e3o abordadas algumas aplica\u00e7\u00f5es, particularmente na Teoria dos Grafos e na an\u00e1lise da estabilidade de compostos org\u00e2nicos.<\/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<div id=\"e-n-tab-content-17737142911\" role=\"tabpanel\" aria-labelledby=\"e-n-tab-title-17737142911\" data-tab-index=\"11\" style=\"--n-tabs-title-order: 11;\" class=\" elementor-element elementor-element-4886012 e-con-full e-flex e-con e-parent\" data-id=\"4886012\" data-element_type=\"container\" data-e-type=\"container\">\n\t\t\t\t<div class=\"elementor-element elementor-element-88e880a elementor-widget elementor-widget-text-editor\" data-id=\"88e880a\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<p><span style=\"color: #000021;\"><strong>Organizadores Gerais:<\/strong><\/span><\/p><p>Cristina Gomes Fernandes (USP) \u2013 cris@ime.usp.br<br \/>Manoel Bezerra Camp\u00ealo Neto (UFC) \u2013 mcampelo@ufc.br<br \/>Vinicius Fernandes dos Santos (UFMG) \u2013 viniciussantos@dcc.ufmg.br<\/p><p><span style=\"color: #000021;\"><strong>Apoio Local:<\/strong><\/span><\/p><p>Teobaldo Leite Bulh\u00f5es J\u00fanior &#8211; tbulhoes@ci.ufpb.br<\/p><p><span style=\"color: #000021;\"><strong>Organizadores do Comit\u00ea de Programa:<\/strong><\/span><\/p><p>Cristina Gomes Fernandes (USP)<br \/>Manoel Bezerra Camp\u00ealo Neto (UFC)<br \/>Vinicius Fernandes dos Santos (UFMG)<\/p><p><span style=\"color: #000021;\"><strong>Comit\u00ea de Programa (TPC):<\/strong><\/span><\/p><p>Anand Subramanian, Universidade Federal da Para\u00edba<br \/>\u00c1lvaro Franco, Universidade Federal de Santa Catarina<br \/>Carlos Vin\u00edcius Gomes Costa Lima, Universidade Federal do Cariri<br \/>C\u00e2ndida Silva, Universidade Federal de S\u00e3o Carlos, Campus Sorocaba<br \/>Cr\u00edston Souza, Universidade Federal do Cear\u00e1<br \/>Cristiane Sato, Universidade Federal do ABC<br \/>Cristina Fernandes, Universidade de S\u00e3o Paulo<br \/>Diana Sasaki, Universidade do Estado do Rio de Janeiro<br \/>Edna Hoshino, Universidade Federal do Mato Grosso do Sul<br \/>Erika Coelho, Universidade Federal de Goi\u00e1s<br \/>Fernanda Couto, Universidade Federal Rural do Rio de Janeiro<br \/>Gabriel Coutinho, Universidade Federal de Minas Gerais<br \/>Karolinna Maia, Universidade Federal do Cear\u00e1<br \/>Lu\u00eds Cunha, Universidade Federal Fluminense<br \/>Manoel Bezerra Campelo Neto, Universidade Federal do Cear\u00e1<br \/>Marina Groshaus, Universidade Tecnol\u00f3gica Federal do Paran\u00e1<br \/>M\u00e1rcia Cerioli, Universidade Federal do Rio de Janeiro<br \/>Rafael Melo, Universidade Federal da Bahia<br \/>Rafael Schouery, Universidade Estadual de Campinas<br \/>Ricardo Corr\u00eaa, Universidade Federal Rural do Rio de Janeiro<br \/>Rosiane de Freitas, Universidade Federal do Amazonas<br \/>Santiago Ravelo, Universidade Federal do Rio Grande do Sul<br \/>Tanilson Santos, Universidade Federal do Tocantins<br \/>Teobaldo Bulh\u00f5es J\u00fanior, Universidade Federal da Para\u00edba<br \/>Vinicius dos Santos, Universidade Federal de Minas Gerais<\/p><p><span style=\"color: #000021;\"><strong>Contato para d\u00favidas:<\/strong><\/span><\/p><div id=\"content\" class=\"site-content no-slider\"><div class=\"mid-content clearfix\"><div id=\"primary\" class=\"content-area\"><article id=\"post-3874\" class=\"article-wrap post-3874 page type-page status-publish hentry\"><div class=\"entry-content\"><p>Cristina Gomes Fernandes (USP) \u2013 cris@ime.usp.br<\/p><p><span style=\"color: #000021;\"><strong>Palestrantes convidados e homenagem especial:<\/strong><\/span><\/p><div id=\"content\" class=\"site-content no-slider\"><div class=\"mid-content clearfix\"><div id=\"primary\" class=\"content-area\"><article id=\"post-3874\" class=\"article-wrap post-3874 page type-page status-publish hentry\"><div class=\"entry-content\"><p>Anand Subramanian, Universidade Federal da Para\u00edba<\/p><p>Cl\u00e1udio L. Lucchesi, Universidade de S\u00e3o Paulo<\/p><p>Durante o evento, haver\u00e1 tamb\u00e9m uma sess\u00e3o em homenagem ao estimado Professor Nelson Maculan, da Universidade Federal do Rio de Janeiro.<\/p><\/div><\/article><\/div><\/div><\/div><\/div><\/article><\/div><\/div><\/div>\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<\/div>\n\t\t<\/div>\n\t\t\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\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"<p>Sobre o evento Chamada de trabalhos T\u00f3picos de Interesse Instru\u00e7\u00f5es para submiss\u00e3o Datas importantes Inscri\u00e7\u00e3o dos autores Publica\u00e7\u00e3o de Trabalhos Premia\u00e7\u00f5es Programa\u00e7\u00e3o Palestras Organiza\u00e7\u00e3o Sobre o evento O Encontro de Teoria da Computa\u00e7\u00e3o, em sua oitava edi\u00e7\u00e3o, tem se apresentado como um f\u00f3rum voltado para a grande \u00e1rea de Teoria da Computa\u00e7\u00e3o, proposto por membros [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"folder":[12],"class_list":["post-1089","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/csbc.sbc.org.br\/2023\/wp-json\/wp\/v2\/pages\/1089","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/csbc.sbc.org.br\/2023\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/csbc.sbc.org.br\/2023\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/csbc.sbc.org.br\/2023\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/csbc.sbc.org.br\/2023\/wp-json\/wp\/v2\/comments?post=1089"}],"version-history":[{"count":82,"href":"https:\/\/csbc.sbc.org.br\/2023\/wp-json\/wp\/v2\/pages\/1089\/revisions"}],"predecessor-version":[{"id":3898,"href":"https:\/\/csbc.sbc.org.br\/2023\/wp-json\/wp\/v2\/pages\/1089\/revisions\/3898"}],"wp:attachment":[{"href":"https:\/\/csbc.sbc.org.br\/2023\/wp-json\/wp\/v2\/media?parent=1089"}],"wp:term":[{"taxonomy":"folder","embeddable":true,"href":"https:\/\/csbc.sbc.org.br\/2023\/wp-json\/wp\/v2\/folder?post=1089"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}