ReP USP - Resultado da busca

Artigo de periodico
A notion of total dual integrality for convex, semidefinite, and extended formulations (2020)
Silva, Marcel Kenji de Carli ; Tunçel, Levent
Source: SIAM Journal on Discrete Mathematics. Unidade: IME
Subjects: PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE, PROGRAMAÇÃO CONVEXA, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Marcel Kenji de Carli e TUNÇEL, Levent. A notion of total dual integrality for convex, semidefinite, and extended formulations. SIAM Journal on Discrete Mathematics, v. 34, n. 1, p. 470-496, 2020Tradução . . Disponível em: https://doi.org/10.1137/18M1169710. Acesso em: 04 out. 2024.
APA
Silva, M. K. de C., & Tunçel, L. (2020). A notion of total dual integrality for convex, semidefinite, and extended formulations. SIAM Journal on Discrete Mathematics, 34( 1), 470-496. doi:10.1137/18M1169710
NLM
Silva MK de C, Tunçel L. A notion of total dual integrality for convex, semidefinite, and extended formulations [Internet]. SIAM Journal on Discrete Mathematics. 2020 ; 34( 1): 470-496.[citado 2024 out. 04 ] Available from: https://doi.org/10.1137/18M1169710
Vancouver
Silva MK de C, Tunçel L. A notion of total dual integrality for convex, semidefinite, and extended formulations [Internet]. SIAM Journal on Discrete Mathematics. 2020 ; 34( 1): 470-496.[citado 2024 out. 04 ] Available from: https://doi.org/10.1137/18M1169710
Artigo de periodico
Primitive points in rational polygons (2020)
Bárány, Imre ; Martin, Greg ; Naslund, Eric ; Robins, Sinai
Source: Canadian Mathematical Bulletin. Unidade: IME
Subjects: GEOMETRIA CONVEXA, RETICULADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BÁRÁNY, Imre et al. Primitive points in rational polygons. Canadian Mathematical Bulletin, v. 63, n. 4, p. 850-870, 2020Tradução . . Disponível em: https://doi.org/10.4153/S0008439520000090. Acesso em: 04 out. 2024.
APA
Bárány, I., Martin, G., Naslund, E., & Robins, S. (2020). Primitive points in rational polygons. Canadian Mathematical Bulletin, 63( 4), 850-870. doi:10.4153/S0008439520000090
NLM
Bárány I, Martin G, Naslund E, Robins S. Primitive points in rational polygons [Internet]. Canadian Mathematical Bulletin. 2020 ; 63( 4): 850-870.[citado 2024 out. 04 ] Available from: https://doi.org/10.4153/S0008439520000090
Vancouver
Bárány I, Martin G, Naslund E, Robins S. Primitive points in rational polygons [Internet]. Canadian Mathematical Bulletin. 2020 ; 63( 4): 850-870.[citado 2024 out. 04 ] Available from: https://doi.org/10.4153/S0008439520000090
Artigo de periodico
Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP (2019)
Silva, Marcel Kenji de Carli ; Tunçel, Levent
Source: SIAM Journal on Optimization. Unidade: IME
Assunto: PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Marcel Kenji de Carli e TUNÇEL, Levent. Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP. SIAM Journal on Optimization, v. 29, n. 4, p. 2650-2676, 2019Tradução . . Disponível em: https://doi.org/10.1137/18M1193657. Acesso em: 04 out. 2024.
APA
Silva, M. K. de C., & Tunçel, L. (2019). Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP. SIAM Journal on Optimization, 29( 4), 2650-2676. doi:10.1137/18M1193657
NLM
Silva MK de C, Tunçel L. Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP [Internet]. SIAM Journal on Optimization. 2019 ; 29( 4): 2650-2676.[citado 2024 out. 04 ] Available from: https://doi.org/10.1137/18M1193657
Vancouver
Silva MK de C, Tunçel L. Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP [Internet]. SIAM Journal on Optimization. 2019 ; 29( 4): 2650-2676.[citado 2024 out. 04 ] Available from: https://doi.org/10.1137/18M1193657
Trabalho de evento
Parallel dynamic programing for solving the string editing problem on a CGM/BSP (2002)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Dehne, Frank; Song, Siang Wun
Source: Proceedings. Conference titles: ACM Symposium on Parallelism in Algorithms and Architectures - SPAA. Unidade: IME
Subjects: ALGORITMOS, PROGRAMAÇÃO DINÂMICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues et al. Parallel dynamic programing for solving the string editing problem on a CGM/BSP. 2002, Anais.. New York: ACM, 2002. Disponível em: https://doi.org/10.1145/564870.564916. Acesso em: 04 out. 2024.
APA
Alves, C. E. R., Cáceres, E. N., Dehne, F., & Song, S. W. (2002). Parallel dynamic programing for solving the string editing problem on a CGM/BSP. In Proceedings. New York: ACM. doi:10.1145/564870.564916
NLM
Alves CER, Cáceres EN, Dehne F, Song SW. Parallel dynamic programing for solving the string editing problem on a CGM/BSP [Internet]. Proceedings. 2002 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1145/564870.564916
Vancouver
Alves CER, Cáceres EN, Dehne F, Song SW. Parallel dynamic programing for solving the string editing problem on a CGM/BSP [Internet]. Proceedings. 2002 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1145/564870.564916
Artigo de periodico
Packing and covering triangles in tripartite graphs (1998)
Haxell, Penny E.; Kohayakawa, Yoshiharu
Source: Graphs and Combinatorics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAXELL, Penny E. e KOHAYAKAWA, Yoshiharu. Packing and covering triangles in tripartite graphs. Graphs and Combinatorics, v. 14, n. 1, p. 1-10, 1998Tradução . . Disponível em: https://doi.org/10.1007/s003730050010. Acesso em: 04 out. 2024.
APA
Haxell, P. E., & Kohayakawa, Y. (1998). Packing and covering triangles in tripartite graphs. Graphs and Combinatorics, 14( 1), 1-10. doi:10.1007/s003730050010
NLM
Haxell PE, Kohayakawa Y. Packing and covering triangles in tripartite graphs [Internet]. Graphs and Combinatorics. 1998 ; 14( 1): 1-10.[citado 2024 out. 04 ] Available from: https://doi.org/10.1007/s003730050010
Vancouver
Haxell PE, Kohayakawa Y. Packing and covering triangles in tripartite graphs [Internet]. Graphs and Combinatorics. 1998 ; 14( 1): 1-10.[citado 2024 out. 04 ] Available from: https://doi.org/10.1007/s003730050010
Artigo de periodico
Turán's extremal problem in random graphs: forbidding odd cycles (1996)
Haxell, Penny E; Kohayakawa, Yoshiharu ; Luczak, Tomasz
Source: Combinatorica. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAXELL, Penny E e KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz. Turán's extremal problem in random graphs: forbidding odd cycles. Combinatorica, v. 16, n. 1, p. 107-122, 1996Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF01300129. Acesso em: 04 out. 2024.
APA
Haxell, P. E., Kohayakawa, Y., & Luczak, T. (1996). Turán's extremal problem in random graphs: forbidding odd cycles. Combinatorica, 16( 1), 107-122. doi:10.1007%2FBF01300129
NLM
Haxell PE, Kohayakawa Y, Luczak T. Turán's extremal problem in random graphs: forbidding odd cycles [Internet]. Combinatorica. 1996 ; 16( 1): 107-122.[citado 2024 out. 04 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF01300129
Vancouver
Haxell PE, Kohayakawa Y, Luczak T. Turán's extremal problem in random graphs: forbidding odd cycles [Internet]. Combinatorica. 1996 ; 16( 1): 107-122.[citado 2024 out. 04 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF01300129
Artigo de periodico
Partitioning by monochromatic trees (1996)
Haxell, Penny E; Kohayakawa, Yoshiharu
Source: Journal of Combinatorial Theory, Series B. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAXELL, Penny E e KOHAYAKAWA, Yoshiharu. Partitioning by monochromatic trees. Journal of Combinatorial Theory, Series B, v. 68, n. 2, p. 218-222, 1996Tradução . . Disponível em: https://doi.org/10.1006/jctb.1996.0065. Acesso em: 04 out. 2024.
APA
Haxell, P. E., & Kohayakawa, Y. (1996). Partitioning by monochromatic trees. Journal of Combinatorial Theory, Series B, 68( 2), 218-222. doi:10.1006/jctb.1996.0065
NLM
Haxell PE, Kohayakawa Y. Partitioning by monochromatic trees [Internet]. Journal of Combinatorial Theory, Series B. 1996 ; 68( 2): 218-222.[citado 2024 out. 04 ] Available from: https://doi.org/10.1006/jctb.1996.0065
Vancouver
Haxell PE, Kohayakawa Y. Partitioning by monochromatic trees [Internet]. Journal of Combinatorial Theory, Series B. 1996 ; 68( 2): 218-222.[citado 2024 out. 04 ] Available from: https://doi.org/10.1006/jctb.1996.0065
Artigo de periodico
On an anti-Ramsey property of Ramanujan graphs (1995)
Haxell, Penny E; Kohayakawa, Yoshiharu
Source: Random Structures and Algorithms. Unidade: IME
Subjects: COMBINATORIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAXELL, Penny E e KOHAYAKAWA, Yoshiharu. On an anti-Ramsey property of Ramanujan graphs. Random Structures and Algorithms, v. 6, n. 4, p. 417-431, 1995Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1002/rsa.3240060405. Acesso em: 04 out. 2024.
APA
Haxell, P. E., & Kohayakawa, Y. (1995). On an anti-Ramsey property of Ramanujan graphs. Random Structures and Algorithms, 6( 4), 417-431. doi:10.1002/rsa.3240060405
NLM
Haxell PE, Kohayakawa Y. On an anti-Ramsey property of Ramanujan graphs [Internet]. Random Structures and Algorithms. 1995 ; 6( 4): 417-431.[citado 2024 out. 04 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1002/rsa.3240060405
Vancouver
Haxell PE, Kohayakawa Y. On an anti-Ramsey property of Ramanujan graphs [Internet]. Random Structures and Algorithms. 1995 ; 6( 4): 417-431.[citado 2024 out. 04 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1002/rsa.3240060405
Artigo de periodico
Turán's extremal problem in random graphs: forbidding even cycles (1995)
Haxell, Penny E; Kohayakawa, Yoshiharu ; Luczak, Tomasz
Source: Journal of Combinatorial Theory, Series B. Unidade: IME
Subjects: COMBINATORIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAXELL, Penny E e KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz. Turán's extremal problem in random graphs: forbidding even cycles. Journal of Combinatorial Theory, Series B, 1995Tradução . . Disponível em: https://doi.org/10.1006/jctb.1995.1035. Acesso em: 04 out. 2024.
APA
Haxell, P. E., Kohayakawa, Y., & Luczak, T. (1995). Turán's extremal problem in random graphs: forbidding even cycles. Journal of Combinatorial Theory, Series B. doi:10.1006/jctb.1995.1035
NLM
Haxell PE, Kohayakawa Y, Luczak T. Turán's extremal problem in random graphs: forbidding even cycles [Internet]. Journal of Combinatorial Theory, Series B. 1995 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1006/jctb.1995.1035
Vancouver
Haxell PE, Kohayakawa Y, Luczak T. Turán's extremal problem in random graphs: forbidding even cycles [Internet]. Journal of Combinatorial Theory, Series B. 1995 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1006/jctb.1995.1035

USP Schools

ReP

Filtros

Authors

Date published

Subjects

Source title

Funding Agencies

Non normalized affiliation