ReP USP - Resultado da busca

Artigo de periodico
Boundedness for proper conflict-free and odd colorings (2026)
Jiménez, A.; Knauer, K.; Lintzmayer, C.N.; Matamala, M.; Peña, J.P.; Quiroz, D.A.; Sambinelli, M.; Wakabayashi, Yoshiko ; Yu, W.; Zamora, J.
Source: Discrete Mathematics. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COLORAÇÃO, GRÁFICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
JIMÉNEZ, A. et al. Boundedness for proper conflict-free and odd colorings. Discrete Mathematics, v. 349, n. artigo 114730, p. 1-16, 2026Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2025.114730. Acesso em: 08 out. 2025.
APA
Jiménez, A., Knauer, K., Lintzmayer, C. N., Matamala, M., Peña, J. P., Quiroz, D. A., et al. (2026). Boundedness for proper conflict-free and odd colorings. Discrete Mathematics, 349( artigo 114730), 1-16. doi:10.1016/j.disc.2025.114730
NLM
Jiménez A, Knauer K, Lintzmayer CN, Matamala M, Peña JP, Quiroz DA, Sambinelli M, Wakabayashi Y, Yu W, Zamora J. Boundedness for proper conflict-free and odd colorings [Internet]. Discrete Mathematics. 2026 ; 349( artigo 114730): 1-16.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.disc.2025.114730
Vancouver
Jiménez A, Knauer K, Lintzmayer CN, Matamala M, Peña JP, Quiroz DA, Sambinelli M, Wakabayashi Y, Yu W, Zamora J. Boundedness for proper conflict-free and odd colorings [Internet]. Discrete Mathematics. 2026 ; 349( artigo 114730): 1-16.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.disc.2025.114730
Artigo de periodico
A minimal face constant rank constraint qualification for reducible conic programming (2025)
Andreani, Roberto ; Haeser, Gabriel ; Mito, Leonardo ; Ramírez, Héctor
Source: Mathematical Programming. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, OTIMIZAÇÃO NÃO LINEAR, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. A minimal face constant rank constraint qualification for reducible conic programming. Mathematical Programming, p. 1-27, 2025Tradução . . Disponível em: https://doi.org/10.1007/s10107-025-02237-w. Acesso em: 08 out. 2025.
APA
Andreani, R., Haeser, G., Mito, L., & Ramírez, H. (2025). A minimal face constant rank constraint qualification for reducible conic programming. Mathematical Programming, 1-27. doi:10.1007/s10107-025-02237-w
NLM
Andreani R, Haeser G, Mito L, Ramírez H. A minimal face constant rank constraint qualification for reducible conic programming [Internet]. Mathematical Programming. 2025 ; 1-27.[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/s10107-025-02237-w
Vancouver
Andreani R, Haeser G, Mito L, Ramírez H. A minimal face constant rank constraint qualification for reducible conic programming [Internet]. Mathematical Programming. 2025 ; 1-27.[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/s10107-025-02237-w
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
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: 08 out. 2025.
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 2025 out. 08 ] 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 2025 out. 08 ] Available from: https://doi.org/10.1016/j.disc.2025.114641
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
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: 08 out. 2025.
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 2025 out. 08 ] 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 2025 out. 08 ] Available from: https://repositorio.usp.br/directbitstream/c8cf92ab-2c7f-415a-8d02-2b4040ca395e/3271547.pdf
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
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: 08 out. 2025.
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 2025 out. 08 ] 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 2025 out. 08 ] Available from: https://onlinelibrary.wiley.com/doi/epdf/10.1002/rsa.70006
Artigo de periodico
Weak notions of nondegeneracy in nonlinear semidefinite programming (2024)
Andreani, Roberto ; Haeser, Gabriel ; Mito, Leonardo Makoto ; Ramírez, Héctor
Source: Mathematical Programming. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. Weak notions of nondegeneracy in nonlinear semidefinite programming. Mathematical Programming, v. 205, n. 1-2, p. 1-32, 2024Tradução . . Disponível em: https://doi.org/10.1007/s10107-023-01970-4. Acesso em: 08 out. 2025.
APA
Andreani, R., Haeser, G., Mito, L. M., & Ramírez, H. (2024). Weak notions of nondegeneracy in nonlinear semidefinite programming. Mathematical Programming, 205( 1-2), 1-32. doi:10.1007/s10107-023-01970-4
NLM
Andreani R, Haeser G, Mito LM, Ramírez H. Weak notions of nondegeneracy in nonlinear semidefinite programming [Internet]. Mathematical Programming. 2024 ; 205( 1-2): 1-32.[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/s10107-023-01970-4
Vancouver
Andreani R, Haeser G, Mito LM, Ramírez H. Weak notions of nondegeneracy in nonlinear semidefinite programming [Internet]. Mathematical Programming. 2024 ; 205( 1-2): 1-32.[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/s10107-023-01970-4
Artigo de periodico
Erratum to New constraint qualifications and optimality conditions for second order cone programs (2022)
Andreani, Roberto ; Fukuda, Ellen Hidemi ; Haeser, Gabriel ; Ramírez, H; Santos, Daiana O; Silva, Paulo J. S. ; Silveira, Thiago Parente da
Source: Set-Valued and Varational Analysis. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, PROGRAMAÇÃO CONVEXA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. Erratum to New constraint qualifications and optimality conditions for second order cone programs. Set-Valued and Varational Analysis, v. 30, n. 1, p. 329-333, 2022Tradução . . Disponível em: https://doi.org/10.1007/s11228-018-0487-2. Acesso em: 08 out. 2025.
APA
Andreani, R., Fukuda, E. H., Haeser, G., Ramírez, H., Santos, D. O., Silva, P. J. S., & Silveira, T. P. da. (2022). Erratum to New constraint qualifications and optimality conditions for second order cone programs. Set-Valued and Varational Analysis, 30( 1), 329-333. doi:10.1007/s11228-018-0487-2
NLM
Andreani R, Fukuda EH, Haeser G, Ramírez H, Santos DO, Silva PJS, Silveira TP da. Erratum to New constraint qualifications and optimality conditions for second order cone programs [Internet]. Set-Valued and Varational Analysis. 2022 ; 30( 1): 329-333.[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/s11228-018-0487-2
Vancouver
Andreani R, Fukuda EH, Haeser G, Ramírez H, Santos DO, Silva PJS, Silveira TP da. Erratum to New constraint qualifications and optimality conditions for second order cone programs [Internet]. Set-Valued and Varational Analysis. 2022 ; 30( 1): 329-333.[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/s11228-018-0487-2

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Subjects

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration