Hardness of dynamic core and truss decompositions (2026)
- Authors:
- USP affiliated authors: FERNANDES, CRISTINA GOMES - IME ; COUTO, YAN SOARES - IME
- Unidade: IME
- DOI: 10.1007/978-3-032-06706-7_5
- Subjects: ALGORITMOS DE APROXIMAÇÃO; MÉTODOS DE DECOMPOSIÇÃO
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Approximation and Online Algorithms. WAOA 2025. Lecture Notes in Computer Science
- ISSN: 0302-9743
- Volume/Número/Paginação/Ano: v. 16077, p. 64-80, 2026
- Conference titles: Workshop on Approximation and Online Algorithms - WAOA
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
COUTO, Yan Soares e FERNANDES, Cristina Gomes. Hardness of dynamic core and truss decompositions. Approximation and Online Algorithms. WAOA 2025. Lecture Notes in Computer Science. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-032-06706-7_5. Acesso em: 12 jan. 2026. , 2026 -
APA
Couto, Y. S., & Fernandes, C. G. (2026). Hardness of dynamic core and truss decompositions. Approximation and Online Algorithms. WAOA 2025. Lecture Notes in Computer Science. Cham: Springer. doi:10.1007/978-3-032-06706-7_5 -
NLM
Couto YS, Fernandes CG. Hardness of dynamic core and truss decompositions [Internet]. Approximation and Online Algorithms. WAOA 2025. Lecture Notes in Computer Science. 2026 ; 16077 64-80.[citado 2026 jan. 12 ] Available from: https://doi.org/10.1007/978-3-032-06706-7_5 -
Vancouver
Couto YS, Fernandes CG. Hardness of dynamic core and truss decompositions [Internet]. Approximation and Online Algorithms. WAOA 2025. Lecture Notes in Computer Science. 2026 ; 16077 64-80.[citado 2026 jan. 12 ] Available from: https://doi.org/10.1007/978-3-032-06706-7_5 - Extremal problems on forest cuts and acyclic neighborhoods in sparse graphs (extended abstract)
- Estruturas de dados persistentes
- Repetition-free longest common subsequence of random sequences
- Trajectory clustering of points in R
- Approximation algorithms for the max-buying problem with limited supply
- Stability in geodesics for memoryless binary long-lived consensus
- Approximating minimum k-section in trees with linear diameter
- Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)
- A new approximation algorithm for finding heavy planar subgraphs
- Maximum series-parallel subgraph
Informações sobre o DOI: 10.1007/978-3-032-06706-7_5 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3277552.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
