skip to main content
Idioma:

Resultados de 1 a 10 de 23  para Produção Intelectual da USP

Ordenado por: Ordenado por: AutorOr hit Enter to replace sort method
Resultados 1 2 3 next page
Mostrar Somente
Refinado por: autor: Latin-American Algorithms, G remover
Result Number Material Type Add to My Shelf Action Record Details and Options
1
Repetition-free longest common subsequence
Repetition-free longest common subsequence
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Repetition-free longest common subsequence

Said Sadique Adi Marilia D. V Braga; Cristina Gomes Fernandes 1966-; Carlos Eduardo Ferreira; Fábio Henrique Viduani Martinez; Marie-France Sagot 1956-; Marco Aurélio Stefanes; Christian Tjandraatmadja; Yoshiko Wakabayashi; Latin American Algorithms, Graphs and Optimization Symposium - LAGOS (4. 2009 Puertos Varas, Chile)

Discrete Applied Mathematics Amsterdam v. 158, n. 12, p. 1315-1324, 2010

Amsterdam 2010

Localização: IME - Inst. Matemática e Estatística    (PROD-1852828 ) e outros locais(Acessar)

2
Repetition-free longest common subsequence
Repetition-free longest common subsequence
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Repetition-free longest common subsequence

Said Sadique Adi Marilia D. V Braga; Cristina Gomes Fernandes 1966-; Carlos Eduardo Ferreira; Fábio Henrique Viduani Martinez; Marie France Sagot; Marco Aurélio Stefanes; Christian Tjandraatmadja; Yoshiko Wakabayashi; Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS (4. 2008 Puertos Varas, Chile)

Electronic Notes in Discrete Mathematics Amsterdam v. 30, p.243-248, 2008

Amsterdam 2008

Localização: IME - Inst. Matemática e Estatística    (PROD-3032347 )(Acessar)

3
An approximate blow-up lemma for sparse pseudorandom graphs
An approximate blow-up lemma for sparse pseudorandom graphs
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

An approximate blow-up lemma for sparse pseudorandom graphs

Peter Allen Julia Böttcher; Hiêp Hàn; Yoshiharu Kohayakawa; Yury Person; Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS (7. 2013 Playa del Carmen, México)

Electronic Notes in Discrete Mathematics Amsterdam v. 44, p. 393-398, 2013

Amsterdam 2013

Localização: IME - Inst. Matemática e Estatística    (PROD-3034019 )(Acessar)

4
Decomposing highly connected graphs into paths of length five
Decomposing highly connected graphs into paths of length five
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Decomposing highly connected graphs into paths of length five

Fábio Happ Botler Guilherme Oliveira Mota; Marcio Takashi Iura Oshiro; Yoshiko Wakabayashi; Latin American Algorithms, Graphs, and Optimization Symposium - LAGOS (8. 2015 Fortaleza, Brasil)

Discrete Applied Mathematics Amsterdam v. 245, p. 128-138, 2018

Amsterdam 2018

Localização: IME - Inst. Matemática e Estatística    (PROD-2872520 )(Acessar)

5
Decompositions of highly connected graphs into paths of length five
Decompositions of highly connected graphs into paths of length five
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Decompositions of highly connected graphs into paths of length five

Fábio Happ Botler Guilherme Oliveira Mota; Marcio Takashi Iura Oshiro; Yoshiko Wakabayashi; Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS (8. 2015 Beberibe)

Electronic Notes in Discrete Mathematics Amsterdam v. 50, p. 211-216, Dec. 2015

Amsterdam 2015

Localização: IME - Inst. Matemática e Estatística    (PROD-2739534 )(Acessar)

6
Almost spanning subgraphs of random graphs after adversarial edge removal
Almost spanning subgraphs of random graphs after adversarial edge removal
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Almost spanning subgraphs of random graphs after adversarial edge removal

Julia Böttcher Yoshiharu Kohayakawa; Anusch Taraz; Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS (5. 2009 Gramado, Brasil)

Electronic Notes in Discrete Mathematics Amsterdam v. 35, p. 335-340, 2009

Amsterdam 2009

Localização: IME - Inst. Matemática e Estatística    (PROD-3035637 )(Acessar)

7
Hamiltonian cycles in kneser graphs for n = 2k+ 2
Hamiltonian cycles in kneser graphs for n = 2k+ 2
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Hamiltonian cycles in kneser graphs for n = 2k+ 2

L. R Bueno Celina Miraglia Herrera de Figueiredo; Luerbio Faria; Candido Ferreira Xavier de Mendonça Neto; Rodrigo de Alencar Hausen; Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS'11 (6. 2011 Bariloche)

Electronic Notes in Discrete Mathematics Amsterdam v. 37, p. 291-296, aug. 2011

Amsterdam 2011

Item não circula. Consulte sua biblioteca.(Acessar)

8
Polyhedral studies on the convex recoloring problem
Polyhedral studies on the convex recoloring problem
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Polyhedral studies on the convex recoloring problem

Manoel Campêlo Karla Roberta Pereira Sampaio Lima; Phablo Fernando Soares Moura; Yoshiko Wakabayashi; Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS (7. 2013 Playa del Carmen, México)

Electronic Notes in Discrete Mathematics Amsterdam v. 44, p. 233-238, nov. 2013

Amsterdam 2013

Localização: IME - Inst. Matemática e Estatística    (PROD-2466583 )(Acessar)

9
The k-hop connected dominating set problem hardness and polyhedra
The k-hop connected dominating set problem hardness and polyhedra
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

The k-hop connected dominating set problem hardness and polyhedra

Rafael S Coelho Phablo Fernando Soares Moura; Yoshiko Wakabayashi; Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS (8. 2015 Beberibe)

Electronic Notes in Discrete Mathematics Amsterdam v. 50, p. 59-64, Dec. 2015

Amsterdam 2015

Localização: IME - Inst. Matemática e Estatística    (PROD-2739553 )(Acessar)

10
A note on random k-dimensional posets
A note on random k-dimensional posets
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

A note on random k-dimensional posets

Ricardo Corrêa Carlos Hoppen; Yoshiharu Kohayakawa; M. Rudini Sampaio; Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS (6. 2011 Bariloche)

Electronic Notes in Discrete Mathematics Amsterdam v. 37, p. 51-56, 2011

Amsterdam 2011

Localização: IME - Inst. Matemática e Estatística    (PROD-2204292 ) e outros locais(Acessar)

Resultados de 1 a 10 de 23  para Produção Intelectual da USP

Ordenado por: Ordenado por: AutorOr hit Enter to replace sort method
Resultados 1 2 3 next page

Personalize Seus Resultados

  1. Editar

Refine Search Results

Mostrar Somente

  1. Disponível na Biblioteca (22)

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.