Past Events

Network science has dominated analysis of complex relational data for decades. This is the practice of modeling data using a graph to represent pairwise relationships and then applying graph theoretic

Imagine an unknown graph over n known vertices. You have the following “cut-query” oracle: for any subset S of vertices, you can get the number of edges with exactly one

Let f(d) be the maximum number of points in R^d such that every three form an acute triangle. For decades, it was thought that f(d) should grow linearly until a

Large real-world stable matching markets typically have the property that "the core is small". That is, there are "few" distinct stable matchings, and most agents have unique partners across all

Multiscale substitution tilings are a new family of tilings of Euclidean space that are generated by multiscale substitution rules. Unlike the standard setup of substitution tilings, which is a basic

We study network coding gaps for the problem of makespan minimization of multiple unicasts. In this problem, distinct packets at different nodes in a network need to be delivered to

Imagine five points in R^2, where no three of them are colinear. You can always find a convex quadrilateral among them. How many points do you need for a convex

I will talk about the Worker-Task Assignment Problem, where the goal is to assign workers to tasks where each task has demand for a particular number of workers, and the

The well-exploited theory of SIMPLE continued fractions has produced some dazzling identities and wonderful irrationality proofs. The often-overlooked theory of GENERAL continued fractions is harder to champion, but just as,

I will introduce a probabilistic technique called dependent random choice, which allows us to analyze dense graphs and find many small sets of vertices with large common neighborhoods. We'll discuss

We consider the problem of load balancing in the distributed setting. The input is a bipartite graph on clients and servers, where each client comes with a positive weight. The

It is known since the 1970s that no more than 23 multiplications are required for computing the product of two 3 3-matrices. It is not known whether this can also

We consider the problem of performing counting range queries on a planar graph G. Suppose each edge e in G has a value v(e) and a length w(e). We would

Interacting agent-based systems are ubiquitous in science, from modeling of particles in Physics to prey-predator and colony models in Biology, to opinion dynamics in economics and social sciences. Oftentimes the

A half-dozen lovely new sequences from the On-Line Encyclopedia of Integer Sequences, with brilliant illustrations and many open problems.

How should a seller price items when facing a single buyer in order to maximize the seller's revenue? In seminal work, Myerson showed that it suffices to post a single,

The Department of Homeland Security university centers of excellence COEs have established a COVID 19 Supply Chain Initiative under support of the DHS Office of University Programs and under the leadership of the CCICADA Center at Rutgers University This event is part of a sequence of short workshops that the

The Department of Homeland Security university centers of excellence COEs have established a COVID 19 Supply Chain Initiative under support of the DHS Office of University Programs and under the leadership of the CCICADA Center at Rutgers University This event is part of a sequence of short workshops that the

The Department of Homeland Security university centers of excellence (COEs) have established a COVID-19 Supply Chain Initiative under support of the DHS Office of University Programs and under the leadership