Menu

Filtros : "Electronic Notes in Discrete Mathematics" "Taraz, Anusch" Limpar

Filtros

Refine with date range

  • 1

1 - 3 (3 records)

  • Trabalho de evento-anais periodico

    A counting lemma for sparse pseudorandom hypergraphs (2015)

    Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, Mathias; Taraz, Anusch

    Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA

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

    • ABNT

      KOHAYAKAWA, Yoshiharu et al. A counting lemma for sparse pseudorandom hypergraphs. 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.2015.07.070. Acesso em: 11 nov. 2025. , 2015

    • APA

      Kohayakawa, Y., Mota, G. O., Schacht, M., & Taraz, A. (2015). A counting lemma for sparse pseudorandom hypergraphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.07.070

    • NLM

      Kohayakawa Y, Mota GO, Schacht M, Taraz A. A counting lemma for sparse pseudorandom hypergraphs [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 421-426.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.07.070

    • Vancouver

      Kohayakawa Y, Mota GO, Schacht M, Taraz A. A counting lemma for sparse pseudorandom hypergraphs [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 421-426.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.07.070

  • Trabalho de evento-anais periodico

    On minimum bisection and related partition problems in graphs with bounded tree width (2015)

    Fernandes, Cristina Gomes ; Schmidt, Tina Janne; Taraz, Anusch

    Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications -EuroComb. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    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 SCHMIDT, Tina Janne e TARAZ, Anusch. On minimum bisection and related partition problems in graphs with bounded tree width. 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.2015.06.067. Acesso em: 11 nov. 2025. , 2015

    • APA

      Fernandes, C. G., Schmidt, T. J., & Taraz, A. (2015). On minimum bisection and related partition problems in graphs with bounded tree width. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.06.067

    • NLM

      Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related partition problems in graphs with bounded tree width [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015 481-488.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.06.067

    • Vancouver

      Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related partition problems in graphs with bounded tree width [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015 481-488.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.06.067

  • Trabalho de evento-anais periodico

    Almost spanning subgraphs of random graphs after adversarial edge removal (2009)

    Böttcher, Julia ; Kohayakawa, Yoshiharu ; Taraz, Anusch

    Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Assunto: GRAFOS ALEATÓRIOS

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

    • ABNT

      BÖTTCHER, Julia e KOHAYAKAWA, Yoshiharu e TARAZ, Anusch. Almost spanning subgraphs of random graphs after adversarial edge removal. 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.2009.11.055. Acesso em: 11 nov. 2025. , 2009

    • APA

      Böttcher, J., Kohayakawa, Y., & Taraz, A. (2009). Almost spanning subgraphs of random graphs after adversarial edge removal. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2009.11.055

    • NLM

      Böttcher J, Kohayakawa Y, Taraz A. Almost spanning subgraphs of random graphs after adversarial edge removal [Internet]. Electronic Notes in Discrete Mathematics. 2009 ; 35 335-340.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/j.endm.2009.11.055

    • Vancouver

      Böttcher J, Kohayakawa Y, Taraz A. Almost spanning subgraphs of random graphs after adversarial edge removal [Internet]. Electronic Notes in Discrete Mathematics. 2009 ; 35 335-340.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/j.endm.2009.11.055
  • 1

1 - 3 (3 records)

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