Previous Conferences & Workshops

An incomplete metric, the Weil-Petersson metric, has played a significant role in the study of the geometry of Teichmuller space. We will mainly discuss the asymptotics of the curvatures of this metric in this talk. Some aspects of another metric...

A graph is called {\em even-hole-free} if no induced subgraph of it is a cycle with an even number of vertices. A vertex of a graph is {\em bisimplicial} if the vertex set of its neighborhood can be partitioned into two cliques. Bruce Reed...

Given a hypergraph H=(V,E), its conflict-free chromatic number (CF-chromatic number) is the minimum number of colors needed to color the vertex set V such that, for every hyperedge S, there is at least one element v \in S whose color is unique (in S...

Maps in W^{1,1} from the sphere S^2 into the circle S^1 can have, at most, countably many topological singularities. I will present some techniques which allow us to localize and quantify those "defects". Joint work with H. Brezis and P. Mironescu.

We present the Controlled Linear Programming Problem (CLPP), a new combinatorial optimization problem nicely merging linear programming with games. In a system of linear monotone constraints of the form $x_i\leq p_i^j(\bar x)+w_i^j$, where $p_i^j$...

Most known smoothable simply connected 4--manifolds admit infinitely many different smooth structures (distinguished, for example, by Seiberg--Witten invariants). There are some 4--manifolds, though, for which the existence of such 'exotic'...

The well-known Max Cut problem asks for the largest bipartite subgraph of a graph G. This problem has been the subject of extensive research, both from the algorithmic perspective in computer science and the extremal perspective in combinatorics...