Procedia Computer Science (2021)
- Authors:
- Autor USP: FERREIRA, CARLOS EDUARDO - IME
- Unidade: IME
- Assunto: CIÊNCIA DA COMPUTAÇÃO
- Language: Inglês
- Imprenta:
- Source:
- ISSN: 1877-0509
- Volume/Número/Paginação/Ano: v. 195, p. 1-542, 2021
- Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS
-
ABNT
Procedia Computer Science. . Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C. Acesso em: 14 mar. 2026. , 2021 -
APA
Procedia Computer Science. (2021). Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C -
NLM
Procedia Computer Science [Internet]. 2021 ; 195 1-542.[citado 2026 mar. 14 ] Available from: https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C -
Vancouver
Procedia Computer Science [Internet]. 2021 ; 195 1-542.[citado 2026 mar. 14 ] Available from: https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C - The node capacitated graph partitioning problem: a computational study
- Algoritmos Branch e Bound para o problema de sequenciamento em uma única máquina
- Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem
- Some formulations for the group Steiner tree problem
- Formulations and valid inequalities for the node capacitated graph partitioning problem
- Advances in bioinformatics and computational biology
- Discrete Applied Mathematics
- A new linear time algorithm to construct dominator trees of reducible flow graphs
- V Latin-American algorithms, graphs, and optimization symposium - Gramado, Brazil, 2009. [Editorial]
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
