Speaker Gruia Calinescu IIT Computer Science http://www.cs.iit.edu/~calinesc/ Description Motivated by applications to wireless sensor networks, we study the following problem. We are given a set S of...
Speaker Marcus Schaefer DePaul University http://ovid.cs.depaul.edu/ Description The beautiful (and old) Hanani-Tutte theorem states that a graph is planar if and only if it can be drawn so that any...
Speaker Jesus De Loera Department of Mathematics University of California Davis https://www.math.ucdavis.edu/~deloera/ Description Linear programming is undeniably a central software tool of applied...
Description Let G =(V,E) be a finite connected graph and π a k-tuple in V. Think of k customers, each one reporting a most preferred vertex. Location and consensus theory often involves finding the...
Description We introduce abstract convex geometries. Much as matroids can be thought of as "discrete vector spaces", convex geometries are "discrete convex hulls". There are specific convex sets of...
Description Group testing is a well researched and practically important topic (e.g. in biological research). The basic idea of group testing is to perfectly identify a small portion of 'special'...
Speaker Despina Stasi IIT Applied Math http://www.personal.psu.edu/~users/d/u/dus33/ Description In this talk we define and discuss the hydra number, a graph parameter arising from an optimization...
Speaker Dan Cranston Virginia Commonwealth University http://www.people.vcu.edu/~dcranston/ Description Let G be a graph with maximum degree Δ ≥3. Brooks' Theorem says that if G has chromatic number Δ...
Speaker Robert Ellis IIT Applied Math http://math.iit.edu/~rellis/ Description The point of group testing is to reduce the cost of finding defective items in a population by testing pools if items...
Description The crossing number of a graph $G$, $\crs(G)$ is the minimum number of intersections among edges over all possible drawings on a plane. The pairwise crossing number $\pcr(G)$ is the...
