Workshop on
Discrete Structures, Complexity and Algorithms

Date: July 15-17, 2009.
Local: NUMEC-USP, São Paulo/SP.

Participants

  1. Francisco Elói Soares de Araújo (Centro Universitário Senac)
  2. Christiane Neme Campos (UNIFESP/SJ)
  3. Renato Carmo (UFPR)
  4. Marcelo Henriques de Carvalho (UFMS)
  5. Cristina Gomes Fernandes (IME-USP)
  6. Alvaro Junio Pereira Franco (IME-USP)
  7. Alexandre Freire (IME-USP)
  8. Luiz Alberto Hespanha (IME-USP)
  9. Carlos Hoppen (IME-USP)
  10. Marcos Kiwi (DIM-CMM, Chile)
  11. Yoshiharu Kohayakawa (IME-USP)
  12. Alair Pereira do Lago (IME-USP)
  13. Orlando Lee (UNICAMP)
  14. Manoel Lemos (UFPE)
  15. Sóstenes Lins (UFPE)
  16. Arnaldo Mandel (IME-USP)
  17. Fábio Henrique Viduani Martinez (UFMS)
  18. Martín Matamala (DIM-CMM, Chile)
  19. Luís Augusto Angelotti Meira (UNIFESP/SJ)
  20. Carlos Gustavo Tamm de Araújo Moreira (IMPA)
  21. Karla Roberta Pereira do Nascimento (IME-USP)
  22. Roberto Imbuzeiro Oliveira (IMPA)
  23. Ander Conselvan de Oliveira (IME-USP)
  24. Marcio Takashi Oshiro (IME-USP)
  25. José Coelho de Pina Jr (IME-USP)
  26. Estela Maris Rodrigues (Mackenzie)
  27. Jalila Rios dos Santos (UFPE)
  28. Rafael Crivellari Saliba Schouery (IME-USP)
  29. Luciano Lacerda Silveira (UFMS)
  30. Fernando José Oliveira de Souza (UFPE)
  31. Marco Aurélio Stefanes (UFMS)
  32. Christian Tjandraatmadja (IME-USP)
  33. Yoshiko Wakabayashi (IME-USP)

Scientific program

Wednesday, July 15
9:30
Manoel Lemos
Some characterization of graphic matroids
10:10
coffee break

10:30
Martín Matamala
Navigating in a graph by aid of its spanning tree
11:15
Fernando Souza
Rigid-vertex graphs
12:00
lunch

14:00
group work

16:00
coffee break

16:30
group work

19:30
workshop dinner

Thursday, July 16
9:30
Marcelo Carvalho
Join covered graphs and applications
10:10
coffee break

10:30
Orlando Lee
Removable paths with parity constraints
11:15
Carlos Gustavo
Complexity of infinite sequences with positive entropy
12:00
lunch

14:00
group work

16:00
coffee break

16:30
group work

Friday, July 17
9:30
Roberto Imbuzeiro
Online Linear Optimization with Bandit Feedback via Following a Perturbed and Delayed Leader
10:10
coffee break

10:30
Francisco Elói de Araújo
Characterization of score matrices used for comparing sequences
11:15
Luís Meira
A continuous facility location problem and its application to a clustering problem
12:00
lunch

14:00
group work

16:00
closing ceremony

Abstracts [pdf] [ps.gz]

CNPq Projeto Universal 485671/07-7 (Jan 2007 - Dez 2009)
Estruturas Discretas, Complexidade e Algoritmos
Coordenador: Prof. Manoel Lemos (UFPE)
Last modified: Fri Jul 24 12:23:27 BRT 2009