ReP USP - Resultado da busca

Artigo de periodico
Decomposing highly edge-connected graphs into paths of any given length (2017)
Botler, Fábio Happ ; Mota, Guilherme Oliveira ; Oshiro, Marcio Takashi Iura ; Wakabayashi, Yoshiko
Source: Journal of Combinatorial Theory, Series B. 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 et al. Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B, v. 122, p. 508-542, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.jctb.2016.07.010. Acesso em: 09 nov. 2025.
APA
Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2017). Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B, 122, 508-542. doi:10.1016/j.jctb.2016.07.010
NLM
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly edge-connected graphs into paths of any given length [Internet]. Journal of Combinatorial Theory, Series B. 2017 ; 122 508-542.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.jctb.2016.07.010
Vancouver
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly edge-connected graphs into paths of any given length [Internet]. Journal of Combinatorial Theory, Series B. 2017 ; 122 508-542.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.jctb.2016.07.010
Artigo de periodico
Intersecting longest paths (2013)
Rezende, Susanna F. de; Fernandes, Cristina Gomes ; Martin, Daniel M; Wakabayashi, Yoshiko
Source: Discrete Mathematics. 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. Intersecting longest paths. Discrete Mathematics, v. 313, n. 12, p. 1401-1408, 2013Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2013.02.016. Acesso em: 09 nov. 2025.
APA
Rezende, S. F. de, Fernandes, C. G., Martin, D. M., & Wakabayashi, Y. (2013). Intersecting longest paths. Discrete Mathematics, 313( 12), 1401-1408. doi:10.1016/j.disc.2013.02.016
NLM
Rezende SF de, Fernandes CG, Martin DM, Wakabayashi Y. Intersecting longest paths [Internet]. Discrete Mathematics. 2013 ; 313( 12): 1401-1408.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.disc.2013.02.016
Vancouver
Rezende SF de, Fernandes CG, Martin DM, Wakabayashi Y. Intersecting longest paths [Internet]. Discrete Mathematics. 2013 ; 313( 12): 1401-1408.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.disc.2013.02.016
Trabalho de evento
On the complexity of solving or approximating convex recoloring problems (2013)
Campêlo, Manoel B ; Huiban, Cristiana Gomes ; Sampaio, Rudini Menezes ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: International Computing and Combinatorics Conference - COCOON. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPÊLO, Manoel B et al. On the complexity of solving or approximating convex recoloring problems. 2013, Anais.. Berlin: Springer, 2013. Disponível em: https://doi.org/10.1007/978-3-642-38768-5_54. Acesso em: 09 nov. 2025.
APA
Campêlo, M. B., Huiban, C. G., Sampaio, R. M., & Wakabayashi, Y. (2013). On the complexity of solving or approximating convex recoloring problems. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-38768-5_54
NLM
Campêlo MB, Huiban CG, Sampaio RM, Wakabayashi Y. On the complexity of solving or approximating convex recoloring problems [Internet]. Proceedings. 2013 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/978-3-642-38768-5_54
Vancouver
Campêlo MB, Huiban CG, Sampaio RM, Wakabayashi Y. On the complexity of solving or approximating convex recoloring problems [Internet]. Proceedings. 2013 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/978-3-642-38768-5_54
Artigo de periodico
On dominating sets of maximal outerplanar graphs (2013)
Campos, C. N ; Wakabayashi, Yoshiko
Source: Discrete Applied Mathematics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPOS, C. N e WAKABAYASHI, Yoshiko. On dominating sets of maximal outerplanar graphs. Discrete Applied Mathematics, v. 161, n. 3, p. 330-335, 2013Tradução . . Disponível em: https://doi.org/10.1016/j.dam.2012.08.023. Acesso em: 09 nov. 2025.
APA
Campos, C. N., & Wakabayashi, Y. (2013). On dominating sets of maximal outerplanar graphs. Discrete Applied Mathematics, 161( 3), 330-335. doi:10.1016/j.dam.2012.08.023
NLM
Campos CN, Wakabayashi Y. On dominating sets of maximal outerplanar graphs [Internet]. Discrete Applied Mathematics. 2013 ; 161( 3): 330-335.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.dam.2012.08.023
Vancouver
Campos CN, Wakabayashi Y. On dominating sets of maximal outerplanar graphs [Internet]. Discrete Applied Mathematics. 2013 ; 161( 3): 330-335.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.dam.2012.08.023
Trabalho de evento
A better approximation ratio and an IP formulation for a sensor cover problem (2012)
Barbosa, Rafael da Ponte; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: Latin American Theoretical Informatics Symposium - LATIN. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BARBOSA, Rafael da Ponte e WAKABAYASHI, Yoshiko. A better approximation ratio and an IP formulation for a sensor cover problem. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-29344-3_5. Acesso em: 09 nov. 2025.
APA
Barbosa, R. da P., & Wakabayashi, Y. (2012). A better approximation ratio and an IP formulation for a sensor cover problem. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-29344-3_5
NLM
Barbosa R da P, Wakabayashi Y. A better approximation ratio and an IP formulation for a sensor cover problem [Internet]. Proceedings. 2012 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_5
Vancouver
Barbosa R da P, Wakabayashi Y. A better approximation ratio and an IP formulation for a sensor cover problem [Internet]. Proceedings. 2012 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_5
Trabalho de evento
An improved upper bound on the density of universal random graphs (2012)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Rucinski, Andrzej
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
DELLAMONICA JUNIOR, Domingos et al. An improved upper bound on the density of universal random graphs. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-29344-3_20. Acesso em: 09 nov. 2025.
APA
Dellamonica Junior, D., Kohayakawa, Y., Rodl, V., & Rucinski, A. (2012). An improved upper bound on the density of universal random graphs. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-29344-3_20
NLM
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20
Vancouver
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20
Trabalho de evento-anais periodico
Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number (2011)
Hoppen, Carlos ; Kohayakawa, Yoshiharu ; Lefmann, Hanno
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
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HOPPEN, Carlos e KOHAYAKAWA, Yoshiharu e LEFMANN, Hanno. Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. 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.09.076. Acesso em: 09 nov. 2025. , 2011
APA
Hoppen, C., Kohayakawa, Y., & Lefmann, H. (2011). Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.09.076
NLM
Hoppen C, Kohayakawa Y, Lefmann H. Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 469-474.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.endm.2011.09.076
Vancouver
Hoppen C, Kohayakawa Y, Lefmann H. Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 469-474.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.endm.2011.09.076

USP Schools

ReP

Filtros

Authors

Funding Agencies

Non normalized affiliation