Seminar in Combinatorial Computation

Run by János Pach

The seminar covers a wide range of topics in combinatorics and graph theory with particular emphasis on algorithms and areas related to computer science. Many of the speakers are CUNY and NYU visitors, postdocs, and graduate students. A seminar talk may cover original research or report on an interesting paper.

The program and the abstracts of the talks (for the last couple of years) can be found on our homepage .

Topics recently covered: Graph coloring in expected polynomial time, Graph colouring via the probabilistic method, k-sets in 2 and 3 dimensions, Unit distances among vertices of a convex polygon, Testing first order graph properties, Computing the volume of convex bodies, The existential theory of reals and some elementary geometric problems, Constructing public key cryptosystems via combinatorial group theory, The Hanna Neumann conjecture, The Ramsey arrow and the polynomial hierarchy, Graceful graphs, Optimal packing of induced stars in a graph, Random processes, Graph embedding problems, Delsarte's linear program.