ReP USP - Resultado da busca

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
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: 08 out. 2025.
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 2025 out. 08 ] 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 2025 out. 08 ] Available from: https://repositorio.usp.br/directbitstream/2c1ce34e-506d-4628-b78f-e3fe087d8bbf/3271550.pdf
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
Trabalho de evento-resumo
Rainbow path covers of sparse random graphs (extended abstract) (2025)
Botler, Fábio Happ ; Kaique, Antônio; Mendonça, Walner ; Mota, G.O; 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
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ et al. Rainbow path covers of sparse random graphs (extended abstract). 2025, Anais.. Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics, 2025. p. 168-173. Disponível em: https://repositorio.usp.br/directbitstream/4cee253e-d4d3-4de2-910f-b1e64c8b77da/3271549.pdf. Acesso em: 08 out. 2025.
APA
Botler, F. H., Kaique, A., Mendonça, W., Mota, G. O., & Sato, C. M. (2025). Rainbow path covers of sparse random graphs (extended abstract). In Proceedings - Booklet of extended abstracts (p. 168-173). Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics. Recuperado de https://repositorio.usp.br/directbitstream/4cee253e-d4d3-4de2-910f-b1e64c8b77da/3271549.pdf
NLM
Botler FH, Kaique A, Mendonça W, Mota GO, Sato CM. Rainbow path covers of sparse random graphs (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 168-173.[citado 2025 out. 08 ] Available from: https://repositorio.usp.br/directbitstream/4cee253e-d4d3-4de2-910f-b1e64c8b77da/3271549.pdf
Vancouver
Botler FH, Kaique A, Mendonça W, Mota GO, Sato CM. Rainbow path covers of sparse random graphs (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 168-173.[citado 2025 out. 08 ] Available from: https://repositorio.usp.br/directbitstream/4cee253e-d4d3-4de2-910f-b1e64c8b77da/3271549.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
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: 08 out. 2025.
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 2025 out. 08 ] 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 2025 out. 08 ] Available from: https://repositorio.usp.br/directbitstream/8dd5db3b-2c85-4bf2-99d5-46b14f045ae5/3271548.pdf
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: 08 out. 2025.
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 2025 out. 08 ] 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 2025 out. 08 ] Available from: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-023
Trabalho de evento-anais periodico
Intersection of longest paths in a graph (2011)
Rezende, Susanna F. de; Fernandes, Cristina Gomes ; Martin, Daniel M.; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. 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
REZENDE, Susanna F. de et al. Intersection of longest paths in a graph. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2011.10.024. Acesso em: 08 out. 2025. , 2011
APA
Rezende, S. F. de, Fernandes, C. G., Martin, D. M., & Wakabayashi, Y. (2011). Intersection of longest paths in a graph. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.10.024
NLM
Rezende SF de, Fernandes CG, Martin DM, Wakabayashi Y. Intersection of longest paths in a graph [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 743-748.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.endm.2011.10.024
Vancouver
Rezende SF de, Fernandes CG, Martin DM, Wakabayashi Y. Intersection of longest paths in a graph [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 743-748.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.endm.2011.10.024
Trabalho de evento-anais periodico
Approximation algorithms and hardness results for the clique packing problem (2007)
Chataigner, Frederic; Manic, Gordana; Wakabayashi, Yoshiko ; Yuster, Raphael
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHATAIGNER, Frederic et al. Approximation algorithms and hardness results for the clique packing problem. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2007.07.065. Acesso em: 08 out. 2025. , 2007
APA
Chataigner, F., Manic, G., Wakabayashi, Y., & Yuster, R. (2007). Approximation algorithms and hardness results for the clique packing problem. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2007.07.065
NLM
Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Electronic Notes in Discrete Mathematics. 2007 ; 29 397-401.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.endm.2007.07.065
Vancouver
Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Electronic Notes in Discrete Mathematics. 2007 ; 29 397-401.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.endm.2007.07.065

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Funding Agencies

Non normalized affiliation