Coming Conferences and Workshops
COCOON'2OOO
SWAT'2000
Tenth SIAM Conference on Discrete Mathematics
Homepages
Jeremy Avigad
(logic)
Mihir Bellare
(complexity theory)
Hans L. Bodlaender
(treewidth)
Richard A. Brualdi
(combinatorial matrix theory, especially qualitative matrix analysis)
Dominique (Dom) de Caen
(Graph theory)
David Eppstein
(graph algorithms, geometry, optimization)
Lance Fortnow
(complexity theory)
Daniel Pritikin
(Graph theory)
Neil Robertson
(graph minors)
Mike Robson
(graph theory, upper bounds for Maximum Independent Sets)
Paul Seymour
(graph theory)
Yann Verhoeven
(random structures, random 2-SAT)
Collections
SIGACT News Theory Calendar
Logic-related conferences
Electronic Colloquium on Computational Complexity
Miscellaneous
Proof Complexity and Feasible Arithmetics
(DIMACS series)
1995-1996 Special Year on Logic and Algorithms
(DIMACS)
European Association for Computer Science Logic
Proofs and Complexity
(this year's theme at BRICS)
Institute of Discrete Mathematics
(Austrian Academy of Sciences)
Max-Planck-Institut für Informatik
Oliver Kullmann
Last modified: Wed Jan 3 20:03:25 GMT 2007