Menu

Filtros : "FERNANDES, CRISTINA GOMES" Limpar

Filtros

Refine with date range

1 - 20 (98 records)

  • Trabalho de evento-anais periodico

    Hardness of dynamic core and truss decompositions (2026)

    Couto, Yan Soares; Fernandes, Cristina Gomes

    Source: Lecture Notes in Computer Science. Conference titles: Workshop on Approximation and Online Algorithms - WAOA. Unidade: IME

    Subjects: ALGORITMOS DE APROXIMAÇÃO, MÉTODOS DE DECOMPOSIÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      COUTO, Yan Soares e FERNANDES, Cristina Gomes. Hardness of dynamic core and truss decompositions. Lecture Notes in Computer Science. Cham: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/978-3-032-06706-7_5. Acesso em: 25 abr. 2026. , 2026

    • APA

      Couto, Y. S., & Fernandes, C. G. (2026). Hardness of dynamic core and truss decompositions. Lecture Notes in Computer Science. Cham: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1007/978-3-032-06706-7_5

    • NLM

      Couto YS, Fernandes CG. Hardness of dynamic core and truss decompositions [Internet]. Lecture Notes in Computer Science. 2026 ; 16077 LNCS 64-80.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1007/978-3-032-06706-7_5

    • Vancouver

      Couto YS, Fernandes CG. Hardness of dynamic core and truss decompositions [Internet]. Lecture Notes in Computer Science. 2026 ; 16077 LNCS 64-80.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1007/978-3-032-06706-7_5

  • Artigo de periodico

    A study on token digraphs (2026)

    Fernandes, Cristina Gomes ; Lintzmayer, Carla Negri ; Peña, Juan P.; Santos, Giovanne ; Trujillo-Negrete, Ana ; Zamora, Jose

    Source: Discrete Mathematics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      FERNANDES, Cristina Gomes et al. A study on token digraphs. Discrete Mathematics, v. 349, n. artigo 114951, p. 1-15, 2026Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2025.114951. Acesso em: 25 abr. 2026.

    • APA

      Fernandes, C. G., Lintzmayer, C. N., Peña, J. P., Santos, G., Trujillo-Negrete, A., & Zamora, J. (2026). A study on token digraphs. Discrete Mathematics, 349( artigo 114951), 1-15. doi:10.1016/j.disc.2025.114951

    • NLM

      Fernandes CG, Lintzmayer CN, Peña JP, Santos G, Trujillo-Negrete A, Zamora J. A study on token digraphs [Internet]. Discrete Mathematics. 2026 ; 349( artigo 114951): 1-15.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1016/j.disc.2025.114951

    • Vancouver

      Fernandes CG, Lintzmayer CN, Peña JP, Santos G, Trujillo-Negrete A, Zamora J. A study on token digraphs [Internet]. Discrete Mathematics. 2026 ; 349( artigo 114951): 1-15.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1016/j.disc.2025.114951

  • Artigo de periodico

    Separating path systems for cubic graphs and for complete bipartite graphs (2026)

    Fernandes, Cristina Gomes ; Hoppen, Carlos ; Kontogeorgiou, George ; Mota, Guilherme Oliveira ; Peng, Danni

    Source: Discrete Mathematics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      FERNANDES, Cristina Gomes et al. Separating path systems for cubic graphs and for complete bipartite graphs. Discrete Mathematics, v. 349, n. artigo 115100, p. 1-7, 2026Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2026.115100. Acesso em: 25 abr. 2026.

    • APA

      Fernandes, C. G., Hoppen, C., Kontogeorgiou, G., Mota, G. O., & Peng, D. (2026). Separating path systems for cubic graphs and for complete bipartite graphs. Discrete Mathematics, 349( artigo 115100), 1-7. doi:10.1016/j.disc.2026.115100

    • NLM

      Fernandes CG, Hoppen C, Kontogeorgiou G, Mota GO, Peng D. Separating path systems for cubic graphs and for complete bipartite graphs [Internet]. Discrete Mathematics. 2026 ; 349( artigo 115100): 1-7.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1016/j.disc.2026.115100

    • Vancouver

      Fernandes CG, Hoppen C, Kontogeorgiou G, Mota GO, Peng D. Separating path systems for cubic graphs and for complete bipartite graphs [Internet]. Discrete Mathematics. 2026 ; 349( artigo 115100): 1-7.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1016/j.disc.2026.115100

  • Artigo de periodico

    Separating path systems in complete graphs (2025)

    Fernandes, Cristina Gomes ; Mota, Guilherme Oliveira ; Sanhueza‐Matamala, Nicolás

    Source: Random Structures & Algorithms. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, ALGORITMOS

    Versão PublicadaAcesso à fonteDOIHow to cite
    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. Random Structures & Algorithms, v. 66, n. 3, p. 1-19, 2025Tradução . . Disponível em: https://onlinelibrary.wiley.com/doi/epdf/10.1002/rsa.70006. Acesso em: 25 abr. 2026.

    • APA

      Fernandes, C. G., Mota, G. O., & Sanhueza‐Matamala, N. (2025). Separating path systems in complete graphs. Random Structures & Algorithms, 66( 3), 1-19. doi:10.1002/rsa.70006

    • NLM

      Fernandes CG, Mota GO, Sanhueza‐Matamala N. Separating path systems in complete graphs [Internet]. Random Structures & Algorithms. 2025 ; 66( 3): 1-19.[citado 2026 abr. 25 ] Available from: https://onlinelibrary.wiley.com/doi/epdf/10.1002/rsa.70006

    • Vancouver

      Fernandes CG, Mota GO, Sanhueza‐Matamala N. Separating path systems in complete graphs [Internet]. Random Structures & Algorithms. 2025 ; 66( 3): 1-19.[citado 2026 abr. 25 ] Available from: https://onlinelibrary.wiley.com/doi/epdf/10.1002/rsa.70006

  • Trabalho de evento-resumo

    Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract) (2025)

    Botler, Fábio Happ ; Fernandes, Cristina Gomes

    Source: Proceedings - Booklet of extended abstracts. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA

    Versão PublicadaHow to cite
    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. Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract). 2025, Anais.. Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics, 2025. p. 156-162. Disponível em: https://repositorio.usp.br/directbitstream/c8cf92ab-2c7f-415a-8d02-2b4040ca395e/3271547.pdf. Acesso em: 25 abr. 2026.

    • APA

      Botler, F. H., & Fernandes, C. G. (2025). Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract). In Proceedings - Booklet of extended abstracts (p. 156-162). Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics. Recuperado de https://repositorio.usp.br/directbitstream/c8cf92ab-2c7f-415a-8d02-2b4040ca395e/3271547.pdf

    • NLM

      Botler FH, Fernandes CG. Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 156-162.[citado 2026 abr. 25 ] Available from: https://repositorio.usp.br/directbitstream/c8cf92ab-2c7f-415a-8d02-2b4040ca395e/3271547.pdf

    • Vancouver

      Botler FH, Fernandes CG. Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 156-162.[citado 2026 abr. 25 ] Available from: https://repositorio.usp.br/directbitstream/c8cf92ab-2c7f-415a-8d02-2b4040ca395e/3271547.pdf

  • Trabalho de evento-resumo

    Extremal problems on forest cuts and acyclic neighborhoods in sparse graphs (extended abstract) (2025)

    Botler, Fábio Happ ; Couto, Yan Soares; Fernandes, Cristina Gomes ; Figueiredo, E F; Gómez, Renzo ; Santos, V. F; Sato, C M

    Source: Proceedings - Booklet of extended abstracts. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Versão PublicadaHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      BOTLER, Fábio Happ et al. Extremal problems on forest cuts and acyclic neighborhoods in sparse graphs (extended abstract). 2025, Anais.. Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics, 2025. p. 163-167. Disponível em: https://repositorio.usp.br/directbitstream/8dd5db3b-2c85-4bf2-99d5-46b14f045ae5/3271548.pdf. Acesso em: 25 abr. 2026.

    • APA

      Botler, F. H., Couto, Y. S., Fernandes, C. G., Figueiredo, E. F., Gómez, R., Santos, V. F., & Sato, C. M. (2025). Extremal problems on forest cuts and acyclic neighborhoods in sparse graphs (extended abstract). In Proceedings - Booklet of extended abstracts (p. 163-167). Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics. Recuperado de https://repositorio.usp.br/directbitstream/8dd5db3b-2c85-4bf2-99d5-46b14f045ae5/3271548.pdf

    • NLM

      Botler FH, Couto YS, Fernandes CG, Figueiredo EF, Gómez R, Santos VF, Sato CM. Extremal problems on forest cuts and acyclic neighborhoods in sparse graphs (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 163-167.[citado 2026 abr. 25 ] Available from: https://repositorio.usp.br/directbitstream/8dd5db3b-2c85-4bf2-99d5-46b14f045ae5/3271548.pdf

    • Vancouver

      Botler FH, Couto YS, Fernandes CG, Figueiredo EF, Gómez R, Santos VF, Sato CM. Extremal problems on forest cuts and acyclic neighborhoods in sparse graphs (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 163-167.[citado 2026 abr. 25 ] Available from: https://repositorio.usp.br/directbitstream/8dd5db3b-2c85-4bf2-99d5-46b14f045ae5/3271548.pdf

  • Trabalho de evento-resumo

    Separating path systems for 2-degenerate graphs (extended abstract) (2025)

    Fernandes, Cristina Gomes ; Hoppen, Carlos ; Kontogeorgiou…, George; Mota, Guilherme Oliveira ; Peng, Danni

    Source: Proceedings - Booklet of extended abstracts. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Versão PublicadaHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      FERNANDES, Cristina Gomes et al. Separating path systems for 2-degenerate graphs (extended abstract). 2025, Anais.. Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics, 2025. p. 461-466. Disponível em: https://repositorio.usp.br/directbitstream/2c1ce34e-506d-4628-b78f-e3fe087d8bbf/3271550.pdf. Acesso em: 25 abr. 2026.

    • APA

      Fernandes, C. G., Hoppen, C., Kontogeorgiou…, G., Mota, G. O., & Peng, D. (2025). Separating path systems for 2-degenerate graphs (extended abstract). In Proceedings - Booklet of extended abstracts (p. 461-466). Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics. Recuperado de https://repositorio.usp.br/directbitstream/2c1ce34e-506d-4628-b78f-e3fe087d8bbf/3271550.pdf

    • NLM

      Fernandes CG, Hoppen C, Kontogeorgiou… G, Mota GO, Peng D. Separating path systems for 2-degenerate graphs (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 461-466.[citado 2026 abr. 25 ] Available from: https://repositorio.usp.br/directbitstream/2c1ce34e-506d-4628-b78f-e3fe087d8bbf/3271550.pdf

    • Vancouver

      Fernandes CG, Hoppen C, Kontogeorgiou… G, Mota GO, Peng D. Separating path systems for 2-degenerate graphs (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 461-466.[citado 2026 abr. 25 ] Available from: https://repositorio.usp.br/directbitstream/2c1ce34e-506d-4628-b78f-e3fe087d8bbf/3271550.pdf

  • Artigo de periodico

    Packing large balanced trees into bipartite graphs (2025)

    Fernandes, Cristina Gomes ; Naia, Tássio ; Santos, Giovanne ; Stein, Maya

    Source: Discrete Mathematics. Unidade: IME

    Subjects: EMPACOTAMENTO E COBERTURA, ESTRUTURAS DE DADOS, TEORIA DOS GRAFOS

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      FERNANDES, Cristina Gomes et al. Packing large balanced trees into bipartite graphs. Discrete Mathematics, v. 348, n. artigo 114641, p. 1-8, 2025Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2025.114641. Acesso em: 25 abr. 2026.

    • APA

      Fernandes, C. G., Naia, T., Santos, G., & Stein, M. (2025). Packing large balanced trees into bipartite graphs. Discrete Mathematics, 348( artigo 114641), 1-8. doi:10.1016/j.disc.2025.114641

    • NLM

      Fernandes CG, Naia T, Santos G, Stein M. Packing large balanced trees into bipartite graphs [Internet]. Discrete Mathematics. 2025 ; 348( artigo 114641): 1-8.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1016/j.disc.2025.114641

    • Vancouver

      Fernandes CG, Naia T, Santos G, Stein M. Packing large balanced trees into bipartite graphs [Internet]. Discrete Mathematics. 2025 ; 348( artigo 114641): 1-8.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1016/j.disc.2025.114641

  • Trabalho de evento-anais periodico

    How to go from partial to full retroactivity in detail (2025)

    Fernandes, Cristina Gomes ; Noronha, Felipe C.

    Source: Procedia Computer Science. Conference titles: Latin American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME

    Subjects: ALGORITMOS E ESTRUTURAS DE DADOS, ESTRUTURAS DE DADOS

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      FERNANDES, Cristina Gomes e NORONHA, Felipe C. How to go from partial to full retroactivity in detail. Procedia Computer Science. Amsterdam: Elsevier BV. Disponível em: https://doi.org/10.1016/j.procs.2025.10.333. Acesso em: 25 abr. 2026. , 2025

    • APA

      Fernandes, C. G., & Noronha, F. C. (2025). How to go from partial to full retroactivity in detail. Procedia Computer Science. Amsterdam: Elsevier BV. doi:10.1016/j.procs.2025.10.333

    • NLM

      Fernandes CG, Noronha FC. How to go from partial to full retroactivity in detail [Internet]. Procedia Computer Science. 2025 ; 273 466-473.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1016/j.procs.2025.10.333

    • Vancouver

      Fernandes CG, Noronha FC. How to go from partial to full retroactivity in detail [Internet]. Procedia Computer Science. 2025 ; 273 466-473.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1016/j.procs.2025.10.333

  • Artigo de periodico

    Approximations for the Steiner multicycle problem (2024)

    Fernandes, Cristina Gomes ; Lintzmayer, Carla Negri ; Moura, Phablo Fernando Soares

    Source: Theoretical Computer Science. Unidade: IME

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS DE APROXIMAÇÃO

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      FERNANDES, Cristina Gomes e LINTZMAYER, Carla Negri e MOURA, Phablo Fernando Soares. Approximations for the Steiner multicycle problem. Theoretical Computer Science, v. 1020, n. artigo 114836, p. 1-16, 2024Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2024.114836. Acesso em: 25 abr. 2026.

    • APA

      Fernandes, C. G., Lintzmayer, C. N., & Moura, P. F. S. (2024). Approximations for the Steiner multicycle problem. Theoretical Computer Science, 1020( artigo 114836), 1-16. doi:10.1016/j.tcs.2024.114836

    • NLM

      Fernandes CG, Lintzmayer CN, Moura PFS. Approximations for the Steiner multicycle problem [Internet]. Theoretical Computer Science. 2024 ; 1020( artigo 114836): 1-16.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1016/j.tcs.2024.114836

    • Vancouver

      Fernandes CG, Lintzmayer CN, Moura PFS. Approximations for the Steiner multicycle problem [Internet]. Theoretical Computer Science. 2024 ; 1020( artigo 114836): 1-16.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1016/j.tcs.2024.114836

  • 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

    Versão PublicadaAcesso à fonteDOIHow to cite
    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: 25 abr. 2026.

    • 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 2026 abr. 25 ] 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 2026 abr. 25 ] Available from: https://doi.org/10.37236/12548

  • Trabalho de evento-anais periodico

    Separating path systems in complete graphs (2024)

    Fernandes, Cristina Gomes ; Mota, Guilherme Oliveira ; Sanhueza-Matamala, Nicolás

    Source: LATIN 2024: Theoretical Informatics. Lecture Notes in Computer Science, vol 14579. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN 2024. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    PrivadoAcesso à fonteDOIHow to cite
    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. LATIN 2024: Theoretical Informatics. Lecture Notes in Computer Science, vol 14579. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-031-55601-2_7. Acesso em: 25 abr. 2026. , 2024

    • APA

      Fernandes, C. G., Mota, G. O., & Sanhueza-Matamala, N. (2024). Separating path systems in complete graphs. LATIN 2024: Theoretical Informatics. Lecture Notes in Computer Science, vol 14579. 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]. LATIN 2024: Theoretical Informatics. Lecture Notes in Computer Science, vol 14579. 2024 ;[citado 2026 abr. 25 ] 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]. LATIN 2024: Theoretical Informatics. Lecture Notes in Computer Science, vol 14579. 2024 ;[citado 2026 abr. 25 ] Available from: https://doi.org/10.1007/978-3-031-55601-2_7

  • Editor de periodico

    Procedia Computer Science (2023)

    Fernandes, Cristina Gomes (Editor) ; Rajsbaum, Sergio

    Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Assunto: CIÊNCIA DA COMPUTAÇÃO

    Acesso à fonteHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      RAJSBAUM, Sergio. Procedia Computer Science. . Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://www.sciencedirect.com/journal/procedia-computer-science/vol/223/suppl/C. Acesso em: 25 abr. 2026. , 2023

    • APA

      Rajsbaum, S. (2023). Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de https://www.sciencedirect.com/journal/procedia-computer-science/vol/223/suppl/C

    • NLM

      Rajsbaum S. Procedia Computer Science [Internet]. 2023 ; 223 1-408.[citado 2026 abr. 25 ] Available from: https://www.sciencedirect.com/journal/procedia-computer-science/vol/223/suppl/C

    • Vancouver

      Rajsbaum S. Procedia Computer Science [Internet]. 2023 ; 223 1-408.[citado 2026 abr. 25 ] Available from: https://www.sciencedirect.com/journal/procedia-computer-science/vol/223/suppl/C

  • Artigo de periodico-apres/intr

    This volume contains the papers presented at LAGOS 2023, the XII Latin-American Algorithms, Graphs and Optimization Symposium. [Prefácio] (2023)

    Fernandes, Cristina Gomes (Editor) ; Rajsbaum, Sergio

    Source: Procedia Computer Science. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Assunto: CIÊNCIA DA COMPUTAÇÃO

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      RAJSBAUM, Sergio. This volume contains the papers presented at LAGOS 2023, the XII Latin-American Algorithms, Graphs and Optimization Symposium. [Prefácio]. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.procs.2023.08.206. Acesso em: 25 abr. 2026. , 2023

    • APA

      Rajsbaum, S. (2023). This volume contains the papers presented at LAGOS 2023, the XII Latin-American Algorithms, Graphs and Optimization Symposium. [Prefácio]. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.procs.2023.08.206

    • NLM

      Rajsbaum S. This volume contains the papers presented at LAGOS 2023, the XII Latin-American Algorithms, Graphs and Optimization Symposium. [Prefácio] [Internet]. Procedia Computer Science. 2023 ; 223 1-4.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1016/j.procs.2023.08.206

    • Vancouver

      Rajsbaum S. This volume contains the papers presented at LAGOS 2023, the XII Latin-American Algorithms, Graphs and Optimization Symposium. [Prefácio] [Internet]. Procedia Computer Science. 2023 ; 223 1-4.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1016/j.procs.2023.08.206

  • 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

    Versão PublicadaAcesso à fonteDOIHow to cite
    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: 25 abr. 2026.

    • 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 2026 abr. 25 ] 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 2026 abr. 25 ] Available from: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-023

  • 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

    PrivadoAcesso à fonteDOIHow to cite
    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: 25 abr. 2026.

    • 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 2026 abr. 25 ] 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 2026 abr. 25 ] Available from: https://doi.org/10.1016/j.jcss.2023.02.006

  • Artigo de periodico

    Complexity and approximability of minimum path-collection exact covers (2023)

    Ravelo, Santiago Valdés ; Fernandes, Cristina Gomes

    Source: Theoretical Computer Science. Unidade: IME

    Subjects: CIÊNCIA DA COMPUTAÇÃO, ALGORITMOS DE APROXIMAÇÃO

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      RAVELO, Santiago Valdés e FERNANDES, Cristina Gomes. Complexity and approximability of minimum path-collection exact covers. Theoretical Computer Science, v. 942, p. 21-32, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2022.11.022. Acesso em: 25 abr. 2026.

    • APA

      Ravelo, S. V., & Fernandes, C. G. (2023). Complexity and approximability of minimum path-collection exact covers. Theoretical Computer Science, 942, 21-32. doi:10.1016/j.tcs.2022.11.022

    • NLM

      Ravelo SV, Fernandes CG. Complexity and approximability of minimum path-collection exact covers [Internet]. Theoretical Computer Science. 2023 ; 942 21-32.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1016/j.tcs.2022.11.022

    • Vancouver

      Ravelo SV, Fernandes CG. Complexity and approximability of minimum path-collection exact covers [Internet]. Theoretical Computer Science. 2023 ; 942 21-32.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1016/j.tcs.2022.11.022

  • Trabalho de evento

    Approximations for the Steiner multicycle problem (2022)

    Fernandes, Cristina Gomes ; Lintzmayer, Carla Negri ; Moura, Phablo Fernando Soares

    Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME

    Subjects: ALGORITMOS DE APROXIMAÇÃO, OTIMIZAÇÃO COMBINATÓRIA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      FERNANDES, Cristina Gomes e LINTZMAYER, Carla Negri e MOURA, Phablo Fernando Soares. Approximations for the Steiner multicycle problem. 2022, Anais.. Cham: Instituto de Matemática e Estatística, Universidade de São Paulo, 2022. Disponível em: https://doi.org/10.1007/978-3-031-20624-5_12. Acesso em: 25 abr. 2026.

    • APA

      Fernandes, C. G., Lintzmayer, C. N., & Moura, P. F. S. (2022). Approximations for the Steiner multicycle problem. In Proceedings. Cham: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1007/978-3-031-20624-5_12

    • NLM

      Fernandes CG, Lintzmayer CN, Moura PFS. Approximations for the Steiner multicycle problem [Internet]. Proceedings. 2022 ;[citado 2026 abr. 25 ] Available from: https://doi.org/10.1007/978-3-031-20624-5_12

    • Vancouver

      Fernandes CG, Lintzmayer CN, Moura PFS. Approximations for the Steiner multicycle problem [Internet]. Proceedings. 2022 ;[citado 2026 abr. 25 ] Available from: https://doi.org/10.1007/978-3-031-20624-5_12

  • Artigo de periodico

    Leafy spanning k-forests (2022)

    Fernandes, Cristina Gomes ; Lintzmayer, Carla Negri ; San Felice, Mário César

    Source: Journal of Combinatorial Optimization. Unidade: IME

    Assunto: ALGORITMOS DE APROXIMAÇÃO

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      FERNANDES, Cristina Gomes e LINTZMAYER, Carla Negri e SAN FELICE, Mário César. Leafy spanning k-forests. Journal of Combinatorial Optimization, v. 44, n. 2, p. 934-946, 2022Tradução . . Disponível em: https://doi.org/10.1007/s10878-022-00872-z. Acesso em: 25 abr. 2026.

    • APA

      Fernandes, C. G., Lintzmayer, C. N., & San Felice, M. C. (2022). Leafy spanning k-forests. Journal of Combinatorial Optimization, 44( 2), 934-946. doi:10.1007/s10878-022-00872-z

    • NLM

      Fernandes CG, Lintzmayer CN, San Felice MC. Leafy spanning k-forests [Internet]. Journal of Combinatorial Optimization. 2022 ; 44( 2): 934-946.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1007/s10878-022-00872-z

    • Vancouver

      Fernandes CG, Lintzmayer CN, San Felice MC. Leafy spanning k-forests [Internet]. Journal of Combinatorial Optimization. 2022 ; 44( 2): 934-946.[citado 2026 abr. 25 ] Available from: https://doi.org/10.1007/s10878-022-00872-z

  • Artigo de periodico

    Period collapse in Ehrhart quasi-polynomials of {1, 3}-graphs (2022)

    Fernandes, Cristina Gomes ; Pina Júnior, José Coelho de ; Alfonsín, Jorge Luis Ramírez ; Robins, Sinai

    Source: Combinatorial Theory. Unidade: IME

    Subjects: COMBINATÓRIA, GEOMETRIA CONVEXA, GEOMETRIA DESCRITIVA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      FERNANDES, Cristina Gomes et al. Period collapse in Ehrhart quasi-polynomials of {1, 3}-graphs. Combinatorial Theory, v. 2, n. 3, p. 1-43, 2022Tradução . . Disponível em: https://doi.org/10.5070/C62359168. Acesso em: 25 abr. 2026.

    • APA

      Fernandes, C. G., Pina Júnior, J. C. de, Alfonsín, J. L. R., & Robins, S. (2022). Period collapse in Ehrhart quasi-polynomials of {1, 3}-graphs. Combinatorial Theory, 2( 3), 1-43. doi:10.5070/C62359168

    • NLM

      Fernandes CG, Pina Júnior JC de, Alfonsín JLR, Robins S. Period collapse in Ehrhart quasi-polynomials of {1, 3}-graphs [Internet]. Combinatorial Theory. 2022 ; 2( 3): 1-43.[citado 2026 abr. 25 ] Available from: https://doi.org/10.5070/C62359168

    • Vancouver

      Fernandes CG, Pina Júnior JC de, Alfonsín JLR, Robins S. Period collapse in Ehrhart quasi-polynomials of {1, 3}-graphs [Internet]. Combinatorial Theory. 2022 ; 2( 3): 1-43.[citado 2026 abr. 25 ] Available from: https://doi.org/10.5070/C62359168

1 - 20 (98 records)

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2026