ReP USP - Resultado da busca

Trabalho de evento
On the complexity of solving or approximating convex recoloring problems (2013)
Campêlo, Manoel B ; Huiban, Cristiana Gomes ; Sampaio, Rudini Menezes ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: International Computing and Combinatorics Conference - COCOON. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPÊLO, Manoel B et al. On the complexity of solving or approximating convex recoloring problems. 2013, Anais.. Berlin: Springer, 2013. Disponível em: https://doi.org/10.1007/978-3-642-38768-5_54. Acesso em: 05 nov. 2024.
APA
Campêlo, M. B., Huiban, C. G., Sampaio, R. M., & Wakabayashi, Y. (2013). On the complexity of solving or approximating convex recoloring problems. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-38768-5_54
NLM
Campêlo MB, Huiban CG, Sampaio RM, Wakabayashi Y. On the complexity of solving or approximating convex recoloring problems [Internet]. Proceedings. 2013 ;[citado 2024 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-38768-5_54
Vancouver
Campêlo MB, Huiban CG, Sampaio RM, Wakabayashi Y. On the complexity of solving or approximating convex recoloring problems [Internet]. Proceedings. 2013 ;[citado 2024 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-38768-5_54
Trabalho de evento
Second-price ad auctions with binary bids and markets with good competition (2012)
Fernandes, Cristina Gomes ; Schouery, Rafael Crivellari Saliba
Source: Proceedings. Conference titles: Internacional Symposium on Combinatorial Optimization - ISCO. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, 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 SCHOUERY, Rafael Crivellari Saliba. Second-price ad auctions with binary bids and markets with good competition. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-32147-4_39. Acesso em: 05 nov. 2024.
APA
Fernandes, C. G., & Schouery, R. C. S. (2012). Second-price ad auctions with binary bids and markets with good competition. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-32147-4_39
NLM
Fernandes CG, Schouery RCS. Second-price ad auctions with binary bids and markets with good competition [Internet]. Proceedings. 2012 ;[citado 2024 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-32147-4_39
Vancouver
Fernandes CG, Schouery RCS. Second-price ad auctions with binary bids and markets with good competition [Internet]. Proceedings. 2012 ;[citado 2024 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-32147-4_39
Trabalho de evento
A better approximation ratio and an IP formulation for a sensor cover problem (2012)
Barbosa, Rafael da Ponte; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: Latin American Theoretical Informatics Symposium - LATIN. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BARBOSA, Rafael da Ponte e WAKABAYASHI, Yoshiko. A better approximation ratio and an IP formulation for a sensor cover problem. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-29344-3_5. Acesso em: 05 nov. 2024.
APA
Barbosa, R. da P., & Wakabayashi, Y. (2012). A better approximation ratio and an IP formulation for a sensor cover problem. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-29344-3_5
NLM
Barbosa R da P, Wakabayashi Y. A better approximation ratio and an IP formulation for a sensor cover problem [Internet]. Proceedings. 2012 ;[citado 2024 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_5
Vancouver
Barbosa R da P, Wakabayashi Y. A better approximation ratio and an IP formulation for a sensor cover problem [Internet]. Proceedings. 2012 ;[citado 2024 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_5
Trabalho de evento
An improved upper bound on the density of universal random graphs (2012)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Rucinski, Andrzej
Source: Proceedings. Conference titles: Latin American 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
DELLAMONICA JUNIOR, Domingos et al. An improved upper bound on the density of universal random graphs. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-29344-3_20. Acesso em: 05 nov. 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., Rodl, V., & Rucinski, A. (2012). An improved upper bound on the density of universal random graphs. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-29344-3_20
NLM
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2024 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20
Vancouver
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2024 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20

USP Schools

ReP

Filtros

Authors

Funding Agencies