Surf these sites: 26th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000) -- The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. CIRM/DONET Graph Theory Workshop -- Program: - Structural Graph Theory and Applications to Coloring, a 10-hour course by Robin Thomas. - Nine invited one-hour lectures. Both Lex Schrijver and Dominic Welsh have already kindly agreed to present three lectures each. CO2000: Combinatorial Optimisation Symposium -- ontributions are invited in the following and related areas of study: Logistics and Routing, Location Analysis, Network Optimisation, Integer Programming, Polyhedral Combinatorics, Scheduling. COCOON2000 -- The conference aims to provide a forum for researchers in theoretical computer science. Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In additional to theoretical results, submissions that report substantial results in experimental and applied research are encouraged. Colloque Informatique et Mathématiques -- The aim of the colloquium is to bring together researchers on subjects at the intersection of fundamental Computer Science and Mathematics. The topics covered are : trees, stochastic processes, large deviations, branching processes, random walks, discrete probability, enumerative and analytical combinatorics, analysis of algorithms, performance evaluation, combinatorial optimization... CombinaTexas Conference -- Combinatorics in the South-Central U.S. DM00- Tenth SIAM Conference on Discrete Mathematics -- The purpose of this conference is to highlight the major theoretical advances in the field, the development of new tools for discrete mathematics, and the most significant of the new applications of discrete mathematics to problems arising in industry and business. The conference also seeks to bring together participants from the many different environments where discrete mathematics is developed and applied. Diskrete Mathematik 2000 -- Discrete Mathematics is playing an increasingly important role in modern mathematics and computer science, partly because to its numerous contributions to practical problems of great relevance. The conference will focus on the scientific exchange between Discrete Mathematic''s various branches and bring together world leading experts of the field with excellent young researchers. Fields Institute: Special Year on Graph Theory and Combinatorial Optimization -- Fields Institute special events on Graph Theory Graph Drawing 2000 -- The symposium is a forum for researchers and practitioners working on all aspects of graph visualization and representation. The range of topics considered in graph drawing includes graph algorithms, graph theory, geometry, topology, visual languages, visual perception, information visualization, computer-human interaction, and graphic design. Graph Theory Conference 2000 - Kalamazoo, Michigan -- The 9th Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms and Applications (GTCC2000). This conference has been held every four years since 1968, hosted by the Department of Mathematics and Statistics at Western Michigan University. ICGT2000 -- The Sixth International Conference on Graph Theory , like its predecessor will be held on the Luminy campus in Marseille, France. There will be some 15 invited talks, and a sizeable number of contributed talks, each of 25 minutes, on all aspects of graph theory. ISMP2000 - 17th International Symposium on Mathematical Programming -- Papers on all theoretical, computational and practical aspects of mathematical programming are welcome. The presentation of very recent results is encouraged. JIM''2000 International Colloquium -- The colloquium JIM''2000 entitled Algorithmes de graphes is intended as a forum for researchers in the area of design and analysis of graph algorithms and related areas. ODSA 2000 -- The conference is devoted to Combinatorial optimization and algorithms on discrete structures, Extremal problems in posets, Design theory, Coding theory, Cryptography, Graph theory, Complexity theory and related topics. Thirty-first Southeastern International Conference on Combinatorics, Graph Theory, and Computing at FAU -- Celebrating its 31st year, the Conference continues in the spirit of earlier conferences in Baton Rouge and Boca Raton. It brings together mathematicians and others interested in combinatorics, graph theory and computing, and their interactions. The Conference lectures and contributed papers, as well as the opportunities for informal conversations, have proved to be of great interest to other scientists and analysts employing these mathematical sciences in their professional work in business, industry, and government.
Help build the largest human-edited
directory on the web.