ReP USP - Resultado da busca

Artigo de periodico
On the query complexity of estimating the distance to hereditary graph properties (2021)
Hoppen, Carlos ; Kohayakawa, Yoshiharu ; Lang, Richard; Lefmann, Hanno ; Stagni, Henrique
Source: SIAM Journal on Discrete Mathematics. Unidade: IME
Assunto: COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HOPPEN, Carlos et al. On the query complexity of estimating the distance to hereditary graph properties. SIAM Journal on Discrete Mathematics, v. 35, n. 2, p. 1238-1251, 2021Tradução . . Disponível em: https://doi.org/10.1137/19M1283951. Acesso em: 13 jul. 2024.
APA
Hoppen, C., Kohayakawa, Y., Lang, R., Lefmann, H., & Stagni, H. (2021). On the query complexity of estimating the distance to hereditary graph properties. SIAM Journal on Discrete Mathematics, 35( 2), 1238-1251. doi:10.1137/19M1283951
NLM
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. On the query complexity of estimating the distance to hereditary graph properties [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 2): 1238-1251.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1137/19M1283951
Vancouver
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. On the query complexity of estimating the distance to hereditary graph properties [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 2): 1238-1251.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1137/19M1283951
Artigo de periodico
Estimating parameters associated with monotone properties (2020)
Hoppen, Carlos ; Kohayakawa, Yoshiharu ; Lang, Richard; Lefmann, Hanno ; Stagni, Henrique
Source: Combinatorics, Probability & Computing. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS PARA PROCESSAMENTO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HOPPEN, Carlos et al. Estimating parameters associated with monotone properties. Combinatorics, Probability & Computing, v. 29, n. 4, p. 616-632, 2020Tradução . . Disponível em: https://doi.org/10.1017/S0963548320000048. Acesso em: 13 jul. 2024.
APA
Hoppen, C., Kohayakawa, Y., Lang, R., Lefmann, H., & Stagni, H. (2020). Estimating parameters associated with monotone properties. Combinatorics, Probability & Computing, 29( 4), 616-632. doi:10.1017/S0963548320000048
NLM
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating parameters associated with monotone properties [Internet]. Combinatorics, Probability & Computing. 2020 ; 29( 4): 616-632.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1017/S0963548320000048
Vancouver
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating parameters associated with monotone properties [Internet]. Combinatorics, Probability & Computing. 2020 ; 29( 4): 616-632.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1017/S0963548320000048
Trabalho de evento-anais periodico
Estimating the distance to a hereditary graph property (2017)
Hoppen, Carlos; Kohayakawa, Yoshiharu ; Lang, Richard; Lefmann, Hanno; Stagni, Henrique
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB'17. Unidade: IME
Assunto: MATEMÁTICA DISCRETA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HOPPEN, Carlos et al. Estimating the distance to a hereditary graph property. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2017.07.014. Acesso em: 13 jul. 2024. , 2017
APA
Hoppen, C., Kohayakawa, Y., Lang, R., Lefmann, H., & Stagni, H. (2017). Estimating the distance to a hereditary graph property. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2017.07.014
NLM
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating the distance to a hereditary graph property [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 607-613.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1016/j.endm.2017.07.014
Vancouver
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating the distance to a hereditary graph property [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 607-613.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1016/j.endm.2017.07.014
Trabalho de evento
Estimating parameters associated with monotone properties (2016)
Hoppen, Carlos; Kohayakawa, Yoshiharu ; Lang, Richard; Lefmann, Hanno; Stagni, Henrique
Source: Approximation, randomization, and combinatorial optimization. Algorithms and Techniques. Conference titles: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016). Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HOPPEN, Carlos et al. Estimating parameters associated with monotone properties. 2016, Anais.. Wadern: Schloss Dagstuhl, 2016. Disponível em: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.35. Acesso em: 13 jul. 2024.
APA
Hoppen, C., Kohayakawa, Y., Lang, R., Lefmann, H., & Stagni, H. (2016). Estimating parameters associated with monotone properties. In Approximation, randomization, and combinatorial optimization. Algorithms and Techniques. Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.APPROX-RANDOM.2016.35
NLM
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating parameters associated with monotone properties [Internet]. Approximation, randomization, and combinatorial optimization. Algorithms and Techniques. 2016 ;[citado 2024 jul. 13 ] Available from: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.35
Vancouver
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating parameters associated with monotone properties [Internet]. Approximation, randomization, and combinatorial optimization. Algorithms and Techniques. 2016 ;[citado 2024 jul. 13 ] Available from: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.35
Artigo de periodico
Edge-colorings of uniform hypergraphs avoiding monochromatic matchings (2015)
Hoppen, Carlos; Kohayakawa, Yoshiharu ; Lefmann, Hanno
Source: Discrete Mathematics. 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 uniform hypergraphs avoiding monochromatic matchings. Discrete Mathematics, v. 338, n. 2, p. 262-271, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2014.10.004. Acesso em: 13 jul. 2024.
APA
Hoppen, C., Kohayakawa, Y., & Lefmann, H. (2015). Edge-colorings of uniform hypergraphs avoiding monochromatic matchings. Discrete Mathematics, 338( 2), 262-271. doi:10.1016/j.disc.2014.10.004
NLM
Hoppen C, Kohayakawa Y, Lefmann H. Edge-colorings of uniform hypergraphs avoiding monochromatic matchings [Internet]. Discrete Mathematics. 2015 ; 338( 2): 262-271.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1016/j.disc.2014.10.004
Vancouver
Hoppen C, Kohayakawa Y, Lefmann H. Edge-colorings of uniform hypergraphs avoiding monochromatic matchings [Internet]. Discrete Mathematics. 2015 ; 338( 2): 262-271.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1016/j.disc.2014.10.004
Artigo de periodico
Edge colourings of graphs avoiding monochromatic matchings of a given size (2012)
Hoppen, Carlos; Kohayakawa, Yoshiharu ; Lefmann, Hanno
Source: Combinatoris Probrability & Computing. Unidade: IME
Assunto: TEORIA DOS GRAFOS
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 colourings of graphs avoiding monochromatic matchings of a given size. Combinatoris Probrability & Computing, v. 21, n. 1-2, p. 203-218, 2012Tradução . . Disponível em: https://doi.org/10.1017/S0963548311000484. Acesso em: 13 jul. 2024.
APA
Hoppen, C., Kohayakawa, Y., & Lefmann, H. (2012). Edge colourings of graphs avoiding monochromatic matchings of a given size. Combinatoris Probrability & Computing, 21( 1-2), 203-218. doi:10.1017/S0963548311000484
NLM
Hoppen C, Kohayakawa Y, Lefmann H. Edge colourings of graphs avoiding monochromatic matchings of a given size [Internet]. Combinatoris Probrability & Computing. 2012 ; 21( 1-2): 203-218.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1017/S0963548311000484
Vancouver
Hoppen C, Kohayakawa Y, Lefmann H. Edge colourings of graphs avoiding monochromatic matchings of a given size [Internet]. Combinatoris Probrability & Computing. 2012 ; 21( 1-2): 203-218.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1017/S0963548311000484
Trabalho de evento-anais periodico
A note on permutation regularity (2012)
Hoppen, Carlos; Kohayakawa, Yoshiharu ; Sampaio, Rudini Menezes
Source: Discrete Applied Mathematics. Conference titles: Latin American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME
Subjects: PERMUTAÇÕES, 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 SAMPAIO, Rudini Menezes. A note on permutation regularity. 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.2011.06.002. Acesso em: 13 jul. 2024. , 2012
APA
Hoppen, C., Kohayakawa, Y., & Sampaio, R. M. (2012). A note on permutation regularity. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2011.06.002
NLM
Hoppen C, Kohayakawa Y, Sampaio RM. A note on permutation regularity [Internet]. Discrete Applied Mathematics. 2012 ; 160( 18): 2716-2727.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1016/j.dam.2011.06.002
Vancouver
Hoppen C, Kohayakawa Y, Sampaio RM. A note on permutation regularity [Internet]. Discrete Applied Mathematics. 2012 ; 160( 18): 2716-2727.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1016/j.dam.2011.06.002
Trabalho de evento-anais periodico
Every hereditary permutation property is testable (2011)
Bastos, Antonio Josefran de Oliveira; Hoppen, Carlos ; Kohayakawa, Yoshiharu ; Sampaio, Rudini Menezes
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. Unidade: IME
Subjects: COMBINATÓRIA, PERMUTAÇÕES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BASTOS, Antonio Josefran de Oliveira et al. Every hereditary permutation property is testable. 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.021. Acesso em: 13 jul. 2024. , 2011
APA
Bastos, A. J. de O., Hoppen, C., Kohayakawa, Y., & Sampaio, R. M. (2011). Every hereditary permutation property is testable. 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.021
NLM
Bastos AJ de O, Hoppen C, Kohayakawa Y, Sampaio RM. Every hereditary permutation property is testable [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 123-128.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1016/j.endm.2011.09.021
Vancouver
Bastos AJ de O, Hoppen C, Kohayakawa Y, Sampaio RM. Every hereditary permutation property is testable [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 123-128.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1016/j.endm.2011.09.021
Trabalho de evento-anais periodico
A note on random k-dimensional posets (2011)
Corrêa, Ricardo; Hoppen, Carlos; Kohayakawa, Yoshiharu ; Sampaio, M. Rudini
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CORRÊA, Ricardo et al. A note on random k-dimensional posets. 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.05.010. Acesso em: 13 jul. 2024. , 2011
APA
Corrêa, R., Hoppen, C., Kohayakawa, Y., & Sampaio, M. R. (2011). A note on random k-dimensional posets. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.05.010
NLM
Corrêa R, Hoppen C, Kohayakawa Y, Sampaio MR. A note on random k-dimensional posets [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 51-56.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1016/j.endm.2011.05.010
Vancouver
Corrêa R, Hoppen C, Kohayakawa Y, Sampaio MR. A note on random k-dimensional posets [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 51-56.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1016/j.endm.2011.05.010

USP Schools

ReP

Filtros

Authors

Date published

Subjects

Source title

Conference titles

Funding Agencies

Non normalized affiliation