skip to main content
Idioma:
Primo Advanced Search
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search prefilters
Busca Simples
Mostrar Somente
Refinado por: autor: Wakabayashi, Y remover data de publicação: 2013Até2018 remover
Result Number Material Type Add to My Shelf Action Record Details and Options
1
Covering a graph with nontrivial vertex-disjoint paths existence and optimization
Covering a graph with nontrivial vertex-disjoint paths existence and optimization
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Covering a graph with nontrivial vertex-disjoint paths existence and optimization

Renzo Gómez Yoshiko Wakabayashi; International Workshop on Graph-Theoretic Concepts in Computer Science - WG (44. 2018 Cottbus, Germany)

Proceedings Cham: Springer, 2018

Cham Springer 2018

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

2
Hardness and inapproximability of convex recoloring problems
Hardness and inapproximability of convex recoloring problems
Material Type:
Artigo 		Adicionar ao Meu Espaço

Hardness and inapproximability of convex recoloring problems

Manoel Campêlo Cristiana Gomes Huiban; Rudini Menezes Sampaio; Yoshiko Wakabayashi

Theoretical Computer Science Amsterdam v. 533, p. 15-25, 2014

Amsterdam 2014

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

3
On path-cycle decompositions of triangle-free graphs
On path-cycle decompositions of triangle-free graphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

On path-cycle decompositions of triangle-free graphs

Andrea Jiménez Yoshiko Wakabayashi

Discrete Mathematics and Theoretical Computer Science Nancy v. 19, n. 3, [21 p.], 2017

Nancy 2017

Acesso online. A biblioteca também possui exemplares impressos.

4
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game

Yoshiharu Kohayakawa Flávio Keidi Miyazawa; Yoshiko Wakabayashi; Latin American Symposium on Theoretical Informatics - LATIN 2018 (13. 2018 Buenos Aires, Argentina)

Proceedings Cham: Springer, 2018

Cham Springer 2018

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

5
On the complexity of solving or approximating convex recoloring problems
On the complexity of solving or approximating convex recoloring problems
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

On the complexity of solving or approximating convex recoloring problems

Manoel B Campêlo Cristiana Gomes Huiban; Rudini Menezes Sampaio; Yoshiko Wakabayashi; International Computing and Combinatorics Conference - COCOON (19. 2013 Hangzhou, China)

Proceedings Berlin : Springer, 2013

Berlin Springer 2013

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

6
Polynomial-time approximation schemes for circle packing problems
Polynomial-time approximation schemes for circle packing problems
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Polynomial-time approximation schemes for circle packing problems

Flavio Keidi Miyazawa Lehilton L. C Pedrosa; Rafael Crivellari Saliba Schouery; Maxim Sviridenko; Yoshiko Wakabayashi; European Symposium on Algorithms - ESA (22. 2014 Wroclaw, Poland)

Algorithms - ESA 2014: 22nd Annual European Symposium Wroclaw, Poland, September 8-10, 2014, Proceedings Berlin: Springer, 2014

Berlin Springer 2014

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

Personalize Seus Resultados

  1. Editar

Refine Search Results

Mostrar Somente

  1. Recursos Online (1)

Novas Pesquisas Sugeridas

Ignorar minha busca e procurar por tudo

Deste Autor:

  1. Wakabayashi, Y
  2. Huiban, C
  3. Sampaio, R
  4. Miyazawa, F
  5. Campêlo, M

Neste Assunto:

  1. Teoria Dos Grafos
  2. Otimização Combinatória
  3. Análise De Algoritmos
  4. Algoritmos
  5. Matemática Discreta

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

Buscando em bases de dados remotas. Favor aguardar.