Menu

Filtros : "Springer" "Financiamento PRONEX" Removidos: "BARBOZA, MIGUEL JUSTINO RIBEIRO" "COHEN, RENATO" "Colômbia" Limpar

Filtros

Refine with date range

  • 1

1 - 12 (12 records)

  • Trabalho de evento

    A polyhedral investigation of the LCS problem and a repetition-free variant (2008)

    Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Tjandraatmadja, Christian ; Wakabayashi, Yoshiko

    Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME

    Subjects: PROGRAMAÇÃO DINÂMICA, PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE

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

    • ABNT

      FERNANDES, Cristina Gomes et al. A polyhedral investigation of the LCS problem and a repetition-free variant. 2008, Anais.. Berlin: Springer, 2008. Disponível em: https://doi.org/10.1007/978-3-540-78773-0_29. Acesso em: 04 set. 2024.

    • APA

      Fernandes, C. G., Ferreira, C. E., Tjandraatmadja, C., & Wakabayashi, Y. (2008). A polyhedral investigation of the LCS problem and a repetition-free variant. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-78773-0_29

    • NLM

      Fernandes CG, Ferreira CE, Tjandraatmadja C, Wakabayashi Y. A polyhedral investigation of the LCS problem and a repetition-free variant [Internet]. Proceedings. 2008 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/978-3-540-78773-0_29

    • Vancouver

      Fernandes CG, Ferreira CE, Tjandraatmadja C, Wakabayashi Y. A polyhedral investigation of the LCS problem and a repetition-free variant [Internet]. Proceedings. 2008 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/978-3-540-78773-0_29

  • Trabalho de evento

    Packing problems with orthogonal rotations (2004)

    Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko

    Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME

    Subjects: ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA

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

    • ABNT

      MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Packing problems with orthogonal rotations. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-24698-5_40. Acesso em: 04 set. 2024.

    • APA

      Miyazawa, F. K., & Wakabayashi, Y. (2004). Packing problems with orthogonal rotations. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24698-5_40

    • NLM

      Miyazawa FK, Wakabayashi Y. Packing problems with orthogonal rotations [Internet]. Proceedings. 2004 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_40

    • Vancouver

      Miyazawa FK, Wakabayashi Y. Packing problems with orthogonal rotations [Internet]. Proceedings. 2004 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_40

  • Trabalho de evento

    Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems (2004)

    Cintra, Glauber Ferreira ; Wakabayashi, Yoshiko

    Source: Proceedings. Conference titles: International Workshop on Experimental and Efficient Algorithms - WEA. Unidade: IME

    Subjects: PROGRAMAÇÃO DINÂMICA, PROGRAMAÇÃO LINEAR

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

    • ABNT

      CINTRA, Glauber Ferreira e WAKABAYASHI, Yoshiko. Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-24838-5_13. Acesso em: 04 set. 2024.

    • APA

      Cintra, G. F., & Wakabayashi, Y. (2004). Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24838-5_13

    • NLM

      Cintra GF, Wakabayashi Y. Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems [Internet]. Proceedings. 2004 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_13

    • Vancouver

      Cintra GF, Wakabayashi Y. Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems [Internet]. Proceedings. 2004 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_13

  • Trabalho de evento-resumo

    Advances in the regularity method (2004)

    Kohayakawa, Yoshiharu

    Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME

    Assunto: TEORIA DA INFORMAÇÃO

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

    • ABNT

      KOHAYAKAWA, Yoshiharu. Advances in the regularity method. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-24698-5_2. Acesso em: 04 set. 2024.

    • APA

      Kohayakawa, Y. (2004). Advances in the regularity method. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24698-5_2

    • NLM

      Kohayakawa Y. Advances in the regularity method [Internet]. Proceedings. 2004 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_2

    • Vancouver

      Kohayakawa Y. Advances in the regularity method [Internet]. Proceedings. 2004 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_2

  • Parte de monografia/livro

    Pattern inference under many guises (2003)

    Sagot, Marie France; Wakabayashi, Yoshiko

    Source: Recent advances in algorithms and combinatorics. Unidade: IME

    Assunto: ANÁLISE DE ALGORITMOS

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

    • ABNT

      SAGOT, Marie France e WAKABAYASHI, Yoshiko. Pattern inference under many guises. Recent advances in algorithms and combinatorics. Tradução . New York: Springer, 2003. . Disponível em: https://doi.org/10.1007/0-387-22444-0_8. Acesso em: 04 set. 2024.

    • APA

      Sagot, M. F., & Wakabayashi, Y. (2003). Pattern inference under many guises. In Recent advances in algorithms and combinatorics. New York: Springer. doi:10.1007/0-387-22444-0_8

    • NLM

      Sagot MF, Wakabayashi Y. Pattern inference under many guises [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 set. 04 ] Available from: https://doi.org/10.1007/0-387-22444-0_8

    • Vancouver

      Sagot MF, Wakabayashi Y. Pattern inference under many guises [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 set. 04 ] Available from: https://doi.org/10.1007/0-387-22444-0_8

  • Trabalho de evento

    Searching in Random partially ordered sets (2002)

    Carmo, Renato José da Silva; Donadelli Junior, Jair; Kohayakawa, Yoshiharu ; Laber, Eduardo Sany

    Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

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

    • ABNT

      CARMO, Renato José da Silva et al. Searching in Random partially ordered sets. 2002, Anais.. Berlin: Springer, 2002. Disponível em: https://doi.org/10.1007/3-540-45995-2_27. Acesso em: 04 set. 2024.

    • APA

      Carmo, R. J. da S., Donadelli Junior, J., Kohayakawa, Y., & Laber, E. S. (2002). Searching in Random partially ordered sets. In Proceedings. Berlin: Springer. doi:10.1007/3-540-45995-2_27

    • NLM

      Carmo RJ da S, Donadelli Junior J, Kohayakawa Y, Laber ES. Searching in Random partially ordered sets [Internet]. Proceedings. 2002 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/3-540-45995-2_27

    • Vancouver

      Carmo RJ da S, Donadelli Junior J, Kohayakawa Y, Laber ES. Searching in Random partially ordered sets [Internet]. Proceedings. 2002 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/3-540-45995-2_27

  • Trabalho de evento

    A coarse-grained parallel algorithm for maximal cliques in circle graphs (2001)

    Cáceres, Edson Norberto ; Song, Siang Wun; Szwarcfiter, Jayme Luiz

    Source: Proceedings. Conference titles: International Conference on Computational Science - ICCS. Unidade: IME

    Assunto: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES

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

    • ABNT

      CÁCERES, Edson Norberto e SONG, Siang Wun e SZWARCFITER, Jayme Luiz. A coarse-grained parallel algorithm for maximal cliques in circle graphs. 2001, Anais.. Berlin: Springer, 2001. Disponível em: https://doi.org/10.1007/3-540-45718-6_69. Acesso em: 04 set. 2024.

    • APA

      Cáceres, E. N., Song, S. W., & Szwarcfiter, J. L. (2001). A coarse-grained parallel algorithm for maximal cliques in circle graphs. In Proceedings. Berlin: Springer. doi:10.1007/3-540-45718-6_69

    • NLM

      Cáceres EN, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for maximal cliques in circle graphs [Internet]. Proceedings. 2001 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/3-540-45718-6_69

    • Vancouver

      Cáceres EN, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for maximal cliques in circle graphs [Internet]. Proceedings. 2001 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/3-540-45718-6_69

  • Trabalho de evento

    The UPS problem (2001)

    Fernandes, Cristina Gomes ; Nierho, Till

    Source: Proceedings. Conference titles: Annual Symposium on Theoretical Aspects of Computer Science - STACS. Unidade: IME

    Assunto: ALGORITMOS DE APROXIMAÇÃO

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

    • ABNT

      FERNANDES, Cristina Gomes e NIERHO, Till. The UPS problem. 2001, Anais.. Berlin: Springer, 2001. Disponível em: https://doi.org/10.1007/3-540-44693-1_21. Acesso em: 04 set. 2024.

    • APA

      Fernandes, C. G., & Nierho, T. (2001). The UPS problem. In Proceedings. Berlin: Springer. doi:10.1007/3-540-44693-1_21

    • NLM

      Fernandes CG, Nierho T. The UPS problem [Internet]. Proceedings. 2001 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/3-540-44693-1_21

    • Vancouver

      Fernandes CG, Nierho T. The UPS problem [Internet]. Proceedings. 2001 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/3-540-44693-1_21

  • Trabalho de evento

    Cube packing (2000)

    Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko

    Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

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

    • ABNT

      MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Cube packing. 2000, Anais.. Berlin: Springer, 2000. Disponível em: https://doi.org/10.1007/10719839_6. Acesso em: 04 set. 2024.

    • APA

      Miyazawa, F. K., & Wakabayashi, Y. (2000). Cube packing. In Proceedings. Berlin: Springer. doi:10.1007/10719839_6

    • NLM

      Miyazawa FK, Wakabayashi Y. Cube packing [Internet]. Proceedings. 2000 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/10719839_6

    • Vancouver

      Miyazawa FK, Wakabayashi Y. Cube packing [Internet]. Proceedings. 2000 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/10719839_6

  • Trabalho de evento

    Finding skew partitions efficiently (2000)

    Figueiredo, Celina Miraglia Herrera de; Klein, Sulamita; Kohayakawa, Yoshiharu ; Reed, Bruce A

    Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

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

    • ABNT

      FIGUEIREDO, Celina Miraglia Herrera de et al. Finding skew partitions efficiently. 2000, Anais.. Berlin: Springer, 2000. Disponível em: https://doi.org/10.1007/10719839_18. Acesso em: 04 set. 2024.

    • APA

      Figueiredo, C. M. H. de, Klein, S., Kohayakawa, Y., & Reed, B. A. (2000). Finding skew partitions efficiently. In Proceedings. Berlin: Springer. doi:10.1007/10719839_18

    • NLM

      Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Proceedings. 2000 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/10719839_18

    • Vancouver

      Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Proceedings. 2000 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/10719839_18

  • Trabalho de evento

    Circuit covers in series-parallel mixed graphs (1998)

    Lee, Orlando; Wakabayashi, Yoshiko

    Source: Proceedings. Conference titles: Latin Symposium on Theoretical Informatics - LATIN. 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

      LEE, Orlando e WAKABAYASHI, Yoshiko. Circuit covers in series-parallel mixed graphs. 1998, Anais.. Berlin: Springer, 1998. Disponível em: https://doi.org/10.1007/BFb0054324. Acesso em: 04 set. 2024.

    • APA

      Lee, O., & Wakabayashi, Y. (1998). Circuit covers in series-parallel mixed graphs. In Proceedings. Berlin: Springer. doi:10.1007/BFb0054324

    • NLM

      Lee O, Wakabayashi Y. Circuit covers in series-parallel mixed graphs [Internet]. Proceedings. 1998 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/BFb0054324

    • Vancouver

      Lee O, Wakabayashi Y. Circuit covers in series-parallel mixed graphs [Internet]. Proceedings. 1998 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/BFb0054324

  • Trabalho de evento

    Multicuts in unweighted graphs with bounded degree and bounded tree-width (1998)

    Calinescu, Gruia ; Fernandes, Cristina Gomes ; Reed, Bruce

    Source: Proceedings. Conference titles: Integer Programming and Combinatorial Optimization - IPCO. Unidade: IME

    Subjects: ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS

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

    • ABNT

      CALINESCU, Gruia e FERNANDES, Cristina Gomes e REED, Bruce. Multicuts in unweighted graphs with bounded degree and bounded tree-width. 1998, Anais.. Berlin: Springer, 1998. Disponível em: https://doi.org/10.1007/3-540-69346-7_11. Acesso em: 04 set. 2024.

    • APA

      Calinescu, G., Fernandes, C. G., & Reed, B. (1998). Multicuts in unweighted graphs with bounded degree and bounded tree-width. In Proceedings. Berlin: Springer. doi:10.1007/3-540-69346-7_11

    • NLM

      Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/3-540-69346-7_11

    • Vancouver

      Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2024 set. 04 ] Available from: https://doi.org/10.1007/3-540-69346-7_11
  • 1

1 - 12 (12 records)

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