skip to main content
Idioma:
Resultados 1 2 3 next page
Mostrar solo
Refinado por: autor: Latin-American Algorithms, G eliminar
Result Number Material Type Add to My Shelf Action Record Details and Options
1
A concurrent implementation of skip graphs
A concurrent implementation of skip graphs
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

A concurrent implementation of skip graphs

Hammurabi Mendes Cristina Gomes Fernandes 1966-; Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS (5. 2009 Gramado, RS)

Electronic Notes in Discrete Mathematics Amsterdam v. 35, p. 263-268, 2009

Amsterdam 2009

Disponible en IME - Inst. Matemática e Estatística    (PROD-3032488 )(Obténgalo)

2
An approximate blow-up lemma for sparse pseudorandom graphs
An approximate blow-up lemma for sparse pseudorandom graphs
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

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

Disponible en IME - Inst. Matemática e Estatística    (PROD-3034019 )(Obténgalo)

3
Decompositions of highly connected graphs into paths of length five
Decompositions of highly connected graphs into paths of length five
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

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

Disponible en IME - Inst. Matemática e Estatística    (PROD-2739534 )(Obténgalo)

4
Decomposing highly connected graphs into paths of length five
Decomposing highly connected graphs into paths of length five
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

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

Disponible en IME - Inst. Matemática e Estatística    (PROD-2872520 )(Obténgalo)

5
Almost spanning subgraphs of random graphs after adversarial edge removal
Almost spanning subgraphs of random graphs after adversarial edge removal
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

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

Disponible en IME - Inst. Matemática e Estatística    (PROD-3035637 )(Obténgalo)

6
V Latin-American algorithms, graphs, and optimization symposium - Gramado, Brazil, 2009. [Editorial]
V Latin-American algorithms, graphs, and optimization symposium - Gramado, Brazil, 2009. [Editorial]
Material Type:
Artículo 		Añadir a Mi Portal

V Latin-American algorithms, graphs, and optimization symposium - Gramado, Brazil, 2009. [Editorial]

Carlos Eduardo Ferreira Fábio Protti; Jayme Luiz Szwarcfiter; Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS (5. 2009 Gramado, Brasil)

Discrete Applied Mathematics Amsterdam v. 160, n. 18, p. 2499-2501, 2012

Amsterdam 2012

Disponible en IME - Inst. Matemática e Estatística    (PROD-2881696 )(Obténgalo)

7
A canonical Ramsey theorem with list constraints in random graphs
A canonical Ramsey theorem with list constraints in random graphs
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

A canonical Ramsey theorem with list constraints in random graphs

José Diego Alvarado Morales Yoshiharu Kohayakawa; Patrick Morris; Guilherme Oliveira Mota; Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS (12. 2023 Huatulco, Mexico)

Procedia Computer Science Amsterdam v. 223, p. 13-19, 2023

Amsterdam 2023

Disponible en IME - Inst. Matemática e Estatística    (PROD-3165969 )(Obténgalo)

8
LAGOS'2009 V Latin-American Algorithms, Graphs and Optimization Symposium, [held in] Gramado, RS, Brazil, November 3-7, 2009
LAGOS'2009 V Latin-American Algorithms, Graphs and Optimization Symposium, [held in] Gramado, RS, Brazil, November 3-7, 2009
Material Type:
Audio 		Añadir a Mi Portal

LAGOS'2009 V Latin-American Algorithms, Graphs and Optimization Symposium, [held in] Gramado, RS, Brazil, November 3-7, 2009

Latin-American Algorithms, Graphs and Optimization Symposium (5th : 2009 : Gramado, RS, Br) Thomas Liebling; Jayme Luiz Szwarcfiter

Gramado SBC 2009

Disponible en IME - Inst. Matemática e Estatística    (CD QA845.C L357L 5º )(Obténgalo)

9
Hamiltonian cycles in kneser graphs for n = 2k+ 2
Hamiltonian cycles in kneser graphs for n = 2k+ 2
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

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

Comprobar fondos(Obténgalo)

10
Stability in geodesics for memoryless binary long-lived consensus
Stability in geodesics for memoryless binary long-lived consensus
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

Stability in geodesics for memoryless binary long-lived consensus

Cristina Gomes Fernandes 1966- Maya Stein; Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS (6. 2011 Bariloche)

Electronic Notes in Discrete Mathematics Amsterdam v. 37, p. 351-356, 2011

Amsterdam 2011

Disponible en IME - Inst. Matemática e Estatística    (PROD-2204281 ) y otras localizaciones(Obténgalo)

Resultados 1 2 3 next page

Personalizar los resultados

  1. Editar

Refine Search Results

Mostrar solo

  1. Disponible (25)

Nuevas sugerencias de búsqueda

Ignorar mi consulta y buscar por todo

por este autor/creador:

  1. Latin-American Algorithms, G
  2. Wakabayashi, Y
  3. Fernandes, C
  4. Kohayakawa, Y
  5. Ferreira, C

con este tema:

  1. Teoria Dos Grafos
  2. Algoritmos
  3. Combinatória
  4. Otimização Combinatória
  5. Grafos Aleatórios

  • Realización: ABCD-USP USP   Logos de Redes Sociales: Freepik

Buscando en bases de datos remotas, por favor espere