ReP USP - Resultado da busca

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
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: 23 nov. 2025.
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 2025 nov. 23 ] 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 2025 nov. 23 ] Available from: https://doi.org/10.1007/978-3-540-78773-0_29
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
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: 23 nov. 2025.
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 2025 nov. 23 ] 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 2025 nov. 23 ] 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
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: 23 nov. 2025.
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 2025 nov. 23 ] 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 2025 nov. 23 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_2
Trabalho de evento-resumo
An optimal algorithm for checking regularity: (extended abstract) (2002)
Kohayakawa, Yoshiharu ; Rödl, Vojtěch; Thoma, Luboš
Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e RÖDL, Vojtěch e THOMA, Luboš. An optimal algorithm for checking regularity: (extended abstract). 2002, Anais.. Philadelphia: SIAM, 2002. Disponível em: https://dl.acm.org/doi/pdf/10.5555/545381.545418. Acesso em: 23 nov. 2025.
APA
Kohayakawa, Y., Rödl, V., & Thoma, L. (2002). An optimal algorithm for checking regularity: (extended abstract). In Proceedings. Philadelphia: SIAM. Recuperado de https://dl.acm.org/doi/pdf/10.5555/545381.545418
NLM
Kohayakawa Y, Rödl V, Thoma L. An optimal algorithm for checking regularity: (extended abstract) [Internet]. Proceedings. 2002 ;[citado 2025 nov. 23 ] Available from: https://dl.acm.org/doi/pdf/10.5555/545381.545418
Vancouver
Kohayakawa Y, Rödl V, Thoma L. An optimal algorithm for checking regularity: (extended abstract) [Internet]. Proceedings. 2002 ;[citado 2025 nov. 23 ] Available from: https://dl.acm.org/doi/pdf/10.5555/545381.545418
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
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: 23 nov. 2025.
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 2025 nov. 23 ] Available from: https://doi.org/10.1007/3-540-44693-1_21
Vancouver
Fernandes CG, Nierho T. The UPS problem [Internet]. Proceedings. 2001 ;[citado 2025 nov. 23 ] Available from: https://doi.org/10.1007/3-540-44693-1_21
Trabalho de evento
A new bound for the Carathéodory rank of the bases of a matroid (2000)
Pina Júnior, José Coelho de ; Soares, Jose Augusto Ramos
Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Subjects: TEORIA DOS GRAFOS, PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PINA JÚNIOR, José Coelho de e SOARES, Jose Augusto Ramos. A new bound for the Carathéodory rank of the bases of a matroid. 2000, Anais.. New York: ACM, 2000. Disponível em: https://dl.acm.org/doi/10.5555/338219.338662. Acesso em: 23 nov. 2025.
APA
Pina Júnior, J. C. de, & Soares, J. A. R. (2000). A new bound for the Carathéodory rank of the bases of a matroid. In Proceedings. New York: ACM. doi:10.5555/338219.338662
NLM
Pina Júnior JC de, Soares JAR. A new bound for the Carathéodory rank of the bases of a matroid [Internet]. Proceedings. 2000 ;[citado 2025 nov. 23 ] Available from: https://dl.acm.org/doi/10.5555/338219.338662
Vancouver
Pina Júnior JC de, Soares JAR. A new bound for the Carathéodory rank of the bases of a matroid [Internet]. Proceedings. 2000 ;[citado 2025 nov. 23 ] Available from: https://dl.acm.org/doi/10.5555/338219.338662
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
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: 23 nov. 2025.
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 2025 nov. 23 ] Available from: https://doi.org/10.1007/BFb0054324
Vancouver
Lee O, Wakabayashi Y. Circuit covers in series-parallel mixed graphs [Internet]. Proceedings. 1998 ;[citado 2025 nov. 23 ] 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
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: 23 nov. 2025.
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 2025 nov. 23 ] 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 2025 nov. 23 ] Available from: https://doi.org/10.1007/3-540-69346-7_11

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Conference titles

Funding Agencies

Non normalized affiliation