ReP USP - Resultado da busca

Trabalho de evento
Separating path systems in complete graphs (2024)
Fernandes, Cristina Gomes ; Mota, Guilherme Oliveira ; Sanhueza-Matamala, Nicolás
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e MOTA, Guilherme Oliveira e SANHUEZA-MATAMALA, Nicolás. Separating path systems in complete graphs. 2024, Anais.. Cham: Springer, 2024. Disponível em: https://doi.org/10.1007/978-3-031-55601-2_7. Acesso em: 06 set. 2024.
APA
Fernandes, C. G., Mota, G. O., & Sanhueza-Matamala, N. (2024). Separating path systems in complete graphs. In Proceedings. Cham: Springer. doi:10.1007/978-3-031-55601-2_7
NLM
Fernandes CG, Mota GO, Sanhueza-Matamala N. Separating path systems in complete graphs [Internet]. Proceedings. 2024 ;[citado 2024 set. 06 ] Available from: https://doi.org/10.1007/978-3-031-55601-2_7
Vancouver
Fernandes CG, Mota GO, Sanhueza-Matamala N. Separating path systems in complete graphs [Internet]. Proceedings. 2024 ;[citado 2024 set. 06 ] Available from: https://doi.org/10.1007/978-3-031-55601-2_7
Artigo de periodico
On the advances in machine learning and complex network measures to an EEG dataset from DMT experiments (2024)
Alves, Caroline Lourenço ; Ciba, Manuel ; Toutain, Thaise Graziele Lima de ; Porto, Joel Augusto Moura ; Sena, Eduardo Pondé de ; Thielemann, Christiane ; Rodrigues, Francisco
Source: Journal of Physics: Complexity. Unidades: ICMC, IFSC
Subjects: VISÃO COMPUTACIONAL, APRENDIZADO COMPUTACIONAL, TOPOLOGIA EM COMPUTAÇÃO, REDES NEURAIS, TEORIA DOS GRAFOS, CÓRTEX CEREBRAL (ANÁLISE), CÉREBRO (ANÁLISE;ESTUDO)
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Caroline Lourenço et al. On the advances in machine learning and complex network measures to an EEG dataset from DMT experiments. Journal of Physics: Complexity, v. 5, n. Ja 2024, p. 015002-1-015002-23, 2024Tradução . . Disponível em: https://doi.org/10.1088/2632-072X/ad1c68. Acesso em: 06 set. 2024.
APA
Alves, C. L., Ciba, M., Toutain, T. G. L. de, Porto, J. A. M., Sena, E. P. de, Thielemann, C., & Rodrigues, F. (2024). On the advances in machine learning and complex network measures to an EEG dataset from DMT experiments. Journal of Physics: Complexity, 5( Ja 2024), 015002-1-015002-23. doi:10.1088/2632-072X/ad1c68
NLM
Alves CL, Ciba M, Toutain TGL de, Porto JAM, Sena EP de, Thielemann C, Rodrigues F. On the advances in machine learning and complex network measures to an EEG dataset from DMT experiments [Internet]. Journal of Physics: Complexity. 2024 ; 5( Ja 2024): 015002-1-015002-23.[citado 2024 set. 06 ] Available from: https://doi.org/10.1088/2632-072X/ad1c68
Vancouver
Alves CL, Ciba M, Toutain TGL de, Porto JAM, Sena EP de, Thielemann C, Rodrigues F. On the advances in machine learning and complex network measures to an EEG dataset from DMT experiments [Internet]. Journal of Physics: Complexity. 2024 ; 5( Ja 2024): 015002-1-015002-23.[citado 2024 set. 06 ] Available from: https://doi.org/10.1088/2632-072X/ad1c68
Artigo de periodico
On the anti-Ramsey threshold for non-balanced graphs (2024)
Araújo, Pedro; Martins, Taísa ; Mattos, Letícia; Mendonça, Walner ; Moreira, Luiz; Mota, Guilherme Oliveira
Source: The Electronic Journal of Combinatorics. Unidade: IME
Subjects: TEORIA DOS GRAFOS, TEORIA DE RAMSEY
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ARAÚJO, Pedro et al. On the anti-Ramsey threshold for non-balanced graphs. The Electronic Journal of Combinatorics, v. 31, n. 1, p. 1-21, 2024Tradução . . Disponível em: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70. Acesso em: 06 set. 2024.
APA
Araújo, P., Martins, T., Mattos, L., Mendonça, W., Moreira, L., & Mota, G. O. (2024). On the anti-Ramsey threshold for non-balanced graphs. The Electronic Journal of Combinatorics, 31( 1), 1-21. Recuperado de https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70
NLM
Araújo P, Martins T, Mattos L, Mendonça W, Moreira L, Mota GO. On the anti-Ramsey threshold for non-balanced graphs [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 1): 1-21.[citado 2024 set. 06 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70
Vancouver
Araújo P, Martins T, Mattos L, Mendonça W, Moreira L, Mota GO. On the anti-Ramsey threshold for non-balanced graphs [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 1): 1-21.[citado 2024 set. 06 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70
Artigo de periodico
Evaluating brain group structure methods using hierarchical dynamic models (2024)
Costa, Lilia ; Anacleto, Osvaldo ; Nascimento, Diego Carvalho ; Smith, James Q; Queen, Catriona M; Louzada, Francisco ; Nichols, Thomas
Source: Pattern Recognition. Unidade: ICMC
Subjects: TEORIA DOS GRAFOS, ESTUDO DE CASO, MAPEAMENTO CEREBRAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COSTA, Lilia et al. Evaluating brain group structure methods using hierarchical dynamic models. Pattern Recognition, v. 155, p. 1-13, 2024Tradução . . Disponível em: https://doi.org/10.1016/j.patcog.2024.110687. Acesso em: 06 set. 2024.
APA
Costa, L., Anacleto, O., Nascimento, D. C., Smith, J. Q., Queen, C. M., Louzada, F., & Nichols, T. (2024). Evaluating brain group structure methods using hierarchical dynamic models. Pattern Recognition, 155, 1-13. doi:10.1016/j.patcog.2024.110687
NLM
Costa L, Anacleto O, Nascimento DC, Smith JQ, Queen CM, Louzada F, Nichols T. Evaluating brain group structure methods using hierarchical dynamic models [Internet]. Pattern Recognition. 2024 ; 155 1-13.[citado 2024 set. 06 ] Available from: https://doi.org/10.1016/j.patcog.2024.110687
Vancouver
Costa L, Anacleto O, Nascimento DC, Smith JQ, Queen CM, Louzada F, Nichols T. Evaluating brain group structure methods using hierarchical dynamic models [Internet]. Pattern Recognition. 2024 ; 155 1-13.[citado 2024 set. 06 ] Available from: https://doi.org/10.1016/j.patcog.2024.110687
Artigo de periodico
Density of identifying codes of hexagonal grids with finite number of rows (2024)
Sampaio, Rudini Menezes ; Sobral, Gabriel Augusto Gonçalves ; Wakabayashi, Yoshiko
Source: RAIRO - Operations Research. Unidades: IME, BIOINFORMÁTICA
Subjects: TEORIA DA INFORMAÇÃO, TEORIA DA COMUNICAÇÃO, TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SAMPAIO, Rudini Menezes e SOBRAL, Gabriel Augusto Gonçalves e WAKABAYASHI, Yoshiko. Density of identifying codes of hexagonal grids with finite number of rows. RAIRO - Operations Research, v. 58, n. 2, p. 1633-1651, 2024Tradução . . Disponível em: https://doi.org/10.1051/ro/2024046. Acesso em: 06 set. 2024.
APA
Sampaio, R. M., Sobral, G. A. G., & Wakabayashi, Y. (2024). Density of identifying codes of hexagonal grids with finite number of rows. RAIRO - Operations Research, 58( 2), 1633-1651. doi:10.1051/ro/2024046
NLM
Sampaio RM, Sobral GAG, Wakabayashi Y. Density of identifying codes of hexagonal grids with finite number of rows [Internet]. RAIRO - Operations Research. 2024 ; 58( 2): 1633-1651.[citado 2024 set. 06 ] Available from: https://doi.org/10.1051/ro/2024046
Vancouver
Sampaio RM, Sobral GAG, Wakabayashi Y. Density of identifying codes of hexagonal grids with finite number of rows [Internet]. RAIRO - Operations Research. 2024 ; 58( 2): 1633-1651.[citado 2024 set. 06 ] Available from: https://doi.org/10.1051/ro/2024046
Artigo de periodico
Independent dominating sets in planar triangulations (2024)
Botler, Fábio Happ ; Fernandes, Cristina Gomes ; Gutiérrez, Juan
Source: The Electronic Journal of Combinatorics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ e FERNANDES, Cristina Gomes e GUTIÉRREZ, Juan. Independent dominating sets in planar triangulations. The Electronic Journal of Combinatorics, v. 31, n. 2, p. 1-10, 2024Tradução . . Disponível em: https://doi.org/10.37236/12548. Acesso em: 06 set. 2024.
APA
Botler, F. H., Fernandes, C. G., & Gutiérrez, J. (2024). Independent dominating sets in planar triangulations. The Electronic Journal of Combinatorics, 31( 2), 1-10. doi:10.37236/12548
NLM
Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 2): 1-10.[citado 2024 set. 06 ] Available from: https://doi.org/10.37236/12548
Vancouver
Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 2): 1-10.[citado 2024 set. 06 ] Available from: https://doi.org/10.37236/12548
Artigo de periodico
How heavy independent sets help to find arborescences with many leaves in DAGs (2023)
Fernandes, Cristina Gomes ; Lintzmayer, Carla Negri
Source: Journal of Computer and System Sciences. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS, ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e LINTZMAYER, Carla Negri. How heavy independent sets help to find arborescences with many leaves in DAGs. Journal of Computer and System Sciences, v. 135, p. 158-174, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.jcss.2023.02.006. Acesso em: 06 set. 2024.
APA
Fernandes, C. G., & Lintzmayer, C. N. (2023). How heavy independent sets help to find arborescences with many leaves in DAGs. Journal of Computer and System Sciences, 135, 158-174. doi:10.1016/j.jcss.2023.02.006
NLM
Fernandes CG, Lintzmayer CN. How heavy independent sets help to find arborescences with many leaves in DAGs [Internet]. Journal of Computer and System Sciences. 2023 ; 135 158-174.[citado 2024 set. 06 ] Available from: https://doi.org/10.1016/j.jcss.2023.02.006
Vancouver
Fernandes CG, Lintzmayer CN. How heavy independent sets help to find arborescences with many leaves in DAGs [Internet]. Journal of Computer and System Sciences. 2023 ; 135 158-174.[citado 2024 set. 06 ] Available from: https://doi.org/10.1016/j.jcss.2023.02.006
Artigo de periodico
The mod k chromatic index of graphs is O(k) (2023)
Botler, Fábio Happ ; Colucci, Lucas ; Kohayakawa, Yoshiharu
Source: Journal of Graph Theory. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ e COLUCCI, Lucas e KOHAYAKAWA, Yoshiharu. The mod k chromatic index of graphs is O(k). Journal of Graph Theory, v. 102, n. 1, p. 197-200, 2023Tradução . . Disponível em: https://doi.org/10.1002/jgt.22866. Acesso em: 06 set. 2024.
APA
Botler, F. H., Colucci, L., & Kohayakawa, Y. (2023). The mod k chromatic index of graphs is O(k). Journal of Graph Theory, 102( 1), 197-200. doi:10.1002/jgt.22866
NLM
Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of graphs is O(k) [Internet]. Journal of Graph Theory. 2023 ; 102( 1): 197-200.[citado 2024 set. 06 ] Available from: https://doi.org/10.1002/jgt.22866
Vancouver
Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of graphs is O(k) [Internet]. Journal of Graph Theory. 2023 ; 102( 1): 197-200.[citado 2024 set. 06 ] Available from: https://doi.org/10.1002/jgt.22866
Artigo de periodico
Estimating the effects of urban green regions in terms of diffusion (2023)
Tokuda, Eric Keiji ; Arruda, Henrique Ferraz de ; Domingues, Guilherme Schimidt ; Costa, Luciano da Fontoura ; Shibata, Florence Alyssa Sakuma ; Cesar Junior, Roberto Marcondes ; Comin, Cesar Henrique
Source: Environment and Planning B: urban analytics and city science. Unidades: IME, IFSC
Subjects: ESPAÇOS VERDES, PROCESSOS DE DIFUSÃO, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TOKUDA, Eric Keiji et al. Estimating the effects of urban green regions in terms of diffusion. Environment and Planning B: urban analytics and city science, v. 50, n. 4, p. 1023-1038, 2023Tradução . . Disponível em: https://doi.org/10.1177/23998083221131572. Acesso em: 06 set. 2024.
APA
Tokuda, E. K., Arruda, H. F. de, Domingues, G. S., Costa, L. da F., Shibata, F. A. S., Cesar Junior, R. M., & Comin, C. H. (2023). Estimating the effects of urban green regions in terms of diffusion. Environment and Planning B: urban analytics and city science, 50( 4), 1023-1038. doi:10.1177/23998083221131572
NLM
Tokuda EK, Arruda HF de, Domingues GS, Costa L da F, Shibata FAS, Cesar Junior RM, Comin CH. Estimating the effects of urban green regions in terms of diffusion [Internet]. Environment and Planning B: urban analytics and city science. 2023 ; 50( 4): 1023-1038.[citado 2024 set. 06 ] Available from: https://doi.org/10.1177/23998083221131572
Vancouver
Tokuda EK, Arruda HF de, Domingues GS, Costa L da F, Shibata FAS, Cesar Junior RM, Comin CH. Estimating the effects of urban green regions in terms of diffusion [Internet]. Environment and Planning B: urban analytics and city science. 2023 ; 50( 4): 1023-1038.[citado 2024 set. 06 ] Available from: https://doi.org/10.1177/23998083221131572
Trabalho de evento
Independent dominating sets in planar triangulations (2023)
Botler, Fábio Happ ; Fernandes, Cristina Gomes ; Gutiérrez, Juan
Source: Proceedings. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ e FERNANDES, Cristina Gomes e GUTIÉRREZ, Juan. Independent dominating sets in planar triangulations. 2023, Anais.. Prague: Charles University, 2023. Disponível em: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-023. Acesso em: 06 set. 2024.
APA
Botler, F. H., Fernandes, C. G., & Gutiérrez, J. (2023). Independent dominating sets in planar triangulations. In Proceedings. Prague: Charles University. doi:10.5817/CZ.MUNI.EUROCOMB23-023
NLM
Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. Proceedings. 2023 ;[citado 2024 set. 06 ] Available from: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-023
Vancouver
Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. Proceedings. 2023 ;[citado 2024 set. 06 ] Available from: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-023
Artigo de periodico
Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs (2023)
Gómez, Renzo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Theoretical Computer Science. Unidade: IME
Subjects: TEORIA DOS GRAFOS, TEORIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GÓMEZ, Renzo e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs. Theoretical Computer Science, v. 947, n. artigo 113691, p. 1-13, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2023.113691. Acesso em: 06 set. 2024.
APA
Gómez, R., Miyazawa, F. K., & Wakabayashi, Y. (2023). Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs. Theoretical Computer Science, 947( artigo 113691), 1-13. doi:10.1016/j.tcs.2023.113691
NLM
Gómez R, Miyazawa FK, Wakabayashi Y. Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs [Internet]. Theoretical Computer Science. 2023 ; 947( artigo 113691): 1-13.[citado 2024 set. 06 ] Available from: https://doi.org/10.1016/j.tcs.2023.113691
Vancouver
Gómez R, Miyazawa FK, Wakabayashi Y. Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs [Internet]. Theoretical Computer Science. 2023 ; 947( artigo 113691): 1-13.[citado 2024 set. 06 ] Available from: https://doi.org/10.1016/j.tcs.2023.113691
Artigo de periodico
The mod k chromatic index of random graphs (2023)
Botler, Fábio Happ ; Colucci, Lucas ; Kohayakawa, Yoshiharu
Source: Journal of Graph Theory. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ e COLUCCI, Lucas e KOHAYAKAWA, Yoshiharu. The mod k chromatic index of random graphs. Journal of Graph Theory, v. 103, n. 4, p. 767-779, 2023Tradução . . Disponível em: https://doi.org/10.1002/jgt.22946. Acesso em: 06 set. 2024.
APA
Botler, F. H., Colucci, L., & Kohayakawa, Y. (2023). The mod k chromatic index of random graphs. Journal of Graph Theory, 103( 4), 767-779. doi:10.1002/jgt.22946
NLM
Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of random graphs [Internet]. Journal of Graph Theory. 2023 ; 103( 4): 767-779.[citado 2024 set. 06 ] Available from: https://doi.org/10.1002/jgt.22946
Vancouver
Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of random graphs [Internet]. Journal of Graph Theory. 2023 ; 103( 4): 767-779.[citado 2024 set. 06 ] Available from: https://doi.org/10.1002/jgt.22946
Artigo de periodico
Balanced connected partitions of graphs: approximation, parameterization and lower bounds (2023)
Moura, Phablo Fernando Soares ; Ota, Matheus Jun ; Wakabayashi, Yoshiko
Source: Journal of Combinatorial Optimization. Unidade: IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOURA, Phablo Fernando Soares e OTA, Matheus Jun e WAKABAYASHI, Yoshiko. Balanced connected partitions of graphs: approximation, parameterization and lower bounds. Journal of Combinatorial Optimization, v. 45, n. artigo 127, p. 1-27, 2023Tradução . . Disponível em: https://doi.org/10.1007/s10878-023-01058-x. Acesso em: 06 set. 2024.
APA
Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2023). Balanced connected partitions of graphs: approximation, parameterization and lower bounds. Journal of Combinatorial Optimization, 45( artigo 127), 1-27. doi:10.1007/s10878-023-01058-x
NLM
Moura PFS, Ota MJ, Wakabayashi Y. Balanced connected partitions of graphs: approximation, parameterization and lower bounds [Internet]. Journal of Combinatorial Optimization. 2023 ; 45( artigo 127): 1-27.[citado 2024 set. 06 ] Available from: https://doi.org/10.1007/s10878-023-01058-x
Vancouver
Moura PFS, Ota MJ, Wakabayashi Y. Balanced connected partitions of graphs: approximation, parameterization and lower bounds [Internet]. Journal of Combinatorial Optimization. 2023 ; 45( artigo 127): 1-27.[citado 2024 set. 06 ] Available from: https://doi.org/10.1007/s10878-023-01058-x
Artigo de periodico
Unfriendly partitions when avoiding vertices of finite degree (2023)
Aurichi, Leandro Fiorini ; Real, Lucas Silva Sinzato
Source: Journal of Logic and Computation. Unidade: ICMC
Subjects: TEORIA DOS GRAFOS, TEORIA DOS CONJUNTOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
AURICHI, Leandro Fiorini e REAL, Lucas Silva Sinzato. Unfriendly partitions when avoiding vertices of finite degree. Journal of Logic and Computation, 2023Tradução . . Disponível em: https://doi.org/10.1093/logcom/exad070. Acesso em: 06 set. 2024.
APA
Aurichi, L. F., & Real, L. S. S. (2023). Unfriendly partitions when avoiding vertices of finite degree. Journal of Logic and Computation. doi:10.1093/logcom/exad070
NLM
Aurichi LF, Real LSS. Unfriendly partitions when avoiding vertices of finite degree [Internet]. Journal of Logic and Computation. 2023 ;[citado 2024 set. 06 ] Available from: https://doi.org/10.1093/logcom/exad070
Vancouver
Aurichi LF, Real LSS. Unfriendly partitions when avoiding vertices of finite degree [Internet]. Journal of Logic and Computation. 2023 ;[citado 2024 set. 06 ] Available from: https://doi.org/10.1093/logcom/exad070
Artigo de periodico
Spectral density-based clustering algorithms for complex networks (2023)
Ramos, Taiane Coelho ; Mourão-Miranda, Janaina ; Fujita, André
Source: Frontiers in Neuroscience. Unidades: IME, ICMC
Subjects: REDES COMPLEXAS, TEORIA DOS GRAFOS, TEORIA ESPECTRAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RAMOS, Taiane Coelho e MOURÃO-MIRANDA, Janaina e FUJITA, André. Spectral density-based clustering algorithms for complex networks. Frontiers in Neuroscience, v. 17, p. 1-14, 2023Tradução . . Disponível em: https://doi.org/10.3389/fnins.2023.926321. Acesso em: 06 set. 2024.
APA
Ramos, T. C., Mourão-Miranda, J., & Fujita, A. (2023). Spectral density-based clustering algorithms for complex networks. Frontiers in Neuroscience, 17, 1-14. doi:10.3389/fnins.2023.926321
NLM
Ramos TC, Mourão-Miranda J, Fujita A. Spectral density-based clustering algorithms for complex networks [Internet]. Frontiers in Neuroscience. 2023 ; 17 1-14.[citado 2024 set. 06 ] Available from: https://doi.org/10.3389/fnins.2023.926321
Vancouver
Ramos TC, Mourão-Miranda J, Fujita A. Spectral density-based clustering algorithms for complex networks [Internet]. Frontiers in Neuroscience. 2023 ; 17 1-14.[citado 2024 set. 06 ] Available from: https://doi.org/10.3389/fnins.2023.926321
Trabalho de evento
Minimum t-spanners on subcubic graphs (2022)
Gómez, Renzo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: International Conference and Workshops on Algorithms and Computation - WALCOM. Unidade: IME
Subjects: TEORIA DOS GRAFOS, APROXIMAÇÃO POR POLINÔMIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GÓMEZ, Renzo e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Minimum t-spanners on subcubic graphs. 2022, Anais.. Cham: Springer, 2022. Disponível em: https://doi.org/10.1007/978-3-030-96731-4_30. Acesso em: 06 set. 2024.
APA
Gómez, R., Miyazawa, F. K., & Wakabayashi, Y. (2022). Minimum t-spanners on subcubic graphs. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-96731-4_30
NLM
Gómez R, Miyazawa FK, Wakabayashi Y. Minimum t-spanners on subcubic graphs [Internet]. Proceedings. 2022 ;[citado 2024 set. 06 ] Available from: https://doi.org/10.1007/978-3-030-96731-4_30
Vancouver
Gómez R, Miyazawa FK, Wakabayashi Y. Minimum t-spanners on subcubic graphs [Internet]. Proceedings. 2022 ;[citado 2024 set. 06 ] Available from: https://doi.org/10.1007/978-3-030-96731-4_30
Trabalho de evento
On the zero-sum Ramsey problem over 'Z POT. d IND. 2' (2022)
Morales, José Diego Alvarado; Colucci, Lucas ; Parente, Roberto Freitas ; Souza, Victor Seixas
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MORALES, José Diego Alvarado et al. On the zero-sum Ramsey problem over 'Z POT. d IND. 2'. 2022, Anais.. Cham: Springer, 2022. Disponível em: https://doi.org/10.1007/978-3-031-20624-5_27. Acesso em: 06 set. 2024.
APA
Morales, J. D. A., Colucci, L., Parente, R. F., & Souza, V. S. (2022). On the zero-sum Ramsey problem over 'Z POT. d IND. 2'. In Proceedings. Cham: Springer. doi:10.1007/978-3-031-20624-5_27
NLM
Morales JDA, Colucci L, Parente RF, Souza VS. On the zero-sum Ramsey problem over 'Z POT. d IND. 2' [Internet]. Proceedings. 2022 ;[citado 2024 set. 06 ] Available from: https://doi.org/10.1007/978-3-031-20624-5_27
Vancouver
Morales JDA, Colucci L, Parente RF, Souza VS. On the zero-sum Ramsey problem over 'Z POT. d IND. 2' [Internet]. Proceedings. 2022 ;[citado 2024 set. 06 ] Available from: https://doi.org/10.1007/978-3-031-20624-5_27
Trabalho de evento-anais periodico
Leafy spanning arborescences in DAGs (2022)
Fernandes, Cristina Gomes ; Lintzmayer, Carla Negri
Source: Discrete Applied Mathematics. Conference titles: Latin and American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS E ESTRUTURAS DE DADOS, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e LINTZMAYER, Carla Negri. Leafy spanning arborescences in DAGs. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.dam.2021.06.018. Acesso em: 06 set. 2024. , 2022
APA
Fernandes, C. G., & Lintzmayer, C. N. (2022). Leafy spanning arborescences in DAGs. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2021.06.018
NLM
Fernandes CG, Lintzmayer CN. Leafy spanning arborescences in DAGs [Internet]. Discrete Applied Mathematics. 2022 ; 323 217-227.[citado 2024 set. 06 ] Available from: https://doi.org/10.1016/j.dam.2021.06.018
Vancouver
Fernandes CG, Lintzmayer CN. Leafy spanning arborescences in DAGs [Internet]. Discrete Applied Mathematics. 2022 ; 323 217-227.[citado 2024 set. 06 ] Available from: https://doi.org/10.1016/j.dam.2021.06.018
Artigo de periodico
Pay attention to evolution: time series forecasting with deep graph-evolution learning (2022)
Spadon, Gabriel ; Hong, Shenda ; Machado, Bruno Brandoli ; Matwin, Stan ; Rodrigues Junior, José Fernando ; Sun, Jimeng
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence - TPAM. Unidade: ICMC
Subjects: PREVISÃO (ANÁLISE DE SÉRIES TEMPORAIS), APRENDIZADO COMPUTACIONAL, REDES NEURAIS, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SPADON, Gabriel et al. Pay attention to evolution: time series forecasting with deep graph-evolution learning. IEEE Transactions on Pattern Analysis and Machine Intelligence - TPAM, v. 44, n. 9, p. Se 2022, 2022Tradução . . Disponível em: https://doi.org/10.1109/TPAMI.2021.3076155. Acesso em: 06 set. 2024.
APA
Spadon, G., Hong, S., Machado, B. B., Matwin, S., Rodrigues Junior, J. F., & Sun, J. (2022). Pay attention to evolution: time series forecasting with deep graph-evolution learning. IEEE Transactions on Pattern Analysis and Machine Intelligence - TPAM, 44( 9), Se 2022. doi:10.1109/TPAMI.2021.3076155
NLM
Spadon G, Hong S, Machado BB, Matwin S, Rodrigues Junior JF, Sun J. Pay attention to evolution: time series forecasting with deep graph-evolution learning [Internet]. IEEE Transactions on Pattern Analysis and Machine Intelligence - TPAM. 2022 ; 44( 9): Se 2022.[citado 2024 set. 06 ] Available from: https://doi.org/10.1109/TPAMI.2021.3076155
Vancouver
Spadon G, Hong S, Machado BB, Matwin S, Rodrigues Junior JF, Sun J. Pay attention to evolution: time series forecasting with deep graph-evolution learning [Internet]. IEEE Transactions on Pattern Analysis and Machine Intelligence - TPAM. 2022 ; 44( 9): Se 2022.[citado 2024 set. 06 ] Available from: https://doi.org/10.1109/TPAMI.2021.3076155
Trabalho de evento
Tree 3-spanners on generalized prisms of graphs (2022)
Gómez, Renzo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GÓMEZ, Renzo e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Tree 3-spanners on generalized prisms of graphs. 2022, Anais.. Cham: Springer, 2022. Disponível em: https://doi.org/10.1007/978-3-031-20624-5_34. Acesso em: 06 set. 2024.
APA
Gómez, R., Miyazawa, F. K., & Wakabayashi, Y. (2022). Tree 3-spanners on generalized prisms of graphs. In Proceedings. Cham: Springer. doi:10.1007/978-3-031-20624-5_34
NLM
Gómez R, Miyazawa FK, Wakabayashi Y. Tree 3-spanners on generalized prisms of graphs [Internet]. Proceedings. 2022 ;[citado 2024 set. 06 ] Available from: https://doi.org/10.1007/978-3-031-20624-5_34
Vancouver
Gómez R, Miyazawa FK, Wakabayashi Y. Tree 3-spanners on generalized prisms of graphs [Internet]. Proceedings. 2022 ;[citado 2024 set. 06 ] Available from: https://doi.org/10.1007/978-3-031-20624-5_34

USP Schools

ReP

Filtros

Document Types

USP Schools

Departament

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Grupo de pesquisa

Funding Agencies

Indexado em

Normalized affiliation

Non normalized affiliation

Countries of institutions of collaboration