Complexity of Discrete Structures

Projeto ProNEx 107/97 - MCT/CNPq

Proc. CNPq 664107/1997-4

Past Events of Interests

• SODA'2002 - Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, January 6 to 8, 2002.
• APPROX'2001 + RANDOM'2001 - 4th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, California, Berkeley, 18 to 20 August, 2001.
• The 10th International Conference on Random Structures and Algorithms, Poznan, August 6 to 10, 2001.
• 23o. Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, July 23 to 27, 2001.
• The 33rd Annual ACM Symposium on Theory of Computing (STOC), Crete, Greece, July 6 to 8, 2001.
• Integer Programming and Combinatorial Optimization, (IPCO 2001), Utrecht, The Netherlands, June 13-15, 2001. In conjuction with DONET Summer School on Integer and Combinatorial Optimization June 11 - 12, 2001, Utrecht, The Netherlands. Deadline (paper submission): November 6, 2000.
• Workshop and Conference on Hypergraphs, Gyula O.H. Katona is 60, Rényi Institute, Budapest, Hungary, June 4 to 17, 2001 and June 7 to 9, 2001.
• Simpósio Brasileiro em Grafos, Algoritmos e Combinatória (GRACO 2001), Fortaleza, Ceará, Brasil, March 17-19, 2001. In conjuction with Escola Brasileira de Verão em Combinatória e Algoritmos, March 12-16 and 20-24, 2001.
• Finite and Infinite Combinatorics, Budapest, Hungary, January 5 to 10, 2001.
• IV Workshop in Combinatorics and Discrete Structures (Approximation), Itatiaia, RJ, Brazil, October 8-11, 2000. (Organized by members of this project.)
• APPROX 2000, Saarbrücken, Germany, September 5-8, 2000.