Filters : "Discrete Applied Mathematics" Limpar

Filters



Refine with date range


  • In: Discrete Applied Mathematics. Unidade: IME

    Subjects: Teoria Dos Grafos, Otimização Combinatória

    Versão AceitaOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko. Strong intractability results for generalized convex recoloring problems. Discrete Applied Mathematics, Amsterdam, Elsevier, 2019. Disponível em: < http://dx.doi.org/10.1016/j.dam.2019.08.002 > DOI: 10.1016/j.dam.2019.08.002.
    • APA

      Moura, P. F. S., & Wakabayashi, Y. (2019). Strong intractability results for generalized convex recoloring problems. Discrete Applied Mathematics. doi:10.1016/j.dam.2019.08.002
    • NLM

      Moura PFS, Wakabayashi Y. Strong intractability results for generalized convex recoloring problems [Internet]. Discrete Applied Mathematics. 2019 ;Available from: http://dx.doi.org/10.1016/j.dam.2019.08.002
    • Vancouver

      Moura PFS, Wakabayashi Y. Strong intractability results for generalized convex recoloring problems [Internet]. Discrete Applied Mathematics. 2019 ;Available from: http://dx.doi.org/10.1016/j.dam.2019.08.002
  • In: Discrete Applied Mathematics. Unidade: IME

    Subjects: Teoria Dos Grafos, Combinatória

    PrivateOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FERREIRA, Carlos Eduardo; FRANCO, Álvaro Junio Pereira. A min–max relation in flowgraphs and some applications. Discrete Applied Mathematics, Amsterdam, Elsevier, v. 245, p. 65-76, 2018. Disponível em: < https://dx.doi.org/10.1016/j.dam.2017.04.038 > DOI: 10.1016/j.dam.2017.04.038.
    • APA

      Ferreira, C. E., & Franco, Á. J. P. (2018). A min–max relation in flowgraphs and some applications. Discrete Applied Mathematics, 245, 65-76. doi:10.1016/j.dam.2017.04.038
    • NLM

      Ferreira CE, Franco ÁJP. A min–max relation in flowgraphs and some applications [Internet]. Discrete Applied Mathematics. 2018 ; 245 65-76.Available from: https://dx.doi.org/10.1016/j.dam.2017.04.038
    • Vancouver

      Ferreira CE, Franco ÁJP. A min–max relation in flowgraphs and some applications [Internet]. Discrete Applied Mathematics. 2018 ; 245 65-76.Available from: https://dx.doi.org/10.1016/j.dam.2017.04.038
  • In: Discrete Applied Mathematics. Unidade: IME

    Subjects: Teoria Dos Grafos

    Versão AceitaOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BOTLER, Fábio Happ; MOTA, G. O; OSHIRO, Marcio Takashi Iura; WAKABAYASHI, Yoshiko. Decomposing highly connected graphs into paths of length five. Discrete Applied Mathematics, Amsterdam, v. 245, p. 128-138, 2018. Disponível em: < https://dx.doi.org/10.1016/j.dam.2016.08.001 > DOI: 10.1016/j.dam.2016.08.001.
    • APA

      Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2018). Decomposing highly connected graphs into paths of length five. Discrete Applied Mathematics, 245, 128-138. doi:10.1016/j.dam.2016.08.001
    • NLM

      Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly connected graphs into paths of length five [Internet]. Discrete Applied Mathematics. 2018 ; 245 128-138.Available from: https://dx.doi.org/10.1016/j.dam.2016.08.001
    • Vancouver

      Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly connected graphs into paths of length five [Internet]. Discrete Applied Mathematics. 2018 ; 245 128-138.Available from: https://dx.doi.org/10.1016/j.dam.2016.08.001
  • In: Discrete Applied Mathematics. Unidade: IME

    Subjects: Algoritmos Gráficos, Programação Matemática

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      RAVELO, Santiago Valdés; FERREIRA, Carlos Eduardo. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem. Discrete Applied Mathematics, Amsterdam, v. 228, p. 158-175, 2017. Disponível em: < https://dx.doi.org/10.1016/j.dam.2016.09.031 > DOI: 10.1016/j.dam.2016.09.031.
    • APA

      Ravelo, S. V., & Ferreira, C. E. (2017). A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem. Discrete Applied Mathematics, 228, 158-175. doi:10.1016/j.dam.2016.09.031
    • NLM

      Ravelo SV, Ferreira CE. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem [Internet]. Discrete Applied Mathematics. 2017 ; 228 158-175.Available from: https://dx.doi.org/10.1016/j.dam.2016.09.031
    • Vancouver

      Ravelo SV, Ferreira CE. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem [Internet]. Discrete Applied Mathematics. 2017 ; 228 158-175.Available from: https://dx.doi.org/10.1016/j.dam.2016.09.031
  • In: Discrete Applied Mathematics. Unidade: IME

    Subjects: Combinatória Probabilística, Combinatória, Ciência Da Computação

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FERNANDES, Cristina Gomes; KIWI, Marcos. Repetition-free longest common subsequence of random sequences. Discrete Applied Mathematics, Amsterdam, v. 210, p. 75-87, 2016. Disponível em: < http://dx.doi.org/10.1016/j.dam.2015.07.005 > DOI: 10.1016/j.dam.2015.07.005.
    • APA

      Fernandes, C. G., & Kiwi, M. (2016). Repetition-free longest common subsequence of random sequences. Discrete Applied Mathematics, 210, 75-87. doi:10.1016/j.dam.2015.07.005
    • NLM

      Fernandes CG, Kiwi M. Repetition-free longest common subsequence of random sequences [Internet]. Discrete Applied Mathematics. 2016 ; 210 75-87.Available from: http://dx.doi.org/10.1016/j.dam.2015.07.005
    • Vancouver

      Fernandes CG, Kiwi M. Repetition-free longest common subsequence of random sequences [Internet]. Discrete Applied Mathematics. 2016 ; 210 75-87.Available from: http://dx.doi.org/10.1016/j.dam.2015.07.005
  • In: Discrete Applied Mathematics. Conference title: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME

    Subjects: Otimização Combinatória, Teoria Dos Grafos, Algoritmos

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ACUÑA, Vicente; FERREIRA, Carlos Eduardo; FREIRE, Alexandre S; MORENO, Eduardo. Solving the maximum edge biclique packing problem on unbalanced bipartite graphs. Discrete Applied Mathematics, Amsterdam, v. 164, p. 2-12, 2014. Disponível em: < http://dx.doi.org/10.1016/j.dam.2011.09.019 > DOI: 10.1016/j.dam.2011.09.019.
    • APA

      Acuña, V., Ferreira, C. E., Freire, A. S., & Moreno, E. (2014). Solving the maximum edge biclique packing problem on unbalanced bipartite graphs. Discrete Applied Mathematics, 164, 2-12. doi:10.1016/j.dam.2011.09.019
    • NLM

      Acuña V, Ferreira CE, Freire AS, Moreno E. Solving the maximum edge biclique packing problem on unbalanced bipartite graphs [Internet]. Discrete Applied Mathematics. 2014 ; 164 2-12.Available from: http://dx.doi.org/10.1016/j.dam.2011.09.019
    • Vancouver

      Acuña V, Ferreira CE, Freire AS, Moreno E. Solving the maximum edge biclique packing problem on unbalanced bipartite graphs [Internet]. Discrete Applied Mathematics. 2014 ; 164 2-12.Available from: http://dx.doi.org/10.1016/j.dam.2011.09.019
  • In: Discrete Applied Mathematics. Unidades: EACH, IME

    Subjects: Otimização Combinatória, Algoritmos, Teoria Dos Grafos, Programação Inteira E Fluxos Em Rede

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LIMA, Karla Roberta Pereira Sampaio; WAKABAYASHI, Yoshiko. Convex recoloring of paths. Discrete Applied Mathematics, Amsterdam, v. 164, p. 450-459, 2014. Disponível em: < http://dx.doi.org/10.1016/j.dam.2013.02.034 > DOI: 10.1016/j.dam.2013.02.034.
    • APA

      Lima, K. R. P. S., & Wakabayashi, Y. (2014). Convex recoloring of paths. Discrete Applied Mathematics, 164, 450-459. doi:10.1016/j.dam.2013.02.034
    • NLM

      Lima KRPS, Wakabayashi Y. Convex recoloring of paths [Internet]. Discrete Applied Mathematics. 2014 ; 164 450-459.Available from: http://dx.doi.org/10.1016/j.dam.2013.02.034
    • Vancouver

      Lima KRPS, Wakabayashi Y. Convex recoloring of paths [Internet]. Discrete Applied Mathematics. 2014 ; 164 450-459.Available from: http://dx.doi.org/10.1016/j.dam.2013.02.034
  • In: Discrete Applied Mathematics. Conference title: Cologne-Twente Workshop on Graphs and Combinatorial Optimization - CTW. Unidade: IME

    Subjects: Teoria Dos Grafos, Combinatória, Otimização Combinatória, Algoritmos

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ALBANO, Alexandre Luiz Junqueira Hadura; LAGO, Alair Pereira do. A convexity upper bound for the number of maximal bicliques of a bipartite graph. Discrete Applied Mathematics[S.l: s.n.], 2014.Disponível em: DOI: 10.1016/j.dam.2013.01.014.
    • APA

      Albano, A. L. J. H., & Lago, A. P. do. (2014). A convexity upper bound for the number of maximal bicliques of a bipartite graph. Discrete Applied Mathematics. Amsterdam. doi:10.1016/j.dam.2013.01.014
    • NLM

      Albano ALJH, Lago AP do. A convexity upper bound for the number of maximal bicliques of a bipartite graph [Internet]. Discrete Applied Mathematics. 2014 ; 165 12-24.Available from: http://dx.doi.org/10.1016/j.dam.2013.01.014
    • Vancouver

      Albano ALJH, Lago AP do. A convexity upper bound for the number of maximal bicliques of a bipartite graph [Internet]. Discrete Applied Mathematics. 2014 ; 165 12-24.Available from: http://dx.doi.org/10.1016/j.dam.2013.01.014
  • In: Discrete Applied Mathematics. Conference title: Latin-American Algorithms, Graphs, and Optimization Symposium. Unidade: IME

    Subjects: Editorial

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FERREIRA, Carlos Eduardo; PROTTI, Fábio; SZWARCFITER, Jayme Luiz. V Latin-American algorithms, graphs, and optimization symposium — Gramado, Brazil, 2009. [Editorial]. Discrete Applied Mathematics[S.l: s.n.], 2012.Disponível em: DOI: 10.1016/j.dam.2012.08.014.
    • APA

      Ferreira, C. E., Protti, F., & Szwarcfiter, J. L. (2012). V Latin-American algorithms, graphs, and optimization symposium — Gramado, Brazil, 2009. [Editorial]. Discrete Applied Mathematics. Amsterdam: Elsevier. doi:10.1016/j.dam.2012.08.014
    • NLM

      Ferreira CE, Protti F, Szwarcfiter JL. V Latin-American algorithms, graphs, and optimization symposium — Gramado, Brazil, 2009. [Editorial] [Internet]. Discrete Applied Mathematics. 2012 ; 160( 18): 2499-2501.Available from: http://dx.doi.org/10.1016/j.dam.2012.08.014
    • Vancouver

      Ferreira CE, Protti F, Szwarcfiter JL. V Latin-American algorithms, graphs, and optimization symposium — Gramado, Brazil, 2009. [Editorial] [Internet]. Discrete Applied Mathematics. 2012 ; 160( 18): 2499-2501.Available from: http://dx.doi.org/10.1016/j.dam.2012.08.014
  • In: Discrete Applied Mathematics. Unidade: IME

    Subjects: Permutações, Combinatória

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      HOPPEN, Carlos; KOHAYAKAWA, Yoshiharu; SAMPAIO, Rudini Menezes. A note on permutation regularity. Discrete Applied Mathematics, Amsterdam, Elsevier, v. 160, n. 18, p. 2716-2727, 2012. Disponível em: < http://dx.doi.org/10.1016/j.dam.2011.06.002 > DOI: 10.1016/j.dam.2011.06.002.
    • APA

      Hoppen, C., Kohayakawa, Y., & Sampaio, R. M. (2012). A note on permutation regularity. Discrete Applied Mathematics, 160( 18), 2716-2727. 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.Available from: http://dx.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.Available from: http://dx.doi.org/10.1016/j.dam.2011.06.002
  • In: Discrete Applied Mathematics. Conference title: Latin American Algorithms, Graphs and Optimization Symposium - LAGOS 07. Unidade: IME

    Subjects: Algoritmos, Aproximação

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ADI, Said Sadique; BRAGA, Marilia D. V.; FERNANDES, Cristina Gomes; et al. Repetition-free longest common subsequence. Discrete Applied Mathematics[S.l: s.n.], 2010.Disponível em: DOI: 10.1016/j.dam.2009.04.023.
    • APA

      Adi, S. S., Braga, M. D. V., Fernandes, C. G., Ferreira, C. E., Martinez, F. H. V., Sagot, M. -F., et al. (2010). Repetition-free longest common subsequence. Discrete Applied Mathematics. Amsterdam. doi:10.1016/j.dam.2009.04.023
    • NLM

      Adi SS, Braga MDV, Fernandes CG, Ferreira CE, Martinez FHV, Sagot M-F, Stefanes MA, Tjandraatmadja C, Wakabayashi Y. Repetition-free longest common subsequence [Internet]. Discrete Applied Mathematics. 2010 ; 158( 12 Special Issue: Sp. Iss. SI): 1315-1324.Available from: https://doi.org/10.1016/j.dam.2009.04.023
    • Vancouver

      Adi SS, Braga MDV, Fernandes CG, Ferreira CE, Martinez FHV, Sagot M-F, Stefanes MA, Tjandraatmadja C, Wakabayashi Y. Repetition-free longest common subsequence [Internet]. Discrete Applied Mathematics. 2010 ; 158( 12 Special Issue: Sp. Iss. SI): 1315-1324.Available from: https://doi.org/10.1016/j.dam.2009.04.023
  • In: Discrete Applied Mathematics. Unidade: IME

    Subjects: Teoria Dos Grafos

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      CHATAIGNER, F.; MANIC, G.; WAKABAYASHI, Yoshiko; YUSTER, R. Approximation algorithms and hardness results for the clique packing problem. Discrete Applied Mathematics, Amsterdam, v. 157, n. 7, p. 1396-1406, 2009. Disponível em: < https://doi.org/10.1016/j.dam.2008.10.017 > DOI: 10.1016/j.dam.2008.10.017.
    • APA

      Chataigner, F., Manic, G., Wakabayashi, Y., & Yuster, R. (2009). Approximation algorithms and hardness results for the clique packing problem. Discrete Applied Mathematics, 157( 7), 1396-1406. doi:10.1016/j.dam.2008.10.017
    • NLM

      Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Discrete Applied Mathematics. 2009 ; 157( 7): 1396-1406.Available from: https://doi.org/10.1016/j.dam.2008.10.017
    • Vancouver

      Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Discrete Applied Mathematics. 2009 ; 157( 7): 1396-1406.Available from: https://doi.org/10.1016/j.dam.2008.10.017
  • In: Discrete Applied Mathematics. Unidade: IME

    Subjects: Teoria Dos Grafos

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FERNANDES, Cristina Gomes; LEE, Orlando; WAKABAYASHI, Yoshiko. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discrete Applied Mathematics, Amsterdam, n. 2, p. 272-279, 2009. Disponível em: < https://doi.org/10.1016/j.dam.2007.10.032 > DOI: 10.1016/j.dam.2007.10.032.
    • APA

      Fernandes, C. G., Lee, O., & Wakabayashi, Y. (2009). Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discrete Applied Mathematics, ( 2), 272-279. doi:10.1016/j.dam.2007.10.032
    • NLM

      Fernandes CG, Lee O, Wakabayashi Y. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width [Internet]. Discrete Applied Mathematics. 2009 ;( 2): 272-279.Available from: https://doi.org/10.1016/j.dam.2007.10.032
    • Vancouver

      Fernandes CG, Lee O, Wakabayashi Y. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width [Internet]. Discrete Applied Mathematics. 2009 ;( 2): 272-279.Available from: https://doi.org/10.1016/j.dam.2007.10.032
  • In: Discrete Applied Mathematics. Conference title: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME

    Subjects: Análise De Algoritmos

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ALVES, C. E. R.; CÁCERES, Edson Norberto; SONG, Siang Wun. An all-substrings common subsequence algorithm. Discrete Applied Mathematics[S.l: s.n.], 2008.Disponível em: DOI: 10.1016/j.dam.2007.05.056.
    • APA

      Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2008). An all-substrings common subsequence algorithm. Discrete Applied Mathematics. Amsterdam. doi:10.1016/j.dam.2007.05.056
    • NLM

      Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 1025-1035.Available from: https://doi.org/10.1016/j.dam.2007.05.056
    • Vancouver

      Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 1025-1035.Available from: https://doi.org/10.1016/j.dam.2007.05.056
  • In: Discrete Applied Mathematics. Unidade: IME

    Subjects: Gráficos

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FEOFILOFF, Paulo; FIGUEIREDO, Celina Miraglia Herrera de; WAKABAYASHI, Yoshiko. Special issue: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics GRACO 2005 - Preface. Discrete Applied Mathematics[S.l: s.n.], 2008.Disponível em: DOI: 10.1016/j.dam.2007.07.017.
    • APA

      Feofiloff, P., Figueiredo, C. M. H. de, & Wakabayashi, Y. (2008). Special issue: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics GRACO 2005 - Preface. Discrete Applied Mathematics. Amsterdam. doi:10.1016/j.dam.2007.07.017
    • NLM

      Feofiloff P, Figueiredo CMH de, Wakabayashi Y. Special issue: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics GRACO 2005 - Preface [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985-985.Available from: http://dx.doi.org/10.1016/j.dam.2007.07.017
    • Vancouver

      Feofiloff P, Figueiredo CMH de, Wakabayashi Y. Special issue: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics GRACO 2005 - Preface [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985-985.Available from: http://dx.doi.org/10.1016/j.dam.2007.07.017
  • In: Discrete Applied Mathematics. Conference title: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME

    Subjects: Combinatória, Teoria Dos Grafos

    Online source accessHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FEOFILOFF, Paulo; FIGUEIREDO, Celina Miraglia Herrera de; WAKABAYASHI, Yoshiko. GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics. Discrete Applied Mathematics[S.l: s.n.], 2008.Disponível em: .
    • APA

      Feofiloff, P., Figueiredo, C. M. H. de, & Wakabayashi, Y. (2008). GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics. Discrete Applied Mathematics. Amsterdam: Elsevier. Recuperado de https://www.sciencedirect.com/journal/discrete-applied-mathematics/vol/156/issue/7
    • NLM

      Feofiloff P, Figueiredo CMH de, Wakabayashi Y. GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985-1180.Available from: https://www.sciencedirect.com/journal/discrete-applied-mathematics/vol/156/issue/7
    • Vancouver

      Feofiloff P, Figueiredo CMH de, Wakabayashi Y. GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985-1180.Available from: https://www.sciencedirect.com/journal/discrete-applied-mathematics/vol/156/issue/7
  • In: Discrete Applied Mathematics. Conference title: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME

    Subjects: Combinatória, Teoria Dos Grafos

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FEOFILOFF, Paulo; FIGUEIREDO, Celina Miraglia Herrera de; WAKABAYASHI, Yoshiko. Proceedings of GRACCO 2005 - Braziliam Symposium on Graphs, Algoritms, and Combintatorics, 2, Angra dos Reis, RJ, Brasil. [Preface]. Discrete Applied Mathematics[S.l: s.n.], 2008.Disponível em: DOI: 10.1016/j.dam.2007.07.017.
    • APA

      Feofiloff, P., Figueiredo, C. M. H. de, & Wakabayashi, Y. (2008). Proceedings of GRACCO 2005 - Braziliam Symposium on Graphs, Algoritms, and Combintatorics, 2, Angra dos Reis, RJ, Brasil. [Preface]. Discrete Applied Mathematics. Amsterdam: Elsevier. doi:10.1016/j.dam.2007.07.017
    • NLM

      Feofiloff P, Figueiredo CMH de, Wakabayashi Y. Proceedings of GRACCO 2005 - Braziliam Symposium on Graphs, Algoritms, and Combintatorics, 2, Angra dos Reis, RJ, Brasil. [Preface] [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985.Available from: https://doi.org/10.1016/j.dam.2007.07.017
    • Vancouver

      Feofiloff P, Figueiredo CMH de, Wakabayashi Y. Proceedings of GRACCO 2005 - Braziliam Symposium on Graphs, Algoritms, and Combintatorics, 2, Angra dos Reis, RJ, Brasil. [Preface] [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985.Available from: https://doi.org/10.1016/j.dam.2007.07.017
  • In: Discrete Applied Mathematics. Unidade: IME

    Subjects: Otimização Combinatória

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FERREIRA, Carlos Eduardo; OLIVEIRA FILHO, Fernando Mário de. Some formulations for the group steiner tree problem. Discrete Applied Mathematics, Amsterdam, Elsevier, v. 154, n. 13, p. 1877-1884, 2006. Disponível em: < https://doi.org/10.1016/j.dam.2006.03.028 > DOI: 10.1016/j.dam.2006.03.028.
    • APA

      Ferreira, C. E., & Oliveira Filho, F. M. de. (2006). Some formulations for the group steiner tree problem. Discrete Applied Mathematics, 154( 13), 1877-1884. doi:10.1016/j.dam.2006.03.028
    • NLM

      Ferreira CE, Oliveira Filho FM de. Some formulations for the group steiner tree problem [Internet]. Discrete Applied Mathematics. 2006 ; 154( 13): 1877-1884.Available from: https://doi.org/10.1016/j.dam.2006.03.028
    • Vancouver

      Ferreira CE, Oliveira Filho FM de. Some formulations for the group steiner tree problem [Internet]. Discrete Applied Mathematics. 2006 ; 154( 13): 1877-1884.Available from: https://doi.org/10.1016/j.dam.2006.03.028
  • In: Discrete Applied Mathematics. Unidade: EACH

    Subjects: Teoria Dos Grafos

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FARIA, Luerbio; FIGUEIREDO, Celina Miraglia Herrera de; GRAVIER, Sylvain; MENDONÇA NETO, Candido Ferreira Xavier de; STOLFI, Jorge. On maximum planar induced subgraphs. Discrete Applied Mathematics, Amsterdam, v. 154, n. 13, p. 1774-1782, 2006. Disponível em: < http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6TYW-4JYKP5P-1-F&_cdi=5629&_user=5674931&_pii=S0166218X06001338&_orig=browse&_coverDate=08%2F15%2F2006&_sk=998459986&view=c&wchp=dGLbVzW-zSkzk&_valck=1&md5=624865934d2be2ac1ccdc8bfde8d75c4&ie=/sdarticle.pdf > DOI: 10.1016/j.dam.2006.03.021.
    • APA

      Faria, L., Figueiredo, C. M. H. de, Gravier, S., Mendonça Neto, C. F. X. de, & Stolfi, J. (2006). On maximum planar induced subgraphs. Discrete Applied Mathematics, 154( 13), 1774-1782. doi:10.1016/j.dam.2006.03.021
    • NLM

      Faria L, Figueiredo CMH de, Gravier S, Mendonça Neto CFX de, Stolfi J. On maximum planar induced subgraphs [Internet]. Discrete Applied Mathematics. 2006 ; 154( 13): 1774-1782.Available from: http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6TYW-4JYKP5P-1-F&_cdi=5629&_user=5674931&_pii=S0166218X06001338&_orig=browse&_coverDate=08%2F15%2F2006&_sk=998459986&view=c&wchp=dGLbVzW-zSkzk&_valck=1&md5=624865934d2be2ac1ccdc8bfde8d75c4&ie=/sdarticle.pdf
    • Vancouver

      Faria L, Figueiredo CMH de, Gravier S, Mendonça Neto CFX de, Stolfi J. On maximum planar induced subgraphs [Internet]. Discrete Applied Mathematics. 2006 ; 154( 13): 1774-1782.Available from: http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6TYW-4JYKP5P-1-F&_cdi=5629&_user=5674931&_pii=S0166218X06001338&_orig=browse&_coverDate=08%2F15%2F2006&_sk=998459986&view=c&wchp=dGLbVzW-zSkzk&_valck=1&md5=624865934d2be2ac1ccdc8bfde8d75c4&ie=/sdarticle.pdf
  • In: Discrete Applied Mathematics. Unidade: IME

    Subjects: Algoritmos

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      REED, Bruce A.; SONG, Siang Wun; SZWARCFITER, Jayme Luiz. Preface: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Discrete Applied Mathematics[S.l.], v. 141, n. 1-3, p. 1, 2004. Disponível em: < https://doi.org/10.1016/S0166-218X(03)00362-7 > DOI: 10.1016/S0166-218X(03)00362-7.
    • APA

      Reed, B. A., Song, S. W., & Szwarcfiter, J. L. (2004). Preface: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Discrete Applied Mathematics, 141( 1-3), 1. doi:10.1016/S0166-218X(03)00362-7
    • NLM

      Reed BA, Song SW, Szwarcfiter JL. Preface: Brazilian Symposium on Graphs, Algorithms and Combinatorics [Internet]. Discrete Applied Mathematics. 2004 ; 141( 1-3): 1.Available from: https://doi.org/10.1016/S0166-218X(03)00362-7
    • Vancouver

      Reed BA, Song SW, Szwarcfiter JL. Preface: Brazilian Symposium on Graphs, Algorithms and Combinatorics [Internet]. Discrete Applied Mathematics. 2004 ; 141( 1-3): 1.Available from: https://doi.org/10.1016/S0166-218X(03)00362-7


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