ReP USP - Resultado da busca

Artigo de periodico
Maximum series-parallel subgraph (2012)
Calinescu, Gruia ; Fernandes, Cristina Gomes ; Kaul, Hemanshu; Zelikovsky, Alexander
Source: Algorithmica. 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
CALINESCU, Gruia et al. Maximum series-parallel subgraph. Algorithmica, v. 63, n. 1-2, p. 137-157, 2012Tradução . . Disponível em: https://doi.org/10.1007/s00453-011-9523-4. Acesso em: 13 ago. 2024.
APA
Calinescu, G., Fernandes, C. G., Kaul, H., & Zelikovsky, A. (2012). Maximum series-parallel subgraph. Algorithmica, 63( 1-2), 137-157. doi:10.1007/s00453-011-9523-4
NLM
Calinescu G, Fernandes CG, Kaul H, Zelikovsky A. Maximum series-parallel subgraph [Internet]. Algorithmica. 2012 ; 63( 1-2): 137-157.[citado 2024 ago. 13 ] Available from: https://doi.org/10.1007/s00453-011-9523-4
Vancouver
Calinescu G, Fernandes CG, Kaul H, Zelikovsky A. Maximum series-parallel subgraph [Internet]. Algorithmica. 2012 ; 63( 1-2): 137-157.[citado 2024 ago. 13 ] Available from: https://doi.org/10.1007/s00453-011-9523-4
Artigo de periodico
A new approximation algorithm for finding heavy planar subgraphs (2003)
Calinescu, Gruia; Fernandes, Cristina Gomes ; Karloff, Howard; Zelikovsky, Alexander
Source: Algorithmica. 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
CALINESCU, Gruia et al. A new approximation algorithm for finding heavy planar subgraphs. Algorithmica, v. 36, n. 2, p. 179-205, 2003Tradução . . Disponível em: https://doi.org/10.1007/s00453-002-1020-3. Acesso em: 13 ago. 2024.
APA
Calinescu, G., Fernandes, C. G., Karloff, H., & Zelikovsky, A. (2003). A new approximation algorithm for finding heavy planar subgraphs. Algorithmica, 36( 2), 179-205. doi:10.1007/s00453-002-1020-3
NLM
Calinescu G, Fernandes CG, Karloff H, Zelikovsky A. A new approximation algorithm for finding heavy planar subgraphs [Internet]. Algorithmica. 2003 ; 36( 2): 179-205.[citado 2024 ago. 13 ] Available from: https://doi.org/10.1007/s00453-002-1020-3
Vancouver
Calinescu G, Fernandes CG, Karloff H, Zelikovsky A. A new approximation algorithm for finding heavy planar subgraphs [Internet]. Algorithmica. 2003 ; 36( 2): 179-205.[citado 2024 ago. 13 ] Available from: https://doi.org/10.1007/s00453-002-1020-3
Artigo de periodico
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width (2003)
Calinescu, Gruia; Fernandes, Cristina Gomes ; Reed, Bruce A.
Source: Journal of Algorithms. Unidade: IME
Assunto: 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 A. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, v. 48, n. 2, p. 333-359, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0196-6774(03)00073-7. Acesso em: 13 ago. 2024.
APA
Calinescu, G., Fernandes, C. G., & Reed, B. A. (2003). Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, 48( 2), 333-359. doi:10.1016/s0196-6774(03)00073-7
NLM
Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 ago. 13 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7
Vancouver
Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 ago. 13 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7
Trabalho de evento-anais periodico
Multicuts in unweighted digraphs with bounded degree and bounded tree-width (2001)
Calinescu, Gruia ; Fernandes, Cristina Gomes
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes. Multicuts in unweighted digraphs with bounded degree and bounded tree-width. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/S1571-0653(04)00258-6. Acesso em: 13 ago. 2024. , 2001
APA
Calinescu, G., & Fernandes, C. G. (2001). Multicuts in unweighted digraphs with bounded degree and bounded tree-width. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S1571-0653(04)00258-6
NLM
Calinescu G, Fernandes CG. Multicuts in unweighted digraphs with bounded degree and bounded tree-width [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 194-197.[citado 2024 ago. 13 ] Available from: https://doi.org/10.1016/S1571-0653(04)00258-6
Vancouver
Calinescu G, Fernandes CG. Multicuts in unweighted digraphs with bounded degree and bounded tree-width [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 194-197.[citado 2024 ago. 13 ] Available from: https://doi.org/10.1016/S1571-0653(04)00258-6
Artigo de periodico
A better approximation algorithm for finding planar subgraphs (1998)
Calinescu, Gruia; Fernandes, Cristina Gomes ; Finkler, Ulrich; Karloff, Howard
Source: Journal of Algorithms. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS GRÁFICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia et al. A better approximation algorithm for finding planar subgraphs. Journal of Algorithms, v. 27, n. 2, p. 269-302, 1998Tradução . . Disponível em: https://doi.org/10.1006/jagm.1997.0920. Acesso em: 13 ago. 2024.
APA
Calinescu, G., Fernandes, C. G., Finkler, U., & Karloff, H. (1998). A better approximation algorithm for finding planar subgraphs. Journal of Algorithms, 27( 2), 269-302. doi:10.1006/jagm.1997.0920
NLM
Calinescu G, Fernandes CG, Finkler U, Karloff H. A better approximation algorithm for finding planar subgraphs [Internet]. Journal of Algorithms. 1998 ; 27( 2): 269-302.[citado 2024 ago. 13 ] Available from: https://doi.org/10.1006/jagm.1997.0920
Vancouver
Calinescu G, Fernandes CG, Finkler U, Karloff H. A better approximation algorithm for finding planar subgraphs [Internet]. Journal of Algorithms. 1998 ; 27( 2): 269-302.[citado 2024 ago. 13 ] Available from: https://doi.org/10.1006/jagm.1997.0920
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: 13 ago. 2024.
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 2024 ago. 13 ] 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 2024 ago. 13 ] Available from: https://doi.org/10.1007/3-540-69346-7_11
Trabalho de evento
A better approximation algorithm for finding planar subgraphs (1996)
Calinescu, Gruia; Fernandes, Cristina Gomes ; Karloff, Howard
Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms. Unidade: IME
Assunto: ALGORITMOS PARA PROCESSAMENTO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e KARLOFF, Howard. A better approximation algorithm for finding planar subgraphs. 1996, Anais.. New York: ACM, 1996. . Acesso em: 13 ago. 2024.
APA
Calinescu, G., Fernandes, C. G., & Karloff, H. (1996). A better approximation algorithm for finding planar subgraphs. In Proceedings. New York: ACM.
NLM
Calinescu G, Fernandes CG, Karloff H. A better approximation algorithm for finding planar subgraphs. Proceedings. 1996 ;[citado 2024 ago. 13 ]
Vancouver
Calinescu G, Fernandes CG, Karloff H. A better approximation algorithm for finding planar subgraphs. Proceedings. 1996 ;[citado 2024 ago. 13 ]

USP Schools

ReP

Filtros

Authors

Funding Agencies

Non normalized affiliation