# DIMAP Seminars

The DIMAP seminar is a regular event of the Centre for Discrete Mathematics and its Applications. The talks are usually held from 2-3 pm on Mondays on Zoom.

For a related Combinatorics Seminar, please see its web page.

For related Oxford-Warwick Complexity Meetings, please see its web page.

- Other interesting lists of online seminars in related areas include CS Theory talks, Combinatorics lectures online (Fox and Seymour), and Math seminars.

An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions

Prophet inequalities compare the expected performance of an online algorithm for a stochastic optimization problem to the expected optimal solution in hindsight. They are a major alternative to classic worst-case competitive analysis, of particular importance in the design and analysis of simple (posted-price) incentive compatible mechanisms with provable approximation guarantees.

A central open problem in this area concerns subadditive combinatorial auctions. Here n agents with subadditive valuation functions compete for the assignment of m items. The goal is to find an allocation of the items that maximizes the total value of the assignment. The question is whether there exists a prophet inequality for this problem that significantly beats the best known approximation factor of O(log m).

We make major progress on this question by providing an O(log log m) prophet inequality. Our proof goes through a novel primal-dual approach. It is also constructive, resulting in an online policy that takes the form of static and anonymous item prices that can be computed in polynomial time given appropriate query access to the valuations. As an application of our approach, we construct a simple and incentive compatible mechanism based on posted prices that achieves an O(log log m) approximation to the optimal revenue for subadditive valuations under an item-independence assumption.

Better-Than-2 Approximations for Weighted Tree Augmentation

The Weighted Tree Augmentation Problem (WTAP) is one of the most basic connectivity augmentation problems. It asks how to increase the edge-connectivity of a given graph from 1 to 2 in the cheapest possible way by adding some additional edges from a given set. There are many standard techniques that lead to a 2-approximation for WTAP, but despite much progress on special cases, the factor 2 remained unbeaten for several decades.

In this talk we present two algorithms for WTAP that improve on the longstanding approximation ratio of 2. The first algorithm is a relative greedy algorithm, which starts with a simple, though weak, solution and iteratively replaces parts of this starting solution by stronger components. This algorithm achieves an approximation ratio of (1 + ln 2 + epsilon) < 1.7. Second, we present a local search algorithm that achieves an approximation ratio of 1.5 + epsilon (for any constant epsilon>0).

This is joint work with Rico Zenklusen.

Fair division of indivisible goods

Fair division of goods is a fundamental problem in many disciplines, including computer science, economics, and social choice theory. In the context of indivisible goods, envy-freeness up to any good (EFX) has emerged as a compelling fairness notion. However, its existence has not been settled yet and is considered one of the most important problems in fair division. In this talk, I will present some recent progress in this direction based on the two papers https://arxiv.org/abs/2002.05119 and https://arxiv.org/abs/2103.01628.

**Slides**

Local problems on grids

A \emph{locally checkable labeling (LCL) problems} are graph problems where a validity of a solution can be checked locally. Examples include proper vertex or edge colorings, perfect matching etc. Such problems have been studied from different points of view. Most important for our investigation is the perspective of distributed computing (the LOCAL model) and random processes (finitary fiids).

In this talk, I will illustrate the connection between these two areas in the setting when the underlying graph is a $d$-dimensional grid (for $d>1$). Known results about proper vertex colorings in both areas show striking similarity:

(1) [Brandt at el 2017] in the LOCAL model $3$-coloring is a global problem and $4$-coloring is solvable in $O(\log^* n)$-rounds,

(2) [Holroyd at el 2017] the coding radius of any finitary fiid $3$-coloring has the second moment infinite and $4$-coloring is solvable as a finitary fiid with tower tail decay.

I will discuss these results in a great detail, precisely formulate the connection between the areas and use the approach from the theory of random processes to describe a finer complexity hierarchy for LCLs than the distributed setting (where the classification is complete) can offer.

All of this is a joint work with Vasek Rozhon.

An optimal approximation algorithm for Feedback Vertex Set in Tournaments

In the Feedback Vertex Set problem, given a directed graph G, the task is to remove a minimum number of vertices to make it acyclic. Even when restricted to the class of Tournaments, i.e. complete directed graphs, this problem remains NP-Complete. It is easy to show that the problem admits a 3-approximation algorithm, and under the Unique Games Conjecture it cannot have a better than 2-approximation. Previous results improving upon the 3-approximation were highly non-trivial, and it was a long-standing open problem to obtain a 2-approximation for it. In this work we give a simple randomized algorithm to resolve this question.

**Slides**

De Bruijn Sequence Constructions: Old and New

A de Bruijn sequence of order n is a circular string of length 2^n that contains every binary string of length n exactly once. For example, the circular string 00010111 is a suitable example for n = 3, since its substrings of length 3 are 000, 001, 010, 101, 011, 111, 110, 100 (where the final two substrings wrap-around). Flye Sainte-Marie proved that these sequences exist for all n in 1894.

In the first half of this talk, we’ll discuss five different methods for constructing de Bruijn sequences. For each approach, we’ll provide its pros and cons, along with history, applications, and related results. For example, in the 1960s, Golomb provided a mathematical characterization of maximal length linear feedback shift registers, and they have been used for pseudorandom number generation in classic video games dating back to Pitfall! (1982). As another example, Martin provided a greedy algorithm for constructing these sequences in 1934, but the resulting sequences are not suitable for pseudorandom number generation.

In the second half of the talk, we’ll consider the analogous concept for sets of fixed-content strings, including the permutations of [n], the binary strings of length n and weight w, and the permutations of a given multiset. We provide the first general construction for the latter by applying the necklace prefix algorithm (also known as the FKM algorithm) to cool-lex order. We’ll also discuss how our shorthand universal cycle for fixed-content strings can speed up brute force calculations for combinatorial optimization problems including the stacker crane problem.

This is joint work with Joe Sawada (University of Guelph) and the new results can be found on debruijnsequence.org.

**Slides**

Deterministic Rounding of Dynamic Fractional Matchings

We present a framework for deterministically rounding a dynamic fractional matching. Applying our framework in a black-box manner on top of existing fractional matching algorithms, we derive the following new results: (1) The first deterministic algorithm for maintaining a $(2-\delta)$-approximate maximum matching in a fully dynamic bipartite graph, in arbitrarily small polynomial update time. (2) The first deterministic algorithm for maintaining a $(1+\delta)$-approximate maximum matching in a decremental bipartite graph, in polylogarithmic update time. (3) The first deterministic algorithm for maintaining a $(2+\delta)$-approximate maximum matching in a fully dynamic general graph, in small polylogarithmic (specifically, $O(\log^4 n)$) update time. These results are respectively obtained by applying our framework on top of the fractional matching algorithms of Bhattacharya et al. [STOC'16], Bernstein et al. [FOCS'20], and Bhattacharya and Kulkarni [SODA'19].

Prior to our work, there were two known general-purpose rounding schemes for dynamic fractional matchings. Both these schemes, by Arar et al. [ICALP'18] and Wajc [STOC'20], were randomized.

Our rounding scheme works by maintaining a good matching-sparsifier with bounded arboricity, and then applying the algorithm of Peleg and Solomon [SODA'16] to maintain a near-optimal matching in this low arboricity graph. To the best of our knowledge, this is the first dynamic matching algorithm that works on general graphs by using an algorithm for low-arboricity graphs as a black-box subroutine. This feature of our rounding scheme might be of independent interest.

This is joint work with Peter Kiss.

**Slides**

A Computational Perspective on Fragments of the Dynamic Logic of Propositional Assignments

We examine DL-PA, a PSPACE-complete restriction of Propositional Dynamic Logic (PDL). DLPA is logical formalism that combines logic, programming and non-determinism constructs. By looking at a few syntactic fragments of DLPA, we observe that the complexity comes from two directions: alternation and iteration, and we build accordingly reductions to and from Quantified Boolean Formulas and Deterministic Planning. We further identify natural fragments of DLPA that correspond to complexity classes of the polynomial hierarchy.

**Slides**

Convergence of square tilings to the Riemann map

A well-known theorem of Rodin and Sullivan, previously conjectured by Thurston, states that the circle packing of the intersection of a lattice with a simply connected planar domain Ω into the unit disc D converges to a Riemann map from Ω to D when the mesh size converges to 0. An analogous statement holds when circle packings are replaced by the square tilings of Brooks et al. The latter provides an algorithm for the approximation of the Riemann map from an arbitrary domain. The theory of random walks and electrical networks comes into play.

Joint work with Christoforos Panagiotis (Geneva).

Linearly sized induced odd subgraphs

A classical result of Gallai from the sixties asserts that the vertex set V of every graph G can be partitioned into two parts V_1, V_2, each spanning an induced subgraph with all degrees even. It follows that every n-vertex graph contains an induced subgraph on at least n/2 vertices with even degrees.

What can be said about the odd case? It is quite easy to see that the odd analog of Gallai's theorem cannot hold in full generality. Hence instead of an even-even partition we can ask for a large induced subgraph of G with all degree odd. Also, since an isolated vertex is never a part of any odd graph, we need to forbid isolated vertices.

A decades old conjecture suggested that every graph G on n vertices of positive minimum degree contains a subset V_0 of size linear in n, with all degrees in the induced subgraph G[V_0] being odd.

Recently, in a joint work with Asaf Ferber we managed to prove this conjecture. In this talk I will discuss the problem, its background and main ingredients of the proof.

**Slides**

Positive spectrahedrons: Geometric properties, Invariance principles and Pseudorandom generators

In a recent work, O'Donnell, Servedio and Tan (STOC 2019) gave explicit pseudorandom generators (PRGs) for arbitrary m-facet polytopes in n variables with seed length poly-logarithmic in m,n, concluding a sequence of works in the last decade, that was started by Diakonikolas, Gopalan, Jaiswal, Servedio, Viola (SICOMP 2010) and Meka, Zuckerman (SICOMP 2013) for fooling linear and polynomial threshold functions, respectively. In this work, we consider a natural extension of PRGs for intersections of positive spectrahedrons. A positive spectrahedron is a Boolean function f(x)=[x_1 A_1+...+x_n A_ n \preceq B] where the A_i s are k × k positive semidefinite matrices. We construct explicit PRGs that \delta-fool "regular" width-M positive spectrahedrons (i.e., when none of the A_i s are dominant) over the Boolean space with seed length poly(log k,log n,M,1/\delta).

Our main technical contributions are the following: We first prove an invariance principle for positive spectrahedrons via the well-known Lindeberg method. As far as we are aware such a generalization of the Lindeberg method was unknown. Second, we prove various geometric properties of positive spectrahedrons such as their noise sensitivity, Gaussian surface area and a Littlewood-Offord theorem for positive spectrahedrons. Using these results, we give applications for constructing PRGs for positive spectrahedrons, learning theory, discrepancy sets for positive spectrahedrons (over the Boolean cube) and PRGs for intersections of structured polynomial threshold functions.

Joint work with Penghui Yao and available at https://arxiv.org/abs/2101.08141

**Slides**

Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications

We give the first non-trivial fully dynamic probabilistic tree embedding algorithm for weighted graphs undergoing edge insertions and deletions. We obtain a trade-off between amortized update time and expected stretch against an oblivious adversary. At the two extremes of this trade-off, we can maintain a tree of expected stretch O(log^{4} n) with update time m^{1/2+o(1)} or a tree of expected stretch n^{o(1)} with update time n^{o(1)}.

Our main result has direct implications to fully dynamic approximate distance oracles and fully dynamic buy-at-bulk network design. For the former, our result is the first to break the O(m^{1/2}) update-time barrier. For the latter, a problem whose static solution heavily relies on probabilistic tree embeddings, we give the first non-trivial dynamic algorithm. As probabilistic tree embeddings are an important tool in static approximation algorithms, further applications of our result in dynamic approximation algorithms are conceivable. From a technical perspective, we obtain our main result by first designing a decremental algorithm for probabilistic low-diameter decompositions via a careful combination of Bartal's ball-growing approach [FOCS '96] with the pruning framework of Chechik and Zhang [SODA '20]. We then extend this to a fully dynamic algorithm by enriching a well-known 'decremental to fully dynamic' reduction with a new bootstrapping idea to recursively employ a fully dynamic algorithm instead of a static one.

This is joint work with Sebastian Forster and Monika Henzinger.

**Slides**

Thresholds

Thresholds for increasing properties are a central concern in probabilistic combinatorics and elsewhere. (An increasing property, say F, is a superset-closed family of subsets of some [here finite] set X, and the "threshold question" for such an F asks, roughly, about how many random elements of X should one choose to make it likely that the resulting set lies in F? For example: about how many random edges from the complete graph on n vertices are typically required to produce a Hamiltonian cycle?).

We will try to give some brief perspective on this area and mention a few recent highlights.

Low-Rank Binary Matrix Approximation in Column-Sum Norm

We consider $\ell_1$-Rank-$r$ Approximation over GF(2), where for a binary $m\times n$ matrix ${\bf A}$ and a positive integer constant $r$, one seeks a binary matrix ${\bf B}$ of rank at most $r$, minimizing the column-sum norm $\| {\bf A} -{\bf B}\|_1$. We show that for every $\varepsilon\in (0, 1)$, there is a randomized $(1+\varepsilon)$-approximation algorithm for $\ell_1$-Rank-$r$ Approximation over GF(2) of running time $m^{O(1)}n^{O(2^{4r}\cdot \varepsilon^{-4})}$. This is the first polynomial-time approximation scheme (PTAS) for this problem.

**Slides**

Reducing Path TSP to TSP

We present a black-box reduction from the path version of the Traveling Salesman Problem (Path TSP) to the classical tour version (TSP). This reduction implies that the approximability of Path TSP is the same as for TSP, up to an arbitrarily small error, and allows for obtaining the currently strongest approximation factors for both Path TSP and its unit-weight special case. Moreover, our reduction avoids future discrepancies between best known approximation factors for TSP and its path version, as they have existed until very recently.

We obtain our results through a variety of new techniques, including a novel way to set up a recursive dynamic program to guess significant parts of an optimal solution. At the core of our dynamic program, we deal with instances of a new generalization of (Path) TSP, which combines parity constraints with certain connectivity requirements. This generalization can be reduced to TSP in certain cases when the dynamic program would not make sufficient progress.

This is joint work with Vera Traub and Jens Vygen.

**Slides**

Adaptive gradient descent methods for constrained optimization

Adaptive gradient descent methods, such as the celebrated Adagrad algorithm (Duchi, Hazan, and Singer; McMahan and Streeter) and ADAM algorithm (Kingma and Ba), are some of the most popular and influential iterative algorithms for optimizing modern machine learning models. Algorithms in the Adagrad family use past gradients to set their step sizes and are remarkable due to their ability to automatically adapt to unknown problem structures such as (local or global) smoothness and convexity. However, these methods achieve suboptimal convergence guarantees even in the standard setting of minimizing a smooth convex function, and it has been a long-standing open problem to develop an accelerated analogue of Adagrad in the constrained setting.

In this talk, we present one such accelerated adaptive algorithm for constrained convex optimization that simultaneously achieves optimal convergence in the smooth, non-smooth, and stochastic setting, without any knowledge of the smoothness parameters or the variance of the stochastic gradients.

The talk is based on joint work with Huy Nguyen (Northeastern University) and Adrian Vladu (CNRS & IRIF, University de Paris), available here: https://arxiv.org/abs/2007.08840

**Slides**

Size-Ramsey numbers of powers of tight paths

The s-colour size-Ramsey number of a hypergraph H is the minimum number of edges in a hypergraph G whose every s-edge-colouring contains a monochromatic copy of H. We show that for every r, s, t, the s-colour size-Ramsey number of the t-power of a tight r-uniform path on n vertices is O(n), answering a question of Dudek, La Fleur, Mubayi, and Rödl (2017).

This is joint work with Alexey Pokrovskiy and Liana Yepremyan.

**Slides**

**Video**

Adjacency Labelling for Planar Graphs

In this talk, I will present an adjacency labelling scheme for planar graphs where each vertex of an n-vertex planar graph G is assigned a (1+o(1))\log_2 n-bit label and the labels of two vertices u and v are sufficient to determine if uv is an edge of G. This is optimal up to the lower order term and is the first such asymptotically optimal result. The scheme relies on the recent Product Structure Theorem for planar graphs.

Joint work with Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, and Pat Morin. Available on arXiv: https://arxiv.org/abs/2003.04280

**Slides**

**Video**

Secure Quantum Computation over Classical Networks

The past few decades have seen inexorable progress in classical and quantum computing, and outsourcing computation to a powerful server (i.e. the cloud) has become more common than ever. Given the higher cost, the difficulty involved in engineering and operating a universal quantum computer, we can imagine the setting of cloud computing to be even more relevant in the quantum world.

While delegating calculations to quantum computers in the cloud seems promising, it raises an inevitable concern: How can a user ensure the privacy of their data and at the same time verify that the output is indeed correct?

In this talk, I will discuss recent progress, limitations, and challenges in secure quantum computations over classical networks. In particular, I will talk about secure remote state preparation (RSP) - a cryptographic primitive - that enable a classical user to remotely prepare a quantum state on the quantum server, using only a classical communication channel. RSP is, therefore, an important candidate to replace quantum channel in many cryptographic protocols, in a modular fashion. I will (at a high level) talk about constructions of RSP using the Learning-With-Errors problem, their security in composable framework, and their applications in delegated quantum computation and two-party quantum computation over a classical channel.

This talk is based on joint works with Christian Badertscher, Michele Ciampi, Alexandru Cojocaru, Léo Colisson, Elham Kashefi, Dominik Leichtle, Petros Wallden.

**Slides**

**Video**

Recent Applications of Expanders to Graph Algorithms

Expanders enable us to make exciting progress in several areas of graph algorithms in the last few years. As examples, we show

(1) the first deterministic almost-linear time algorithms for solving Laplacian systems and computing approximate max flow (previous fast algorithms are randomized Monte Carlo),

(2) the first deterministic dynamic connectivity algorithm with subpolynomial worst-case update time (previous deterministic algorithms take \Omega(sqrt{n}) update time),

(3) the first near-linear time algorithm for computing an exact maximum bipartite matching in moderately dense graphs (previous algorithms take strictly superlinear time), and

(4) the first non-trivial example of distributed algorithms in the CONGEST model whose round-complexity matches the bound in the stronger CONGESTED CLIQUE model with no locality constraint.

I will describe the key expander-related tools behind these applications and explain how to use them at a high-level. I will conclude with a list of open problems.

This survey talk is based on joint works with many people including Aaron Bernstein, Jan van den Brand, Yi-Jun Chang, Julia Chuzhoy, Yu Gao, Gramoz Goranci, Maximilian Probst Gutenberg, Yin Tat Lee, Jason Li, Danupon Nanongkai, Richard Peng, Harald Räcke, Aaron Sidford, Zhao Song, He Sun, Zihan Tan, Di Wang, and Christian Wulff-Nilsen.

**Slides**

**Video**

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms

We introduce a notion for hierarchical graph clustering which we call the expander hierarchy and show a fully dynamic algorithm for maintaining such a hierarchy on a graph with n vertices undergoing edge insertions and deletions using n^{o(1)} update time. An expander hierarchy is a tree representation of graphs that faithfully captures the cut-flow structure and consequently our dynamic algorithm almost immediately implies several results including:

(1) The first fully dynamic algorithm with n^{o(1)} worst-case update time that allows querying n^{o(1)}-approximate conductance, s-t maximum flows, and s-t minimum cuts for any given (s,t) in O(\log^{1/6} n) time. Our results are deterministic and extend to multi-commodity cuts and flows. The key idea behind these results is a fully dynamic algorithm for maintaining a tree flow sparsifier, a notion introduced by Räcke [FOCS'02] for constructing competitive oblivious routing schemes.

(2) A deterministic fully dynamic connectivity algorithm with n^{o(1)} worst-case update time. This significantly simplifies the recent algorithm by Chuzhoy et al.~that uses the framework of Nanongkai et al. [FOCS'17].

(3) The first non-trivial deterministic fully dynamic treewidth decomposition algorithm on constant-degree graphs with n^{o(1)} worst-case update time that maintains a treewidth decomposition of width tw(G) n^{o(1)} where tw(G) denotes the treewidth of the current graph.

This is joint work with Gramoz Goranci, Thatchaphol Saranurak, and Zihan Tan.

**Slides**

**Video**

Near-Optimal Algorithms for Approximate Min-Cost Flow and Dynamic Shortest Paths

In the decremental single-source shortest paths problem, the goal is to maintain distances from a fixed source s to every vertex v in a graph undergoing deletions. In this paper, we conclude a long line of research on this problem by showing a near-optimal deterministic data structure that maintains $(1+\epsilon)$-approximate distance estimates and runs in $m^{1+o(1)}$ total update time.

Our result, in particular, removes the oblivious adversary assumption required by the previous breakthrough result by Henzinger et al. FOCS'14], which leads to our second result: the first almost-linear time algorithm for $(1-\epsilon)$-approximate min-cost flow in undirected graphs where capacities and costs can be taken over edges and vertices. Previously, algorithms for max flow with vertex capacities, or min-cost flow with any capacities required super-linear time. Our result essentially completes the picture for approximate flow in undirected graphs.The key technique of the first result is a novel framework that allows us to treat low-diameter graphs like expanders. This allows us to harness expander properties while bypassing shortcomings of expander decomposition, which almost all previous expander-based algorithms needed to deal with. For the second result, we break the notorious flow-decomposition barrier from the multiplicative-weight-update framework using randomization.

**Slides**

**Video**

Equiangular lines, spherical two-distance sets, and spectral graph theory

Solving a longstanding problem on equiangular lines, we determine, for each given fixed angle and in all sufficiently large dimensions, the maximum number of lines pairwise separated by the given angle. The answer is expressed in terms of spectral radii of graphs. Generalizing to spherical two-distance sets, we conjecturally relate the problem to a certain eigenvalue problem for signed graphs, and solve it in a number of cases. A key ingredient is a new result in spectral graph theory: the adjacency matrix of a connected bounded degree graph has sublinear second eigenvalue multiplicity. Joint work with Zilin Jiang, Jonathan Tidor, Yuan Yao, and Shengtong Zhang (all MIT)

https://arxiv.org/abs/1907.12466

https://arxiv.org/abs/2006.06633

**Slides**

Approximating pathwidth for graphs of small treewidth

It is well known that the complete binary tree of height h has pathwidth ⌈h/2⌉ and every graph with pathwidth at least 2^(h+1)−2 contains a subdivision of such a tree. Kawarabayashi and Rossman (SODA'18) conjectured that for some universal constant c, every graph with pathwidth Ω(h^c) has treewidth at least h or contains a subdivision of a complete binary tree of height h. We show that this conjecture holds with c=2. Furthermore, we describe a polynomial-time algorithm which, given a graph G and a tree decomposition of G of width t−1, constructs a path decomposition of G of width at most th+1 and a subdivision of a complete binary tree of height h in G, for some appropriately chosen h. This algorithm, combined with the O(sqrt(log(tw)))-approximation algorithm for treewidth due to Feige, Hajiaghayi and Lee (STOC'05), yields an O(tw·sqrt(log(tw)))-approximation algorithm for pathwidth, which is the first algorithm with approximation ratio depending only on the treewidth. This is joint work with Carla Groenland, Gwenaël Joret, and Wojciech Nadara.

Hierarchical decompositions in dynamic graph algorithms

A dynamic graph algorithm is a data structure that maintains a graph property while the graph undergoes a sequence of edge updates. In dynamic graph algorithms with polylogarithmic time per operation a hierarchical graph decomposition is typically maintained. We present various such hierarchies and the different types of invariants used to maintain them efficiently. They lead to very fast dynamic algorithms for connectivity, approximate matching, vertex cover, densest subgraph and set cover as well as for (Delta+1)-vertex coloring.

Problems around Helly theorem

**Video**

Clique factors in randomly perturbed graphs (and related questions)

We study the model of randomly perturbed dense graphs, which is the union of any n-vertex graph G_\alpha with minimum degree at least \alpha n and the binomial random graph G(n,p). In this talk, we shall start off from the following question in this area: When does G_\alpha \cup G(n,p) contain a clique factors, i.e. a spanning subgraph consisting of vertex disjoint copies of the complete graph K_k? We offer a number of new results, as well as a number of interesting questions.

Joint work with Olaf Parczyk, Amedeo Sgueglia and Jozef Skokan.

**Slides**

**Video**

Solving hard cut problems via flow augmentation

Joint work with Eunjung Kim, Stefan Kratsch and Marcin Pilipczuk.

I present a procedure for what we call flow augmentation: Given an undirected graph G=(V,E) with vertices s, t and an unknown (s,t)-edge cut Z of cardinality k=|Z|, our procedure returns an augmented graph G'=G+A (augmented by a set A of additional edges) such that with some probability depending only on k, Z is an (s,t)-min cut in G'. Our procedure runs in linear time and has success probability 1/f(k) where f(k)=2^{O(k log k)}.

This gives a simple, powerful tool for the design of FPT algorithms for graph cut problems; i.e., algorithms for NP-hard problems whose running time is bounded by f(k)*poly(n) where k is a problem parameter.

As an application, we consider the Min SAT(\Gamma) family of CSP-like optimization problems, parameterized by the solution cost. This is a generic family of optimization problems that includes problems such as Edge Bipartization, Almost 2-SAT and the infamous l-Chain SAT problem. We show that every such problem falls into one of three classes:

(1) FPT, using flow-augmentation techniques

(2) W[1]-hard, thus unlikely to be FPT, or

(3) as hard as directed graph cuts, hence out of scope for our framework.

In particular, the positive result here requires designing an FPT algorithm for a problem we call Coupled Min-Cut, which is a natural but challenging problem that seems resistant to all previous approaches.

In the talk, I present the flow-augmentation procedure, and give the main outlines of the applications.

**Slides**

**Video**

Revisiting Tardos's framework for linear programming: faster exact solutions using approximate solvers

In 1986, Eva Tardos showed that solving an LP of the form min c x s.t. Ax=b, x>=0 for an integer constraint matrix A can be reduced to solving O(mn) LPs in A having small integer coefficient objectives and right-hand sides using any exact LP algorithm. In this work, we give a substantially improved framework, in which we remove the integrality requirement of A, using a dependence on a certain condition measure. We can also replace the exact LP solves with approximate ones, enabling us to directly leverage the tremendous recent algorithmic progress for approximate linear programming. The talk will emphasise the underlying proximity results and introduce the ‘circuit imbalance measure’, a particularly convenient condition measure in this context. This is joint work with Daniel Dadush and Bento Natura.

**Slides**

**Video**

Permutation Patterns

An occurrence of a permutation pattern in a permutation (resp., word) is a subsequence of the permutation (resp., word) whose elements appear in the same relative order of size as the elements in the pattern. Permutation patterns are a very active area of research with a long history and an annual conference since 2003. The field is growing at rate of about 100 papers per year, and it is becoming more and more difficult to keep track of the modern trends.

In this talk, I will introduce several (but not all!) of the notions of permutation patterns appearing in the literature, and will present a number of open problems including less familiar ones. References to the original sources will be given. For example, we will briefly discuss one of the most intriguing open questions on the number of permutations of length n avoiding the pattern 1324. We do not even know the asymptotics of the growth rate for the numbers.

**Slides**

**Video**

Trees on Trees

We consider a natural notion of search trees on graphs, which we show is ubiquitous in various areas of discrete mathematics and computer science. Search trees on graphs can be modified by local operations called rotations, which generalize rotations in binary search trees. The rotation graph of search trees on a graph G is the skeleton of a polytope called the graph associahedron of G. The special case of binary search trees and the classical associahedron is obtained when the graph G is a path. We consider the case where G is a tree.

We prove that the worst-case diameter of tree associahedra is \Theta(n log n), which answers a question from Thibault Manneville and Vincent Pilaud.

We also consider the use of search trees on trees as online adaptive data structures for searching elements of a tree-structured space. We describe an online O(log log n)-competitive search tree data structure, matching the best known competitive ratio of binary search trees.

Based on joint works with Stefan Langerman and Pablo Pérez-Lantero (E-JC 2018), and with Jit Bose, John Iacono, Greg Koumoutsos, and Stefan Langerman (SODA 2020).

**Slides**

**Video**

Connectivity threshold in random temporal graphs

A temporal graph is a pair (G, t), where G is a graph and t is a function that assigns to every edge of G a discrete set of timestamps (say, natural numbers) at which this edge is available. A sequence (v_0v_1, t_1), (v_1v_2, t_2), …, (v_{k-1} v_k, t_k) is a temporal (v_0,v_k)-path if (v_0,v_1, …, v_k) is path in G and t_1 < t_2 < … < t_k.

A temporal graph is temporally connected if every vertex of the temporal graph can reach any other vertex by a temporal path. In the case of static graphs, any connected graph contains a connected spanning subgraph with a linear number of edges. This does not hold for temporal graphs and the minimum number of edges in a temporally connected spanning subgraph depends on the host temporal graph.

Motivated by this distinction, we study temporal connectivity of random temporal graphs. More specifically, we consider a model of random simple temporal graphs (i.e. temporal graphs in which all timestamps are pairwise different and every edge is assigned exactly one timestamp), which are also known as edge ordered graphs. In this model the graph G is an Erdős–Rényi random graph G(n,p) and t is an ordering of the edges of G chosen uniformly at random.

We establish a threshold function for being temporally connected which is of the same order as the corresponding function for static graphs. Namely, we show that for p > (4+o(1)) log(n)/n a random temporal graph is temporally connected a.a.s., while for p < (2 - o(1)) log(n)/n a random temporal graph is not temporally connected a.a.s.

Joint work with Arnaud Casteigts, Michael Raskin, and Malte Renken.

**Slides**

Walking Randomly, Massively, and Efficiently

It is easy to generate random walks of length L in O(L) rounds of the Massively Parallel Computation model, which was inspired by practical distributed processing systems such as MapReduce. We show how to generate them from all vertices simultaneously in O(poly(log L + log n)) rounds, even for directed graphs, where n is the number of vertices in the input graph. Our algorithm works in the most restrictive version of the model, in which local space per machine is strongly sublinear in the number of vertices.

In this talk I will first introduce a relatively simple O(log L)-round algorithm for undirected graphs and discuss its applications to property testing and computing PageRank on undirected graphs. Next I will sketch a series of transformations that allow for extending this result first to directed PageRank and then to random walks in directed graphs.

Joint work with Jakub Lacki, Slobodan Mitrovic, and Piotr Sankowski.

**Slides**

Edit Distance in Near-Linear Time: it’s a Constant Factor

We present an algorithm for approximating the edit distance between two strings of length n in time n^{1+epsilon}, for any positive epsilon, up to a constant factor. Our result completes the research direction set forth in the recent breakthrough paper of Chakraborty-Das-Goldenberg-Koucky-Saks (FOCS'18), who showed the first constant-factor approximation algorithm with a (strongly) sub-quadratic running time. Several recent results have shown near-linear complexity under different restrictions on the inputs (eg, when the edit distance is close to maximal, or when one of the inputs is pseudo-random). In contrast, our algorithm obtains a constant-factor approximation in near-linear running time for any input strings.

Joint work with Negev Shekel Nosatzki, available at https://arxiv.org/abs/2005.07678.

**Slides: **[ppt] ,[pdf]

Parameterized Analysis, Graph Minors and Planar Disjoint Paths

Parameterized Anaylsis leads both to deeper understanding of intractability results and to practical solutions for many NP-hard problems. Informally speaking, Parameterized Analysis is a mathematical paradigm to answer the following fundamental question: What makes an NP-hard problem hard? Specifically, how do different parameters (being formal quantifications of structure) of an NP-hard problem relate to its inherent difficulty? Can we exploit these relations algorithmically, and to which extent? Over the past three decades, Parameterized Analysis has grown to be a mature field of outstandingly broad scope with significant impact from both theoretical and practical perspectives on computation.

In this talk, I will first give a brief introduction of the field of Parameterized Analysis and to the Graph Minors theory as its origin. Additionally, I will zoom into a specific result, namely, the first single-exponential time parameterized algorithm for the Disjoint Paths problem on planar graphs. An efficient algorithm for the Disjoint Paths problem in general, and on "almost planar" graphs in particular, is a critical part in the quest for the establishment of an Efficient Graph Minors Theory. As the Graph Minors Theory is the origin of Parameterized Analysis and ubiquitous in the design of parameterized algorithms, making this theory efficient is a holy grail in the field.

**Slides**

Semi-Algebraic Proofs and the tau-Conjecture: Can a Natural Number be Negative?

We introduce the binary value principle which is a simple subset-sum instance expressing that a natural number written in binary cannot be negative, relating it to central problems in proof and algebraic complexity. We prove conditional superpolynomial lower bounds on the Ideal Proof System (IPS) refutation size of this instance, based on a well-known hypothesis by Shub and Smale about the hardness of computing factorials, where IPS is the strong algebraic proof system introduced by Grochow and Pitassi (2014). Conversely, we show that short IPS refutations of this instance bridge the gap between sufficiently strong algebraic and semi-algebraic proof systems. Our results extend to full-fledged IPS the paradigm introduced in Forbes, Shpilka, Tzameret and Wigderson (2016), whereby lower bounds against subsystems of IPS were obtained using restricted algebraic circuit lower bounds, and demonstrate that the binary value principle captures the advantage of semi-algebraic over algebraic reasoning, for sufficiently strong systems.

Joint work with Yaroslav Alekseev, Dima Grigoriev and Edward A. Hirsch.

**Slides **[ppt (recommended), pdf]

Derandomization and Circuit Lower Bounds in an Exponentially-Hard (Uniform) World

Exponential-time hypotheses -- variants of the classical ETH -- have become widely influential in the last decade. In this talk we will show that even relatively-mild variants of exponential-time hypotheses have far-reaching implications to derandomization, to circuit lower bounds, and to the connections between the two. We will discuss two results in the talk:

1. The Randomized Exponential-Time Hypothesis (rETH) implies that BPP can be simulated deterministically (in average-case and infinitely-often) in nearly-polynomial-time, i.e. in time $2^{\tilde{O}(log n)}$. This significantly improves the state-of-the-art in uniform "hardness-to-randomness" results.

2. The Non-Deterministic Exponential-Time Hypothesis (NETH), and even very weak versions of it, imply that worst-case derandomization of BPP is completely equivalent to circuit lower bounds against E=DTIME[2^{O(n)}]; in particular, under these hypotheses pseudorandom generators are necessary for derandomization. This provides appealing evidence that the equivalence indeed holds.

The talk is based on a joint work with Lijie Chen, Ron Rothblum, and Eylon Yogen.

**Slides**

The Complexity of Quantified Constraints

We elaborate the complexity of the Quantified Constraint Satisfaction Problem, QCSP(A), where A is a finite idempotent algebra. Such a problem is either in NP or is co-NP-hard, and the borderline is given precisely according to whether A enjoys the polynomially-generated powers (PGP) property. This completes the complexity classification problem for QCSPs modulo that co-NP-hard cases might have complexity rising up to Pspace-complete. Our result requires infinite languages, but in this realm represents the proof of a slightly weaker form of a conjecture for QCSP complexity made by Hubie Chen in 2012. The result relies heavily on the algebraic dichotomy between PGP and exponentially-generated powers (EGP), proved by Dmitriy Zhuk in 2015, married carefully to previous work of Chen. Finally, we discuss some recent work with Zhuk in which the aforementioned Chen Conjecture is actually shown to be false. Indeed, the complexity landscape for QCSP(B), where B is a finite constraint language, is much richer than was previously thought.

**Slides**

Solving Large Scale Semidefinite Problems by Decomposition

Standard semidefinite optimization solvers exercise high computational complexity when applied to problems with many variables and a large semidefinite constraint. To avoid this unfavourable situation, we use results from the graph theory that allow us to equivalently replace the original large-scale matrix constraint by several smaller constraints associated with the subdomains. This leads to a significant improvement in efficiency. We will further strengthen the standard approach for a special class of arrow matrices. We will demonstrate that these reformulations are particularly suitable for problems of topology optimization with vibration or global buckling constraints.

**Slides**

An asymptotic version of the prime power conjecture for perfect difference sets

A subset D of a finite cyclic group Z/mZ is called a "perfect difference set" if every nonzero element of Z/mZ can be written uniquely as the difference of two elements of D. If such a set exists, then a simple counting argument shows that m=n^2+n+1 for some nonnegative integer n. Singer constructed examples of perfect difference sets in Z/(n^2+n+1)Z whenever n is a prime power, and it is an old conjecture that these are the only such n for which a perfect difference set exists. In this talk, I will discuss a proof of an asymptotic version of this conjecture: the number of n less than N for which Z/(n^2+n+1)Z contains a perfect difference set is asymptotically the number of prime powers less than N.

Counting complexity and quantum information theory

In computational counting problems, the goal of a computation is to determine the number of solutions to some problem specified by a number of constraint functions. More generally, each constraint function may be weighted, and the goal is to determine the total weight of all solutions. The holant framework formalises a broad family of such counting problems in order to analyse their computational complexity. In this talk, I show how some of the mathematical properties of constraint functions that determine the complexity of a holant problem are equivalent to properties of quantum states that are of independent interest in quantum information theory. I then use results from quantum theory to classify the (classical, i.e. non-quantum) complexity of several families of holant problems.

**Slides**

Euler-tours of low-height toroidal grids

The problem of exactly counting the Euler tours (ETs) of an (undirected) 4-regular graph is known to be #P-complete, and to date no fpras exists for approximate counting. The natural “Kotzig moves” Markov chain converges to the uniform distribution on Euler tours of the given graph, but attempts to show rapid mixing (even for restricted classes of graphs) have been unsuccessful.

For the specific case of a toroidal grid with a constant number of rows k, a “transfer matrix” can be defined and used to exactly count Euler tours of that grid. We show that we can use some of that same structure to prove rapid mixing of the Kotzig moves chain on 2-rowed toroidal grids, and discuss the issues for higher number of rows.

(Joint work with Sophia Jones. I will touch on the details of the transfer matrix method for ETs, which was joint with Creed, Astefanoaei, and Marinov).

Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization

We prove that for all constants a, NQP = NTIME[n^polylog(n)] cannot be (1/2 + 2^(-log^a n) )-approximated by 2^(log^a n)-size ACC^0 circuits. Previously, it was even open whether E^NP can be (1/2+1/sqrt(n))-approximated by AC^0[2] circuits. As a straightforward application, we obtain an infinitely often non-deterministic pseudorandom generator for poly-size ACC^0 circuits with seed length 2^{log^eps n}, for all eps > 0.

More generally, we establish a connection showing that, for a typical circuit class C, non-trivial nondeterministic CAPP algorithms imply strong (1/2 + 1/n^{omega(1)}) average-case lower bounds for nondeterministic time classes against C circuits. The existence of such (deterministic) algorithms is much weaker than the widely believed conjecture PromiseBPP = PromiseP.

Our new results build on a line of recent works, including [Murray and Williams, STOC 2018], [Chen and Williams, CCC 2019], and [Chen, FOCS 2019]. In particular, it strengthens the corresponding (1/2 + 1/polylog(n))-inapproximability average-case lower bounds in [Chen, FOCS 2019]. The two important technical ingredients are techniques from Cryptography in NC^0 [Applebaum et al., SICOMP 2006], and Probabilistic Checkable Proofs of Proximity with NC^1-computable proofs.

This is joint work with Hanlin Ren from Tsinghua University.

An updating method for geometric data structures

We present the "micro-to-macro" updating method for dynamic data structures in the word-RAM model. Its application to dynamic planar orthogonal range reporting (report the input points within any given query rectangle) [JoCG'18] and point location (vertical ray shooting: report the lowest input horizontal line segment above any give query point) [SoCG'18] has achieved significantly sublogarithmic update time for these fundamental geometric problems. These advancements have been used as subroutines towards improving more dynamic problems in computational geometry and stringology. In this talk we will present the method in its general form and will discuss its geometric variations in terms of a "range tree" and a "segment tree" formulation.

[JoCG'18] Chan and T: Dynamic orthogonal range searching on the RAM, revisited. Journal of Computational Geometry 2018: 9(2): 45-66 (Special Issue of Selected Papers from SoCG 2017) [SoCG'18] Chan and T: Dynamic Planar Orthogonal Point Location in Sublogarithmic Time. Symposium on Computational Geometry 2018: 25:1-25:15

The Complexity of Bounded Context Switching with Dynamic Thread Creation

Dynamic networks of concurrent pushdown systems (DCPS) are a theoretical model for multi- threaded recursive programs with shared global state and dynamical creation of threads. The reachability problem for DCPS is undecidable in general, but Atig et al. (2009) showed that it becomes decidable, and is in 2EXPSPACE, when each thread is restricted to a fixed number of context switches. The best known lower bound for the problem is EXPSPACE-hard and this lower bound follows already when each thread is a finite-state machine and runs atomically to completion (i.e., does not switch contexts). In this paper, we close the gap by showing that reachability is 2EXPSPACE-hard already with only one context switch. To do so, we introduce a natural 2EXPSPACE-complete problem via a succinct encoding of Petri nets and through a series of reductions of independent interest, close a 10-year old exponential gap in the complexity of safety verification for multithreaded recursive programs.

Structure vs Randomness in Complexity Theory

The dichotomy between structure and randomness plays an important role in areas such as combinatorics and number theory. I will discuss a similar dichotomy in complexity theory, and illustrate it with three examples of my own work: (i) An algorithmic result (with Igor Oliveira) showing how to probabilistically generate a fixed prime of length n in time sub-exponential in n, for infinitely many n (ii) A lower bound result showing that Promise-MA, the class of promise problems with short proofs that are verifiable efficiently by probabilistic algorithms, does not have circuits of size n^k for any fixed k (iii) A barrier result (with Jan Pich) showing that certain lower bounds in proof complexity are not themselves efficiently provable.

What these results all have in common is that they are unconditional results in settings where such results are often surprising, and that the proofs are non-constructive. I will speculate on whether this non-constructivity is essential, and on the implications for complexity theory more broadly.

Sublinear Time Algorithms for Graph Clustering with Noisy Partial Information

Due to the massive size of modern network data, local algorithms that run in sublinear time for analysing the cluster structure of the graph are receiving growing interest. Two typical examples are local graph clustering algorithms that find a cluster from a seed node with running time proportional to the size of the output set, and clusterability testing algorithms that decide if a graph can be partitioned into a few clusters in the framework of property testing. In this talk, I will present a new type of sublinear time algorithms for graph clustering, called local robust clustering oracles and local filters, that are tailored for analysing the cluster structure of graphs with noisy partial information.

Hadwiger's Conjecture - Quo ?

Hadwiger's Conjecture (1943) asserts that every graph without the complete graph K_{t+1} as a minor has a proper vertex-colouring using at most t colours. In spite of a lot of effort we seem to be very far from a proof of the conjecture in general. For instance, it was proved in 1993 that it is true for t at most 5, a bound that hasn't changed since then. Nevertheless, in recent years there has been an increase in activity around the conjecture. In the talk I will discuss some of these recent approaches and results.

One-sided error Gap Hamming Distance

In the Gap Hamming Distance problem each of two parties receives a binary string, with the promise that Hamming distance between is either rather small or rather big. The goal is to distinguish the first case from the second bound (and minimize the number of bits needed to achieve that). This problem was studied in a lot of ways due to its applications to streaming algorithms and property testing lower bounds. We determine almost exactly its one-sided error communication complexity. The most interesting part of our work is an upper bound, which combines several ideas from previous algorithms for this problem.

Joint work with E. Klenin.

The $\epsilon$-$t$-Net Problem.

We study a natural generalization of the classical $\epsilon$-net problem (Haussler--Welzl 1987), which we call \emph{the $\epsilon$-$t$-net problem}: Given a hypergraph on $n$ vertices and parameters $t$ and $\epsilon\geq \frac t n$, find a minimum-sized family $S$ of $t$-element subsets of vertices such that each hyperedge of size at least $\epsilon n$ contains a set in $S$. When $t=1$, this corresponds to the $\epsilon$-net problem.

We prove that any sufficiently large hypergraph with VC-dimension $d$ admits an $\epsilon$-$t$-net of size $O(\frac{ (1+\log t)d}{\epsilon} \log \frac{1}{\epsilon})$. For some families of geometrically-defined hypergraphs (such as the dual hypergraph of regions with linear union complexity), we prove the existence of $O(\frac{1}{\epsilon})$-sized $\epsilon$-$t$-nets.

We also present an explicit construction of $\epsilon$-$t$-nets (including $\epsilon$-nets) for hypergraphs with bounded VC-dimension. In comparison to previous constructions for the special case of $\epsilon$-nets (i.e., for $t=1$), it does not rely on advanced derandomization techniques. To this end we introduce a variant of the notion of VC-dimension which is of independent interest.

This is a joint work with Noga Alon, Bruno Jartoux, Chaya Keller and Shakhar Smorodinsky.Computational Hardness of Multidimensional Subtraction Games

The talk is devoted to algorithmic complexity of solving subtraction games in a fixed dimension with a finite difference set. We prove that there exists a game in this class such that any algorithm solving the game runs in exponential time. Also we prove an existence of a game in this class such that solving the game is PSPACE-hard. The results are based on the construction introduced by Larsson and W\"atlund. It relates subtraction games and cellular automata.

Joint work with V.Gurvich.

Matroid algorithms and integer programming

While integer programming is computationally hard in general, efficient algorithms exist for various special instances. For example, there exists a fixed parameter algorithm for integer programs where the constraint matrix has bounded dual tree-depth and bounded entries. In this talk, we present a matroid based algorithm for finding an equivalent instance of an integer program where the constraint matrix has small dual tree-depth.

The talk will start with a brief introduction to matroids and algorithmic problems concerning matroids. We will particularly focus on width parameters for matroids and algorithms for matroids with small width. One of the results that we will present asserts that the branch-depth of the matroid formed by columns of a matrix is equal to the minimum tree-depth of a row-equivalent matrix, and we will discuss algorithmic corollaries of this result in particular in relation to integer programming.

The talk will be self-contained. The results presented in this talk are based on joint work with Timothy Chan, Jacob Cooper, Martin Koutecky and Kristyna Pekarkova.

Measurable versions of Vizing’s theorem

The chromatic index \chi(G) of a graph G is the minimal number of colors needed to color all edges of G so that every two edges that intersect have different colors, i.e., a minimal number of partial matchings that cover all edges of G. A theorem of Vizing asserts that if G is a finite graph, then \chi(G) ≤ \Delta(G)+1 where \Delta(G) denotes the maximum degree of G. A simple compactness argument allows to extend this result to infinite graphs, however this usually yields a non-constructive (non-definable) coloring. We consider the problem of estimating the definable chromatic index of definable graphs of bounded degree. We show that if the vertex set of G is endowed with a standard Borel structure and invariant probability measure \mu, i.e., G is a graphing, then we have \chi_\mu(G) ≤ \Delta(G)+1 where \chi_\mu(G) is the minimal number of partial Borel matchings that cover all edges up to \mu-null set. This is a joint work with Oleg Pikhurko.

Automating resolution is NP-hard

We show that it is NP-hard to distinguish between formulas with polynomial length Resolution refutations and formulas without subexponential length resolution refutations. This can be understood as an answer to the question for the computational complexity of automating Resolution. The talk focusses on the historical and theoretical context of the question.

This is joint work with Albert Atserias.

Families of permutations with a forbidden intersection

A family of permutations is said to be 't-intersecting' if any two permutations in the family agree on at least t points. It is said to be (t-1)-intersection-free if no two permutations in the family agree on exactly t-1 points. Deza and Frankl conjectured in 1977 that a t-intersecting family of permutations in S_n can be no larger than a coset of the stabiliser of t points, provided n is large enough depending on t; this was proved by the speaker and independently by Friedgut and Pilpel in 2008. We give a new proof of a stronger statement: namely, that a (t-1)-intersection-free family of permutations in S_n can be no larger than a coset of the stabiliser of t points, provided n is large enough depending on t. This can be seen as an analogue for permutations of seminal results of Frankl and Furedi on families of k-element sets. Our proof is partly algebraic and partly combinatorial; it is more 'robust' than the original proofs of the Deza-Frankl conjecture, using a combinatorial 'quasirandomness' argument to avoid many of the algebraic difficulties of the original proofs. Its robustness allows easier generalisation to various other permutation groups. Based on joint work with Noam Lifshitz (Bar Ilan University).

The maximum length of K_r-Bootstrap Percolation

Graph-bootstrap percolation, also known as weak saturation, was introduced by Bollobás in 1968. In this process, we start with initial "infected" set of edges E_0, and we infect new edges according to a predetermined rule. Given a graph H and a set of previously infected edges E_t ⊆ E(K_n), we infect a non-infected edge e if it completes a new copy of H in G=([n] , E_t U {e}). A question raised by Bollobás asks for the maximum time the process can run before it stabilizes. Bollobás, Przykucki, Riordan, and Sahasrabudhe considered this problem for the most natural case where H=K_r. They answered the question for r ≤ 4 and gave a non-trivial lower bound for every r ≥ 5. They also conjectured that the maximal running time is o(n^2) for every integer r. We disprove their conjecture for every r ≥ 6 and we give a better lower bound for the case r=5; in the proof we use the Behrend construction. This is a joint work with József Balogh, Alexey Pokrovskiy, and Tibor Szabó.

Implicit regularization for optimal sparse recovery

We present an implicit regularization scheme for gradient descent methods applied to unpenalized least squares regression to solve the problem of reconstructing a sparse signal from an underdetermined system of linear measurements under the restricted isometry assumption. For a given parameterization yielding a non-convex optimization problem, we show that prescribed choices of initialization, step size and stopping time yield a statistically and computationally optimal algorithm that achieves the minimax rate with the same cost required to read the data up to poly-logarithmic factors. Beyond minimax optimality, we show that our algorithm adapts to instance difficulty and yields a dimension-independent rate when the signal-to-noise ratio is high enough. We validate our findings with numerical experiments and compare our algorithm against explicit $\ell_{1}$ penalization. Going from hard instances to easy ones, our algorithm is seen to undergo a phase transition, eventually matching least squares with an oracle knowledge of the true support.

(based on joint work with Patrick Rebeschini and Tomas Vaskevicius)

Synchronization of finite automata

Imagine a reactive system modeled by a complete DFA. We know the structure of this DFA and we can observe its input, but we don't know its current state. Our goal is to eventually discover in which state the DFA is. This is possible if and only if there exists a word (called a reset word) which sends all the states to one particular state. Automata which admit reset words are called synchronizing, and the minimum length of reset words is the subject of the Černý conjecture, one of the oldest open problems in automata theory. I will explain the extensions of this concept to the more general classes of partial DFAs and unambiguous NFAs, describe some extremal and algorithmic results for the mentioned classes, and show their tight connection with variable length codes.

Maximum hittings by maximal left-compressed intersecting families

The celebrated Erdös-Ko-Rado Theorem states that for all integers r ≤ n/2 and every family A ⊆ ([n] \choose r), if A is intersecting (meaning that no pair of members of A are disjoint), then |A| ≤ (n-1 \choose r-1). For r < n/2, the star is the unique family to achieve equality. In this talk we consider the following variant, asked by Barber: for integers r and n, where r is fixed and n is sufficiently large, and for a set X ⊆ [n], what are the maximal left-compressed intersecting families A ⊆ ([n] \choose r) which achieve maximum hitting with X (i.e. have the most members which intersect X)? We answer the question for every X, extending previous results by Borg and Barber which characterise those sets X for which maximum hitting is achieved by the star. This is joint work with Richard Mycroft.

Guarantees for Maximising Negative and Non-Monotone Submodular Functions

Submodular set functions exhibit natural diminishing returns property and occur in a variety of practical and theoretical settings. For example, the joint entropy of a subset of random variables, the number of points covered by a collection of sets, and the log-determinant of a principle submatrices all give rise to such functions. While most problems related to constrained maximisation of a submodular set functions are known to be hard, a variety of algorithms have been developed that approximately solve these problems with known worst-case guarantees. However, all of these algorithms assume that the submodular function is non-negative, and the best guarantees are available only when the function is non-decreasing. In this talk, I will discuss some recent joint work with Moran Feldman, Chris Harshaw, and Amin Karbasi that gives strengthened guarantees for a particular class of submodular functions that does not satisfy either of these properties. Our techniques are based on recent insights into related continuous optimisation problems, but result in a simple, randomised algorithm that is combinatorial in nature.

Combinatorial generation via permutation languages

In this talk I present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations, which provides a unified view on many known results and allows us to prove many new ones. In particular, we obtain the following four classical Gray codes as special cases: the Steinhaus-Johnson-Trotter algorithm to generate all permutations of an n-element set by adjacent transpositions; the binary reflected Gray code to generate all n-bit strings by flipping a single bit in each step; the Gray code for generating all n-vertex binary trees by rotations due to Lucas, van Baronaigien, and Ruskey; the Gray code for generating all partitions of an n-element ground set by element exchanges due to Kaye.

The first main application of our framework is the generation of pattern-avoiding permutations, yielding new Gray codes for different families of permutations that are characterized by the avoidance of certain classical patterns, (bi)vincular patterns, barred patterns, mesh patterns, monotone and geometric grid classes, and many others. We also obtain new Gray codes for all the combinatorial objects that are in bijection to these permutations, in particular for five different types of geometric rectangulations, also known as floorplans, which are divisions of a square into n rectangles subject to different restrictions.

The second main application of our framework are lattice congruences of the weak order on the symmetric group S_n. Recently, Pilaud and Santos realized all those lattice congruences as (n-1)-dimensional polytopes, called quotientopes, which generalize hypercubes, associahedra, permutahedra etc. Our algorithm generates the equivalence classes of each of those lattice congruences, by producing a Hamilton path on the skeleton of the corresponding quotientope, yielding a constructive proof that each of these highly symmetric graphs is Hamiltonian. We thus also obtain a provable notion of optimality for the Gray codes obtained from our framework: They translate into walks along the edges of a polytope.

This is joint work with Liz Hartung, Hung P. Hoang, and Aaron Williams (SODA 2020).

On Combinatorial discrepancy and an old problem of J.E. Littlewood

The basic problem in combinatorial discrepancy theory is, given a collection of subsets A_{1},..,A_{m} of [n], to find a colouring f from [n] to {1,-1} so that each of the sums ∑_{x in Ai} |f(x)| for i in [m] is as small as possible. In this talk I will discuss how the sort of combinatorial and probabilistic reasoning used to think about problems in combinatorial discrepancy can be adapted to solve an old conjecture of J.E. Littlewood on the existence of “flat Littlewood polynomials”. This talk is based on joint work with Paul Balister, Béla Bollobás, Rob Morris and Marius Tiba.

Complexity of Linear Operators

Let A be an nxn boolean matrix with z zeroes and u ones and x be an n-dimensional vector of formal variables over a semigroup (S,·) . How many semigroup operations are required to compute the linear operator Ax?

p>As we observe in this paper, this problem contains as a special case the well-known range queries problem and has a rich variety of applications in such areas as graph algorithms, functional programming, circuit complexity, and others. It is easy to compute Ax using O(u) semigroup operations. The main question studied in this paper is: can Ax be computed using O(z) semigroup operations? We prove that in general this is not possible: there exists a matrix A with exactly two zeroes in every row (hence z=2n) whose complexity is \Theta(n\alpha(n)) where \alpha(n) is the inverse Ackermann function. However, for the case when the semigroup is commutative, we give a constructive proof of an O(z) upper bound. This implies that in commutative settings, complements of sparse matrices can be processed as efficiently as sparse matrices (though the corresponding algorithms are more involved). Note that this covers the cases of Boolean and tropical semirings that have numerous applications, e.g., in graph theory.As a simple application of the presented linear-size construction, we show how to multiply two nxn matrices over an arbitrary semiring in O(n^2) time if one of these matrices is a 0/1-matrix with O(n) zeroes (i.e., a complement of a sparse matrix).

Joint work with Alexander Kulikov, Ivan Mikhailin and Andrey Mokhov.

Graphs with large chromatic number

If a graph G has large chromatic number, then what can we say about its induced subgraphs? In particular, if G does not contain a large clique, then what else can we guarantee? Thirty years ago, Andras Gyarfas made a sequence of beautiful conjectures on this topic. We will discuss the recent resolution of several of these conjectures, and other related results.

Joint work with Maria Chudnovsky, Paul Seymour and Sophie Spirkl.

One-sided linearity testing

A classical property testing result states that if a Boolean function f satisfies f(x XOR y) = f(x) XOR f(y) for most inputs x,y, then f is close to an XOR. Prompted by an application to approximate judgment aggregation, we discuss what happens when replacing XOR with AND. The solution involves a one-sided analog of the familiar noise operator of Boolean Function Analysis.

Joint work with Noam Lifshitz, Dor Minzer, and Elchanan Mossel.

Complexity of graph colouring and beyond

In this talk I'll describe recent progress on the complexity of approximate graph colouring, a notorious open problem in approximation algorithms since the 70s. Moving beyond, I'll talk about the framework of homomorphism problems between relational structures, also known as constraint satisfaction problems, and recent developments.

Based on joint work with Marcin Wrochna (to appear in Proceedings of SODA'20) and work in progress with Alex Brandts and Marcin Wrochna.

Group testing

In the group testing problem we aim to identify a small number of infected individuals within a large population. To this end we have at our disposal a test procedure that returns the infection status of not just one individual, but of an entire group. Specifically, the test result is positive if any one individual in the group is infected, and negative otherwise. All tests are conducted in parallel. The task is to find a test design, i.e., an allocation of individuals to tests, such that the infection status of each individual can be inferred from the test results. Each individual can be assigned to several tests, and randomisation is allowed. Within this framework, what is the smallest number of tests required to infer the infection status of all individuals with high probability, either algorithmically or information-theoretically?

The talk is based on recent joint work with Oliver Gebhard, Max Hahn-Klimroth and Philipp Loick.

Memory-efficient algorithms for finding needles in haystacks

One of the most common algorithmic tasks is to find a single interesting event (a needle) in an exponentially large collection (haystack) of N=2^n possible events, or to demonstrate that no such event is likely to exist. In particular, we are interested in the problem of finding needles which are defined as events that happen with an unusually high probability of p≫1/N in a haystack which is an almost uniform distribution on N possible events. Such a search algorithm has many applications in cryptography and cryptanalysis, and its best known time/memory tradeoff requires O(1/Mp^2) time given O(M) memory when the search algorithm can only sample values from this distribution.

In this talk I will describe much faster needle searching algorithms when the distribution is defined by applying some deterministic function f to random inputs. Such a distribution can be modeled by a random directed graph with N vertices in which almost all the vertices have O(1) predecessors while the vertex we are looking for has an unusually large number of O(pN) predecessors. When we are given only a constant amount of memory, we propose a new search methodology which we call NestedRho. As p increases, such random graphs undergo several subtle phase transitions, and thus the log-log dependence of the time complexity T on p becomes a piecewise linear curve which bends four times. The new algorithm is faster than the O(1/p^2) time complexity of the best previous algorithm in the full range of 1/N < p < 1, and in particular it improves it for some values of p by a significant factor of sqrt(N). When we are given more memory, I show how to combine the NestedRho technique with the parallel collision search technique in order to further reduce its time complexity. Finally, I will show how to apply the new search technique to more complicated distributions with multiple peaks when we want to find all the peaks whose probabilities are higher than p.

Periodic words, common subsequences and frogs

Froggies on a pond

They get scared and hop along

Scaring others too

Their erratic gait

Gives us tools to calculate

LCS of words

The price of clustering in bin-packing with applications to bin-packing with delays

One of the most signifcant algorithmic challenges in the “big data era” is handling instances that are too large to be processed by a single machine. The common practice in this regard is to partition the massive problem instance into smaller ones and process each one of them separately. In some cases, the solutions for the smaller instances are later on assembled into a solution for the whole instance, but in many cases this last stage cannot be pursued (e.g., because it is too costly, because of locality issues, or due to privacy considerations). Motivated by this phenomenon, we consider the following natural combinatorial question: Given a bin-packing instance I (namely, a set of items with sizes in (0, 1] that should be packed into unit capacity bins) and a partition {I_i} of I into clusters, how large is the ratio sum_i Opt(I_i)/Opt(I), where Opt(J) denotes the optimal number of bins into which the items in J can be packed?

In this paper, we investigate the supremum of this ratio over all instances I and partitions {I_i}, referred to as the bin-packing price of clustering (PoC). It is trivial to observe that if each cluster contains only one tiny item (and hence, Opt(I_i) = 1), then the PoC is unbounded. On the other hand, a relatively straightforward argument shows that under the constraint that Opt(I_i) > 1, the PoC is 2. Our main challenge was to determine whether the PoC drops below 2 when Opt(I_i) > 2. In addition, one may hope that lim_k PoC(k) = 1, where PoC(k) denotes the PoC under the restriction to clusters I_i with Opt(I_i) ≥ k. We resolve the former question afrmatively and the latter one negatively: Our main results are that PoC(k) ≤ 1.951 for any k ≥ 3 and lim_k PoC(k) = 1.691... Moreover, the former bound cannot be signifcantly improved as PoC(3) > 1.933. In addition to the immediate contribution of this combinatorial result to “big data” kind of applications, it turns out that it is useful also for an interesting online problem called bin-packing with delays.

Quantum algorithms from foundations to applications

Quantum computers are designed to use quantum mechanics to outperform any standard, “classical” computer based only on the laws of classical physics. Following many years of experimental and theoretical developments, it is anticipated that quantum computers will soon be built that cannot be simulated by today’s most powerful supercomputers. But to take advantage of a quantum computer requires a quantum algorithm: and designing and applying quantum algorithms requires contributions to be made at all levels of the theoretical “stack”, from underpinning mathematics through to detailed running time analysis. In this talk, I will describe one example of this process. First, an abstract quantum algorithm due to Aleksandrs Belovs is used to speed up classical search algorithms based on the technique known as backtracking (“trial and error”). Then this quantum algorithm can be applied to fundamental constraint satisfaction problems such as graph colouring, sometimes achieving substantial speedups over leading classical algorithms. The talk will aim to give a flavour of the mathematics involved in quantum algorithm design, rather than going into full details.

Partial rejection sampling with an application to all-terminal network reliability

Rejection sampling, sometimes called the acceptance-rejection method, is a simple, classical technique for sampling from a conditional distribution given that some desirable event occurs. The idea is to sample from the unconditioned distribution (assumed to be simple, for example a product distribution), accept the sample if the desirable event occurs and reject otherwise. This trial is repeated until the first acceptance. Rejection sampling in this form is rarely a feasible approach to sampling combinatorial structures, as the acceptance probability is generally exponentially small in the size of the problem instance. However, some isolated cases had been discovered where an exact sample is obtained by resampling only that part of the structure that “goes wrong”, an example being the “sink-popping” algorithm of Cohn, Pemantle and Propp for sampling sink-free orientations in an undirected graph.

The situations in which this shortcut still yields an exact sample from the desired distribution can be characterised, and are related to so-called extreme instances for the Lovász Local Lemma. Even when this ideal situation does not obtain, we find that we can generate exact samples by resampling just the parts of the structure that go wrong “plus a bit more”. We call this “Partial rejection sampling”. As an application we consider the computation of "all-terminal network reliability". Let G be an undirected graph in which each edge is assigned a failure probability. Suppose the edges of G fail independently with the given probabilities. We show how to compute efficiently the probability that the resulting graph is connected. No polynomial-time algorithm for estimating this quantity within specified relative error was previously known.

Based on joint work with Heng Guo (Edinburgh) and Jingcheng Liu (UC, Berkeley).

Widths of regular and context-free languages

Given a regular language L over a partially-ordered alphabet, how large can an antichain in L be (with respect to the lexicographic order)? More precisely, since L will in general be infinite we should ask about the width w_{n} of the set of words in L of length n, and how this grows with n. This generalises the classical language growth problem, and I show that as with language growth there is a dichotomy between polynomial and exponential growth. Moreover there is a polynomial-time algorithm to distinguish the two cases for a language specified by an NFA, and in the case of polynomial growth to compute the precise growth rate. For context-free languages there is a similar dichotomy between polynomial and exponential growth, but now the problem of classifying a given language is undecidable. Finally for a corresponding problem on regular tree languages there is a trichotomy between polynomial, exponential and doubly exponential growth.

The motivation for this problem is from information security, specifically quantitative information flow: suppose that Alice and Bob are interacting with some central system, represented as a deterministic finite transducer. How much information can reach Bob about Alice's actions? It turns out that this is precisely the width of a certain regular language, and hence by the above is either logarithmic or linear (in bits) in the length of the interaction, and a given system can be efficiently classified as either `safe' or `dangerous' as appropriate.

WQO dichotomy conjecture: decidability in Petri nets with homogeneous data

I will introduce a conjecture connecting (1) homogeneous relational structures, (2) Petri nets with data, and (3) well quasi-orders; with the gentle introduction to all three of these topics. I will talk about why the conjecture is reasonable, what is known about it so far, as well as about our results on a special case of 2-edge-coloured graphs.

Based on a paper " WQO Dichotomy for 3-graphs" by S. Lasota and R. Piórkowski.

Caps and progression-free sets in Z_{m}^{n}

We will discuss lower and upper bounds for the size of k-AP-free subsets of Z_{m}^{n}, that is, for r_{k}(Z_{m}^{n}), in certain cases. Specifically, we will look at some recent lower bounds given by Elsholtz and myself. In the case m=4,k=3 we present a construction which gives the tight answer up to n ≤ 5, and point out some connection with coding theory.

Advances in hierarchical clustering of vector data

Compared to the highly successful flat clustering (e.g. k-means), despite its important role and applications in data analysis, hierarchical clustering has been lacking in rigorous algorithmic studies until late due to absence of rigorous objectives. Since 2016, a sequence of works has emerged and gave novel algorithms for this problem in the general metric setting. This was enabled by a breakthrough by Dasgupta, who introduced a formal objective into the study of hierarchical clustering.

In this talk I will give an overview of our recent progress on models and scalable algorithms for hierarchical clustering applicable specifically to high-dimensional vector data. I will first discuss various linkage-based algorithms (single-linkage, average-linkage) and their formal properties with respect to various objectives. I will then introduce a new projection-based approximation algorithm for vector data. The talk will be self-contained and doesn’t assume prior knowledge of clustering methods.

Based on joint works with Vadapalli (ICML’18) and Charikar, Chatziafratis and Niazadeh (AISTATS’19)

Bounded diameter tree partitions

Ryser conjectured that the vertices of every r-edge-coloured graph with independence number i can be covered be (r - 1)i monochromatic trees. Motivated by a problem in analysis, Milicevic recently conjectured that moreover one can ensure that these trees have bounded diameter. We'll show that the two conjectures are equivalent. As a corollary one obtains new results about Milicevic's Conjecture.

This is joint work with Abu Khazneh.

Random walks on dynamic graphs: Mixing times, hitting times, and return probabilities

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion properties which allows us to capture the progress the random walk makes through t-step probabilities.

We apply our framework to dynamically changing graphs, where the set of vertices is fixed while the set of edges changes in each round. For random walks on dynamic connected graphs for which the stationary distribution does not change over time, we show that their behaviour is in a certain sense similar to static graphs. For example, we show that the mixing and hitting times of any sequence of d-regular connected graphs is O(n^2), generalising a well-known result for static graphs.

Joint Work with Luca Zanetti

https://arxiv.org/abs/1903.01342

Designs and decompositions

In this talk I will give an introduction to Design Theory from the combinatorial perspective of (hyper)graph decompositions. I will survey some recent progress on the existence of decompositions, with particular attention to triangle decompositions of graphs, which provide a simple (yet still interesting) illustration of more general results.

Embedding simply connected 2-complexes in 3-space.

A classical theorem of Kuratowski characterises graphs embeddable in the plane by two obstructions. More precisely, a graph is planar if and only if it does not contain the complete graph K_5 or the complete bipartite graph K_{3,3} as a minor.

Can you characterise embeddability of 2-dimensional simplicial complexes in 3-space in a way analogous to Kuratowski’s characterisation of graph planarity?

Codes, locality, and randomised algorithms

Coding theory is a central tool in communication, cryptography, algorithms, complexity, and more. Loosely speaking, codes are mathematical objects that provide means to endow information with structure that admits robustness to noise.

In recent years, there has been a surge of interest in highly structured codes that exhibit local-to-global phenomena. Such codes admit various types of algorithms that make their decisions based on a small local view, and thus run in sublinear time. In this talk, I will present recent results regarding two fundamental types of codes with a local-to-global structure: locally decodable codes and locally testable codes. In addition, I will discuss several applications of such codes to theoretical computer science and discrete mathematics, as well as discuss old open problems and new approaches for resolving them.

Algorithms for #BIS-hard problems on expander graphs

We give an FPTAS and an efficient sampling algorithm for the high-fugacity hard-core model on bounded-degree bipartite expander graphs. The results apply, for example, to random bipartite Δ-regular graphs, for which no efficient algorithms were known in the non-uniqueness regime of the infinite Δ-regular tree. Joint work with Peter Keevash and Will Perkins.

Algorithmic Mechanism Design for Two-sided Markets

Mechanism design for one-sided markets is an area of extensive research in economics and, since more than a decade, in computer science as well. Two-sided markets, on the other hand, have not received the same attention despite the many applications to Internet advertisement and to the sharing economy.

In two-sided markets, both buyers and sellers act strategically. An ideal goal in two-sided markets is to maximize the social welfare of buyers and sellers with individually rational (IR), incentive compatible (IC) and budget-balanced mechanisms (BB), which requires that the mechanism does not subsidize the market or make an arbitrary profit from the exchange. Unfortunately, Myerson and Satterthwaite proved in 1983 that this goal cannot be achieved even in the bayesian setting and for the simple case of only one buyer and one seller.

In this talk, I’ll discuss meaningful trade-offs and algorithmic approximations of the above requirements by presenting several recent results and some challenging open problems.

The Reachability Problem for Petri Nets is Not Elementary

Petri nets, also known as vector addition systems, are a long established and widely used model of concurrent processes. The complexity of their reachability problem is one of the most prominent open questions in the theory of verification. That the reachability problem is decidable was established by Mayr in his seminal STOC 1981 work, and the currently best upper bound is non-primitive recursive cubic-Ackermannian of Leroux and Schmitz from LICS 2015. We show that the reachability problem is not elementary. Until this work, the best lower bound has been exponential space, due to Lipton in 1976.

Joint work with Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic and Jerome Leroux.

Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model

We study the hard-core (gas) model defined on independent sets of an input graph where the independent sets are weighted by a parameter (aka fugacity) \lambda > 0. For constant \Delta, previous work of Weitz (2006) established an FPTAS for the partition function for graphs of maximum degree \Delta when \lambda < \lambda_c(\Delta). Sly (2010) showed that there is no FPRAS, unless NP=RP, when \lambda > lambda_c(\Delta). The threshold \lambda_c(\Delta) is the critical point for the statistical physics phase transition for uniqueness/non-uniqueness on the infinite \Delta-regular tree. The running time of Weitz's algorithm is exponential in log(\Delta).

Here we present an FPRAS for the partition function whose running time is O*(n^2). We analyze the simple single-site Markov chain known as the Glauber dynamics for sampling from the associated Gibbs distribution. We prove there exists a constant \Delta_0 such that for all graphs with maximum degree \Delta \ge \Delta_0 and girth > 6 (i.e., no cycles of length at most 6), the mixing time of the Glauber dynamics is O(n log(n)) when \lambda < \lambda_c(\Delta). Our work complements that of Weitz which applies for small constant \Delta whereas our work applies for all \Delta at least a sufficiently large constant \Delta_0 (this includes \Delta depending on n=|V).

Our proof utilises loopy BP (belief propagation) which is a widely-used algorithm for inference in graphical models. A novel aspect of our work is using the principal eigenvector for the BP operator to design a distance function which contracts in expectation for pairs of states that behave like the BP fixed point. We also prove that the Glauber dynamics behaves locally like loopy BP. As a byproduct we obtain that the Glauber dynamics, after a short burn-in period, converges close to the BP fixed point, and this implies that the fixed point of loopy BP is a close approximation to the Gibbs distribution. Using these connections we establish that loopy BP quickly converges to the Gibbs distribution when the girth > 5 and \lambda < \lambda_c(\Delta).

This is a joint work with Tom Hayes, Daniel Stefankovic, Eric Vigoda and Yitong Yin.

Multidimensional Data Summaries

In order to avoid agonisingly slow query response times over very large sets of data, two strategies are employed. One strategy is to reduce the response time by optimising the query execution for the underlying data. The other strategy is to provide approximate answers in the meantime. Both strategies rely on data summaries that can estimate the number of points along box-shaped ranges. In the literature many summaries have been proposed, ranging from ones offering formal guarantees to heuristics geared towards practical performance. In my talk I will primarily focus on summaries providing tight bounds for the estimation error, discuss prominent approaches and present results from a joint work with Anton Dignös and Johann Gamper. In addition to that, I will discuss open problems and challenges involved in formalising the problem without risking to lose touch with practical applications.

Cycles in Tournaments

Linial and Morgenstern conjectured that, among all tournaments with a given density d of cycles of length three, the density of cycles of length four is minimized by a random blow-up of a transitive tournament with all but one parts of equal sizes, i.e., the structure of extremal tournaments resembles the one that appears in the famous Erdos-Rademacher problem concerning the minimum density of triangles in a graph with a given edge density. We prove the conjecture for d>=1/36 and demonstrate that the structure of extremal examples is more complex than expected and give its full description for d>=1/16. Contrary to many recent results in this area, our proof is not based on the flag algebra method but it uses methods from spectral graph theory. At the end of the talk, we consider a related problem of determining the maximum number of cycles of length k in a tournament and solve this problem when k=8 or k is not divisible by four.

This talk contains results obtained jointly with Timothy Chan, Andrzej Grzesik, Laszlo Miklos Lovasz, Jonathan Noel and Jan Volec.

On the role of randomization in local distributed algorithms

Many modern computing systems are distributed and built in a decentralized way on top of large networks. As one of the key challenges when running a distributed algorithm in a large network, typically no node can know the state of the whole network and each node thus each node has to base its decisions on only partial, mostly local information about the network. The major goal of the research on local distributed algorithms is to understand to what extent nodes in a network can achieve a global goal such as solving some graph problem, based on only local information.

In my talk, I will focus on the role of using randomization in local distributed graph algorithms. In many cases, there currently is a large gap between the best randomized and deterministic algorithms and understanding whether this gap is inherent, is considered to be one of the central open questions of the area. I will discuss recent results that shed some light on what randomness is really needed for and that also allow to identify simple and basic problems that are complete for the class of problems that have efficient randomized distributed algorithms and for which we do not know efficient deterministic algorithms.

Size reconstructability of graphs

The deck of a graph G is given by the multiset {G-v:v in V(G)} of (unlabelled) subgraphs, which are called cards. The graph reconstruction conjecture states that no two non-isomorphic graphs (on at least three vertices) can have the same deck. The number of edges of a graph can be computed from its deck and Brown and Fenner show that the size of G can be reconstructed as well after any 2 cards have been removed from the deck (for n≤ 29). We show that for sufficiently large n, the number of edges can be computed whenever at most 20/√ n cards are missing. I will talk about the background of the problem, the main ideas of the proof and my favourite open problems in the area.

Joint work with Hannah Guggiari and Alex Scott.

Unique End of Potential Line

We study the complexity of problems in PPAD ∩ PLS that have unique solutions. Three well-known examples of such problems are the problem of finding a fixpoint of a contraction map, finding the unique sink of a Unique Sink Orientation (USO), and solving the P-matrix Linear Complementarity Problem (P-LCP). Each of these are promise-problems, and when the promise holds, they always possess unique solutions.

We define the complexity class UEOPL to capture problems of this type. We show that UEOPL ⊆ CLS, and that all of our motivating problems are contained in UEOPL: specifically USO, P-LCP, and finding a fixpoint of a Piecewise-Linear Contraction under an ℓp-norm all lie in UEOPL. Our results also imply that parity games, mean-payoff games, discounted games, and simple-stochastic games lie in UEOPL.

All of our containment results are proved via a reduction to a problem that we call One-Permutation Discrete Contraction (OPDC). This problem is motivated by a discretized version of contraction, but it is also closely related to the USO problem. We show that OPDC lies in UEOPL, and we are also able to show that OPDC is UEOPL-complete.

Based on joint work with Spencer Gordon, Ruta Mehta, and Rahul Savani.

Critical scaling limit of the random intersection graph.

In this talk, we prove a scaling limit for the size of the largest components of a critical random intersection graph in which each individual is assigned to each community with a uniform probability p, all independently of each other. We show that the order of magnitude of the largest component depends significantly on the asymptotic behaviour of the ratio between the number of individuals and communities. We further discuss how this result relates to the known scaling limits of critical inhomogeneous random graphs.

Graph Planning with Expected Finite Horizon

A classical problem in discrete planning is to consider a weighted graph and construct a path that maximizes the sum of weights for a given time horizon T. However, in many scenarios, the time horizon in not fixed, but the stopping time is chosen according to some distribution such that the expected stopping time is T. If the stopping time distribution is not known, then to ensure robustness, the distribution is chosen by an adversary, to represent the worst-case scenario.

A stationary plan for every vertex always chooses the same outgoing edge. For fixed horizon T, stationary plans are not sufficient for optimality. Quite surprisingly we show that when an adversary chooses the stopping time distribution with expected stopping time T, then stationary plans are sufficient. While computing optimal stationary plans for fixed horizon is NP-complete, we show that computing optimal stationary plans under adversarial stopping time distribution can be achieved in polynomial time. Consequently, our polynomial-time algorithm for adversarial stopping time also computes an optimal plan among all possible plans.

Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration

In the file migration problem, we are given a metric space (X,d) and an indivisible file of size D needs to be stored in one of the points X. At each time step, a request arrives from some point r in X, incurring a cost of d(r,x), where x is the point where the file is stored. We can then move the file to a new point y, paying D d(x,y). This problem has been studied in the online setting, and the best known competitive ratio has been 4.086 (Bartal et al., SODA 1997). In this talk I will discuss a 4-competitive algorithm. One interesting feature of this result is the extensive use of computers in both designing and analyzing the algorithm.

Sumset Bounds for the Entropy on Abelian Groups

The development of the field of additive combinatorics in recent years has provided, among other things, a collection of fascinating and deep, elementary tools for estimating the sizes of discrete subsets of abelian groups. Tao in 2010 connected these results with the entropy of discrete probability measures: Interpreting the entropy of a discrete random variable as the logarithm of its "effective support size," he provided a series of new inequalities for the discrete entropy. We will review this background and describe how Tao's results extend in a nontrivial way to the entropy of random elements in general abelian groups. The somewhat surprising key difference between the discrete and the general case is that the "functional submodularity" property of the discrete entropy needs to be replaced by the general "data processing property" of the entropy.

No background in information theory, entropy or additive combinatorics will be assumed.

Spanning cycles in random directed graphs.

A beautiful coupling argument by McDiarmid can translate results on the appearance of a spanning (Hamilton) cycle in random graphs to random directed graphs and spanning cycles with different patterns of directions. However, this does not determine the sharp threshold for the appearance for each possible pattern of edges, and, moreover, it cannot determine when a random directed graph is likely to contain a spanning cycle for each possible pattern of directions simultaneously.

I will discuss techniques for finding spanning cycles in random graphs and directed graphs, and McDiarmid's coupling, and how these can be combined to solve these problems.

O-Minimal Invariants for Linear Loops

The termination analysis of linear loops plays a key role in several areas of computer science, including program verification and abstract interpretation. Such deceptively simple questions also relate to a number of deep open problems, such as the decidability of the Skolem and Positivity Problems for linear recurrence sequences, or equivalently reachability questions for discrete-time linear dynamical systems. In this paper, we introduce the class of *o-minimal invariants*, which is broader than any previously considered, and study the decidability of the existence and algorithmic synthesis of such invariants as certificates of non-termination for linear loops equipped with a large class of halting conditions. We establish two main decidability results, one of them conditional on Schanuel's conjecture in transcendental number theory.

On equilateral sets in subspaces of l_infty^n

S is an equilateral set in a normed space X, if the distance of any two distinct points of S is 1. The equilateral number e(X) of X is the maximum cardinality of an equilateral set in X. A conjecture of Petty states that e(X)>=n+1 for any X of dimension n. This conjecture is still wide open. We study equilateral sets in subspaces of l_\infty^n of fixed codimension k, and prove exponential lower bounds on their equilateral number. This proves Petty's conjecture for these classes of norms, provided that n is sufficiently large compared to k. In particular, we obtain that if X is an n-dimensional normed space with a centrally symmetric convex polytope of at most 4n/3-o(n) pairs of facets as a unit ball, then e(X)>=n+1. We also prove lower bounds for the equilateral number of norms that are close to subspaces of l_\infty^n.

Is your automaton good for playing games?

Good-for-Games (GFG) automata offer a compromise between deterministic and nondeterministic automata. They can resolve non-deterministic choices in a step-by-step fashion, without needing any information about the remaining suffix of the word. These automata can be used to solve games with omega-regular conditions, and in particular were introduced as a tool to solve Church's synthesis problem. GFG automata can offer exponential succinctness compared to the deterministic automata that are classically used in this context.

The problem of recognizing whether a given automaton is GFG is surprisingly challenging, and an efficient solution would be interesting from both theoretical and practical points of view. After introducing GFG automata through motivations and examples, I will detail the most recent advancements on this topic, namely a polynomial-time algorithm for recognizing GFG Büchi automata.

On the way to weak automata

Different types of automata over words and trees offer different trade-offs between expressivity, conciseness, and the complexity of decision procedures. Alternating weak automata enjoy simple algorithms for emptiness and membership checks, which makes transformations into automata of this type particularly interesting. For instance, an algorithm for solving two-player infinite games -- such as parity games -- can be viewed as a special case of such a transformation. However, our understanding of the worst-case size blow-up that these transformations can incur is rather poor.

I will present a quasi-polynomial transformation of alternating parity word automata into alternating weak automata, improving on the existing exponential upper bound.

If time allows, I will also mention that on trees the situation is drastically different: alternating parity tree automata (and even universal co-Buchi tree automata), can be exponentially more concise than alternating weak automata.

This talk is based on "On the way to alternating weak automata", co-authored with Udi Boker, to appear at FSTTCS'18.

Capacity Upper Bounds for Deletion-Type Channels

The binary deletion channel is a simple point-to-point communications channel in which a stream of bits is sent by a sender and each bit is independently either delivered to the receiver or discarded. Despite its simplicity, determining the Shannon capacity of the channel; i.e., the best possible rate of reliable transmission, remains as one of the most challenging open problems in information theory. The deletion channel has regained great attention in recent years in part due to the significance to DNA storage systems, in addition to its fundamental importance.

We develop a systematic approach, based on convex programming and real analysis, for obtaining upper bounds on the capacity of the binary deletion channel and, more generally, channels with i.i.d. insertions and deletions. Our framework can be applied to obtain capacity upper bounds for any repetition distribution. Our techniques essentially reduce the task of proving capacity upper bounds to maximizing a univariate, real-valued, and concave function over a bounded interval. The corresponding univariate function is carefully designed according to the underlying distribution of repetitions and the choices vary depending on the desired strength of the upper bounds as well as the desired simplicity of the function (e.g., being only efficiently computable versus having an explicit closed-form expression in terms of elementary, or common special, functions).

Among many other results, we show that the capacity of the binary deletion channel with deletion probability d is at most (1-d) log φ for d ≤ 1/2, and, assuming that the capacity function is convex, is at most 1-d log(4/φ) for d < 1/2, where φ is the golden ratio. This is the first nontrivial capacity upper bound for any value of d outside the limiting case d → 0 that is fully explicit and proved without computer assistance.

Based on work appearing in STOC’18 and JACM; pre-print here.

At the Roots of Dictionary Compression: String Attractors

A well-known fact in the field of lossless text compression is that high-order entropy is a weak model when the input contains long repetitions. Motivated by this fact, decades of research have generated myriads of so-called dictionary compressors: algorithms able to reduce the text’s size by exploiting its repetitiveness. Lempel-Ziv 77 is one of the most successful and well-known tools of this kind, followed by straight-line programs, run-length Burrows-Wheeler transform, macro schemes, collage systems, and the compact directed acyclic word graph. In this paper, we show that these techniques are different solutions to the same, elegant, combinatorial problem: to find a small set of positions capturing all distinct text’s substrings. We call such a set a string attractor. We first show reductions between dictionary compressors and string attractors. This gives the approximation ratios of dictionary compressors with respect to the smallest string attractor and allows us to uncover new asymptotic relations between the output sizes of different dictionary compressors. We then show that the k-attractor problem — deciding whether a text has a size-t set of positions capturing all substrings of length at most k — is NP-complete for k≥ 3. This, in particular, includes the full string attractor problem. We provide several approximation techniques for the smallest k-attractor, show that the problem is APX-complete for constant k, and give strong inapproximability results. To conclude, we provide matching lower and upper bounds for the random access problem on string attractors. The upper bound is proved by showing a data structure supporting queries in optimal time. Our data structure is universal: by our reductions to string attractors, it supports random access on any dictionary-compression scheme. In particular, it matches the lower bound also on LZ77, straight-line programs, collage systems, and macro schemes, and therefore essentially closes (at once) the random access problem for all these compressors.

This talk is based on joint work with Nicola Prezza that appeared at STOC 2018.

An almost sharp degree bound for sums of squares certificates for quaternary quartics

We show that a nonnegative 4-variate homogeneous polynomial (form) f in R[x,y,z,t] of degree 4 is the ratio p/q of forms p, q of degrees 8 and 4, resp., where p, q are sums of squares of forms. This allows an efficient check of nonnegativity of f using semidefinite optimization (SDP). No similar results were known for forms of degree>2 in more than 3 variables. (The 3-variate case was settled in 1893 by Hilbert, and slightly improved upon for small degrees in the past 10 years).

We conjecture that there are "special" f=at^{2}+2bt+c, where a, b,c in R[x,y,z], for which the "8/4"- degree bound is sharp. In particular the ternary sextic h:=Disc(f)=ac-b^{2} cannot be s.o.s., and we construct such h. However, SDPs stipulating that f cannot be written as p/q with smaller than "8/4" degrees resist solving, despite their relatively modest sizes. We discuss related shortcomings of SDP solvers, and a problem of a number-theoretic flavour, of constructing a "sparse" h with small coefficients.

A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines

In the online packet scheduling problem with deadlines, the goal is to schedule transmissions of packets that arrive over time in a network switch and need to be sent across a link. Each packet has a deadline, representing its urgency, and a non-negative weight, that represents its priority. Only one packet can be transmitted in any time slot, so, if the system is overloaded, some packets will inevitably miss their deadlines and be dropped. In this scenario, the natural objective is to compute a transmission schedule that maximizes the total weight of packets which are successfully transmitted. The problem is inherently online, with the scheduling decisions made without the knowledge of future packet arrivals. The goal is to develop an algorithm with the lowest possible competitive ratio, which is the worst-case ratio between the optimum total weight of a schedule (computed by an offline algorithm) and the weight of a schedule computed by a (deterministic) online algorithm.

In this talk, we present a φ-competitive online algorithm (where φ≈1.618 is the golden ratio), matching the previously established lower bound. We then outline main ideas and techniques of its analysis. Finally, we discuss possible extensions of this work.

Joint work with Marek Chrobak, Łukasz Jeż, and Jiří Sgall.

Successive minimal paths in complete graphs with random edge weights

It is known that in a complete graph with independent exponential edge weights the distance between two fixed vertices is asymptotically log n/n. We look at the cost X_{k} of k-th minimal path between two fixed vertices, defined as the cheapest path in G after having deleted the previous k-1 minimal paths. We show that X_{k}/(log n/n) tends to 1 for k=o(log n). We also look at variants of the problem and a strengthening for small k. This talk is based on joint work with P. Balister, B. Mezei and G. Sorkin.

Bisimulation Metrics for Weighted Automata

We develop a new bisimulation (pseudo)metric for weighted finite automata (WFA) that generalizes Boreale's linear bisimulation relation. Our metrics are induced by seminorms on the state space of WFA. Our development is based on spectral properties of sets of linear operators. In particular, the joint spectral radius of the transition matrices of WFA plays a central role. We also study continuity properties of the bisimulation pseudometric, establish an undecidability result for computing the metric, and give a preliminary account of applications to spectral learning of weighted automata. Finally, we compare our metric to other bisimulation metrics in the special case of probabilistic automata. (https://arxiv.org/abs/1702.08017)

Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States

The plan is first to briefly recall the notion of vector addition systems with states (an equivalent to Petri nets) and the known results on complexity of related basic problems; this will be followed by sketching the main ideas of the paper to appear at Petri Nets 2018.

The coverability and boundedness problems are well-known exponential-space complete problems for vector addition systems with states (or Petri nets). The boundedness problem asks if the reachability set (for a given initial configuration) is finite. Here we consider a dual problem, the co-finiteness problem that asks if the complement of the reachability set is finite; by restricting the question we get the co-emptiness (or universality) problem that asks if all configurations are reachable.

We show that both the co-finiteness problem and the co-emptiness problem are complete for exponential space. While the lower bounds are obtained by a straightforward reduction from coverability, getting the upper bounds is more involved; in particular we use the bounds derived for reversible reachability by Leroux in 2013.

Joint work with J. Leroux and G. Sutre.

The complexity of general-valued CSPs seen from the other side

The constraint satisfaction problem (CSP) is concerned with homomorphisms between two structures. For CSPs with restricted left-hand side structures, the results of Dalmau et al. 2002, Grohe 2003, and Atserias et al. 2007 establish the precise borderline of polynomial-time solvability (subject to complexity-theoretic assumptions) and of solvability by bounded-consistency algorithm (unconditionally) as bounded treewidth modulo homomorphic equivalence.

The general-valued constraint satisfaction problem (VCSP) is a generalisation of the CSP concerned with homomorphisms between two valued structures. For VCSPs with restricted left-hand side valued structures, we establish the precise borderline of polynomial-time solvability (subject to complexity-theoretic assumptions) and of solvability by the k-th level of the Sherali-Adams LP hierarchy (unconditionally). We also obtain results on related problems concerned with finding a solution and recognising the tractable cases; the latter has an application in database theory.

Joint work with Clement Carbonnel and Standa Zivny.

Approximation hardness of (Graphic) Travelling Salesman Problem

The Travelling Salesman Problem (TSP) is the fundamental and one of the most studied combinatorial optimisation problem. Despite several improvements of Christofides's approximation ratio (the graphic TSP) there is still a significant gap between currently the best known approximation ratio and hardness results. Our focus will be on the hardness results where several improvements have been made in the last two decades. Currently the only known method to prove the approximation hardness results for the Graphic TSP is a gap preserving reduction. However, the gap preserving techniques have been improved by constructions of better amplifiers, gadgets and transformations. As a result of that the initial APX-hardness results presented without any explicit constant (Papadimitriou & Yannakakis, 1993) was improved to the current best known value of 123/122 (Lampis at al., 2015).

In this talk we present further improvement of these techniques based on the weighted amplifiers.

This is joint work with Miroslav Chlebik (University of Sussex).

Graphons, Tao’s regularity and difference polynomials

We show that Tao’s spectral proof of the algebraic regularity lemma for certain classes of finite structures has a very natural formulation in the context of graphons. We apply these techniques to study expander difference polynomials over fields with powers of Frobenius.

Weak Cost Register Automata are Still Powerful

In this fairly technical talk, I will show that the equivalence problem for copyless cost register automata is undecidable, disproving a conjecture of Alur et. al from 2012. “Cost register automata” simply means automata equipped with nonnegative integer registers where each transition induces an update expressed using increments and minimums; the automaton outputs a specific register on acceptance. Further, “copyless” means that each register is used at most once in the update functions, for each transition. The constructions focus on simulating counter machines with zero-tests: we will see that a copyless cost register automaton can “check” that an input string is a correct execution of a counter machine.

Joint work with S. Almagor, F. Mazowiecki and G. A. Pérez.

Full paper: arXiv:1804.06336

Stochastic Quasi-Gradient Methods: Variance Reduction via Jacobian Sketching

We develop a new family of variance reduced stochastic gradient descent methods for minimizing the average of a very large number of smooth functions. Our method - JacSketch - is motivated by novel developments in randomized numerical linear algebra, and operates by maintaining a stochastic estimate of a Jacobian matrix composed of the gradients of individual functions. In each iteration, JacSketch efficiently updates the Jacobian matrix by first obtaining a random linear measurement of the true Jacobian through (cheap) sketching, and then projecting the previous estimate onto the solution space of a linear matrix equation whose solutions are consistent with the measurement. The Jacobian estimate is then used to compute a variance-reduced unbiased estimator of the gradient, followed by a stochastic gradient descent step. Our strategy is analogous to the way quasi-Newton methods maintain an estimate of the Hessian, and hence our method can be seen as a *stochastic quasi-gradient method*. Indeed, quasi-Newton methods project the current Hessian estimate onto a solution space of a linear equation consistent with a certain linear (but non-random) measurement of the true Hessian. Our method can also be seen as stochastic gradient descent applied to a *controlled stochastic optimization reformulation* of the original problem, where the control comes from the Jacobian estimates.

We prove that for smooth and strongly convex functions, JacSketch converges linearly with a meaningful rate dictated by a single convergence theorem which applies to general sketches. We also provide a refined convergence theorem which applies to a smaller class of sketches, featuring a novel proof technique based on a *stochastic Lyapunov function*. This enables us to obtain sharper complexity results for variants of JacSketch with importance sampling. By specializing our general approach to specific sketching strategies, JacSketch reduces to the celebrated stochastic average gradient (SAGA) method, and its several existing and many new minibatch, reduced memory, and importance sampling variants. Our rate for SAGA with importance sampling is the current best-known rate for this method, resolving a conjecture by Schmidt et al (2015). The rates we obtain for minibatch SAGA are also superior to existing rates. Moreover, we obtain the first minibatch SAGA method with importance sampling.

This is joint work with Robert Mansel Gower (Telecom ParisTech) and Francis Bach (INRIA and Ecole Normale Superieure).

Lagrangians of hypergraphs

Frankl and Füredi conjectured (1989) that any r-uniform hypergraph, whose edges form an initial segment of length m in the colex ordering, maximises the Lagrangian among all r-uniform hypergraphs with m edges, for all r and m. We prove this conjecture for r=3 (and all sufficiently large m), thus improving results of Talbot (2002), Tang et al. (2016) and Tyomkyn (2017). For larger r, we show that the conjecture holds whenever $\left(\genfrac{}{}{0ex}{}{\mathrm{t-1}}{r}\right)$ ≤ m ≤ $\left(\genfrac{}{}{0ex}{}{\mathrm{t-1}}{r}\right)$ + $\left(\genfrac{}{}{0ex}{}{\mathrm{t-2}}{\mathrm{r-1}}\right)$ for some integer t (and m is large enough), thus improving a result of Tyomkyn. However, the conjecture is in fact false for general r>3 and m.

The stochastic path problem and probabilistic automata of bounded ambiguity

I will present an algorithmic question called the stochastic path problem, which is a multi-objective optimisation problem. My motivation for studying this problem is a connection with probabilistic automata of bounded ambiguity. There are more (open) questions than answers, and as customary nowadays I will construct a quasipolynomial time algorithm.

Based on a joint work with Cristian Riveros and James Worrell published in CONCUR'17.

The class of (P_{7},C_{4},C_{5})-free graphs: decomposition, χ-boundedness, and algorithms

As usual, P_{n} (n≥1) denotes the path on n vertices, and C_{n} (n≥3) denotes the cycle on n vertices. For a family H of graphs, we say that a graph G is H-free if no induced subgraph of G is isomorphic to any graph in H. We present a decomposition theorem for the class of (P_{7},C_{4},C_{5})-free graphs; in fact, we give a complete structural characterization of (P_{7},C_{4},C_{5})-free graphs that do not admit a clique-cutset. We use this decomposition theorem to show that the class of (P_{7},C_{4},C_{5})-free graphs is χ-bounded by a linear function (more precisely, every (P_{7},C_{4},C_{5})-free graph G satisfies χ(G)≤3ω(G)/2, and to to construct polynomial-time algorithms that solve the optimal coloring, maximum weight clique, and maximum weight stable set problems for this class.

The talk is based on joint work with Kathie Cameron, Shenwei Huang and Vaidy Sivaraman.

Colouring random graphs

A (proper) colouring of a graph is a vertex colouring where no two neighbouring vertices are coloured the same, and the chromatic number is the least number of colours where this is possible. Determining the chromatic number of G(n,p) is one of the classic challenges in random graph theory. For the case where p is constant, we will establish upper and lower bounds which are the first to match each other up to a term of size o(1) in the denominator. In particular, these bounds determine the average colour class size in an optimal colouring almost completely, answering a question by Kang and McDiarmid. We also consider a closely related graph parameter - the equitable chromatic number of the dense random graph G(n,m) - which can be determined exactly on a subsequence of the integers.

Simulation Beats Richness: New Data Structure Lower Bounds

We develop a new technique for proving lower bounds in the setting of assymetric communication, a model that was introduced in the famous works of Miltersen (STOC '94) and Miltersen, Nisan, Safra and Wigderson (STOC '95). At the core of our technique is the first simulation theorem in the assymetric setting, where Alice gets a p \times n matrix x over F_2 and Bob gets an n-bit vector y. Alice and Bob need to evaluate f(x . y) for a boolean function f : {0,1}^p --> {0,1}; where x . y is the matrix-vector product. Our simulation theorems show that a deterministic/randomized communication protocol exists for this problem, with cost C . n for Alice and C for Bob, if and only if there exists a deterministic/randomized parity decision tree of cost \Theta(C) for evaluating it.

As applications of this technique, we obtain the following results: (a) The first strong lower bounds against randomized data structure schemes for the one-bit output problem of Vector Matrix-Vector product over F_2. Moreover, our method yields strong lower bounds even when the data structure scheme has tiny advantage over random guessing. (b) The first lower bounds against randomized data structure schemes for two natural Boolean variants of Orthogonal Vector Counting. (c) We construct an assymetric communication problem and obtain a deterministic lower bound for it which is provably better than any lower-bound which might be obtained by the classical Richness method of Miltersen et al. (STOC '95). This seems to be the first known limitation of the Richness method in the context of proving deterministic lower bounds.

(This is joint work with Michal Koucky, Bruno Loff and Sagnik Mukhopadhyay.)

A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem

We give a constant-factor approximation algorithm for the asymmetric traveling salesman problem. Our approximation guarantee is analyzed with respect to the standard LP relaxation, and thus our result confirms the conjectured constant integrality gap of that relaxation. Our techniques build upon the constant-factor approximation algorithm for the special case of node-weighted metrics. Specifically, we give a generic reduction to structured instances that resemble but are more general than those arising from node-weighted metrics. For those instances, we then solve Local-Connectivity ATSP, a problem known to be equivalent (in terms of constant-factor approximation) to the asymmetric traveling salesman problem. This is joint work with Ola Svensson and Jakub Tarnawski.

How Computer Science Informs Modern Auction Design

Economists have studied the theory and practice of auctions for decades. How can computer science contribute? Using the recent U.S. FCC double-auction for wireless spectrum as a case study, I'll illustrate the many answers: novel auction formats, algorithms for NP-hard problems, approximation guarantees for simple auctions, and communication complexity-based impossibility results.

Decomposing the Complete r-Graph

The Graham-Pollak theorem states that to decompose the complete graph Kn into complete bipartite subgraphs we need at least n−1 of them. What happens for hypergraphs? In other words, suppose that we wish to decompose the complete r-graph on n vertices into complete r-partite r-graphs; how many do we need?

In this talk we will report on recent progress on this problem. This is joint work with Luka Milicevic and Ta Sheng Tan.

Labeling schemes for trees and planar graphs

Labeling schemes seek to assign a label to each node in a network, so that a function on two nodes can be computed by examining their labels alone. The goal is to minimize the maximum length of a label and (as a secondary goal) the time to evaluate the function. As a prime example, we might want to compute the distance between two nodes of a network using only their labels. We consider this question for two natural classes of networks: trees and planar graphs. For trees on n nodes, we design labels consisting of 1/4log^2(n) bits (up to lower order terms), thus matching a recent lower bound of Alstrup et al. [ICALP 2016]. One of the components used in our solution (and many others) is a labeling scheme for finding the nearest common ancestor of two nodes in a rooted tree. We present a novel interpretation of this question using the notion of minor-universal trees, which allows us to improve the 2.772log(n) upper bound of Alstrup et al. [SODA 2014] to 2.318log(n), and highlights a natural limitation of all known schemes.

For planar graphs, the situation of distance labeling is more complex. A major open problem is to close the gap between an upper bound of O(n^{1/2}log(n))-bits and a lower bound of O(n^{1/3})-bits for unweighted planar graphs. We show that, for undirected unweighted planar graphs, there is no hope to achieve a higher lower bound using the known techniques. This is done by designing a centralized structure of size ~O(min(k^2,(kn)^{1/2})) that can calculate the distance between any pair of designated k terminal nodes. We show that this size it tight, up to polylogarithmic terms, for such centralized structures. This is complemented by an improved upper bound of O(n^{1/2}) for labeling nodes of an undirected unweighted planar graph for calculating the distances.

Joint work with Ofer Freedman, Fabian Kuhn, Jakub Lopuszanski, Pat Nicholson, Konstantinos Panagiotou, Pascal Su, Przemyslaw Uznanski, Oren Weimann.

Minimizing Regret in Infinite-Duration Games Played on Graphs

Two-player zero-sum games of infinite duration are used in verification to model the interaction between a controller (Eve) and its environment (Adam). The question usually addressed is that of the existence of a strategy for Eve that can maximize her payoff against any strategy of Adam. I will summarize recent work on an alternative solution concept: finding regret-minimal strategies of Eve, i.e. strategies that minimize the difference between her actual payoff and the payoff she could have achieved if she had known the strategy of Adam in advance. We give algorithms to compute the strategies of Eve that ensure minimal regret against an adversary whose choice of strategy is (i) unrestricted, (ii) limited to positional strategies, or (iii) limited to word strategies.

Local limit theorem for the number of K4 in G(n,p)

Understanding the distribution of subgraph counts has long been a central question in the study of random graphs. In this talk, we consider the distribution of the number of K_4 subgraphs, denoted by S_n in the Erdős Rényi random graph G(n,p). When the edge probability is a fixed constant in (0,1), a classical central limit theorem for S_n states that (S_n-mu_n)/\sigma_n$ converges in distribution to the standard Gaussian distribution. This convergence can however be shown to hold locally as well and we present a proof of the local convergence of S_n, which is joint work with O. Riordan.

Maximising the number of induced cycles in a graph

How many induced cycles can a graph on n vertices contain? For sufficiently large n, we determine the maximum number of induced cycles and the maximum number of even or odd induced cycles. We also characterize the graphs achieving this bound in each case. This answers a question of Tuza, and a conjecture of Chvátal and Tuza from 1988. Joint work with Alex Scott.

The Maker-Breaker Rado game on a random set of integers

Given an integer-valued matrix A of dimension l x k and an integer-valued vector b of dimension l, the Maker-Breaker (A,b)-game on a set of integers X is the game where Maker and Breaker take turns claiming previously unclaimed integers from X, and Maker's aim is to obtain a solution to the system Ax=b, whereas Breaker's aim is to prevent this.

When X is a random subset of {1,...,n} where each number is included with probability p independently of all others, we determine the threshold probability p_0 for when the game is Maker or Breaker's win, for a large class of matrices and vectors. This class includes but is not limited to all pairs (A,b) for which Ax=b corresponds to a single linear equation. The Maker's win statement also extends to a much wider class of matrices which include those which satisfy Rado's partition theorem.

Decidable Logics for Path Feasibility of Programs with Strings

Symbolic executions (and their recent variants called dynamic symbolic executions) are an important technique in automated testing. Instead of analysing only concrete executions of a program, one could treat such executions symbolically (i.e. with some variables that are not bound to concrete values) and use constraint solvers to determine this (symbolic) path feasibility so as to guide the path explorations of the system under test, which in combination with dynamic analysis gives the best possible path coverage. For string-manipulating programs, solvers need to be able to handle constraints over the string domain. This gives rise to the following natural question: what is an ideal decidable logic over strings for reasoning about path feasibility in a program with strings? This is a question that is connected to a number of difficult results in theoretical computer science (decidability of the theory of strings with concatenations, a.k.a., word equations) and long-standing open problems (e.g. decidability of word equations with length constraints). Worse yet, recent examples from cross-site scripting vulnerabilities suggest that more powerful string operations (e.g. finite-state transducers) might be required as first class citizens in string constraints. Even though putting all these string operations in a string logic leads to undecidability, recent results show that there might be a way to recover decidability while retaining expressivity for applications in symbolic execution. In this talk, I will present one such result from my POPL'16 paper (with P. Barcelo). The string logic admits concatenations, regular constraints, finite-state transductions, letter-counting and length constraints (which can consequently express charAt operator, and string disequality). I will provide a number of examples from the cross-site scripting literature that shows how a string logic can, for the first time, be used to discover a bug in or prove correctness of the programs. I will conclude by commenting on a new decision procedure for the logic that leads to an efficient implementation (POPL'18 with L. Holik, P. Janku, P. Ruemmer, and T. Vojnar) and a recent attempt to incorporate the fully-fledged replace-all operator into a string logic (POPL'18 with T. Chen, Y. Chen, M. Hague, and Z. Wu).

An introduction to weighted automata

Automata are one of the simplest computational model, computing the well-known class of regular languages and enjoying a lot of nice properties. However, an automaton has only a "qualitative" behaviour: either it accepts a given input or rejects it. Weighted automata are a quantitative extension of automata, introduced in the 60's, which allow to compute values such as probabilities, costs, gains... In this talk, I will introduce this model, and describe the main (closed and open) problems in this field. I might also explain the link with the study of sets of matrices.

On the Analysis of Evolutionary Algorithms - How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms

Evolutionary algorithms are popular general-purpose algorithms for optimisation and design that use search operators like mutation, crossover and selection to "evolve" a population of good solutions. In the past decades there has been a long and controversial debate about when and why the crossover operator is useful. The building-block hypothesis assumes that crossover is particularly helpful if it can recombine good "building blocks", i. e. short parts of the genome that lead to high fitness. However, all attempts at proving this rigorously have been inconclusive. As of today, there is no rigorous and intuitive explanation for the usefulness of crossover. In this talk we provide such an explanation. For functions where "building blocks" need to be assembled, we prove rigorously that many evolutionary algorithms with crossover are twice as fast as the fastest evolutionary algorithm using only mutation. The reason is that crossover effectively turns fitness-neutral mutations into improvements by combining the right building blocks at a later stage. This also leads to surprising conclusions about the optimal mutation rate.

Correspondence Coloring and its Applications

Correspondence coloring, introduced by Dvorak and I in 2015, is a generalization of list coloring wherein vertices are given lists of colors and each edge is given a matching between the lists of its endpoints. So unlike in list or even ordinary coloring where adjacent vertices are not allowed to be colored the same, here we require that the colors of adjacent vertices are not matched along the edge. In this manner, correspondence coloring is list coloring where the 'meaning' of color is a local rather than global notion. Although results for correspondence coloring are interesting in their own right, in this talk we will focus on applying correspondence coloring to difficult problems from coloring and list-coloring to obtain new results; for example, for 3-list-coloring planar graphs without 4 to 8 cycles (joint work with Dvorak), on Reed's conjecture (joint work with Bonamy and Perrett) and on the list coloring version of Reed's conjecture (joint work with Delcourt).

On some Applications of Graph Theory to Number Theoretic Problems

How large can a set of integers be, if the equation a_{1}a_{2}...a_{h}=b_{1}b_{2}...b_{h} has no solution consisting of distinct elements of this set? How large can a set of integers be, if none of them divides the product of h others? How small can a multiplicative basis for {1, 2, ..., n} be? The first question is about a generalization of the multiplicative Sidon-sets, the second one is of the primitive sets, while the third one is the multiplicative version of the well-studied analogue problem for additive bases.

Proof complexity of constraint satisfaction problems

Many natural computational problems, such as satisfiability and systems of equations, can be expressed in a unified way as constraint satisfaction problems (CSPs). In this talk I will show that the usual reductions preserving the complexity of the constraint satisfaction problem preserve also its proof complexity. As an application, I will present two gap theorems, which say that CSPs that admit small size refutations in some classical proof systems are exactly the constraint satisfaction problems which can be solved by Datalog.

This is joint work with Albert Atserias.

On the List Coloring Version of Reed's Conjecture

Reed conjectured in 1998 that the chromatic number of a graph should be at most the average of the clique number (a trivial lower bound) and maximum degree plus one (a trivial upper bound); in support of this conjecture, Reed proved that the chromatic number is at most some nontrivial convex combination of these two quantities. King and Reed later showed that a fraction of roughly 1/130000 away from the upper bound holds. Motivated by a paper by Bruhn and Joos, last year Bonamy, Perrett, and Postle proved for large enough maximum degree, a fraction of 1/26 away from the upper bound holds, a signficant step towards the conjectured value of 1/2. Using new techniques, we show that the list-coloring version holds; for large enough maximum degree, a fraction of 1/13 suffices for list chromatic number. This result implies that 1/13 suffices for ordinary chromatic number as well. This is joint work with Luke Postle.

To iterate or not to iterate: A linear time algorithm for recognizing near acyclicity

Planarity, bipartiteness, and acyclicity are basic graph properties with classic linear time recognition algorithms and the problems of testing whether a given graph has k vertices whose deletion makes it planar, bipartite, or acyclic, are fundamental NP-complete problems when k is part of the input.

However, it is known that for any fixed k, there is a linear time algorithm to test whether a graph is k vertices away from being planar or bipartite. On the other hand, it has remained open whether there is a similar linear time recognition algorithm for digraphs which are just 2 vertices away from being a DAG.

The subject of this talk is a new algorithm that, for every fixed k, runs in linear time and recognizes digraphs which are k vertices away from being acyclic, thus mirroring the case for planarity and bipartiteness. This algorithm is designed via a new methodology that can be used in combination with the technique of iterative compression from the area of Fixed-Parameter Tractability and applies to several ``cut problems’’ on digraphs. This is joint work with Daniel Lokshtanov (University of Bergen, Norway) and Saket Saurabh (The Institute of Mathematical Sciences, India).

CALF: Categorical Automata Learning Framework

Automata learning is a technique that has successfully been applied in verification, with the automaton type varying depending on the application domain. Adaptations of automata learning algorithms for increasingly complex types of automata have to be developed from scratch because there was no abstract theory offering guidelines. This makes it hard to devise such algorithms, and it obscures their correctness proofs. We introduce a simple category-theoretic formalism that provides an appropriately abstract foundation for studying automata learning. Furthermore, our framework establishes formal relations between algorithms for learning, testing, and minimization. This is joint work with Gerco van Heerdt and Matteo Sammartino.

Coloring graph products and Hedetniemi's conjecture

Hedetniemi's conjecture (1966) states that χ(G×H) = min(χ(G),χ(H)), for all graphs G,H (× being the tensor/direct/categorical product). The best we know is that the conjecture is true when χ(G×H) ≤ 3 (El-Zahar and Sauer 1985). The talk will focus on how this result is essentially just a proof of an analogous statement in topology, with one combinatorial step added. I will then survey some more connections with topology, questions about how deep they go, and some recent, more combinatorial approaches. No prior knowledge of topology is assumed.

Nested Convex Bodies are Chaseable

In the Convex Body Chasing problem, we are given an initial point v_{0} in R^{d} and an online sequence of n convex bodies F_{1}, … , F_{n}. When we receive F_{i}, we are required to move inside F_{i}. Our goal is to minimize the total distance traveled. This fundamental online problem was first studied by Friedman and Linial (DCG 1993). They proved an Ω(√d) lower bound on the competitive ratio, and conjectured that a competitive ratio depending only on d is possible. However, despite much interest in the problem, the conjecture remains wide open.

We consider the setting in which the convex bodies are nested: F_{1} ⊃ … ⊃ F_{n}. The nested setting is closely related to extending the online LP framework of Buchbinder and Naor (ESA 2005) to arbitrary linear constraints. Moreover, this setting retains much of the difficulty of the general setting and captures an essential obstacle in resolving Friedman and Linial’s conjecture. In this work, we give the first f(d)-competitive algorithm for chasing nested convex bodies in R^{d}.

This is joint work with Nikhil Bansal, Martin Bohm, Marek Elias and Grigorios Koumoutsos.

Oscillatory integrals and their application in geometric graph theory

Let K be the field of real or p-adic numbers, and F(x) = (f_1(x), . . ., f_m(x)) be such that 1, f_1 , . . . , f_m are linearly independent polynomials with coefficients in K. In the present talk, we will prove that for the field K, the Borel chromatic number of of the Cayley graph of K^m with respect to these polynomials is infinite. The proof employs a recent spectral bound for the Borel chromatic number of Cayley graphs, combined with an analysis of certain oscillatory integrals over local fields. The talk should be accessible to non-experts.

Designs beyond quasirandomness

In a recent breakthrough, Peter Keevash proved the Existence conjecture for combinatorial designs, which has its roots in the 19th century. In joint work with Daniela Kühn, Allan Lo and Deryk Osthus, we gave a new proof of this result, based on the method of iterative absorption. In fact, `regularity boosting’ allows us to extend our main decomposition result beyond the quasirandom setting and thus to generalise the results of Keevash. In particular, we obtain a resilience version and a minimum degree version. In this talk, we will present our new results within a brief outline of the history of the Existence conjecture and provide an overview of the proof.

Universal Partial Words

A universal word for a finite alphabet A and some positive integer n is a word over A such that every word of length n appears exactly once as a (consecutive) subword. It is well known and is easy to prove that universal words exist for any A and n. The notion of universal words was extended to other combinatorial structures (admitting encoding by words). Universal partial words are words that in addition to the letters from A may contain an arbitrary number of a special "joker" symbol, which can be substituted by any letter from A. The study of universal partial words was initiated recently. Such words allow shortening universal words. In my talk, I will discuss a number of existence and non-existence results related to universal partial words.

This is joint work with Herman Chen, Torsten Mutze and Brian Sun.

Challenges in Distributed Shortest Paths Algorithms

This talk focuses on the current challenges in computing distances and shortest paths on distributed networks (the CONGEST model), in particular exact algorithms and the directed case. I will survey previous results and techniques, and try to point out where the previous techniques fail, and where major new ideas are needed.

This talk will touch results I (co)-authored in STOC 2014 and STOC 2016, among others.

Blow-up lemmas

The blow-up lemma states that a system of super-regular pairs contains all bounded degree spanning graphs as subgraphs that embed into a corresponding system of complete pairs. This lemma has far-reaching applications in extremal combinatorics. I discuss sparse analogues of the blow-up lemma for subgraphs of random and of pseudorandom graphs, and consider various applications of these lemmas.

Joint work with Peter Allen, Julia Böttcher, Hiep Hàn and Yoshiharu Kohayakawa.

The complexity of Boolean surjective VCSPs

Boolean valued constraint satisfaction problems (VCSPs) are discrete optimization problems with the goal to find an assignment of labels {0, 1} to variables that minimizes the objective function given as a sum of constant-arity constraints. In the surjective setting, an assignment is in addition required to use each label at least once. For example, the minimum cut problem falls within this framework. We give a complexity classification of Boolean surjective VCSPs parameterized by the set of available constraints.

Strategies for stochastic games

The talk will be about two-player, zero-sum, concurrent, mean-payoff games played on graphs, classically called stochastic games. A stochastic game consists of a set of matrix games (that is games like rock-paper-scissors, where players act simultaneously). The game is over an infinite sequence of rounds and in each round one of the matrix games is played, and depending on the players joint choice and the matrix game, some reward is given and some matrix game is selected for the next round. The outcome of the game is given as the average of the rewards. Stochastic games has the annoying property that they are hard to play even near-optimally in the sense that the memory usage of even epsilon-optimal strategies (and optimal strategies need not even exist) grows unbounded as a function of the round number. The talk will focus on two questions related to stochastic games:

(1) Assume without loss of generality that all rewards are in [0,1], can we find the sub-set of matrix games, such that for each of those matrix games, there is an epsilon-optimal, finite-memory strategy that ensures value 1-epsilon for all epsilon>0? This problem is sometimes called the (finite-memory) value 1 problem (or limit-sure). I present an algorithm for that problem with polynomial running time. While the problem has not been considered for general stochastic games before, it has been considered for many special cases thereof (in each special case considered, if any strategy ensured value 1-epsilon, then a strategy without memory did as well). The algorithm also shows that if there exist a finite-memory strategy ensuring value 1-epilson, then there exist one ensuring 1-epsilon that did not use memory at all and the algorithm also finds such a strategy.

(2) Next, if we are not so lucky that the right start matrix game has a epsilon-optimal, finite-memory strategy, it would at least be nice to use as little memory as possible (as a function of time). That way, if we are forced to follow such a strategy we can at least add space for the strategy slowly. I present a new family of strategies for stochastic games that ensures that the strategy only needs O(log log T) bits of memory in round T (previous known strategies used O(log T) bits of memory in round T).

The talk will not assume prior knowledge about stochastic games, and is based on my paper from SODA 2015 and my paper from SAGT 2016. Both papers can be found on my homepage at http://Rasmus.Ibsen-Jensen.com

Families with few k-chains

A central theorem in combinatorics is Sperner’s Theorem, which determines the maximum size of a family in the Boolean lattice that does not contain a 2-chain. Erdős later extended this result and determined the largest family not containing a k-chain. Erdős and Katona and later Kleitman asked how many such chains must appear in families whose size is larger than the corresponding extremal result.

This question was resolved for 2-chains by Kleitman in 1966, who showed that amongst families of size M in the Boolean lattice, the number of 2-chains is minimized by a family whose sets are taken as close to the middle layer as possible. He also conjectured that the same conclusion should hold for all k, not just 2. The best result on this question is due to Das, Gan and Sudakov who showed roughly that Kleitman’s conjecture holds for families whose size is at most the size of the k+1 middle layers of the Boolean lattice. Our main result is that for every fixed k and epsilon, if n is sufficiently large then Kleitman’s conjecture holds for families of size at most (1-epsilon)2^n, thereby establishing Kleitman’s conjecture asymptotically. Our proof is based on ideas of Kleitman and Das, Gan and Sudakov.

Extensions of Dynamic Programming for Decision Tree Study

In the presentation, we consider extensions of dynamic programming approach to the investigation of decision trees as algorithms for problem solving, as a way for knowledge extraction and representation, and as classifiers which, for a new object given by values of conditional attributes, define a value of the decision attribute. These extensions allow us (i) to describe the set of optimal decision trees, (ii) to count the number of these trees, (iii) to make sequential optimization of decision trees relative to different criteria, (iv) to find the set of Pareto optimal points for two criteria, and (v) to describe relationships between two criteria. The applications include the minimization of average depth for decision trees sorting eight elements (this question was open since 1968), improvement of upper bounds on the depth of decision trees for diagnosis of 0-1-faults in read-once combinatorial circuits over monotone basis, existence of totally optimal (with minimum depth and minimum number of nodes) decision trees for Boolean functions, study of time-memory tradeoff for decision trees for corner point detection, study of relationships between number and maximum length of decision rules derived from decision trees, study of accuracy-size tradeoff for decision trees which allows us to construct enough small and accurate decision trees for knowledge representation, and decision trees that, as classifiers, outperform often decision trees constructed by CART. The end of the presentation is devoted to the introduction to KAUST.

Linear Time Algorithm for Update Games

An arena is a finite directed graph whose vertices are divided into two classes, i.e. squares and circles; this forms the basic playground for many infinite 2-player pebble games. In Update Games the square player aims at moving the pebble so to visit all vertices of the arena infinitely often, while player circle works against. It is known that deciding who’s the winner in a given Update Game costs O(mn) time, where n is the number of vertices and m is that of arcs. We present an algorithm for solving that problem in O(m+n) linear time. The algorithm builds on a generalization, from directed graphs to arenas, of the depth-first search (DFS) and the strongly-connected components (SCCs) decomposition, taking inspiration from Tarjan’s SCCs classical algorithm.

Property testing for structures of bounded degree

Property testing (for a property P) asks for a given input, whether it has property P, or is "far" from having that property. A "testing algorithm" is a probabilistic algorithm that answers this question with high probability correctly, by only looking at small parts of the input. Testing algorithms are thought of as "extremely efficient", making them relevant in the context of big data.

We extend the bounded degree model of property testing from graphs to relational structures, and we show that every property definable in first-order logic is testable with a constant number of queries in polylogarithmic time. On structures of bounded tree-width, a similar statement holds for monadic second-order logic.

This is joint work with Frederik Harwath.

Dynamic Matching via Primal-Dual Method

The primal-dual method is a general technique that is widely used to design efficient (static) algorithms for optimization problems. We present the first application of this technique in a dynamic setting.

We consider the problem of maintaining an approximately maximum matching in a dynamic graph. Specifically, we have an input graph G = (V, E) with n nodes. The node-set of the graph remains unchanged over time, but the edge-set is dynamic. At each time-step an adversary either inserts an edge into the graph, or deletes an already existing edge from the graph. The goal is to maintain a matching of approximately maximum size in G with small update time.

We present a clean primal-dual algorithm for this problem that maintains a (2+epsilon)-approximate maximum fractional matching in O(log n) amortized update time. We also describe several extensions to this basic framework, which allow us to obtain new efficient dynamic algorithms for maintaining a (2+\epsilon)-approximate maximum integral matching in O(poly log n) amortized update time, and a (2+epsilon)-approximate maximum fractional matching in O(log^3 n) worst case update time.

Joint work with Monika Henzinger, Giuseppe Italiano and Danupon Nanongkai.

Best-response Dynamics in Combinatorial Auctions with Item Bidding

In a combinatorial auction with item bidding, agents participate in multiple single-item second-price auctions at once. As some items might be substitutes, agents need to strategize in order to maximize their utilities. A number of results indicate that high welfare can be achieved this way, giving bounds on the welfare at equilibrium. Recently, however, criticism has been raised that equilibria are hard to compute and therefore unlikely to be attained.

In this paper, we take a different perspective. We study simple best-response dynamics. That is, agents are activated one after the other and each activated agent updates his strategy myopically to a best response against the other agents’ current strategies. Often these dynamics may take exponentially long before they converge or they may not converge at all. However, as we show, convergence is not even necessary for good welfare guarantees. Given that agents' bid updates are aggressive enough but not too aggressive, the game will remain in states of good welfare after each agent has updated his bid at least once.

In more detail, we show that if agents have fractionally subadditive valuations, natural dynamics reach and remain in a state that provides a 1/3 approximation to the optimal welfare after each agent has updated his bid at least once. For subadditive valuations, we can guarantee an Ω(1/ log m) approximation in case of m items that applies after each agent has updated his bid at least once and at any point after that. The latter bound is complemented by a negative result, showing that no kind of best-response dynamics can guarantee more than an o(log log m/ log m) fraction of the optimal social welfare.

Joint work with Thomas Kesselheim

The paper is available from: http://paulduetting.com/pubs/SODA17.pdf

Reordering Buffer Management in General Metric Spaces

In the reordering buffer management problem a sequence of requests arrive online in a finite metric space, and have to be processed by a single server. This server is equipped with a request buffer of size k and can decide at each point in time, which request from its buffer to serve next. Servicing of a request is simply done by moving the server to the location of the request. The goal is to process all requests while minimizing the total distance that the server is travelling inside the metric space.

In this paper we present a deterministic algorithm for the reordering buffer management problem that achieves a competitive ratio of O(log Δ+min{log n,log k}) in a finite metric space of n points and aspect ratio Δ. This is the first algorithm that works for general metric spaces and has just a logarithmic dependency on the relevant parameters. The guarantee is memory-robust, i.e., the competitive ratio decreases only slighty when the buffer-size of the optimum is increased to h=(1+ε)k. For memory robust guarantees our bounds are close to optimal.

Measurable combinatorics and the Lovász Local Lemma

For k∈ N, k-coloring of a graph G is a partition V_{1}, ..., V_{k} of its vertex set into k independent sets (i.e., sets with no edges between their elements). Given a graph G, we might want to know if it admits a k-coloring - and this question leads to a great body of work in graph theory. To complicate the matters further, we can require the sets V_{1}, ..., V_{k} to have some additional "nice" properties. For instance, if the vertex set of G is the unit interval [0,1], can the sets V_{1}, ..., V_{k} be Lebesgue-measurable (or, even better, Borel)? The short answer is, not always, and understanding the extent to which classical combinatorial results can be adapted for the Borel and measurable settings is the premise of the recently emerged field of Borel combinatorics, which has already found many applications in descriptive set theory, ergodic theory, probability theory, and the study of graph limits, to name a few. In this talk I will try to give a brief introduction to this fascinating area and to explain how the Lovász Local Lemma, a classical tool in probabilistic combinatorics, can be used to obtain results in the measurable framework.

Colouring Diamond-free Graphs

The Colouring problem is that of deciding, given a graph G and an integer k, whether G admits a (proper) k-colouring. For all graphs H up to five vertices, we classify the computational complexity of Colouring for (diamond,H)-free graphs. Our proof is based on combining known results together with proving that the clique-width is bounded for (diamond,P_{1}+2P_{2})-free graphs. Our technique for handling this case is to reduce the graph under consideration to a k-partite graph that has a very specific decomposition. As a by-product of this general technique we are also able to prove boundedness of clique-width for four other new classes of (H_{1},H_{2})-free graphs. As such, our work also continues a recent systematic study into the (un)boundedness of clique-width of (H_{1},H_{2})-free graphs, and our five new classes of bounded clique-width reduce the number of open cases from 13 to 8.

Joint work with François Dross and Daniël Paulusma.

Parking on a tree

Consider the following particle system. We are given a uniform random rooted tree on vertices labelled by [n]={1,2,...,n}, with edges directed towards the root. Each node of the tree has space for a single particle (we think of them as cars). A number m<=n of cars arrives one by one, and car i wishes to park at node S_{i}, 1<=i<=m, where S_{1}, S_{2}, ..., S_{m} are i.i.d. uniform random variables on [n]. If a car arrives at a space which is already occupied, it follows the unique path oriented towards the root until the first time it encounters an empty space, in which case it parks there; otherwise, it leaves the tree. Let A_{n,m} denote the event that all m cars find spaces in the tree. Lackner and Panholzer proved (via analytic combinatorics methods) that there is a phase transition in this model. Set m = [an]. Then if a<=1/2, P(A_{n,[an]}) tends to (1-2a)^{1/2}/(1-a), whereas if a>1/2 we have P(A_{n,[an]}) tending to 0. (In fact, they proved more precise asymptotics in n for a>1/2.) In this talk, I will give a probabilistic explanation for this phenomenon, and an alternative proof via the objective method. Time permitting, I will also discuss some generalisations.

Joint work with Michał Przykucki (Oxford).

Pricing and Optimization in Shared Vehicle Systems: Queueing Models and Approximation Algorithms

Shared vehicle systems, such as those for bike-sharing (e.g., Citi Bike in NYC, Velib in Paris), car-sharing (e.g., car2go, Zipcar) and ride-sharing (Uber, Lyft, etc.) are fast becoming essential components of the urban transit infrastructure. The technology behind these platforms enable fine-grained monitoring and control tools, including good demand forecasts, accurate vehicle-availability information, and the ability to do dynamic pricing and vehicle repositioning. However, owing to their on-demand nature and the presence of network externalities (wherein setting prices at one place affects the supply at all other locations), optimizing the operations of such systems is challenging.

In this work, we describe how such systems can be modeled using queueing-network models and present a unifying framework for data-driven pricing and optimization. Our approach provides efficient algorithms with rigorous approximation guarantees under a variety of controls (pricing, empty-vehicle repositioning, demand redirection) and for a wide class of objective functions (including welfare and revenue, and also multi-objective problems such as Ramsey pricing).

Based on joint work with Sid Banerjee and Thodoris Lykouris at Cornell

Densities of 3-vertex graphs

Let d_{i}(G) be the density of the 3-vertex i-edge graph in a graph G, i.e., the probability that three random vertices induce a subgraph with i edges. Let S be the set of all quadruples (d_{0},d_{1},d_{2},d_{3}) that are arbitrary close to 3-vertex graph densities in arbitrary large graphs. Huang, Linial, Naves, Peled and Sudakov have recently determined the projection of the set S to the (d_{0},d_{3}) plane. We determine the projections of the set S to all the remaining planes.

This is joint work with Roman Glebov, Ping Hu, Tamás Hubai, Daniel Král' and Jan Volec.

Universal graphs

A graph in a certain class is said to be universal if all elements of the class embed to it according to a specified notion of embedding, may it be strong, weak or homomorphic embeddings. For example, any class of graphs that contains a clique of the size equal to the largest size of an element of the class, if such a largest size exists, is universal for that class under weak embeddings. The question becomes more complicated when one discusses classes of graphs that omit cliques, or if one changes the notion of embedding. For example, there is no universal graph for all countable graphs that omit an infinite clique, yet there is a strongly universal countable graph in the class of all countable graphs (the random graph). We shall discuss what happens at uncountable infinite cardinals, where we get independence results, open questions and, this is what was surprising to us, at certain of them just straight negative answers without any additional axioms of set theory used. The proof is simple and we shall show it during the talk.

A new framework for distributed submodular maximization

A wide variety of problems in machine learning, including exemplar clustering, document summarization, and sensor placement, can be cast as constrained submodular maximization problems. A lot of recent effort has been devoted to developing distributed algorithms for these problems. However, these results suffer from high number of rounds, suboptimal approximation ratios, or both. We develop a framework for bringing existing algorithms in the sequential setting to the distributed setting, achieving near optimal approximation ratios for many settings in only a constant number of MapReduce rounds. Our techniques also give a fast sequential algorithm for non-monotone maximization subject to a matroid constraint.

This is joint work with Alina Ene, Huy L. Nguyen and Justin Ward.

Online Algorithms for Multi-Level Aggregation

In the Multi-Level Aggregation Problem (MLAP), requests arrive at the nodes of an edge-weighted tree T, and have to be served eventually. A service is defined as a subtree X of T that contains its root. This subtree X serves all requests that are pending in the nodes of X, and the cost of this service is equal to the total weight of X. Each request also incurs waiting cost between its arrival and service times. The objective is to minimize the total waiting cost of all requests plus the total cost of all service subtrees. Aggregation problem for trees of arbitrary depth arise in multicasting, sensor networks, communication in organization hierarchies, and in supply-chain management. The instances of MLAP associated with these applications are naturally online, in the sense that aggregation decisions need to be made without information about future requests.

Constant-competitive online algorithms are known for MLAP with one or two levels. However, it has been open whether there exist constant competitive online algorithms for trees of depth more than 2. Addressing this open problem, we give the first constant competitive online algorithm for networks of arbitrary (fixed) number of levels. The competitive ratio is O(D^4 2^D), where D is the depth of T. The algorithm works for arbitrary waiting cost functions, including the variant with deadlines.

Joint work with Martin Böhm, Jarosław Byrka, Marek Chrobak, Christoph Dürr, Lukáš Folwarczný, Łukasz Jeż, Jiří Sgall, Nguyen Kim Thang and Pavel Veselý, appeared at ESA 2016.

Independent sets in hypergraphs and Ramsey properties of graphs and the integers

Many important problems in combinatorics and other related areas can be phrased in the language of independent sets in hypergraphs. Recently Balogh, Morris and Samotij, and independently Saxton and Thomason developed very general container theorems for independent sets in hypergraphs; both of which have seen numerous applications to a wide range of problems. There are other problems, however, which can be more naturally phrased in terms of disjoint independent sets in hypergraphs. We develop an analogue of the container theorem of Balogh, Morris and Samotij for tuples of disjoint independent sets in hypergraphs. We also give several applications of this theorem to Ramsey-type problems. For example, we generalise the random Ramsey theorem of Rödl and Ruciński by providing a resilience analogue. This result also implies the random version of Turán's theorem due to Conlon and Gowers, and Schacht.

This is joint work with Robert Hancock and Katherine Staden.

Coloring square-free Berge graphs

We consider the class of graphs that does not contain as induced subgraphs chordless cycles of odd length greater than 3, their complements and chordless cycles of length 4 (square-free Berge graphs). We present a purely-graph theoretical algorithm that produces an optimal coloring for the graphs in this class. This is joint work with Chudnovsky, Lo, Maffray and Trotignon.

This is a subclass of perfect graphs, that have been extensively studied in the last 50 years. In 1981 Grötschel, Lovász and Schrijver showed that perfect graphs can be optimally colored in polynomial time. Their algorithm uses the ellipsoid method. The last big open problem in the area is to find a purely combinatorial polynomial time coloring algorithm for perfect graphs.

On the Power of Advice and Randomization for Online Bipartite Matching

An online algorithm receives its input piece-by-piece in a serial fashion. Upon reception of a piece of the input, it has to irrevocably decide how to process this piece of data. Since the online algorithm can base its decisions only on what it has seen in the past, and, in particular, has no information about the future, it is often difficult or impossible to take good decisions. For many problems, access to randomness helps to avoid that the algorithm always takes the wrong decisions.

Suppose that we provide the online algorithm with additional knowledge about the future (= advice). Clearly, if enough information is given, we can obtain optimal solutions. However, does it help if we grant only very few advice bits to the algorithm? How much advice is needed to outperform any randomized online algorithm? In this work, we study these questions with regards to the maximum bipartite matching problem.

This is joint work with Christoph Dürr (Université Pierre et Marie Curie, Paris) and Marc Renault (Université Paris Diderot, Paris).

Primes with missing digits

We will talk about recent work which shows that there are infinitely many primes with no 7 in their decimal expansion. (And similarly with 7 replaced by any other digit.) This shows the existence of primes in a thin set of numbers, which is typically very difficult. The proof relies on a fun mixture of number theory, discrete Fourier analysis and combinatorial geometry, amongst other things.

Distinguishing Hidden Markov Chains

Hidden Markov Chains (HMCs) are commonly used mathematical models of probabilistic systems. They are employed in various fields such as speech recognition, signal processing, and biological sequence analysis. We consider the problem of distinguishing two given HMCs based on an observation sequence that one of the HMCs generates. More precisely, given two HMCs and an observation sequence, a distinguishing algorithm is expected to identify the HMC that generates the observation sequence. Two HMCs are called distinguishable if for every ε>0 there is a distinguishing algorithm whose error probability is less than ε. We show that one can decide in polynomial time whether two HMCs are distinguishable. Further, we present and analyze two distinguishing algorithms for distinguishable HMCs. The first algorithm makes a decision after processing a fixed number of observations, and it exhibits two-sided error. The second algorithm processes an unbounded number of observations, but the algorithm has only one-sided error. The error probability, for both algorithms, decays exponentially with the number of processed observations. We also provide an algorithm for distinguishing multiple HMCs. Finally, we discuss an application in stochastic runtime verification.

Joint work with A. Prasad Sistla.

Upper tails for arithmetic progressions in a random set

Let X denote the number of k-term arithmetic progressions in a random subset of Z/NZ or {1,...,N}. We determine, in certain ranges of parameters, the probability that X exceeds its expectation by a constant factor. Recently, Chatterjee and Dembo reduced the problem, at least for k=3, to a natural variational problem. We solve this variational problem asymptotically, thereby obtaining the large deviation rate. More generally, for all k, using the inverse theorem for the Gowers norms, we determine the rate as long as p tends to 0 extremely slowly.

Joint work with Bhaswar B. Bhattacharya, Shirshendu Ganguly, and Xuancheng Shao.

Navigating one-counter automata: Directions in the mountains

One-counter automata (OCA) are finite-state automata with a counter that supports increments, decrements, and tests for zero. They correspond to an intermediate class between regular and context-free languages and are suitable for modeling ``counting'' phenomena. However, reasoning about OCA is often intractable: for example, language equivalence is undecidable for nondeterministic OCA, and for deterministic OCA it took 40 years to prove the existence of short distinguishing words. In this talk, I will give a review of reasoning tasks for OCA and discuss new tractability results:

- shortest paths between configurations of OCA are of at most quadratic length;
- the Parikh image and sub-/superword closures of the language are accepted by small nondeterministic finite automata.

List colouring of hypergraphs

The list chromatic number of a hypergraph is defined in the same way as for a graph: it is the smallest number k such that, if every vertex is given a list of k colours, then each vertex can choose a colour from its list so that no edge is monochromatic. One of the successes of the recently discovered "container method" was to show that the list colouring number of an r-uniform hypergraph is at least c_{r} log d, where d is the average degree. But is the container method giving the best answer here? We describe a colouring algorithm based on "preference orders" which correctly determines the list chromatic number of hypergraphs having a certain property. Hypergraphs with this property include those generated at random, which are expected to be worst-case examples for the general problem.

Joint work with Ares Meroueh.

The decomposition threshold of a given graph

A fundamental theorem of Wilson states that, for every graph F, the edge-set of every sufficiently large clique (satisfying a trivially necessary divisibility condition) has a decomposition into copies of F. One of the main open problems in this area is to determine the minimum degree threshold which guarantees an F-decomposition in an incomplete host graph. We solve this problem for the case when F is bipartite and make significant progress towards the general case.

This is joint work with Stefan Glock, Daniela Kühn, Richard Montgomery and Deryk Osthus.

The time of graph bootstrap percolation

Graph bootstrap percolation, known also as weak saturation, is a simple cellular automaton introduced by Bollobás in 1968. Given a graph H and a subset G of E(K_{n}) we initially infect all edges in G and then, in consecutive steps, we infect every edge e that completes a new infected copy of H in K_{n}. We say that G percolates if eventually every edge in K_{n} is infected.

In this talk, for H = K_{r}, we discuss the running time of the process until it percolates. Treating this as an extremal question, we obtain bounds on the maximum running time of the process when the initial graph G is chosen deterministically. For G = G_{n,p}, we give threshold densities p=p(n,r,t) such that G_{n,p} percolates in exactly t time steps of the K_{r}-bootstrap process with high probability.

Based on joint work with Béla Bollobás, Oliver Riordan, and Julian Sahasrabudhe, and with Karen Gunderson and Sebastian Koch.

On forbidden induced subgraphs for unit disk graphs

A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore can be characterized in terms of minimal forbidden induced subgraphs. In spite of quite active study of unit disk graphs very little is known about minimal forbidden induced subgraphs for this class. We found only finitely many minimal non unit disk graphs in the literature. In this paper we study in a systematic way forbidden induced subgraphs for the class of unit disk graphs. We develop several structural and geometrical tools, and use them to reveal infinitely many new minimal non unit disk graphs. Further we use these results to investigate structure of co-bipartite unit disk graphs. In particular, we give structural characterization of those co-bipartite unit disk graphs whose edges between parts form a C_{4}-free bipartite graph, and show that bipartite complements of these graphs are also unit disk graphs. Our results lead us to propose a conjecture that the class of co-bipartite unit disk graphs is closed under bipartite complementation.

Based on joint work with Aistis Atminas.

Multi-particle diffusion limited aggregation

Many processes found in nature, for example dielectric breakdown cascades, Hele-shaw flow and electrodeposition, have fascinating similar behaviors such as the formation of fractal-like arms. We consider a classical random process of aggregation on Z^{d}, which belongs to a class of models introduced in the physics and chemistry literature to better understand how fractal structures arise in nature. At each vertex of Z^{d}, initially place one particle with probability mu, independently of other vertices. In addition, an aggregate will grow through Z^{d}. The aggregate initially consists only of the origin. Particles move as continuous time simple random walks obeying the exclusion rule (so that each vertex has no more than one particle at any time). The aggregate grows indefinitely by attaching particles to its surface whenever a particle attempts to jump onto it. Once a particle is attached to the aggregate, it becomes part of the aggregate and does not move anymore. The only rigorous results previously known about this process were restricted to 1 dimension. In this work we show that, for dimensions d>1, if the initial density of particles mu is large enough, then with positive probability the aggregate grows with positive speed, reaching out to distance of order t by time t.

This is a joint work with Vladas Sidoravicius.

Copyless cost register automata

Cost register automata (CRA) and its subclass, copyless CRA, were recently proposed by Alur et al. as a new model for computing functions over words. We study the expressiveness and closure properties of copyless CRA. In particular we compare this model with the well-know model of weighted automata. Weighted automata can be naturally characterized by a subfragment of weighted logic, a quantitative extension of MSO introduced by Droste and Gastin. Our results show that a similar characterization of copyless CRA seems to be unlikely. We introduce a new quantitative logic, which turns out to be equally expressive to a natural subclass of copyless CRA.

Based on joint work with Cristian Riveros.

The Reachability Problem for Two-Dimensional Vector Addition Systems with States

Does a given regular language over an alphabet of integer vectors contain a word such that (1) the sum of every prefix is non-negative and (2) the sum of the whole word is 0 ?

This problem, known as the reachability problem for vector addition systems with states, has widespread applications in logic, formal languages, control theory, and the verification of concurrent processes. It was first shown to be decidable already in the early 80s, but its exact complexity remains elusive to date.

In this talk I will recall the status quo regarding the complexity of the reachability problem, mostly focussing on the subproblems for fixed and small dimensions.

I will present our recent result on the two-dimensional case that the length of shortest reachability certificates is polynomial in the largest integer and the size of the NFA defining the input language. This complements a result by Blondin et. al. (LICS'15) and shows that the 2-dim. reachability problem is PSPACE-complete when numbers are encoded in binary and NL-complete if the input is given in unary.

A New Perspective on FO Model Checking of Dense Graph Classes

We consider the FO model checking problem of dense graph classes, namely those which are FO-interpretable in some sparse graph classes. If an input dense graph is given together with the corresponding FO interpretation in a sparse graph, one can easily solve the model checking problem using the existing algorithms for sparse graph classes. However, if the assumed interpretation is not given, then the situation is markedly harder.

We give a structural characterization of graph classes which are FO-interpretable in graph classes of bounded degree. This characterization allows us to efficiently compute such an interpretation for an input graph. As a consequence, we obtain an FPT algorithm for FO model checking of graph classes FO interpretable in graph classes of bounded degree. The approach we use to obtain these results may also be of independent interest.

Based on joint work with P. Hliněný, D. Lokshtanov, J. Obdržálek and M. S. Ramanujan.

Hamilton cycles in dense hypergraphs

We consider the problem of finding a Hamilton cycle in a uniform hypergraph of large minimum codegree. This is an area which has been widely studied over the years, with existing results including Dirac's classical theorem that any graph G on n>=3 vertices with minimum degree delta(G)>=n/2 admits a Hamilton cycle, and Röodl, Ruciński and Szemerédi's analogous theorem for k-uniform hypergraphs (k-graphs) H with minimum codegree delta(H)>=n/2+o(n).

Our attention is focussed on k-graphs with minimum codegree slightly below the aforementioned minimum codegree threshold. For tight cycles, we show that the determining the existence of a Hamilton cycle is NP-hard even in k-graphs H with minimum codegree delta(H)>=n/2-C , where C is a constant depending only on k. On the other hand, we demonstrate significantly different behavior for looser cycles. Indeed, we prove the existence of a constant eps such that we can find a Hamilton 2-cycle in polynomial time (or give a certificate that no such cycle exists) in a 4-graph H with delta(H)>=n/2-eps*n. This is achieved through a structural theorem which precisely characterises all 4-graphs H with delta(H)>=n/2-eps*n which do not contain a Hamilton 2-cycle.

This is joint work with Frederik Garbe (University of Birmingham).

Minimum number of edges in odd cycles

Erdős, Faudree and Rousseau conjectured in 1992 that for every k>=2 every graph with n vertices and n^{2}/4+1 edges contains at least 2n^{2}/9 edges that occur in an odd cycle of length 2k+1. We disprove this conjecture for k=2 by showing a graph with (2+sqrt(2))n^{2}/16 edges in pentagons. We prove that asymptotically this is the best possible constant in this case. For the remaining case k>=3, we prove that asymptotically the conjecture is true. The main tool used in the proofs is the flag algebra method applied in a specific two-colored setting.

Joint work with Andrzej Grzesik and Jan Volec.

Partial representation extension problems for classes of graphs with geometric representations

In order to define a class of graphs, we often say that the class consists of exactly those graphs which admit a specific (e.g. geometric) representation. For instance, interval graphs are the graphs that can be represented by real intervals so that every vertex is assigned an interval and the edges are the pairs of intervals that intersect. The recognition problem for such a class of graphs asks whether a graph provided in the input belongs to the class. Most recognition algorithms also produce an appropriate representation for positive instances. The partial representation extension problem generalizes the recognition problem: given a graph G, a subset S of V(G), and a representation R of the induced subgraph G[S], it asks whether G admits a representation that extends R, that is, whose restriction to S is equal to R.

Partial representation extension problems have been introduced in 2011 by Klavík, Kratochvíl and Vyskočil, who provided a polynomial-time algorithm for extending partial representations of interval graphs. In general, recognition algorithms for classes which allow a compact structural description of all valid representations of a graph (such as the PQ-tree for interval graphs or the modular decomposition for permutation graphs) are usually easy to generalize to solve the partial representation extension problem as well. However, for many natural classes of graphs like circular-arc graphs or trapezoid graphs no such structural description is known. In a joint work with Tomasz Krawczyk, we propose a way of overcoming this difficulty; in particular, we provide a polynomial-time partial representation extension algorithm for the class of trapezoid graphs.

In this talk, I will briefly survey results on partial representation extension problems for various classes of graphs. Then, for some example classes, I will explain what the structural description of all valid representations looks like and how it is useful for extending partial representations. Finally, I will present some ideas behind the above-mentioned algorithm for trapezoid graphs.

Non-Parametric Network Inference

Networks are ubiquitous in today’s world. Any time we make observations about people, places, or things and the interactions between them, we have a network. Yet a quantitative understanding of real-world networks is in its infancy, and must be based on strong theoretical and methodological foundations. The goal of this talk is to provide some insight into these foundations from the perspective of nonparametric techniques in relation to subgraph count statistics, in particular how tradeoffs between model complexity and parsimony can be balanced to yield practical algorithms with provable properties.

History-Register Automata

Programs with dynamic allocation are able to create and use an unbounded number of fresh resources, such as references, objects, files, etc. We propose History-Register Automata (HRA), a new automata-theoretic formalism for modelling such programs. HRAs extend the expressiveness of previous approaches and bring us to the limits of decidability for reachability checks. The distinctive feature of our machines is their use of unbounded memory sets (histories) where input symbols can be selectively stored and compared with symbols to follow. In addition, stored symbols can be consumed or deleted by reset. We show that the combination of consumption and reset capabilities renders the automata powerful enough to imitate counter machines, and yields closure under all regular operations apart from complementation. We moreover examine weaker notions of HRAs which strike different balances between expressiveness and effectiveness. This is joint work with Radu Grigore.

Moderate deviations of random graph subgraph counts

There have been many results recently on the probability of large deviations of subgraph counts in the Erdos-Renyi random graph G(n,p). In this talk we discuss smaller deviations in subgraph counts. And, as we shall see, the correct context for these results is G(n,m) rather than G(n,p).

Based on joint work with Christina Goldschmidt and Alex Scott.

Communication Lower Bounds for Statistical Estimation Problems

We study the tradeoff between the statistical error and communication cost of distributed statistical estimation problems in high dimensions. In the distributed sparse Gaussian mean estimation problem, each of the m machines receives n data points from a d-dimensional Gaussian distribution with unknown mean θ which is promised to be k-sparse. The machines communicate by message passing and aim to estimate the mean θ. We provide a tight (up to logarithmic factors) tradeoff between the estimation error and the number of bits communicated between the machines. This directly leads to a lower bound for the distributed sparse linear regression problem: to achieve the statistical minimax error, the total communication is at least Ω(min{n,d}m), where n is the number of observations that each machine receives and d is the ambient dimension. We also give the first optimal simultaneous protocol in the dense case for mean estimation.

As our main technique, we prove a distributed data processing inequality, as a generalization of usual data processing inequalities, which might be of independent interest and useful for other problems.

This is joint work with Mark Braverman, Ankit Garg, Tengyu Ma, and David P. Woodruff

Graph polynomials for locally convergent graph sequences

A sequence of graphs is called locally convergent if their features observable by local sampling are getting indistinguishable in the limit. This concept is most useful for bounded degree graphs. We observe how graph polynomials like the chromatic or matching polynomial behave on such a sequence of graphs. Are they convergent in some regard? What would be a suitable notion of convergence?

(Joint work with different subsets of Miklós Abért and Péter Csikvári.)

Regular and orientably regular maps

A map is a cellular decomposition of a surface, or, equivalently, a 2-cell embedding of a graph on a surface. A map is regular if its automorphism group is transitive, and hence regular, on flags (vertex-edge-side triples of mutually incident elements). If the supporting surface of a map is orientable, the map is orientably regular if its group of all orientation-preserving automorphisms is transitive, and hence regular, on arcs (edges with a direction). Regular and orientably regular maps are a natural generalisation of Platonic solids to arbitrary surfaces.

At an algebraic level, regular and orientably regular maps can be identified with the corresponding automorphism groups, which turn out to be quotients of the well-known triangle groups. This gives rise to rich connections between the theory of regular maps and group theory, hyperbolic geometry, Riemann surfaces and Galois theory.

In the talk we will discuss the state-of-the-art of classification of regular and orientably regular maps with a given underlying graph, supporting surface, or automorphism group, and outline open problems in this area of research.

An introduction to Lp samplers and their applications

In this talk, I will discuss certain class of samplers for dynamic data that are known as L_p samplers. Formally, given a finite stream of updates (additions and subtraction) on the coordinates of an underlying vector x in R^n, an L_p sampler outputs a random coordinate where the probability of picking the i-th coordinate is |x_i|^p/||x||_p^p. In particular for p=1, each coordinate is sampled proportional to its weight |x_i|, while For p=0, the sampler simply outputs a random non-zero coordinate.

Relaxing the requirements and for p in [0,2), it has been shown there are approximate L_p samplers that output the i-th coordinate with probability O(|x_i|^p/||x||_p^p) using only O(log^2n) bits of space.

In this talk, I will discuss the general idea behind such samplers and present two applications in finding duplicates and dynamic graph problems. If time permits, I also show an Omega(log^2 n) lower bound for sampling from 0,+-1 vectors that proves the tightness of the upper bound in terms of dependence on n. In conclusion, I will mention some open questions and motivations for further work in this area.

The major part of this talk will be based on a joint work with Mert Saglam and Gabor Tardos published in PODS 2011.

Closed Words: Algorithms and Combinatorics

A closed word, also referred to as a periodic-like word or complete first return, is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We show that a word of length n contains at least n+1 distinct closed factors. We also characterise words containing exactly n+1 closed factors. Furthermore, we show that a word of length n can contain Θ(n^{2}) many distinct closed factors.

On the algorithmic side, we consider factorising a word into its longest closed factors and present a linear time algorithm for this problem. In addition, we construct a closed factor array, which holds for every position in the word, the longest closed factor starting at that position. We describe our technique that runs in O(n log n/ log log n) time.

Heat kernels in graphs: A journey from random walks to geometry, and back

Heat kernels are one of the most fundamental concepts in physics and mathematics. In physics, the heat kernel is a fundamental solution of the heat equation and connects the Laplacian operator to the rate of heat dissipation. In spectral geometry, many fundamental techniques are based on heat kernels. In finite Markov chain theory, heat kernels correspond to continuous-time random walks and constitute one of the most powerful techniques in estimating the mixing time.

In this talk, we will briefly discuss this line of research and its relation to heat kernels in graphs. In particular, we will see how heat kernels are used to design the first nearly-linear time algorithm for finding clusters in real-world graphs. Some interesting open questions will be addressed as well.

This is based on the joint work with Richard Peng (MIT), and Luca Zanetti (University of Bristol). Parts of the results of this talk appeared in COLT 2015.

Exponentially dense matroids

The growth rate function for a minor-closed class of matroids is the function h(n) whose value at an integer n is the maximum number of elements in a simple matroid in the class of rank at most n; this can be seen as a measure of the density of thematroids in the class. A theorem of Geelen, Kabell, Kung and Whittle implies that h(n), where finite, grows either linearly, quadratically, or exponentially with base equal to some prime power q, in n. I will discuss growth rate functions for classes of theexponential sort, determining the growth rate function almost exactly for various interesting classes and giving a theorem that essentially characterises all such functions. No knowledge of matroid theory will be assumed.

The phase transition in bounded-size Achlioptas processes

In the Erdös-Rényi random graph process, starting from an empty graph, in each step a new random edge is added to the evolving graph. One of its most interesting features is the `percolation phase transition': as the ratio of the number of edges to vertices increases past a certain critical density, the global structure changes radically, from only small components to a single giant component plus small ones.

In this talk we consider Achlioptas processes, which have become a key example for random graph processes with dependencies between the edges. Starting from an empty graph these proceed as follows: in each step two potential edges are chosen uniformly at random, and using some rule one of them is selected and added to the evolving graph.

We shall prove that, for a large class of widely studied rules (so-called bounded-size rules), the percolation phase transition is qualitatively comparable to the classical Erdös-Rényi process. For example, assuming ε^{3}n→∞ and ε→0 as n→∞, the size of the largest component after step t_{c}n±εn whp satisfies L_{1}(t_{c}n-εn)∼Dε^{-2}log(ε^{3}n) and L_{1}(t_{c} n+εn)∼dεn, where t_{c},D,d>0 are rule-dependent constants (in the Erdös-Rényi process we have t_{c}=D=1/2 and d=4).

Based on joint work with Oliver Riordan.

Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture

A class of graphs is bridge-addable if, given a graph G in the class, any graph obtained by adding an edge between two connected components of G is also in the class. We prove a conjecture of McDiarmid, Steger and Welsh, that says that if G_{n} is taken uniformly at random from a class of bridge-addable graphs on n vertices, then G_{n} is connected with probability at least exp(-1/2)+o(1), when n tends to infinity. This lower bound is asymptotically best possible and it is reached for the class of forests. Our proof uses a "local double counting" strategy that enables us to compare the size of two sets of combinatorial objects by solving a related multivariate optimization problem. In our case, the optimization problem deals with partition functions of trees weighted by a supermultiplicative functional.

This is joint work with Guillaume Chapuy.

Parallel Algorithms for Geometric Graph Problems

Over the past decade a number of parallel systems such as MapReduce, Hadoop, and Dryad have become widely successful in practice. In this talk, I will present a new algorithmic framework for geometric graph problems for these kinds of systems. Our algorithms produce approximate solutions for problems such as Minimum Spanning Tree (MST) and Earth-Mover Distance (EMD). Provided the underlying set of points lies in a space of constant dimension, only a constant number of rounds is necessary, while the total amount of space and communication remains linear in the size of the data. In contrast, for general graphs, achieving the same result for MST (or even connectivity) remains a challenging open problem, despite drawing significant attention in recent years.

Our algorithmic framework has implications beyond modern parallel systems. For example, it yields a new algorithm for approximating EMD in the plane in near-linear time. We note that while recently Sharathkumar and Agarwal (STOC 2012) have developed a near-linear time algorithm for (1+epsilon)-approximating EMD, our approach is fundamentally different and also solves the transportation cost problem, which was raised as an open question in their work.

Joint work with Alexandr Andoni, Aleksandar Nikolov, and Grigory Yaroslavtsev.

The role of symmetry in high-dimensional sphere packing

The sphere packing problem asks how large a fraction of R^n can be covered with congruent balls if they are not allowed to overlap (except tangentially). In this talk, I’ll survey what’s known in high dimensions, with particular attention to the role of symmetry, and I’ll highlight some open problems on which progress should be possible.

Left and right convergence of bounded degree graphs

There are several notions of convergence for sequences of bounded degree graphs. One such notion is left convergence (also known as local or Benjamini-Schramm convergence), which is based on counting neighborhood distributions. Another notion is right convergence, based on counting homomorphisms to a target (weighted) graph. We introduce some of these notions. Borgs, Chayes, Kahn and Lovász showed that a sequence of bounded degree graphs is left convergent if and only if it is right convergent for certain target graphs H with all weights (including loops) close to 1. We will give a short alternative proof of this statement.

The optimal absolute ratio for online bin packing

We present an online bin packing algorithm with absolute competitive ratio 5/3, which is optimal.

Mantel's theorem extensions and analogues

Mantel’s theorem tells us precisely how many edges a triangle-free graph may contain. We will consider some of the many analogues and extensions of this result, old, new and conjectured. New results are joint work with Rahil Baber and Adam Sanitt.

Approximating the Nash Social Welfare with Indivisible Items

We study the problem of allocating a set of indivisible items among agents with additive valuations with the goal of maximizing the Nash social welfare objective, i.e., the product of the agents' valuations, a problem which is known to be NP-hard. Our main result is the first algorithm that guarantees a constant factor approximation for the average Nash social welfare. We first observe that the integrality gap of the convex program relaxation can be arbitrarily high so we propose a different fractional solution which we use as a guide to define an appropriate rounding which then leads to the constant factor approximation algorithm.

An interesting contribution of our analysis is the fractional solution that we use. The dual variables of the convex program that computes the Nash social welfare-maximizing fractional allocation can be interpreted as prices, and the fraction of the item allocated to each agent corresponds to how much the agent is spending on that item. Using this interpretation, we define a fractional solution that restricts the amount of spending that can go into any given item, thus keeping the highly demanded items under-allocated, and forcing the agents to spend on less desired items. As a result, the induced prices of this novel allocation reveal more information regarding how the less desired items should be allocated.

This is joint work with Vasilis Gkatzelis.

Leverhulme Lecture: Complexity Hierarchies Beyond Elementary

Decision problems with a non-elementary complexity occur naturally in logic, combinatorics, formal language, verification, etc., with complexities ranging from simple towers of exponentials to Ackermannian and beyond. Somewhat surprisingly, we lack the definitions of classes and reductions that would allow to state completeness results at such high complexities. We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non-elementary problems.

Optimal path and cycle decompositions of random graphs

Motivated by longstanding conjectures regarding decompositions of graphs into paths and cycles, we prove the optimal decomposition results for dense random graphs into (i) cycles and edges, (ii) paths and (iii) linear forests. There is also an interesting connection to the overfull subgraph conjecture on edge-colourings of graphs. We actually derive (i)-(iii) from quasirandom versions of our results.

The results are joint work with Stefan Glock and Deryk Osthus.

FPT algorithms via LP-relaxations

For a handful of problems (including some of the "flagship problems" of parameterized complexity), very efficient FPT algorithms can be constructed using using the LP-relaxation of the problem. However, this approach requires the LP to have some very restrictive properties that only a few LP-relaxations have, namely half-integrality and a technical condition known as persistence. (Prior to the work presented here, we knew of essentially two problems with such LP-relaxations, namely Vertex Cover and Node Multiway Cut). It was also not clear how to look for more compatible polytopes.

We circumvented this problem by observing that a half-integral LP relaxation corresponds to a polynomial-time solvable discrete problem relaxation to a larger domain, e.g., Vertex Cover can be efficiently minimised over the solution space {0, 1/2, 1}^n, which corresponds to optimisation over a domain of size 3. This lets us rephrase the existence of "useful relaxations" in the language of so-called Valued CSP problems.

In particular, we show that the LP-relaxations for Vertex Cover and Node Multiway Cut are special cases of a class of relaxations known as k-submodular functions, and use this class to give improved FPT algorithms for several other problems, including the first 2^O(k)-time algorithm for the problems Group Feedback Vertex Set and Subset Feedback Vertex. This is based on work from SODA 2014.

If time allows, I will also give a quick look at a direct combinatorial condition that provides an extension of this work.

FO Model Checking on Posets of Bounded Width

Over the past two decades the main focus of research into first-order (FO) model checking algorithms have been sparse relationalstructures - culminating in the FPT-algorithm by Grohe, Kreutzer and Siebertz for FO model checking of nowhere dense classes of graphs [STOC'14], with dense structures starting to attract attention only recently. Bova, Ganian and Szeider [LICS'14] initiated the study of the complexity of FO model checkingon partially ordered sets (posets). Bova, Ganian and Szeider showed that model checking existential FO logic is fixed-parameter tractable (FPT) on posets of bounded width, where the width of a poset is the size of the largest antichain in the poset. The existence of an FPT algorithm for general FO model checking on posets of bounded width, however, remained open. We resolve this question in the positive by giving an algorithm that takes as its input an n-element poset P of width w and an FO logic formula h, and determines whether h holds on P in time f(h,w)n^{2}.

Based on joint work with Jakub Gajarský, Petr Hliněný, Jan Obdržálek, Sebastian Ordyniak, M. S. Ramanujan, and Saket Saurabh.

Spectral Algorithms for Random Hypergraph Partitioning

I will discuss new algorithms for a collection of related problems: random hypergraph partitioning (the hypergraph generalization of the stochastic block model), planted random k-SAT, and inverting Goldreich's one-way function. In each the goal is to find a planted solution at the lowest possible edge or clause density. I will present both positive algorithmic results and lower bounds for general classes of algorithms. Based on joint work with Vitaly Feldman, Santosh Vempala, and Laura Florescu.

Hybrid tractability of binary CSPs

In this talk, we will survey recent work on the computational complexity of binary constraint satisfaction problems (CSPs) that are not tractable only due to the structure of the instance (such as bounded treewidth) or the types of the constraints in the instance (such as linear equations).

A part of this talk is based on joint work with David Cohen, Martin Cooper, and Peter Jeavons.

The Complexity of the Simplex Method

The simplex method is a well-studied and widely-used pivoting method for solving linear programs. When Dantzig originally formulated the simplex method, he gave a natural pivot rule that pivots into the basis a variable with the most violated reduced cost. In their seminal work, Klee and Minty showed that this pivot rule takes exponential time in the worst case. We prove two main results on the simplex method. Firstly, we show that it is PSPACE-complete to find the solution that is computed by the simplex method using Dantzig's pivot rule. Secondly, we prove that deciding whether Dantzig's rule ever chooses a specific variable to enter the basis is PSPACE-complete. We use the known connection between Markov decision processes (MDPs) and linear programming, and an equivalence between Dantzig's pivot rule and a natural variant of policy iteration for average-reward MDPs. We construct MDPs and show PSPACE-completeness results for single-switch policy iteration, which in turn imply our main results for the simplex method.

Joint work with John Fearnley

Random walks on dynamic graphs given by dynamical percolation

We study the behavior of random walk on dynamical percolation. In this model, the edges of a graph G are either open or closed, and refresh their status at rate \mu. At the same time a random walker moves on G at rate 1 but only along edges which are open. The regime of interest here is when \mu goes to zero as the number of vertices of G goes to infinity, since this creates long-range dependencies on the model. When G is the d-dimensional torus of side length n, we prove that in the subcritical regime, the mixing times is of order n^2/\mu. We also obtain results concerning mean squared displacement and hitting times.

This is a joint work with Yuval Peres and Jeff Steif.

Decompositions of large graphs into small subgraphs

A fundamental theorem of Wilson states that, for every graph F, every sufficiently large F-divisible clique has an F-decomposition. Here G has an F-decomposition if the edges of G can be covered by edge-disjoint copies of F (and F-divisibility is a trivial necessary condition for this). We extend Wilson’s theorem to graphs which are allowed to be far from complete (joint work with B. Barber, D. Kuhn, A. Lo).

I will also discuss some results and open problems on decompositions of dense graphs and hypergraphs into Hamilton cycles and perfect matchings.

A Distributed Greedy Algorithm for Submodular Maximization in Large Datasets

A variety of practical optimization problems such as sensor placement, document summarization, and influence maximization can be formulated in terms of maximizing a non-decreasing submodular function. One simple, yet practically effective approach to this problem is the simple, standard greedy algorithm, which requires time Θ(n^2). Unfortunately, this makes it impractical for extremely large data sets.

In this talk, I will present a new distributed greedy algorithm, based on joint work with Rafael Barbosa, Alina Ene, and Huy Le Nguyen. Unlike previous distributed approaches, our algorithm leverages the power of randomization to attain a constant-factor approximation, independent of the number of machines used. Moreover, our results can be applied to general matroid constraints and knapsack constraints, as well as decreasing submodular functions.

Colouring graphs without odd holes

Gyárfás conjectured in 1985 that if G is a graph with no induced cycle of odd length at least 5, then the chromatic number of G is bounded by a function of its clique number. We prove this conjecture, and discuss some further results. Joint work with Paul Seymour.

Learning game-theoretic equilibria via query protocols

In the traditional model of algorithmically solving a game, the entire game is the "input data", which is presented in its entirety to an algorithm that is supposed to compute a solution, for example an exact/approximate Nash/correlated equilibrium. In some situations it may be preferable to regard the game as a "black box" which the algorithm can find out about via queries. For example, a complete description of a multi-player game may be infeasibly large. In this talk, we give an overview of recent work on algorithms that find game-theoretic equilibria via a sequence of queries that specify pure-strategy profiles, and answer with the associated payoffs. The main research issue is "query complexity", which refers to how many queries are needed in order to find a given kind of solution.

Regular subgraphs of hypergraphs

An n-vertex graph with no r-regular subgraphs are forests if r=2, thus it has at most n-1 edges. For r>=3, Pyber showed that it has at most c_{r}n log(n) edges for some c_{r}. For hypergraphs, Mubayi and Verstraete showed that n-vertex k-graphs with no 2-regular subgraphs has at most {n-1 choose k-1} edges if k>=4 is even and n is sufficiently large. In this talk, we prove that for every integer r>=3, an n-vertex k-graph H containing no r-regular subgraphs has at most (1+o(1)){n-1 choose k-1} edges if k>r and n is sufficiently large. Moreover, if r=3,4, r|k, and n, k are both sufficiently large, then the maximum number of edges in H is exactly {n-1 choose k-1}, with equality only if all edges contain a specific vertex v. We also ask some related questions.

Rainbow triangles in three-colored graphs

Erdős and Sós proposed a problem of determining the maximum number F(n) of rainbow triangles in 3-edge-colored complete graphs on n vertices. They conjectured that F(n)=F(a)+F(b)+F(c)+F(d)+abc+abd+acd+bcd, where a+b+c+d=n and a,b,c,d are as equal as possible. We prove that the conjectured recurrence holds for sufficiently large n. We also prove the conjecture for n = 4^k for all k >= 0. These results imply that lim F(n)/{n choose 3}=0.4, and determine the unique limit object. In the proof we use flag algebras combined with stability arguments.

Joint work with József Balogh, Bernard Lidický, Florian Pfender, Jan Volec and Michael Young.

On the chromatic number of generalized shift graph

A generalized shifted graph is a graph whose vertices are ordered k-subsets a well ordered ground set and two vertices a_1<a_2<...<a_k and b_1<b_2<...<b_{k} are adjacent if they form some given pattern such as: a_1<a_2<b_1<a_3<b_2<...<b_{k-2}<a_k<b_{k-1},<b_{k}. In the talk we study the behaviour of the chromatic number of such graphs. (This is a joint work with Christian Avart and Vojta Rödl.)

The Ramsey number of the clique and the hypercube

The Ramsey number r(K_s,Q_n) is the smallest integer N such that every red-blue colouring of the edges of the complete graph on N vertices contains either a red n-dimensional hypercube Q_n, or a blue clique on s vertices. In 1983, Burr and Erdos conjectured that r(K_s,Q_n) = (s-1)(2^n - 1)+1 for every positive integer s and sufficiently large n. In this talk we shall sketch the proof of this conjecture and discuss some related problems. (Joint work with Gonzalo Fiz Pontiveros, Simon Griffiths, Rob Morris and David Saxton.)

Ramsey multiplicity of patterns in abelian groups

Burr and Rosta conjectured that given any fixed (small) graph H, a random 2-colouring of the edges of the complete graph K_n contains (asymptotically) the minimum number of monochromatic copies of H. This conjecture was disproved by Sidorenko, who showed that it is false when H is a triangle with a pendant edge. Despite a number of other special cases having been resolved since, the general classification problem remains wide open. We explore an analogous question concerning monochromatic additive configurations contained in 2-colourings of the cyclic group Z_p and the finite-dimensional vector space F_p^n. (This is joint work with Alex Saad.)

Stable Matching, Friendship, and Altruism

We will discuss both integral and fractional versions of "correlated stable matching" problems. Each player is a node in a social network and strives to form a good match with a neighboring player; the player utilities from forming a match are correlated. We consider the existence, computation, and inefficiency of stable matchings from which no pair of players wants to deviate. We especially focus on networks where players are embedded in a social context, and may incorporate friendship relations or altruism into their decisions.

When the benefits from a match are the same for both players, we show that incorporating the well-being of other players into their matching decisions significantly improves the quality of stable solutions. Furthermore, a good stable matching always exists and can be reached in polynomial time. We extend these results to more general matching rewards, when players matched to each other may receive different utilities from the match. For this more general case, we show that incorporating social context (i.e., "caring about your friends") can make an even larger difference, and greatly reduce the price of anarchy. Finally, we extend most of our results to network contribution games, in which players can decide how much effort to contribute to each incident edge, instead of simply choosing a single node to match with.

Structure in large spectra

The large spectrum, the set of frequencies where the Fourier transform of a given set is particularly large, plays an important role in arithmetic combinatorics. A important result about such sets is Chang's lemma, which gives a sharp bound for the additive dimension of such sets, the size of the largest dissociated subset. We present a new structural lemma which, for certain applications, is a quantitative improvement of Chang's lemma. As an application, we discuss how this can be used to obtain a new quantitative result for Roth's theorem on three term arithmetic progressions.

Efficient Teamwork

In real-life multi-agent projects, agents often choose actions that are highly inefficient for the project or damaging for other agents because they care only about their own contracts and interests. We show that this can be avoided by the right project management. We model agents with private workflows including hidden actions and chance events, which can influence each other through publicly observable actions and events. We design an efficient mechanism for this model which is prior-free, incentive-compatible, collusion-resistant, individually rational and avoids free-riders.

Flag triangulations of spheres: f-, h-, and γ- numbers

Heinz Hopf asked if the sign of the (reduced) Euler characteristic of the nonpositively curved manifold is determined by its dimension. The question was motivated by the following strategy (for Riemannian met‐ ric). Is there a higher‐dimensional analogue of Gauß‐Bonnet formula? Is the integrand of constant sign? The answer to the first question is affirmative, but the second is not true. Thus the problem remains open. If the manifold carries piecewise Euclidean metric, the version of Gauß‐Bonnet formula is obvious. Even in the simplest case of cubbed manifold (i.e. a manifold made of cubes) the "integrand" becomes an in‐ teresting combinatorial quantity. According to extremely simple, though beautiful construction due to Mike Davis the second question is equivalent to the original Hopf question (for cubbed manifolds). In the talk we would discuss the connection between "no missing faces" triangulation of spheres and nonpositively curved cubbed manifolds. We would derive famous Charney‐Davis Conjecture (Hopf conjecture for cubbed manifolds) and discuss the up‐to‐date human knowledge about it (as well as hopes and illusions).

Information Theoretical Cryptogenography

We consider problems where n people are communicating and a random subset of them is trying to leak information, without making it clear who are leaking the information. We introduce a measure of suspicion, and show that the amount of leaked information will always be bounded by the expected increase in suspicion, and that this bound is tight. Suppose a large number of people have some information they want to leak, but they want to ensure that after the communication, an observer will assign probability at most c to the events that each of them is trying to leak the information. How much information can they reliably leak, per person who is leaking? We show that the answer is -log(1−c)/c-log(e) bits.

Approximation Algorithms for Multiway Partitioning Problems and a Simplex Coloring Conjecture

We consider several problems where the goal is partition a ground set into several pieces while minimizing a "cut-type" objective function; examples include Multiway Cut, Node-weighted Multiway Cut, Metric Labeling and Hypergraph Labeling. A natural LP relaxation gives an optimal approximation for these problems, assuming the Unique Games Conjecture (the UGC assumption can be removed for certain submodular generalizations of these problems). However, we do not know how to round this LP in general and the focus has been on understanding this LP for specific problems. In this talk, we describe several rounding strategies and an integrality gap construction that leads to a simplex coloring conjecture reminiscent of Sperner’s Lemma.

This talk is based on joint work with Chandra Chekuri (UIUC), Huy Nguyen (Simons Institute Berkeley), Jan Vondrak (IBM Research Almaden), and Yi Wu (Google).

A tetrachotomy for positive equality-free logic

We consider the problem of evaluating positive equality-free sentences of FO on a fixed, finite relational structure B. This may be seen as a generalisation of the Quantified Constraint Satisfaction Problem (QCSP), itself a generalisation of the Constraint Satisfaction Problem (CSP). We argue that our generalisation is not totally arbitrary, and that ours is the only problem in a large class - other than the CSP and QCSP - whose complexity taxonomy was unsolved.

We introduce surjective hyper-endomorphisms in order to give a Galois connection that characterises definability in positive equality-free FO. Through the algebraic method we are able to characterise the complexity of our problem for all finite structures B. Specifically, the problem is either in Logspace, NP-complete, co-NP-complete or Pspace-complete.

The problem appears obtuse, but possesses a surprising elegance. There may yet be lessons to be learnt in the methodology of the solution of this case, for the continuing program for CSP.

Rooted Triplet Inconsistency: Hardness and Algorithms

Andrew Chester (Melbourne), Riccardo Dondi (Bergamo), Anthony Wirth (Melbourne) The Minimum Rooted Triplet Inconsistency (MinRTI) problem represents a key computational task in the construction of phylogenetic trees, whose goal is the reconstruction of a large tree that incorporates the information contained in a given set of triplets. Inspired by Aho et al's seminal paper and Bryant's thesis, we consider an edge-labelled multigraph problem, called Minimum Dissolving Graph (MinDG), and we show that is equivalent to MinRTI. We prove that on an n-vertex graph, for every x > 0, MinDG is hard to approximate within a factor in O(2^{\og^{1-x}n}), even on trees formed by multi-edges. Then, via a further reduction, this inapproximability result extends to MinRTI. In addition, we provide polynomial-time algorithms that return optimal solutions when the input multigraph is restricted to a multi-edge path or a simple tree. Finally, we investigate the complexity of MinRTI (and of MinDG) when the number of occurrences of every label is bounded, and we show that the problem is APX-hard when this bound is equal to five.

Subexponential Parameterized Complexity of Completion Problems

Let P be a fixed hereditary graph class. In the P Completion problem, given a graph G and an integer k, we ask whether it is possible to add at most k edges to G to obtain a member of P. In the recent years completion problems received significant attention from the perspective of parameterized complexity, with the standard parameterization by k. In my talk I will first survey the history of the study of parameterized complexity of completion problems, including the breakthrough paper of Villanger et al that settles fixed-parameter tractability of Interval Completion, as well as recent advancements on polynomial kernelization.

Then, we will move to the main topic of the talk, namely subexponential parameterized algorithms. First fixed-parameter algorithms for completion problems focused mostly on the ‘forbidden induced subgraphs’ definition of the graph class P in question. In 2012 Fomin and Villanger came up with a novel idea to instead focus on some structural definition of the class P, trying to build the modified output graph by dynamic programming. Slightly simplifying, we may say that the main technical contribution of Fomin and Villanger is a bound of at most exp(sqrt(k)log(k)) reasonable ‘partial chordal graphs’ for an input instance (G, k) of Chordal Completion. Consequently, Chordal Completion can be solved in exp(sqrt(k)log(k))+poly(n) time. Following the approach of Fomin and Villanger, in the past two years subexponential parameterized algorithms were shown for the class of chain, split, threshold, trivially perfect, pseudosplit and, very recently, proper interval and interval graphs. Moreover, a few lower bounds for related graph classes were found.

In my talk I will present the approach of Fomin and Villanger mostly on the example of Trivially Perfect Completion, and then survey the main ideas needed in the remaining algorithms.

Differentially Private Data Release

Privacy preserving data publishing is an important problem that has been extensively studied in the past decades. The state-of-the-art solution to the problem is differential privacy, which offers a strong degree of privacy protection without relying on restrictive assumptions of the adversary. In this talk, we first give a brief introduction to differential privacy, then show how to handle the publication of high-dimensional sensitive data with differential privacy guarantees.

The height of the tower in Szemerédi's regularity lemma

Szemerédi’s regularity lemma is one of the most powerful tools in graph theory. Roughly speaking, the lemma says that the vertex set of any graph may be partitioned into a small number of parts such that the bipartite subgraph between almost every pair of parts behaves in a random-like fashion. Addressing a question of Gowers, we determine the order of the tower height for the partition size in a version of Szemerédi’s regularity lemma.

Joint work with Jacob Fox.

Minors and dimension

The dimension of a poset P is the minimum number of linear extensions of P whose intersection is equal to P. This parameter plays a similar role for posets as the chromatic number does for graphs. A lot of research has been carried out in order to understand when and why the dimension is bounded. There are constructions of posets with height 2 (but very dense cover graphs) or with planar cover graphs (but unbounded height) that have unbounded dimension. Streib and Trotter proved in 2012 that posets with bounded height and with planar cover graphs have bounded dimension. Recently, Joret et al. proved that the dimension is bounded for posets with bounded height whose cover graphs have bounded tree-width. My current work generalizes both these results, showing that the dimension is bounded for posets of bounded height whose cover graphs exclude a fixed (topological) minor. The proof is based on the Robertson-Seymour and Grohe-Marx structural decomposition theorems.

In this talk, I will survey results relating the dimension of a poset to structural properties of its cover graph and present some ideas behind the proof of the result on excluded minors.

Some problems around random walks

I will present a selection of open problems related to random walks on graphs that I hope will be of interest to the computer science and extremal combinatorics communities.

Subcubic triangle-free graphs have fractional chromatic number at most 14/5

We prove the following conjecture of Heckman and Thomas: every triangle-free graph with maximum degree 3 is fractionally (14/5)-colorable. A graph is fractionally k-colorable if every vertex can be assigned a measurable subset of [0,k) of unit Lebesgue measure and the sets of every two adjacent vertices are disjoint.

This is a joint work with Zdeněk Dvořák and Jean-Sébastien Sereni.

The topology and Möbius function of the permutation pattern poset

An occurrence of the pattern *p* in a permutation Π is a subsequence of length |*p*| in Π whose letters appear in the same order of size as the letters in *p*. For example, the subsequence 425 in 341625 is an occurrence of 213, whereas 341625 *avoids* 321. The set of all finite permutations forms a poset with respect to pattern containment. As this poset embodies all pattern containment (and avoidance) in permutations, it is a fundamental object in all pattern studies. We study its *intervals* [*A,B*], that is, sets of permutations containing a given permutation *A* and contained in another permutation *B*. This poset has a rich structure, only a little of which is understood so far.

Any interval *I* has an associated simplicial complex, called its *order complex*, whose topological properties are closely connected to properties of *I*. For example, the reduced Euler characteristic of an order complex equals the Möbius function of the underlying poset. Thus, a boolean algebra, whose order complex is a sphere, has Möbius function ±1.

So far, we only know a few things about the topology and Möbius function of intervals in this poset. For example, we know that intervals of layered permutations (which are concatenations of decreasing sequences, each with smaller letters than the next, such as 321465) are *shellable*. That implies they are homotopy equivalent to wedges of spheres, and the Möbius function, which equals, up to a sign, the number of spheres, can be computed in polynomial time. The same is true for intervals of permutations with a fixed number of *descents* (pairs of adjacent letters in decreasing order). We can also compute, in polynomial time, the Möbius function for intervals of *separable* permutations (those avoiding 2413 and 3142) and we conjecture that they are also shellable.

I will report on joint work with Peter McNamara and work of my student Jason Smith.

Diffusion Load Balancing

In Diffusion Load Balancing one assumes that a set of m tasks are arbitrarily distributed over n resources. The system is modelled by a graph where the nodes represent the resources and the edges represent communication links between resources. Diffusion Load Balancing works in synchronous rounds. In every round every node is allowed to balance its load with its direct neighbours in the network. The later model is usually assumed to be the more realistic model. The question is not how long does it take to balance the load as evenly as possible.

One distinguishes between continuous and discrete models. In continuous load balancing the tasks can be split arbitrarily, allowing neighbouring nodes to balance their load evenly. In discrete load balancing tasks can not be split at all and a well balanced situation is much harder to achieve.

In this talk I will introduce two different frameworks that translate a continuous load balancing scheme into a discrete versions. The first scheme tries to simulate the continuous algorithm whereas the second scheme is a more direct approach.

Balls into Bins via Local Search

We study a natural process for allocating m balls (tasks) into n bins (resources) that are organized as the vertices of an undirected graph G. Balls arrive one at a time. When a ball arrives, it first chooses a vertex u in G uniformly atrandom. Then the ball performs a local search in G starting from u until it reaches a vertex with local minimum load, where the ball is finally placed on. Then the next ball arrives and this procedure is repeated. In this talk we derive bounds on the maximum load of this process and the time until every bin has at least one ball allocated to it.

RSP-based analysis for the efficiency of l_{1}-minimization for solving l_{0}-problems

Many practical problems (e.g., signal and image processing) can be formulated as l_{0}-minimization problems, which seek the sparsest solution to an underdetermined linear system. The recent study indicates that l_{1}-minimization is efficient for solving l_{0}-problems in many situations. From a mathematical point of view, however, the understanding of the relationship between l_{0}- and l_{1}-minimization remains incomplete. Their relationship can be further interpreted via the property of the range space of the transpose of matrices, which provides an angle to completely characterize the uniqueness of l_{1}-minimizers and the uniform recovery of k-sparse signals. This analysis leads naturally to the concept of range space property (RSP) and the so-called 'full-column-rank' property, which altogether provide a broad understanding of the equivalence and the strong equivalence between l_{0}- and l_{1}-minimization problems.

A new optimization framework for dynamic resource allocation problems

Many decision problems can be cast as dynamic resource allocation problems, i.e., they can be framed in the context of a set of requests requiring a complex time-based interaction amongst a set of available resources. For instance scheduling, one of the classic problem in Operations Research, belongs to this class.

For this class of problem we present a new optimization framework. The framework a) allows modeling flexibility by incorporating different objective functions, alternative sets of resources and fairness controls; b) is widely applicable in a variety of problems in transportation, services and engineering; and c) is tractable, i.e., provides near optimal solutions fast for large-scale instances. To justify these assertions, we model and report encouraging computational results on three widely studied problems - the Air Traffic Flow Management, the Aircraft Maintenance Problems and Job Shop Scheduling. Finally, we provide several polyhedral results that offer insights on its effectiveness.

Joint work with D. Bertsimas and S. Gupta

Fast projection methods for robust separable nonnegative matrix factorization

Nonnegative matrix factorization (NMF) has become a widely used tool for analysis of high-dimensional data. In this talk, we first present a series of applications of NMF in image processing, text mining, and hyperspectral imaging. Then we address the problem of solving NMF, which is NP-hard in general. However, certain special cases, such as the case of separable data with noise, are known to be solvable in polynomial time. We propose a very fast successive projection algorithm for this case. Variants of this algorithm have appeared previously in the literature; our principal contribution is to prove that the algorithm is robust against noise and to formulate bounds on the noise tolerance. A second contribution is an analysis of a preconditioning strategy based on semidefinite programming that significantly improves the robustness against noise. We present computational results on artificial data and on a simulated hyperspectral imaging problem. (Joint work with Stephen Vavasis; see http://arxiv.org/abs/1208.1237 and http://arxiv.org/abs/1310.2273 for more details.)

Temporal Networks : Optimization and Connectivity

We consider here Temporal Networks. They are defined by a labelling L assigning a set of discrete time-labels to each edge of the graph G of the network. The labels of an edge are natural numbers. They indicate the discrete time moments at which the edge is available. We focus on path problems of temporal networks. In particular we consider time-respecting paths , i.e. paths whose edges are assigned by L a strictly increasing sequence of labels. We begin by giving efficient algorithms for computing shortest time-respecting paths. We then prove a natural analog of Menger’s theorem holding for arbitrary temporal networks. Finally we propose two cost minimization parameters for temporal network design. One is the “temporality” of G , in which the goal is to minimize the maximum number of labels per edge and the other is the temporal cost of G , where the goal is to minimize the total number of labels used. Optimization of these parameters is subject to some connectivity constraints. We prove several lower and upper bounds for the temporality and the temporal cost of some very basic graphs like rings, trees, directed acyclic graphs. We also examine how hard is to compute (even approximately) such costs. This work is joint with G. Mertzios and O. Michail and appeared in ICALP 2013.

Strongly polynomial algorithm for generalized flow maximization

The generalized flow model is a classical extension of network flows. Besides the capacity constraints, there is a gain factor given on every arc, such that the flow amount gets multiplied by this factor while traversing the arc. Gain factors can be used to model physical changes such as leakage or theft. Other common applications use the nodes to represent different types of entities, e.g. different currencies, and the gain factors correspond to the exchange rates. We investigate the flow maximization problem in such networks. This is described by a linear program, however, no strongly polynomial algorithm was known before, despite a vast literature on combinatorial algorithms. From a general linear programming perspective, this is probably the simplest linear program where Tardos's general result on strongly polynomial algorithms does not apply. We give the first strongly polynomial algorithm for the problem. It uses a new variant of the classical scaling technique, called continuous scaling. The main measure of progress is that within a strongly polynomial number of steps, an arc can be identified that must be tight in every dual optimal solution, and thus can be contracted, reducing the size of the problem instance.

Learning Sums of Independent Integer Random Variables

Let S be a sum of n independent integer random variables, each supported on {0,1,...,k−1}. How many samples are required to learn the distribution of S to high accuracy? In this talk I will show that the answer is completely independent of n, and moreover I will describe a computationally efficient algorithm which achieves this low sample complexity. More precisely, the algorithm learns any such S to ε-accuracy (with respect to the total variation distance) using poly(k,1/ε) samples, independent of n. Its running time is poly(k,1/ε) in the standard word RAM model.

This result a broad generalization of the main result of [Daskalakis, Diakonikolas, Servedio-STOC'12] which gave a similar learning result for the special case k=2 (when the distribution S is a Poisson Binomial Distribution). Prior to this work, no nontrivial results were known for learning these distributions even in the case k=3. A key difficulty is that, in contrast to the case of k=2, sums of independent {0,1,2}-valued random variables may behave very differently from (discretized) normal distributions, and in fact may be rather complicated --- they are not log-concave, they can have Ω(n) local optima, there is no relationship between the Kolmogorov distance and the total variation distance for the class, etc.

The heart of the learning algorithm is a new limit theorem which characterizes what the sum of an arbitrary number of arbitrary independent {0,1,...,k−1}-valued random variables may look like. Previous limit theorems in this setting made strong assumptions on the "shift invariance" of the constituent random variables in order to force a discretized normal limit. We believe that our new limit theorem, as the first result for truly arbitrary sums of independent {0,1,...,k−1}-valued random variables, is of independent interest.

The talk will be based on a joint work with Costis Daskalakis, Ryan O'Donnell, Rocco Servedio and Li-Yang Tan.

A domination algorithm for {0,1}-instances of the travelling salesman problem

In this talk, I shall discuss an approximation algorithm for {0,1}-instances of the travelling salesman problem which performs well with respect to combinatorial dominance. More precisely, given a {0,1}-edge-weighting of the complete graph Kn on n vertices, our algorithm outputs a Hamilton cycle H of Kn with the following property: the proportion of Hamilton cycles of Kn whose weight is smaller than that of H is at most n^{-1/29} = o(1). Our analysis is based on a martingale approach. Previously, the best result in this direction was a polynomial-time algorithm with domination ratio 1/2 - o(1) for arbitrary edge weights. On the hardness side we can show that, if the Exponential Time Hypothesis holds, there exists a constant C such that n^{-1/29} cannot be replaced by exp(-(log n)^{C}) in the result above. (Joint work with Daniela Kühn and Deryk Osthus)

Tight Lower Bounds for the Online Labeling Problem

In the online labeling problem with parameters n and m we are presented with a sequence of n keys from a totally ordered universe U and must assign each arriving key a label from the label set {1,2,...,m} so that the order of labels (strictly) respects the ordering on U. As new keys arrive it may be necessary to change the labels of some items; such changes may be done at any time at unit cost for each change. The goal is to minimize the total cost. An alternative formulation of this problem is the file maintenance problem, in which the items, instead of being labeled, are maintained in sorted order in an array of length m, and we pay unit cost for moving an item. Although there exists simple algorithm for solving file maintenance problem for more than 30 years (Itai, Konheim, Rodeh, 1981) no matching lower bound was known until our recent result (Bulanek, Koucky, Saks, STOC 2012). For the case m=n^{C} for C>1, there was known lower bound (Dietz, Seiferas, Zhang, 2004), however the proof was rather complicated and could not be extended to even bigger m (for example m=n^{log n}). This was solved in our next result (Babka, Bulanek, Cunat, Koucky, Saks, ESA 2013). In this talk I would like to talk about the importance of the Online Labeling for Cache oblivious algorithms and also I would like to show basic ideas of our results.

Joint work with Martin Babka, Vladimír Cunat, Michal Koucky, Michael Saks

The Evolution of Subcritical Achlioptas Processes

In Achlioptas processes, starting from an empty graph, in each step two potential edges are chosen uniformly at random, and using some rule one of them is selected and added to the evolving graph. Although the evolution of such 'local' modifications of the Erdös-Rényi random graph process has received considerable attention during the last decade, so far only rather simple rules are well understood. Indeed, the main focus has been on 'bounded-size' rules, where all component sizes larger than some constant B are treated the same way, and for more complex rules very few rigorous results are known.

We study Achlioptas processes given by (unbounded) size rules such as the sum and product rules. Using a variant of the neighbourhood exploration process and branching process arguments we show that certain key statistics are tightly concentrated at least until the susceptibility (the expected size of the component containing a randomly chosen vertex) diverges. Our convergence result is most likely best possible for certain rules: in the later evolution the number of vertices in small components may not be concentrated. Furthermore, we believe that for a large class of rules the critical time where the susceptibility 'blows up' coincides with the percolation threshold.

Joint work with Oliver Riordan.

A Unified Approach to Truthful Scheduling on Related Machines

We present a unified framework for designing deterministic monotone polynomial time approximation schemes (PTAS's) for a wide class of scheduling problems on uniformly related machines. This class includes (among others) minimizing the makespan, maximizing the minimum load, and minimizing the lp norm of the machine loads vector. Previously, this kind of result was only known for the makespan objective. Monotone algorithms have the property that an increase in the speed of a machine cannot decrease the amount of work assigned to it. The key idea of our novel method is to show that for goal functions that are sufficiently well-behaved functions of the machine loads, it is possible to compute in polynomial time a highly structured nearly optimal schedule. Monotone approximation schemes have an important role in the emerging area of algorithmic mechanism design. In the game-theoretical setting of these scheduling problems there is a social goal, which is one of the objective functions that we study. Each machine is controlled by a selfish single-parameter agent, where its private information is its cost of processing a unit sized job, which is also the inverse of the speed of its machine. Each agent wishes to maximize its own profit, defined as the payment it receives from the mechanism minus its cost for processing all jobs assigned to it, and places a bid which corresponds to its private information. For each one of the problems, we show that we can calculate payments that guarantee truthfulness in an efficient manner. Thus, there exists a dominant strategy where agents report their true speeds, and we show the existence of a truthful mechanism which can be implemented in polynomial time, where the social goal is approximated within a factor of 1+ε for every ε>0.

Balanced Graph Partitioning for Massive Scale Computations

In recent time, there has been a lot of interest in balanced graph partitioning of large scale graphs to scale out computations that use as input a large-scale graph input data by running in parallel on distributed clusters of machines. Traditional balanced graph partitioning asks to partition a set of vertices such that the number of vertices across different partitions is balanced within some degree of slackness, and the number of cut edges is minimized. This problem is known to be NP hard and the best known approximation ratio is O(\sqrt{\log n \log k}) for partitioning of a graph with n vertices to k partitions. Substantial work was recently devoted to studying the online graph partitioning problem where vertices are required to be irrevocably assigned to partitions as they are observed in an input stream of vertices, mostly by studying various heuristics and developing some limited theoretical results. An alternative way to partition a graph that has emerged recently is so called edge partitioning, where instead, the set of edges is partitioned. The motivation for the latter strategy for partitioning a graph is that many real-world graphs exhibit a power-law degree sequence, so some portion of vertices have large degrees and allowing to assign the edges incident to high-degree vertices to different partitions may allow to achieve a good load balance and a small cut. The problem becomes even more challenging with the cut cost defined to account for the aggregation of messages that is allowed by many distributed computations. In this talk, we will present our work and results in the area.

Bidimensionality on Geometric Intersection Graphs

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, polylines, ellipsoids and even convex polyhedra. We consider geometric intersection graphs GB where each body of the collection B is represented by a vertex, and two vertices of GB are adjacent if the intersection of the corresponding bodies is non-empty. For such graph classes and under natural restrictions on their maximum degree or subgraph exclusion, we prove that the relation between their tree-width and the maximum size of a grid minor is linear. These combinatorial results vastly extend the applicability of all the meta-algorithmic results of the bidimensionality theory to geometrically defined graph classes.

Equidistributions on Planar Maps via Involutions on Description Trees

Description trees were introduced by Cori, Jacquard and Schaeffer in 1997 to give a general framework for the recursive decompositions of several families of planar maps studied by Tutte in a series of papers in the 1960s. We are interested in two classes of planar maps which can be thought as connected planar graphs embedded in the plane or the sphere with a directed edge distinguished as the root. These classes are rooted non-separable (or, 2-connected) and bicubic planar maps, and the corresponding to them trees are called, respectively, β(1,0)-trees and β(0,1)-trees.

Using different ways to generate these trees we define two endofunctions on them that turned out to be involutions. These involutions are not only interesting in their own right, in particular, from counting fixed points point of view, but also they were used to obtain non-trivial equidistribution results on planar maps, certain pattern avoiding permutations, and objects counted by the Catalan numbers.

The results to be presented in this talk are obtained in a series of papers in collaboration with several researchers.

Multi-Branch Split Cutting Planes for Mixed-Integer Programs

Cutting planes (cuts, for short), or inequalities satisfied by integral solutions of systems of linear inequalities, are important tools used in modern solvers for integer programming problems. In this talk we present theoretical and computational results on split cuts — studied by Cook, Kannan and Schrijver (1990), and related to Gomory mixed-integer cuts — and recent generalizations, namely multi-branch split cuts. In particular, we give the first pure cutting plane algorithm to solve mixed-integer programs based on multi-branch split cuts. We also show that there are mixed-integer programs with n+1 variables which are unsolvable by (n-1)-branch split cuts. In computational work, we consider a family of quadratic unconstrained boolean optimization problems recently used in tests on the DWave quantum computer and discuss how they can be solved using special families of split cuts in reasonable time.

This is joint work with Neil Dobbs, Oktay Gunluk, Tomasz Nowicki, Grzegorz Swirczsz and Marcos Goycoolea.

Partition Regularity in the Rationals

A system of linear equations is partition regular if, whenever the natural numbers are finitely coloured, it has a monochromatic solution. We could instead talk about partition regularity over the rational numbers, and if the system is finite then these notions coincide. What happens in the infinite case? Joint work with Neil Hindman and Imre Leader.

Dynamic Financial Hedging Strategies for a Storable Commodity with Demand Uncertainty

We consider a firm purchasing and processing a storable commodity in a volatile commodity price market. The firm has access to both a commodity spot market and an associated financial derivatives market. The purchased commodity serves as a raw material which is then processed into an end product with uncertain demand. The objective of the firm is to coordinate the replenishment and financial hedging decisions to maximize the mean-variance utility of its terminal wealth over a finite horizon.

We employ a dynamic programming approach to characterize the structure of optimal time-consistent policies for inventory and financial hedging decisions of the firm. Assuming unmet demand is lost, we show that under forward hedges the optimal inventory policy can be characterized by a myopic state-dependent base-stock level. The optimal hedging policy can be obtained by minimizing the variance of the hedging portfolio, the value of excess inventory and the profit-to-go as a function of future price. In the presence of a continuum of option strikes, we demonstrate how to construct custom exotic derivatives using forwards and options of all strikes to replicate the profit-to-go function. The financial hedging decisions are derived using the expected profit function evaluated under the optimal inventory policy. These results shed new light into the corporate risk and operations management strategies: inventory replenishment decisions can be separated from the financial hedging decisions as long as forwards are in place, and the dynamic inventory decision problem reduces to a sequence of myopic optimization problems. In contrast to previous results, our work implies that financial hedges do affect optimal operational policies, and inventory and financial hedges can be substitutes. Finally, we extend our analysis to the cases with backorders, price-sensitive demand, and variable transaction costs.

Joint work with Panos Kouvelis (Olin School of Business, Washington University in St. Louis, US) and Qing Ding (Huazhong University of Science and Technology, Wuhan, China.)

Faster Algorithms for the Sparse Fourier Transform

The Fast Fourier Transform (FFT) is one of the most fundamental numerical algorithms. It computes the Discrete Fourier Transform (DFT) of an n-dimensional signal in O(n log n) time. The algorithm plays an important role in many areas. It is not known whether its running time can be improved. However, in many applications, most of the Fourier coefficients of a signal are "small" or equal to zero, i.e., the output of the transform is (approximately) sparse. In this case, it is known that one can compute the set of non-zero coefficients faster than in O(n log n) time.

In this talk, I will describe a new set of efficient algorithms for the sparse Fourier Transform. One of the algorithms has the running time of O(k log n), where k is the number of non-zero Fourier coefficients of the signal. This improves over the runtime of the FFT for any k = o(n). If time allows, I will also describe some of the applications, to spectrum sensing and GPS locking, as well as mention a few outstanding open problems.

The talk will cover the material from the joint papers with Fadel Adib, Badih Ghazi, Haitham Hassanieh, Michael Kapralov, Dina Katabi, Eric Price and Lixin Shi. The papers are available at http://groups.csail.mit.edu/netmit/sFFT/

Near-Optimal Multi-Unit Auctions with Ordered Bidders

I will discuss prior-free profit-maximizing auctions for digital goods. In particular, I will give an overview of the area and I will focus on prior-free auctions with ordered bidders and identical items. In this model, we compare the expected revenue of an auction to the monotone price benchmark: the maximum revenue that can be obtained from a bid vector using prices that are non-increasing in the bidder ordering and bounded above by the second-highest bid. I will discuss an auction with constant-factor approximation guarantee for identical items, in both unlimited and limited supply settings. Consequently, this auction is simultaneously near-optimal for essentially every Bayesian environment in which bidders' valuation distributions have non-increasing monopoly prices, or in which the distribution of each bidder stochastically dominates that of the next.

Information Theory and Compressed Sensing

The central goal of compressed sensing is to capture attributes of a signal using very few measurements. In most work to date this broader objective is exemplified by the important special case of classification or reconstruction from a small number of linear measurements. In this talk we use information theory to derive fundamental limits on compressive classification, on the maximum number of classes that can be discriminated with low probability of error and on the tradeoff between the number of classes and the probability of misclassification. We also describe how to use information theory to guide the design of linear measurements by maximizing mutual information between the measurements and the statistics of the source.

Routing in Directed Graphs with Symmetric Demands

In this talk, we consider some fundamental maximum throughput routing problems in directed graphs. In this setting, we are given a capacitated directed graph. We are also given source-destination pairs of nodes (s_1, t_1), (s_2, t_2), ..., (s_k, t_k). The goal is to select a largest subset of the pairs that are simultaneously routable subject to the capacities; a set of pairs is routable if there is a multicommodity flow for the pairs satisfying certain constraints that vary from problem to problem (e.g., integrality, unsplittability, edge or node capacities). Two well-studied optimization problems in this context are the Maximum Edge Disjoint Paths (MEDP) and the All-or-Nothing Flow (ANF) problem. In MEDP, a set of pairs is routable if the pairs can be connected using edge-disjoint paths. In ANF, a set of pairs is routable if there is a feasible multicommodity flow that fractionally routes one unit of flow from s_i to t_i for each routed pair (s_i, t_i).

MEDP and ANF are both NP-hard and their approximability has attracted substantial attention over the years. Over the last decade, several breakthrough results on both upper bounds and lower bounds have led to a much better understanding of these problems. At a high level, one can summarize this progress as follows. MEDP and ANF admit poly-logarithmic approximations in undirected graphs if one allows constant congestion, i.e., the routing violates the capacities by a constant factor. Moreover, these problems are hard to approximate within a poly-logarithmic factor in undirected graphs even if one allows constant congestion. In sharp contrast, both problems are hard to approximate to within a polynomial factor in directed graphs even if a constant congestion is allowed and the graph is acyclic.

In this talk, we focus on routing problems in directed graphs in the setting in which the demand pairs are symmetric: the input pairs are unordered and a pair s_i t_i is routed only if both the ordered pairs (s_i,t_i) and (t_i,s_i) are routed. Perhaps surprisingly, the symmetric setting can be much more tractable than the asymmetric setting. As we will see in this talk, when the demand pairs are symmetric, ANF admits a poly-logarithmic approximation with constant congestion. We will also touch upon some open questions related to MEDP in directed graphs with symmetric pairs.

This talk is based on joint work with Chandra Chekuri (UIUC).

NL-completeness of Equivalence for Deterministic One-Counter Automata

Emerging from formal language theory, a classical model of computation is that of pushdown automata. A folklore result is that equivalence of pushdown automata is undecidable. Concerning deterministic pushdown automata, there is still an enormous complexity gap, where the primitive recursive upper bound is not matched by the best-known lower bound of P-hardness. Thus, further subclasses have been studied. The aim of the talk is to sketch the ideas underlying the recent result that has been presented at STOC'13. It is shown that equivalence of deterministic one-counter automata is NL-complete. One-counter automata are pushdown automata over a singleton stack alphabet plus a bottom stack symbol. This improves the superpolynomial complexity upper bound shown by Valiant and Paterson in 1975. The talk is based on joint results with S. Göller and P. Jančar.

Vertex-Minors of Graphs

The vertex-minor relation of graphs is defined in terms of local complementation and vertex deletion. This concept naturally arises in the study of circle graphs (intersection graphs of chords in a circle) and rank-width of graphs. Many theorems on graph minors have analogous results in terms of vertex-minors and some graph algorithms are based on vertex-minors. We will survey known results and discuss a recent result regarding unavoidable vertex-minors in very large graphs.

On Optimality of Clustering by Space Filling Curves

This talk addresses the following question: “How much do I lose if I insist on handling multi-dimensional data using one-dimensional indexes?”. A space filling curve (SFC) is a mapping from a multi-dimensional universe to a single dimension, and has been used widely in the design of data structures in databases and scientific computing, including commercial products such as Oracle. A fundamental quality metric of an SFC is its “clustering number”, which measures the average number of contiguous segments a query region can be partitioned into.

We present the first non-trivial lower bounds on the clustering number of any space filling curve for a general class of multidimensional rectangles, and a characterization of the clustering number of a general class of space filling curves. These results help resolve open questions including one posed by Jagadish in 1997, and show fundamental limits on the performance of this data structuring technique.

This is based on joint work with Pan Xu.

Optimizing the Management of Crews and Aircrafts in Canary Islands

This talk deals with a routing-and-scheduling optimization problem that is faced by an airline company that operates in the Canary Islands. There are 10 airports, with around 180 flights each day in total, and the flight time between any two airports is around 30 minutes. All of the maintenance equipment is based at the airport in Gran Canaria, and therefore each aircraft must go to Gran Canaria after flying for two days. The crew members, however, live not only in Gran Canaria, but also in Tenerife. Each crew member expects to return to his domicile at the end of each day. There are also other regulations on the activities of the crew members to be considered in the optimization problem. The goal is to construct routes and schedules for the aircraft and the crew simultaneously, at minimum cost, while satisfying the above constraints.

This problem can be modelled as a "2-depot vehicle routing problem with capacitated vehicles and driver exchanges". It is a new and challenging optimization, closely related to the classical vehicle routing problem, but with some new features requiring an ad-hoc analysis.

In this seminar we show mathematical models in Integer Linear Programming, and describe "branch-and-cut" and "branch-and-price" techniques to find optimimal or near-optimal solutions. These techniques are capable of solving real-life instances. The software package is currently being used by the airline company.

Streaming Verification of Outsourced Computation

When handling large quantities of data, it is desirable to outsource the computational effort to a third party: this captures current efforts in cloud computing, but also scenarios within trusted computing systems and inter-organizational data sharing. When the third party is not fully trusted, it is desirable to give assurance that the computation has been performed correctly. This talk presents some recent results in designing new protocols for verifying computations which are streaming in nature: the verifier (data owner) needs only a single pass over the input, storing a sublinear amount of information, and follows a simple protocol with a prover (service provider) that takes a small number of rounds. A dishonest prover fools the verifier with only polynomially small probability, while an honest prover's answer is always accepted. Starting from basic aggregations, interactive proof techniques allow a quite general class of computations to be verified, leading to practical implementations.

A family of effective payoffs in stochastic games with perfect information

We consider two-person zero-sum stochastic games with perfect information and, for each integer k>=0, introduce a new payoff function, called the k-total reward. For k = 0 and 1 they are the so called mean payoff and total rewards, respectively. For all k, we prove Nash-solvability of the considered games in pure stationary strategies, and show that the uniformly optimal strategies for the discounted mean payoff (0-reward) function are also uniformly optimal for k-total rewards if the discount factor is close enough (depending on k) to 1. We also demonstrate that k-total reward games form a proper subset of (k + 1)-total reward games for each k. In particular, all these classes contain mean payoff games.

Joint work with Vladimir Gurvich (Rutgers, New Brunswick, USA), Khaled Elbassioni (Masdar Institute, Abu Dhabi, UAE), and Kazuhise Makino (RIMS, Kyoto, Japan)

Reachability in Two-Clock Timed Automata is PSPACE-complete

Timed automata are a successful and widely used formalism, which are used in the analysis and verification of real time systems. Perhaps the most fundamental problem for timed automata is the reachability problem: given an initial state, can we perform a sequence of transitions in order to reach a specified target state? For timed automata with three or more clocks, this problem is PSPACE-complete, and for one-clock timed automata the problem is NL-complete. The complexity of reachability in two-clock timed automata has been left open: the problem is known to be NP-hard, and contained in PSPACE.

Recently, Haase, Ouaknine, and Worrell have shown that reachability in two-clock timed automata is log-space equivalent to reachability in bounded one-counter automata. In this work, we show that reachability in bounded one-counter automata is PSPACE-complete, and therefore we resolve the complexity of reachability in two-clock timed automata.

Quadratization of pseudo-Boolean functions

A pseudo-Boolean function f is a real-valued function of 0,1 variables. Any such function can be represented uniquely by a multilinear expression in the binary input variables, and it is said to be quadratic if this expression has degree two or less. In recent years, several authors have proposed to consider the problem of `quadratizing' pseudo-Boolean functions by expressing f(x) as min {g(x,y): y in {0,1}^m } where g(x,y) is a quadratic pseudo-Boolean function of x and of additional binary variables y. We say that g(x,y) is a quadratization of f. In this talk, we investigate the number of additional variables needed in a quadratization.

New trends for graph searches

In this talk I will survey some new results of computation of graph parameters using graph search, but also how to discover graph structure using a series of graph searches.

First I will describe how to evaluate the diameter of a graph using only 4 successive BFS (Breadth First searches). This heuristic is very acurate and can be applied on huge graphs. Furthermore it can be completed by an exact algorithm which seems to be very efficient (more that is worst case complexity).

Then I will focuse on cocomparability graphs showing that first LDFS (Lexicographic Depth First Search) can be used to compute a minimum path cover.

I will finish by describing some fixed point properties of graph search acting on a cocomparability graph, describing many open problems.

Reachability Problems for Words, Matrices and Maps

Most computational problems for matrix semigroups and groups are inherently difficult to solve and even undecidable starting from dimension three or four. The examples of such problems are the membership problem (including the special cases of the mortality and identity problems), vector reachability, scalar reachability, freeness problems and emptiness of matrix semigroups intersection. Many questions about the decidability and complexity of problems for two-dimensional matrix semigroups remain open and are directly linked with other challenging problems in the field.

In this talk several closely related fundamental problems for words and matrices will be considered. I will survey a number of new techniques and encodings used to solve long standing open problem about reachability of Identity matrix; discuss hardness and decidability results for 2x2 matrix semigroups as well as highlight interconnections between matrix problems, reachability for iterative maps, combinatorics on words and computational problems for braids.

Skew Bisubmodularity and Valued CSPs

An instance of the Finite-Valued Constraint Satisfaction Problem (VCSP) is given by a finite set of variables, a finite domain of values, and a sum of rational-valued functions, each function depending on a subset of the variables. The goal is to find an assignment of values to the variables that minimises the sum.

In this talk I will investigate VCSPs in the case when the variables can take three values and provide a tight description of the tractable cases.

Joint work with Andrei Krokhin and Robert Powell.

The Tradeoff Between Privacy and Communication

Traditional communication complexity scenarios feature several participants, each with a piece of the input, who must cooperate to compute some function of the input. The difficulty of such problems is measured by the amount of communication (in bits) required. However, in more realistic scenarios, participants may wish to keep their own input (personal preferences, banking information, etc.) as private as possible, revealing only the information necessary to compute the function.

In the 80s it was shown that most two-player functions are not computable while maintaining perfect privacy (Kushilevitz '89). Unwilling to let this rest, researchers have in recent years defined several relaxed notions of "approximate" privacy. Not surprisingly, protocols providing better privacy can require exponentially more bits than standard "simple" protocols.

I will present all background necessary, as well as our result providing tight lower bounds on the tradeoff between privacy and communication complexity. If time permits, we may explore the relation between different notions of privacy, as well as several open questions that stem from these results.

This talk will assume no background in communication complexity.

Robust algorithms for constraint satisfaction problems

In a constraint satisfaction problem (CSP), one is given a set of variables, a set of values for the variables, and constraints on combinations of values that can be taken by specified subsets of variables. An algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying at least a (1-f(epsilon))-fraction of constraints for each (1-epsilon)-satisfiable instance (i.e., such that at most an epsilon-fraction of constraints needs to be removed to make the instance satisfiable), where f approaches 0 as epsilon goes to 0. Barto and Kozik recently characterized all CSPs admitting a robust polynomial algorithm (with doubly exponential f), confirming a conjecture of Guruswami and Zhou. In the present talk, based on joint work with Victor Dalmau, we shall explain how homomorphism dualities, universal algebra, and linear programming are combined to give large classes of CSPs that admit a robust polynomial algorithm with polynomial loss, i.e., with f(epsilon)=O(epsilon^{1/k}) for some k.

Coloring (H1,H2)-free graphs

A k-coloring of a graph G=(V,E) is a mapping c: V -> {1,2,..,k} such that c(u) is not equal to c(v) whenever u and v are adjacent vertices. The Colouring problem is that of testing whether a given graph has a k-coloring for some given integer k. If a graph contains no induced subgraph isomorphic to any graph in some family {H1,..,Hp}, then it is called (H1,..,Hp)-free. The complexity of Colouring for H1-free graphs is known to be completely classified. For (H1,H2)-free graphs the classification is still open, although many partial results are known. We survey the known results and present a number of new results for this case.

On the maximum difference between several graph invariants

A graph invariant is a property of graphs that depends only on the abstract structure, not on graph representations such as particular labellings or drawings of the graph. Although bounds on invariants have been studied for a long time by graph theorists, the past few years have seen a surge of interest in the systematic study of linear relations (or other kinds of relations) between graph invariants. We focus our attention on the average distance in a graph as well as on the maximum orders of an induced (linear) forest, an induced tree, an induced bipartite graph, and a stable set. We give upper bounds on differences between some of these invariants, and prove that they are tight.

Squared Metric Facility Location Problem and the Upper Bound Factor-Revealing Programs

The facility location problem (FLP) aims to place facilities in a subset of locations, serving a given set of clients, and minimizing the cost of opening facilities and connecting clients to facilities. In the Metric FLP (MFLP), the underling distance function is a metric. We consider a variant of the FLP for different distances. Namely, we study the Squared Metric FLP (SMFLP), when the distance function is a squared metric. We analyze algorithms for the MFLP when applied to the SMFLP. Surprisingly, the (now) standard LP-rounding algorithm for the FLP (Chudak and Shmoys 2003, etc.) achieves the approximation lower bound for the SMFLP of 2.040..., unless P = NP. This lower bound is obtained by extending the 1.463... hardness of the metric case. We have also studied known primal-dual algorithms for the MFLP (Jain et al. 2003, and Mahdian, Ye, and Zhang 2006), and showed that they performed well for the SMFLP. More interestingly, we showed how to obtain 'upper bound factor-revealing programs' (UPFRPs) to bound the so called factor-revealing linear programs used in these primal-dual analyses. Solving one UPFRP suffices to obtain the approximation factor, as a more straightforward alternative to analytical proofs, that could be long and tedious.

Truthful Mechanisms for Approximating Proportionally Fair Allocations

We revisit the classic problem of fair division from a mechanism design perspective and provide a simple truthful mechanism that yields surprisingly good approximation guarantees for the widely used solution concept of Proportional Fairness, a solution concept used in money-free settings. Unfortunately, Proportional Fairness cannot be implemented truthfully. Instead, we have designed a mechanism that discards carefully chosen fractions of the allocated resources so as to induce the agents to be truthful in reporting their valuations.

For a multi-dimensional domain with an arbitrary number of agents and items, for all homothetic valuation functions, this mechanism provides every agent with at least a 1/e fraction of her Proportionally Fair valuation. We also uncover a connection between this mechanism and VCG-based mechanism design.

Finally, we ask whether better approximation ratios are possible in more restricted settings. In particular, motivated by the massive privatization auction in the Czech republic in the early 90s we provide another mechanism for additive linear valuations that works particularly well when all the items are in high demand.

Joint work with Vasilis Gkatzelis and Gagan Goel.

Optimal coalition structure and stable payoff distribution in large games

Cooperative games with transferable utilities belong to a branch of game theory where groups of players can form coalitions in order to jointly achieve the groups’ objectives. Two key questions that arise in cooperative game theory are (a) *How to optimally form coalitions of players?* and (b) *How to share/distribute the cost/reward among the players?* The first problem can be viewed as a complete set covering problem which can be formulated as an MILP with an exponentially large number of binary variables. For the second problem, the nucleolus and the Shapley value are often considered as the most important solution concepts thank to their attractive properties. However, computing the nucleolus is extremely difficult and existing methods can only solve games with less than 30 players. In this talk, we review some applications of cooperative game theory and present recent developments in solving these two problems. We test the algorithms with a number of simulated games with up to 400 players.

On bounded degree spanning trees in the random graph

The appearence of certain spanning subraphs in the random graph is a well-studied phenomenon in probabilistic graph theory. In this talk, we present results on the threshold for the appearence of bounded-degree spanning trees in G(n,p) as well as for the corresponding universality statements. In particular, we show hitting time thresholds for some classes of bounded degree spanning trees.

Joint work with Daniel Johannsen and Michael Krivelevich.

More on perfect matchings in uniform hypergraphs

Last year I gave a talk at Warwick on minimum degree conditions which force a hypergraph to contain a perfect matching. In this self-contained talk I will discuss recent work with Yi Zhao (Georgia State University) on this problem: Given positive integers k and r with k/2 ≤ r ≤ k−1, we give a minimum r-degree condition that ensures a perfect matching in a k-uniform hypergraph. This condition is best possible and improves on work of Pikhurko, who gave an asymptotically exact result. Our approach makes use of the absorbing method.

Ramsey multiplicity

Ramsey's theorem states that for any graph H there exists an n such that any 2-colouring of the complete graph on n vertices contains a monochromatic copy of H. Moreover, for large n, one can guarantee that there are at least c_H n^v copies of H, where v is the number of vertices in H. In this talk, we investigate the problem of optimising the constant c_H, focusing in particular on the case of complete graphs.

On Optimality of Deterministic and Non-Deterministic Transformations

Dynamical systems can be modelled by Markov semigroups, and we use Markov transition kernels to model computational machines and algorithms. We study points on a simplex of all joint probability measures corresponding to various types of transition kernels. In particular, deterministic or non-deterministic (e.g. randomised) algorithms correspond respectively to boundary or interior points of the simplex. The performance of the corresponding systems is evaluated by expected cost (or expected utility), which is a linear functional. The domain of optimisation is defined by information constraints. We use our result on mutual absolute continuity of optimal measures to show that optimal transition kernels cannot be deterministic, unless information is unbounded. As an illustration, we construct an example where any deterministic kernel can only have unbounded expected cost, unless the information constraint is removed. On the other hand, a non-deterministic kernel can have finite expected cost under the same information constraint.

Approximation Algorithm for the Resource Dependent Assignment Problem

Assignment problems deal with the question of how to assign a set of n agents to a set of n tasks such that each task is performed only once and each agent is assigned to a single task so as to minimize a specific predefined objective. We define a special kind of assignment problem where the cost of assigning agent j to task i is not a constant cost but rather a function of the amount of resource allocated to this particular task. We assume this function, known as the resource consumption function, to be convex in order to ensure the law of diminishing marginal returns. The amount of resource allocated to each task is a continuous decision variable. One variation of this problem, proven to be NP-hard, is minimizing the total assignment cost when the total available resource is limited. In this research we provide an approximation algorithm to solve this problem, where a ρ-approximation algorithm is an algorithm that runs in polynomial time and produces a solution with cost within a factor of at most ρ of the optimal solution.

Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor

A fundamental model of operations research is the finite, but infinite-horizon, discounted Markov Decision Process. Ye showed recently that the simplex method with Dantzig pivoting rule, as well as Howard's policy iteration algorithm, solve discounted Markov decision processes, with a constant discount factor, in strongly polynomial time. More precisely, Ye showed that for both algorithms the number of iterations required to find the optimal policy is bounded by a polynomial in the number of states and actions. We improve Ye's analysis in two respects. First, we show a tighter bound for Howard's policy iteration algorithm. Second, we show that the same bound applies to the number of iterations performed by the strategy iteration (or strategy improvement) algorithm used for solving 2-player turn-based stochastic games with discounted zero-sum rewards. This provides the first strongly polynomial algorithm for solving these games.

Joint work with Peter Bro Miltersen and Uri Zwick.

A new method of searching a network

An object (hider) is at an unknown point on a given network Q, not necessarily at a node. Starting from a known point (known to the hider), a searcher moves around the network to minimize the time T required to find (reach) the hider. The hider's location may be a known distribution or one chosen by the hider to make T large. We study the Bayesian problem where the hider's distribution over Q is known and also the game problem where it is chosen by an adversarial hider. Two types of searcher motion (continuous search or expanding search) are considered.

Algorithms for optimization over noisy data

To deal with NP-hard reconstruction problems, one natural possibility consists in assuming that the input data is a noisy version of some unknown ground truth. We present two such examples: correlation clustering, and transitive tournaments. In correlation clustering, the goal is to partition data given pairwise similarity and dissimilarity information, and sometimes semi-definite programming can, with high probability, reconstruct the optimal (maximum likelihood) underlying clustering. The proof uses semi-definite programming duality and the properties of eigenvalues of random matrices. The transitive tournament problem asks to reverse the fewest edge orientations to make an input tournament transitive. In the noisy setting it is possible to reconstruct the underlying ordering with high probability using simple dynamic programming.

On the factorial layer of hereditary classes of graphs

A class of graphs is hereditary if it is closed under taking induced subgraphs. It is known that the rates of growth of the number of n-vertex labeled graphs in hereditary classes constitute discrete layers. Alekseev and independently Balogh, Bollobas and Weinreich obtained global structural characterizations of hereditary classes in the first few lower layers. The minimal layer for which no such characterization is known is the factorial one, i.e. the layer containing classes with the factorial speed of growth of the number of n-vertex labeled graphs. Many classes of theoretical or practical importance belong to this layer, including forests, planar graphs, line graphs, interval graphs, permutation graphs, threshold graphs etc. In this talk we discuss some approaches to obtaining structural characterization of the factorial layer and related results.

Turan Numbers of Bipartite Graphs Plus an Odd Cycle

The theory of Turan numbers of non-bipartite graphs is quite well-understood, but for bipartite graphs the field is wide open. Many of the main open problems here were raised in a series of conjectures by Erdos and Simonovits in 1982. One of them can be informally stated as follows: for any family F of bipartite graphs, there is an odd number k, such that the extremal problem for forbidding F and all odd cycles of length at most k within a general graph is asymptotically equivalent to that of forbidding F within a bipartite graph. In joint work with Sudakov and Verstraete we proved a stronger form of this conjecture, with stability and exactness, for some specific families of even cycles. Also, in joint work with Allen, Sudakov and Verstraete, we gave a general approach to the conjecture using Scott's sparse regularity lemma. This proves the conjecture for some specific complete bipartite graphs, and moreover is effective for any F based on some reasonable assumptions on the maximum number of edges in a bipartite F-free graph, which are similar to the conclusions of another conjecture of Erdos and Simonovits.

Distributionally Robust Convex Optimisation

Distributionally robust optimisation is a decision-making paradigm that caters for situations in which the probability distribution of the uncertain problem parameters is itself subject to uncertainty. The distribution is then typically assumed to belong to an ambiguity set comprising all distributions that share certain structural or statistical properties. In this talk, we propose a unifying framework for modelling and solving distributionally robust optimisation problems. We introduce standardised ambiguity sets that contain all distributions with prescribed conic representable confidence sets and with mean values residing on an affine manifold. It turns out that these ambiguity sets are sufficiently expressive to encompass and extend several approaches from the recent literature. They also allow us to accommodate a variety of distributional properties from classical and robust statistics that have not yet been studied in the context of robust optimisation. We determine sharp conditions under which distributionally robust optimisation problems based on our standardised ambiguity sets are computationally tractable. We also provide tractable conservative approximations for problems that violate these conditions.

A Tight, Combinatorial Algorithm for Submodular Matroid Maximization

In recent joint work with Yuval Filmus, I considered the problem of maximizing a submodular function subject to a single matroid constraint, obtaining a novel 1 - 1/e approximation algorithm based on non-oblivious local search. This is the same approximation ratio previously attained by the "continuous greedy" algorithm of Calinescu, Chekuri, Vondrak, and Pal, and is the best possible in polynomial time for the general value oracle setting (or, alternatively, assuming that P ≠ NP). Unlike the continuous greedy algorithm, however, our algorithm is purely combinatorial, and extremely simple; it requires no rounding and considers only integral solutions. In this talk, I will give a brief overview of both the problem and prior algorithmic approaches, and present our new algorithm, together with some of its analysis.

Local Optimality in Algebraic Path Problems

Due to complex policy constraints, some Internet routing protocols are associated with non-standard metrics that fall outside of the approach to path problems based on semirings and "globally optimal" paths. Some of these exotic metrics can be captured by relaxing the semiring axioms to include algebras that are not distributive. A notion of "local optimality" can be defined for such algebras as a fixed-point of a matrix equation, which models solutions required by Internet routing protocols. Algorithms for solving such equations are explored, as well as applications beyond network routing.

Semi-local String Comparison

The computation of a longest common subsequence (LCS) between two strings is a classical algorithmic problem. Some applications require a generalisation of this problem, which we call semi-local LCS. It asks for the LCS between a string and all substrings of another string, and/or the LCS between all prefixes of one string and all suffixes of another. Apart from an important role that this generalised problem plays in string algorithms, it turns out to have surprising connections with semigroup algebra, computational geometry, planar graph algorithms, comparison networks, as well as practical applications in computational biology. The talk will present an efficient solution for the semi-local LCS problem, and will survey some related results and applications. Among these are dynamic LCS support; fast clique computation in special graphs; fast comparison of compressed strings; parallel string algorithms.

Lyndon Words and Short Superstrings

In the Shortest-Superstring problem, we are given a set of strings S and want to find a string that contains all strings in S as substrings and has minimum length. This is a classical problem in approximation and the best known approximation factor is 2 1/2, given by Sweedyk in 1999. Since then, no improvement has been made, however two other approaches yielding a 2 1/2-approximation algorithms have been proposed by Kaplan et al. and recently by Paluch et al., both based on a reduction to maximum asymmetric TSP path (Max-ATSP-Path) and structural results of Breslauer et al.

In this talk we give an algorithm that achieves an approximation ratio of 2 11/23, breaking through the long-standing bound of 2 1/2. We use the standard reduction of Shortest-Superstring to Max-ATSP-Path. The new, somewhat surprising, algorithmic idea is to take the better of the two solutions obtained by using: (a) the currently best 2/3-approximation algorithm for Max-ATSP-Path and (b) a naive cycle-cover based 1/2-approximation algorithm. To prove that this indeed results in an improvement, we further develop a theory of string overlaps, extending the results of Breslauer et al. This theory is based on the novel use of Lyndon words, as a substitute for generic unbordered rotations and critical factorizations, as used by Breslauer et al.

The Power of Linear Programming for Valued CSPs

The topic of this talk is Valued Constraint Satisfaction Problems (VCSPs) and the question of how VCSPs can be solved efficiently. This problem can also be cast as how to minimise separable functions efficiently. I will present algebraic tools that have been developed for this problem and will also mention a recent result on the connection between linear programming and VCSPs (based on a paper with J. Thapper, to appear in FOCS'12).

Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings

Consider a directed or an undirected graph with integral edge weights from the set [-W, W], that does not contain negative weight cycles. In this paper, we introduce a general framework for solving problems on such graphs using matrix multiplication. The framework is based on the usage of Baur-Strassen's theorem and of Strojohann's determinant algorithm. It allows us to give new and simple solutions to the following problems:

- Finding Shortest Cycles - We give a simple Õ(Wn
^{ω}) time algorithm for finding shortest cycles in undirected and directed graphs. For directed graphs this matches the time bounds obtained in 2011 by Roditty and Vassilevska-Williams. On the other hand, no algorithm working in Õ(Wn^{ω}) time was previously known for undirected graphs with negative weights. - Computing Diameter - We give a simple Õ(Wn
^{ω}) time algorithm for computing a diameter of an undirected or directed graphs. This considerably improves the bounds of Yuster from 2010, who was able to obtain this time bound only in the case of directed graphs with positive weights. To the contrary, our algorithm works in the same time bound for both directed and undirected graphs with negative weights. - Finding Minimum Weight Perfect Matchings - We present an Õ(Wn
^{ω}) time algorithm for finding minimum weight perfect matchings in undirected graphs. This resolves an open problem posted by Sankowski in 2006, who presented such an algorithm but only in the case of bipartite graphs.

We believe that the presented framework can find applications for solving larger spectra of related problems. As an illustrative example we apply it to the problem of computing a set of vertices that lie on cycles of length at most t, for some t. We give a simple Õ(Wn^{ω}) time algorithm for this problem that improves over the Õ(tWn^{ω}) time algorithm given by Yuster in 2011.

This is joint work work with Marek Cygan and Harold N. Gabow. A preliminary version of the paper appeared in arxiv.1204.1616.

Analyzing Graphs via Random Linear Projections

We present a sequence of algorithmic results for analyzing graphs via random linear projections or "sketches". We start with results for evaluating basic connectivity and k-connectivity and then use these primitives to construct combinatorial sparsifiers that allow every cut to be approximated up to a factor 1+ε. Our results have numerous applications including single-pass stream algorithms for constructing sparsifiers in fully-dynamic graph streams where edges can be added and deleted in the underlying graph.

This is joint work work with Kook Jin Ahn and Sudipto Guha.

Pricing on Paths: A PTAS for the Highway Problem

In the highway problem, we are given an n-edge line graph (the highway), and a set of paths (the drivers), each one with its own budget. For a given assignment of edge weights (the tolls), the highway owner collects from each driver the weight of the associated path, when it does not exceed the budget of the driver, and zero otherwise. The goal is to choose weights so as to maximize the total profit.

A lot of research has been devoted to this apparently simple problem. The highway problem was shown to be strongly NP-hard only recently [Elbassioni,Raman,Ray,Sitters-'09]. The best-known approximation is O(log n/loglog n) [Gamzu,Segev-'10], which improves on the previous-best O(log n) approximation [Balcan,Blum-'06]. Better approximations are known for a number of special cases.

In this work we present a PTAS for the highway problem, hence closing the complexity status of the problem. Our result is based on a novel randomized dissection approach, which has some points in common with Arora's quadtree dissection for Euclidean network design [Arora-'98]. The basic idea is enclosing the highway in a bounding path, such that both the size of the bounding path and the position of the highway in it are random variables. Then we consider a recursive O(1)-ary dissection of the bounding path, in subpaths of uniform optimal weight. Since the optimal weights are unknown, we construct the dissection in a bottom-up fashion via dynamic programming, while computing the approximate solution at the same time. Our algorithm can be easily derandomized.

The same basic approach provides PTASs also for two generalizations of the problem: the tollbooth problem with a constant number of leaves and the maximum-feasibility subsystem problem on interval matrices. In both cases the previous best approximation factors are polylogarithmic [Gamzu,Segev-'10,Elbassioni,Raman,Ray,Sitters-'09].

Joint work with Thomas Rothvoß.

Improved Lower Bounds on Crossing Numbers of Graphs Through Optimization

The crossing number problem for graphs is to draw (or embed) a graph in the plane with a minimum number of edge crossings. Crossing numbers are of interest for graph visualization, VLSI design, quantum dot cellular automata, RNA folding, and other applications. On the other hand, the problem is notoriously difficult. In 1973, Erdös and Guy wrote that: "Almost all questions that one can ask about crossing numbers remain unsolved." For example, the crossing numbers of complete and complete bipartite graphs are still unknown in general. The case of the complete bipartite graph is known as Turán's brickyard problem, and was already posed by Paul Turán in the 1940's. Moreover, even for cubic graphs, it is NP-hard to compute the crossing number.

Different types of crossing numbers may be defined by restricting drawings; thus the k-page (book) crossing number corresponds to drawings where all vertices are drawn on a line (the spine of a book), and each edge on one of k planes intersecting the spine (the book pages). It is conjectured that the two-page and normal crossing numbers coincide for complete and complete bipartite graphs. In this talk, we will survey some recent results, where improved lower bounds were obtained for (k-page) crossing numbers of complete and complete bipartite graphs through the use of optimization techniques. (Joint work with D.V. Pasechnik and G. Salazar)

Arithmetic Progressions in Sumsets via (Discrete) Probability, Geometry and Analysis

If A is a large subset of {1,...,N}, then how long an arithmetic progression must A+A = {a+b : a,b in A} contain? Answers to this ostensibly combinatorial question were given by Bourgain and then Green, both using some very beautiful Fourier analytic techniques. Here I plan to discuss a new attack on the problem that rests on a lemma in discrete geometry, proven by a random sampling technique, and applied in a discrete analytic context. We shall not use any deep results, and we shall try to keep things as self-contained as possible.

Based on joint work with Ernie Croot and Izabella Laba.

Induced Matchings, Arithmetic Progressions and Communication

Extremal Combinatorics is one of the central branches of discrete mathematics which deals with the problem of estimating the maximum possible size of a combinatorial structure which satisfies certain restrictions. Often, such problems have also applications to other areas including Theoretical Computer Science, Additive Number Theory and Information Theory. In this talk we will illustrate this fact by several closely related examples focusing on a recent work with Alon and Moitra.

Treewidth Reduction Theorem and Algorithmic Problems on Graphs

We introduce the so-called Treewidth Reduction Theorem. Given a graph G, two specified vertices s and t, and an integer k, let C be the union of all minimal s-t (vertex) separators of size at most k. Furthermore, let G^{*} be the graph obtained from G by contracting all the connected components of G - C into single vertices. The theorem states that the treewidth of G^{*} is bounded by a function of k and that the graph G^{*} can be computed in linear time for any fixed k.

The above theorem allows us to solve the following generic graph separation problem in linear time for every fixed k. Let G be a graph with two specified vertices s and t and let Z be a hereditary class of graphs. The problem asks if G has an s-t vertex separator S of size at most k such that the subgraph induced by S belongs to the class Z.

In other words, we show that this generic problem is fixed-parameter tractable. This allows us to resolve a number of seemingly unrelated open questions scattered in the literature concerning fixed-parameter tractability of various graph separation problems under specific constraints.

The role of the Treewidth Reduction Theorem is that it reduces an arbitrary instance of the given problem to an instance of the problem where the treewidth is bounded. Then the standard methodology using Courcelle's theorem can be applied.

The purpose of this talk is to convey the main technical ideas of the above work at an intuitive level. The talk is self-contained. In particular, no prior knowledge of parameterized complexity, treewidth, and Courcelle's theorem is needed. Everything will be intuitively defined in the first 10-15 minutes of the talk.

Joint work with D. Marx and B. O'Sullivan. Available at http://arxiv.org/abs/1110.4765.

Exact Quantum Query Algorithms

The framework of query complexity is a setting in which quantum computers are known to be significantly more powerful than classical computers. In this talk, I will discuss some new results in the model of

I will present several families of total boolean functions which have exact quantum query complexity which is a constant fraction of their classical query complexity. These results were originally inspired by numerically solving the semidefinite programs characterising quantum query complexity for small problem sizes. I will also discuss the model of nonadaptive exact quantum query complexity, which can be characterised in terms of coding theory.

The talk will be based on the paper arXiv:1111.0475, which is joint work with Richard Jozsa and Graeme Mitchison.

Representing Graphs by Words

A simple graph G=(V,E) is (word-)representable if there exists a word W over the alphabet V such that any two distinct letters x and y alternate in W if and only if (x,y) is an edge in E. If W is k-uniform (each letter of W occurs exactly k times in it) then G is called k-representable. It is known that a graph is representable if and only if it is k-representable for some k. The minimum k for which a representable graph G is k-representable is called its representation number.

Representable graphs first appeared in algebra, in study of the Perkins semigroup, which has played a central role in semigroup theory since 1960, particularly as a source of examples and counterexamples. However, these graphs have connections to robotic scheduling and they are interesting from combinatorial and graph theoretical point of view (for example, representable graphs are a generalization of circle graphs, which are exactly 2-representable graphs).

Some questions one can ask about representable graphs are as follows. Are all graphs representable? How do we characterize those graphs that are (non-)representable? How many representable graphs are there? How large can the representation number be for a graph on n nodes?

In this talk, we will go through these and some other questions stating what progress has been made in answering them. In particular, we will see that a graph is representable if and only if it admits a so-called semi-transitive orientation. This allows us to prove a number of results about representable graphs, not least that 3-colorable graphs are representable. We also prove that the representation number of a graph on n nodes is at most n, from which one concludes that the recognition problem for representable graphs is in NP. This bound is tight up to a constant factor, as there are graphs whose representation number is n/2.

Making Markov Chains Less Lazy

There are only a few methods for analysing the rate of convergence of an ergodic Markov chain to its stationary distribution. One is the canonical path method of Jerrum and Sinclair. This method applies to Markov chains which have no negative eigenvalues. Hence it has become standard practice for theoreticians to work with lazy Markov chains, which do absolutely nothing with probability 1/2 at each step. This must be frustrating for practitioners, who want to use the most efficient Markov chain possible.

I will explain how laziness can be avoided by the use of a twenty-year old lemma of Diaconis and Stroock's, or my recent modification of that lemma. Other relevant approaches will also be discussed. A strength of the new result is that it can be very easy to apply. We illustrate this by revisiting the analysis of Jerrum and Sinclair's well-known chain for sampling perfect matchings of a graph.

Polynomial-Time Approximation Schemes for Shortest Path with Alternatives

Consider the generic situation that we have to select k alternatives from a given ground set, where each element in the ground set has a random arrival time and cost. Once we have done our selection, we will greedily select the first arriving alternative, and the total cost is the time we had to wait for this alternative plus its random cost. Our motivation to study this problem comes from public transportation, where each element in the ground set might correspond to a bus or train, and the usual user behavior is to greedily select the first option from a given set of alternatives at each stop. We consider the arguably most natural arrival time distributions for such a scenario: exponential distributions, uniform distributions, and distributions with mon. decreasing linear density functions. For exponential distributions, we show how to compute an optimal policy for a complete network, called a shortest path with alternatives, in O(n(log n + δ^3)) time, where n is the number of nodes and δ is the maximal outdegree of any node, making this approach practicable for large networks if δ is relatively small. Moreover, for the latter two distributions, we give PTASs for the case that the distribution supports differ by at most a constant factor and only a constant number of hops are allowed in the network, both reasonable assumptions in practice. These results are obtained by combining methods from low-rank quasi-concave optimization with fractional programming. We finally complement them by showing that general distributions are NP-hard.

Minimum Degree Thresholds for Perfect Matchings in Hypergraphs

Given positive integers k and r where 4 divides k and k/2 ≤ r ≤ k-2, we give a minimum r-degree condition that ensures a perfect matching in a k-uniform hypergraph. This condition is essentially best possible and improves on work of Pikhurko, who gave an asymptotically exact result. Our approach makes use of the Hypergraph Removal Lemma as well as a structural result of Keevash and Sudakov relating to the Turan number of the expanded triangle. This is joint work with Yi Zhao.

Robust Optimization over Integers

Robust optimization is an approach for optimization under uncertainty that has recently attracted attention both from theory and practitioners. While there is an elaborate and powerful machinery for continuous robust optimization problems, results on robust combinatorial optimization and robust linear integer programs are still rare and hardly general. We consider robust counterparts of integer programs and combinatorial optimization problems, i.e., seek solutions that stay feasible if at most Γ-many parameters change within a given range.

We show that one can optimize a not necessarily binary, cost robust problem, for which one can optimize a slightly modified version of the deterministic problem. Further, in case there is a ρ-approximation for the modified deterministic problem, we give a method for the cost robust counterpart to attain a (ρ+ε)-approximation (for minimization problems; for maximization we get a 2ρ-approximation), or again a ρ-approximation in a slightly more restricted case. We further show that general integer linear programs where a single or few constraints are subject to uncertainty can be solved, in case the problem can be solved for constraints on piecewise linear functions. In case these programs are binary, it suffices to solve the underlying non-robust program (n+1) times.

We demonstrate the applicability of our approach on two classes of integer programs, namely, totally unimodular integer programs and integer programs with two variables per inequality. Further, for combinatorial optimization problems our method yields polynomial time approximations and pseudopolynomial, exact algorithms for robust Unbounded Knapsack Problems.

This is joint work with Kai-Simon Goetzmann (TU Berlin) and Claudia Telha (MIT).

The Complexity of Computing the Sign of the Tutte Polynomial

The Tutte polynomial of a graph is two-variable polynomial that captures many interesting properties of the graph. In this talk, I will describe the polynomial and then discuss the complexity of computing the sign of the polynomial. Having fixed the two parameters, the problem is, given an input graph, determine whether the value of the polynomial is positive, negative, or zero. We determine the complexity of this problem over (most of) the possible settings of the parameters. Surprisingly, for a large portion of the parameter space, the problem is #P-complete. (This is surprising because the problem feels more like a decision problem than a counting problem --- in particular, there are only three possible outputs.) I'll discuss the ramifications for the complexity of approximately evaluating the polynomial. As a consequence, this resolves the complexity of computing the sign of the chromatic polynomial. Here there is a phase transition at q=32/27, which I will explain. The talk won't assume any prior knowledge about graph polynomials or the complexity of counting.

(Joint work with Mark Jerrum.)

Combinatorics of Tropical Linear Algebra

Tropical linear algebra is an emerging and rapidly evolving area of idempotent mathematics, linear algebra and applied discrete mathematics. It has been designed to solve a class of non-linear problems in mathematics, operational research, science and engineering. Besides the main advantage of dealing with non-linear problems as if they were linear, the techniques of tropical linear algebra enable us to efficiently describe complex sets, reveal combinatorial aspects of problems and view the problems in a new, unconventional way. Since 1995 we have seen a remarkable expansion of this field following a number of findings and applications in areas as diverse as algebraic geometry, phylogenetics, cellular protein production, the job rotation problem and railway scheduling.

We will give an overview of selected combinatorial aspects of tropical linear algebra with emphasis on set coverings, cycles in digraphs, transitive closures and the linear assignment problem. An application to multiprocessor interactive systems and a number of open problems will be presented.

Every Property of Hyperfinite Graphs is Testable

The analysis of complex networks like the webgraph, social networks, metabolic networks or transportation networks is a challenging problem. One problem that has drawn a significant amount of attention is the question to classify the domain to which a given network belongs, i.e. whether it is, say, a social network or a metabolic network. One empirical approach to solve this problem uses the concept of network motifs. A network motif is a subgraph that appears more frequently in a certain class of graphs than in a random graph. This approach raises the theoretical question about the structural properties we can learn about a graph by looking at small subgraphs and how one can analyze graph structure by looking at random samples, as these will typically contain frequent subgraphs.

Obviously, it is not possible to to analyze classical structural properties like, for example, connectivity by only looking at small subgraphs. One needs a relaxed and more robust definition of graph properties. Such a definition is given by the concept of property testing. In my talk and within the framework of property testing I will give a partial answer to the question what we can learn about graph properties from the distribution of constant sized subgraphs. I will show that every planar graph with constant maximum degree is defined up to epsilon n edges by its distribution (frequency) of subgraphs of constant size. This result implies that every property of planar graphs is testable in the property testing sense.

(Joint work with Ilan Newman)

Improved Approximations for Monotone Submodular k-Set Packing and General k-Exchange Systems

In the weighted k-set packing problem, we are given a collection of k-element sets, each with a weight, and seek a maximum weight collection of pairwise disjoint sets. In this talk, we consider a generalization of this problem in which the goal is to find a pairwise disjoint collection of sets that maximizes a monotone submodular function.

We present a novel combinatorial algorithm for the problem, which is based on the notion of non-oblivious local search, in which a standard local search process is guided by an auxiliary potential function distinct from the problem's objective. Specifically, we use a potential function inspired by an algorithm of Berman for weighted maximum independent set in (k+1)-claw free graphs. Unfortunately, moving from the linear (weighted) case to the monotone submodular case introduces several difficulties, necessitating a more nuanced approach. The resulting algorithm guarantees a (k + 3)/2 approximation, improving on the performance of the standard, oblivious local search algorithm by a factor of nearly 2 for large k.

More generally, we show that our algorithm applies to all problems that can be formulated as k-exchange systems, which we review in this talk. This class of independence systems, introduced by Feldman, Naor, Schwartz, and Ward, generalize the matroid k-parity problem in a wide class of matroids and capture many other combinatorial optimization problems. Such problems include matroid k-parity in strongly base orderable matroids, independent set in (k + 1)-claw free graphs (which includes k-set packing as a special case), k-uniform hypergraph b-matching, and maximum asymmetric traveling salesperson (here, k = 3). Our non-oblivious local search algorithm improves on the current state-of-the-art approximation performance for many of these specific problems, as well.

Hybridising Heuristic and Exact Methods to Solve Scheduling Problems

The research community has focussed on the use of heuristics and meta-heuristic methods to solve real life scheduling problems, as such problems are too large to solve exactly. However there is much to learn and utilise from exact models. This talk will explain how hybridising exact methods within heuristic techniques can enable better solutions to be obtained. Specifically, exact methods will be used to ensure that feasible solutions are guaranteed, allowing the heuristic to focus on improving secondary objectives.

Two test cases will be described. The first is a nurse rostering problem where a knapsack model is used to ensure feasibility, allowing a tabu search method to locate high quality solutions. The second is the problem of allocating medical students to clinical specialities over a number of time periods. A network flow model is hybridised within a Greedy Randomised Adaptive Search Procedure framework. It will be demonstrated that this produces better solutions than using GRASP on its own.

Local Matching Dynamics in Social Networks

Stable marriage and roommates problems are the classic approach to model resource allocation with incentives and occupy a central position in the intersection of computer science and economics. There are a number of players that strive to be matched in pairs, and the goal is to obtain a stable matching from which no pair of players has an incentive to deviate. In many applications, a player is not aware of all other players and must explore the population before finding a good match. We incorporate this aspect by studying stable matching under dynamic locality constraints in social networks. Our interest is to understand local improvement dynamics and their convergence to matchings that are stable with respect to their imposed information structure in the network.

Approximating Graphic TSP by Matchings

We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a decreased cost. For the TSP on graphic metrics (graph-TSP), the approach yields a 1.461-approximation algorithm with respect to the Held-Karp lower bound. For graph-TSP restricted to a class of graphs that contains degree three bounded and claw-free graphs, we show that the integrality gap of the Held-Karp relaxation matches the conjectured ratio 4/3. The framework allows for generalizations in a natural way and also leads to a 1.586-approximation algorithm for the traveling salesman path problem on graphic metrics where the start and end vertices are prespecified.

The Quadratic Assignment Problem: on the Borderline Between Hard and Easy Special Cases

The quadratic assignment problem (QAP) is a well studied and notoriously hard combinatorial optimisation problem both from the theoretical and the practical point of view. Other well known combinatorial optimisation problems as for example the travelling salesman problem or the linear arrangement problem can be seen as special cases of the QAP.

In this talk we will first introduce the problem and briefly review some important computational complexity results. Then we will focus on polynomially solvable special cases and introduce structural properties of the coefficient matrices of the QAP which guarantee the efficient solvability of the problem.

We will show that most of these special cases have the so called constant permutation property, meaning that the optimal solution of the problem does not depend on the concrete realization of the coefficient matrices as soon as those matrices possess the structural properties which turn the QAP polynomially solvable as mentioned above. We will show that the borderline between hard and easy special cases is quite thin, in the sense that slight perturbations of the structural properties mentioned above are enough to produce NP-hard special cases again. We will conclude with an outlook of further research and some open special cases which could be well worth analysing next in terms of computational complexity.

Extended Formulations in Combinatorial Optimization

Applying the polyhedral method to a combinatorial optimization problem usually requires a description of the convex hull P of the set of feasible solutions. Typically, P is determined by an exponential number of inequalities, and a complete description is often hopeless, even for polynomial-time solvable problems. In some cases, P can be represented in a simpler way as the projection of some polyhedron Q in a higher-dimensional space, where often Q is defined by a much smaller system of constraints than P. In this talk we discuss techniques to obtain extended formulations for combinatorial optimization problems, and cases where extended formulations prove useful.

The work presented includes papers with M. Conforti, A. Del Pia, B. Gerards, and L. Wolsey.

The "Power of ..." Type Results in Parallel Machine Scheduling

In this talk, I will present the results on parametric analysis of the power of pre-emption for two and three uniform machines, with the speed of the fastest machine as a parameter. For identical parallel machines, I will present a series of results on the impact that adding an extra machine may have on the makespan and the total completion time. For the latter models, the solution approaches to the problem of the cost-optimal choice of the number of machines are reported.

Robust Markov Decision Processes

Markov decision processes (MDPs) are powerful tools for decision making in uncertain dynamic environments. However, the solutions of MDPs are of limited practical use due to their sensitivity to distributional model parameters, which are typically unknown and have to be estimated by the decision maker. To counter the detrimental effects of estimation errors, we consider robust MDPs that offer probabilistic guarantees in view of the unknown parameters. To this end, we assume that an observation history of the MDP is available. Based on this history, we derive a confidence region that contains the unknown parameters with a pre-specified probability 1-β. Afterwards, we determine a policy that attains the highest worst-case performance over this confidence region. By construction, this policy achieves or exceeds its worst-case performance with a confidence of at least 1-β. Our method involves the solution of tractable conic programs of moderate size.

Independent Sets in Hypergraphs

We say that a hypergraph is stable if each sufficiently large subset of its vertices either spans many hyperedges or is very structured. Hypergraphs that arise naturally in many classical settings posses the above property. For example, the famous stability theorem of Erdős and Simonovits and the triangle removal lemma of Ruzsa and Szemerédi imply that the hypergraph on the vertex set E(K_n) whose hyperedges are the edge sets of all triangles in K_n is stable. In the talk, we will present the following general theorem: If (H_n)_n is a sequence of stable hypergraphs satisfying certain technical conditions, then a typical (i.e., uniform random) m-element independent set of H_n is very structured, provided that m is sufficiently large. The above abstract theorem has many interesting corollaries, some of which we will discuss. Among other things, it implies sharp bounds on the number of sum-free sets in a large class of finite Abelian groups and gives an alternate proof of Szemerédi's theorem on arithmetic progressions in random subsets of integers.

Joint work with Noga Alon, József Balogh, and Robert Morris.

Creating a Partial Order and Finishing the Sort

In 1975, Mike Fredman showed that, given a set of distinct values satisfying an arbitrary partial order, one can finish sorting the set in a number of comparisons equal to the information theory bound (Opt) plus at most 2n. However, it appeared that determining what comparisons to do could take exponential time. Shortly after this several people, including myself, wondered about the complementary problem Fredman's "starting point" of arranging elements into a given partial order. My long term conjecture was that one can do this, using a number of comparisons equal to the information theory lower bound for the problem plus a lower order term plus O(n) through a reduction to multiple selection. Along the way some key contributions to the problems were made, including the development of graph entropy and the work of Andy Yao (1989) and Jeff Kahn and Jeong Hang Kim (1992). The problems were both solved, with Jean Cardinal, Sam Fiorini, Gwen Joret, Raph Jungers (2009, 2010), using the techniques of graph entropy, multiple selection and merging in polynomial time to determine the anticipated Opt + o(Opt) + O(n) comparisons. The talk will discuss this long term development and some amusing stops along the way.

Statistical Mechanics Approach to the Problem of Counting Large Subgraphs in Random Graphs

Counting the number of distinct copies of a given pattern in a graph can be a difficult problem when the sizes of both the pattern and the graph get large. This talk will review statistical mechanics approaches to some instances of this problem, focusing in particular on the enumeration of large matchings and long circuits of a graph. The outcomes of these methods are conjectures on the typical number of such patterns in large random graphs, and heuristic algorithms for counting and constructing them. In the case of the matchings, the heuristic statistical mechanics method has been also turned into a mathematically rigorous proof.

Applications and Studies in Modular Decomposition

The modular decomposition is a powerful tool for describing combinatorial structures (such as graphs, tournaments, posets or permutations) in terms of smaller ones. Since its appearance in a talk by Fraisse in the 1950s, and first appearance in print by Gallai in the 1960s, it has appeared in a wide variety of settings ranging from game theory to combinatorial optimisation.

In this talk, after discussing some of these various historical settings, I will present a number of different settings where the modular decomposition has influenced my own research, including the enumeration and structural theory of permutations (in particular the general study of well-quasi-ordering), and -- quite unrelatedly -- recent connections made with the celebrated reconstruction conjecture.

Of increasing importance to this work has been our growing understanding of the "prime" structures: those that cannot be broken down into smaller structures under the modular decomposition. Started by Schmerl and Trotter in the early 1990s, there is now an industry of researchers looking at the fine structure of these objects, and I will present some recent work in this area. Taker a "broader" view, we also know, in the case of permutations, a Ramsey-theoretic result for these prime structures: every sufficiently long prime permutation must contain a subpermutation belonging to one of three families. However, it still remains to translate this result into one for graphs, and I will close by exploring some of the difficulties and differences discovered in our attempts to make this conversion.

Random Graphs on Spaces of Negative Curvature

Random geometric graphs have been well studied over the last 50 years or so. These are graphs that are formed between points randomly allocated on a Euclidean space and any two of them are joined if they are close enough. However, all this theory has been developed when the underlying space is equipped with the Euclidean metric. But, what if the underlying space is curved?

The aim of this talk is to initiate the study of such random graphs and lead to the development of their theory. Our focus will be on the case where the underlying space is a hyperbolic space. We will discuss some typical structural features of these random graphs as well as some applications, related to their potential as a model for networks that emerge in social life or in biological sciences.

Upper Bound for Centerlines

Given a set of points P in R^3, what is the best line that approximates P? We introduce a notion of approximation which is robust under the perturbations of P, and analyse how good it is.

Algorithms for Testing FOL Properties

Algorithmic metatheorems guarantee that certain types of problems have efficient algorithms. A classical example is the theorem of Courcelle asserting that every MSOL property can be tested in linear time for graphs with bounded tree-width. Another example is a result of Frick and Grohe that every FOL property can be tested in almost linear time in graph classes with locally bounded tree-width. Such graph classes include planar graphs or graphs with bounded maximum degree. An example of an FOL property is the existence of a fixed graph as a subgraph.

We extend these results in two directions:

- we show that FOL properties can be tested in linear time for classes of graphs with bounded expansion (this is a joint result with Zdenek Dvorak and Robin Thomas), and
- FOL properties can be polynomially tested (with the degree of the polynomial independent of the property) in classes of regular matroids with locally bounded branch-width (this is a joint result with Tomas Gavenciak and Sang-il Oum).

An alternative proof of our first result has been obtained by Dawar and Kreutzer.

Lower Bounds for Online Integer Multiplication and Convolution in the Cell-probe Model

We will discuss time lower bounds for both online integer multiplication and convolution in the cell-probe model. For the multiplication problem, one pair of digits, each from one of two n digit numbers that are to be multiplied, is given as input at step i. The online algorithm outputs a single new digit from the product of the numbers before step i+1. We give a lower bound of Omega((d/w)*log n) time on average per output digit for this problem where 2^d is the maximum value of a digit and w is the word size. In the convolution problem, we are given a fixed vector V of length n and we consider a stream in which numbers arrive one at a time. We output the inner product of V and the vector that consists of the last n numbers of the stream. We show an Omega((d/w)*log n) lower bound for the time required per new number in the stream. All the bounds presented hold under randomisation and amortisation. These are the first unconditional lower bounds for online multiplication or convolution in this popular model of computation.

Nash Codes for Noisy Channels

We consider a coordination game between a sender and a receiver who communicate over a noisy channel.

The sender wants to inform the receiver about the state by transmitting a message over the channel. Both receive positive payoff only if the receiver decodes the received signal as the correct state. The sender uses a known "codebook" to map states to messages. When does this codebook define a Nash equilibrium?

The receiver's best response is to decode the received signal as the most likely message that has been sent. Given this decoding, an equilibrium or "Nash code" results if the sender encodes every state as prescribed by the codebook, which is not always the case. We show two theorems that give sufficient conditions for Nash codes. First, the "best" codebook for the receiver (which gives maximum expected receiver payoff) defines a Nash code.

A second, more surprising observation holds for communication over a binary channel which is used independently a number of times, a basic model of information theory: Given a consistent tie-breaking decoding rule which holds generically, ANY codebook of binary codewords defines a Nash code. This holds irrespective of the quality of the code and also for nonsymmetric errors of the binary channel.

(Joint work with P. Hernandez)

On Clique Separator Decomposition of Some Hole-Free Graph Classes

(joint work with Vassilis Giakoumakis and Frédéric Maffray)

In a finite undirected graph G=(V,E), a vertex set Q ⊆ V is a clique separator if the vertices in Q are pairwise adjacent and G\Q has more connected components than G. An atom of G is a subgraph of G without clique separators. Tarjan and Whitesides gave polynomial time algorithms for determining clique separator decomposition trees of graphs. By a well-known result of Dirac, a graph is chordal if and only if its atoms are cliques.

A hole is a chordless cycle of length at least five. Hole-free graphs generalize chordal graphs; G is chordal if and only if it is C_4-free and hole-free. We characterize hole- and diamond-free graphs (hole- and paraglider-free graphs, respectively) in terms of the structure of their atoms. Hereby a diamond is K_4-e, and a paraglider is the result of substituting an edge into one of the vertices of a C_4; equivalently, it is the complement graph of the disjoint union of P_2 and P_3. Thus, hole- and paraglider-free graphs generalize chordal graphs and are perfect. Hole- and diamond-free graphs generalize chordal bipartite graphs (which are exactly the triangle-free hole-free graphs).

Our structural results have various algorithmic implications. Thus, the problems Recognition, Maximum Independent Set, Maximum Clique, Coloring, Minimum Fill-In, and Maximum Induced Matching can be solved efficiently on hole- and paraglider-free graphs.

Network Design under Demand Uncertainties

Telecommunication network design has been an extremely fruitful area for the application of discrete mathematics and optimization. To cover for uncertain demands, traffic volumes are typically highly overestimated. In this talk, we adapt the methodology of robust optimization to obtain more resource- and cost-efficient network designs. In particular, we generalize valid inequalities for network design to the robust network design problem, and report on their added value.

Cutting-Planes for the Max-Cut Problem

We present a cutting-plane scheme based on the separation of some product-type classes of valid inequalities for the max-cut problem. These include triangle, odd clique, rounded psd and gap inequalities. In particular, gap inequalities were introduced by Laurent & Poljak and include many other known inequalities as special cases. Yet, they have received little attention so far and are poorly understood. This paper presents the first ever computational results, showing that gap inequalities yield extremely strong upper bounds in practice.

Joint work with Professor Adam N. Letchford and Dr. Konstantinos Kaparis, Lancaster University.

Holographic Algorithms

Using the notion of polynomial time reduction computer scientists have discovered an astonishingly rich web of interrelationships among the myriad computational problems that arise in diverse applications. These relationships can be used both to give evidence of intractability, such as that of NP-completeness, as well as to provide efficient algorithms.

In this talk we discuss a notion of a holographic reduction that is more general than the traditional one in the following sense. Instead of locally mapping solutions one-to-one, it maps them many-to-many but preserves some measure such as the sum of the solutions. One application is to finding new polynomial time algorithms where none was known before. Another is to give evidence of intractability. There are pairs of related problems that can be contrasted in this manner. For example, for a skeletal version of Cook’s 3CNF problem (restricted to be planar and where every variable occurs twice positively) the problem of counting the solutions modulo 2 is NP-hard, but counting them modulo 7 is polynomial time computable. Holographic methods have proved useful in establishing dichotomy theorems, which offer a more systematic format for distinguishing the easy from the probably hard. Such theorems state that for certain wide classes of problems every member is either polynomial time computable, or complete in some class conjectured to contain intractable problems.

New and Old Algorithms for Matroid and Submodular Optimization

Ultra-Fast Rumor Spreading in Models of Real-World Networks

In this talk an analysis of the popular push-pull protocol for spreading a rumor on networks will be presented. Initially, a single node knows of a rumor. In each succeeding round, every node chooses a random neighbor, and the two nodes share the rumor if one of them is already aware of it. We present the first theoretical analysis of this protocol on two models of random graphs that have a power law degree distribution with an arbitrary exponent β > 2. In particular, we study preferential attachment graphs and random graphs with a given expected degree sequence.

The main findings reveal a striking dichotomy in the performance of the protocol that depends on the exponent of the power law. More specifically, we show that if 2 < β < 3, then the rumor spreads to almost all nodes in Ω(loglog n) rounds with high probability. This is exponentially faster than all previously known upper bounds for the push-pull protocol established for various classes of networks. On the other hand, if β > 3, then Ω(log n) rounds are necessary.

I will also discuss the asynchronous version of the push-pull protocol, where the nodes do not operate in rounds, but exchange information according to a Poisson process with rate 1. Surprisingly, if 2 < β < 3, the rumor spreads even in constant time, which is much smaller than the typical distance of two nodes.

This is joint work with N. Fountoulakis, T. Sauerwald.

On the Erdős-Szekeres Problem and its Modifications

In our talk, we shall concentrate on a classical problem of combinatorial geometry going back to P. Erdős and G. Szekeres. First of all, we shall introduce and discuss the minimum number g(n) such that from any set of g(n) points in general position in the plane, one can choose a set of n points which are the vertices of a convex n-gon. Further, we shall proceed to multiple important modifications of the quantity g(n). In particular we shall consider a value h(n): it’s definition is almost the same as the just-mentioned definition of g(n); one should only replace in it “a convex n-gon” by “a convex empty n-gon”. Also we shall generalize h(n) to h(n, k) and to h(n, mod q), where the previous condition “an n-gon is empty” is substituted either by the condition “an n-gon contains at most k points” (so that h(n) = h(n, 0)) or by the condition “an n-gon contains 0 points modulo q”. Finally, we shall speak about various chromatic versions of the above quantities.

We shall present a series of recent achievments in the field, and we shall discuss some new approaches and conjectures.

Optimal (Fully) LZW-compressed Pattern Matching

We consider the following variant of the classical pattern matching problem motivated by the increasing amount of digital data we need to store: given an uncompressed pattern s[1..m] and a compressed representation of a string t[1..N], does s occur in t? I will present a high-level description of an optimal linear time algorithm which detects the occurrence in t compressed using the Lempel-Ziv-Welsch method (widely used in real-life applications due to its simplicity and relatively good approximation ratio), thus answering a question of Amir, Benson, and Farach from 1994. Then I will show how to extend this method to solve the fully compressed version of the problem, where both the pattern and the text are compressed, also in optimal linear time, hence improving the previously known solution of Gąsieniec and Rytter, and essentially closing this line of research.

Understanding the Kernelizability of Multiway Cut

In this talk I will present results of my ongoing research whose goal is to understand kernelizability of the multiway cut problem. To make the talk self-contained, I will start from the definition of kernelization, accompanied by a simple kernelization procedure for the Vertex Cover problem. Then I will define the multiway cut problem, briefly overview the existing parameterization results, and provide reasons why understanding kernelizability of the problem is an interesting question.

In the final part of my talk I will present a kernelization algorithm for a special, yet NP-hard, case of the multiway cut problem and discuss possible ways of its generalization.

Fractional Colouring and Pre-colouring Extension of Graphs

A vertex-colouring of a graph is an assignment of colours to the vertices of the graph so that adjacent vertices receive different colours. The minimum number of colours needed for such a colouring is called the chromatic number of the graph. Now suppose that certain vertices are already pre-coloured, and we want to extend this partial colouring to a colouring of the whole graph. Because of the pre-coloured vertices, we may need more colours than just the chromatic number. How many extra colours are needed under what conditions has been well-studied, and we will give a short overview of those results.

A different way of colouring the vertices is so-called fractional colouring. For such a colouring we are given an interval [0,K] of real numbers, and we need to assign to each vertex a subset of [0,K] of measure one so that adjacent vertices receive disjoint subsets. The fractional chromatic number is the minimum K for which this is possible.

Again we can look at this problem assuming that certain vertices are already pre-coloured (are already assigned a subset of measure one). Assuming some knowledge about the pre-coloured vertices, what K is required to guarantee that we can always extend this partial colouring to a fractional colouring of the whole graph? The answer to this shows a surprising dependence on the fractional chromatic number of the graph under consideration.

This is joint work with Dan Kral, Martin Kupec, Jean-Sebastien Sereni and Jan Volec.

Partitioning Posets

It is well known and easy to prove that every graph with m edges has a cut containing at least m/2 edges. While the complete graph shows that the constant ½ cannot be improved, Edwards established a more precise extremal bound that includes lower order terms. The problem of determining such bounds is called the extremal maxcut problem and many variants of it have been studied. In the first part of the talk, we consider a natural analogue of the extremal maxcut problem for posets and some of its generalisations. (Whereas a graph cut is a set of all edges that cross some bipartition of the graph’s vertex set, we shall define a poset cut to be a set of all comparable pairs that cross some order-preserving partition of the poset’s ground set.)

The algorithmic maxcut problem for graphs, i.e. the problem of determining the size of the largest cut in a graph, is well known to be NP-hard. In the second part of the talk, we examine the complexity of the poset analogue of the max-cut problem and some of its generalisations.

Solution to an Edge-coloring Conjecture of Grunbaum

By a classical result of Tait, the four color theorem is equivalent to the statement that each 2-edge-connected 3-regular planar graph has a 3-edge-coloring. An embedding of a graph into a surface is called polyhedral if its dual has no multiple edges or loops. A conjecture of Grunbaum, presented in 1968, states that each 3-regular graph with a polyhedral embedding into an orientable surface has a 3-edge-coloring. With respect to the result of Tait, it aims to generalize the four color theorem for any orientable surface. We present a negative solution to this conjecture, showing that for each orientable surface of genus at least 5, there exists a 3-regular non 3-edge-colorable graph with a polyhedral embedding into the surface.

Achlioptas Process Phase Transitions are Continuous

It is widely believed that certain simple modifications of the random graph process lead to discontinuous phase transitions. In particular, starting with the empty graph on $n$ vertices, suppose that at each step two pairs of vertices are chosen uniformly at random, but only one pair is joined, namely one minimizing the product of the sizes of the components to be joined. Making explicit an earlier belief of Achlioptas and others, in 2009, Achlioptas, D'Souza and Spencer conjectured that there exists a δ>0 (in fact, δ\ge 1/2) such that with high probability the order of the largest component `jumps' from o(n) to at least δ n in o(n) steps of the process, a phenomenon known as `explosive percolation'. We give a simple proof that this is not the case. Our result applies to all `Achlioptas processes', and more generally to any process where a fixed number of independent random vertices are chosen at each step, and (at least) one edge between these vertices is added to the current graph, according to any (online) rule. We also prove the existence and continuity of the limit of the rescaled size of the giant component in a class of such processes, settling a number of conjectures. Intriguing questions remain, however, especially for the product rule described above.

Joint work with Oliver Riordan.

Dynamics of Boolean Networks - An Exact Solution

In his seminal work Kauffman introduced a very simple dynamical model of biological gene-regulatory networks. Each gene was modeled by a binary variable that can be in an ON/OFF state and interacts with other genes via a coupling Boolean function which determines the state of a gene at the next time-step. It was argued that this model, also known as Random Boolean network (RBN) or Kauffman net, is relevant to the understanding of biological systems. RBNs belong to a larger class of Boolean networks that exhibits a rich dynamical behavior, which is very versatile and has found its use in the modeling of genetic, neural and social networks as well as in many other branches of science.

The annealed approximation has proved to be a valuable tool in the analysis of large scale Boolean networks as it allows one to predict the time evolution of network activity (proportion of ON/OFF states) and Hamming distance (the difference between the states of two networks of identical topology) order parameters. The broad validity of the annealed approximation to general networks of this type has remained an open question; additionally, while the annealed approximation provides accurate activity and Hamming distance results for various Boolean models with quenched disorder it cannot compute correlation functions, used in studying memory effects. In particular, there are models with strong memory effects where the annealed approximation is not valid in specific regimes.

In the current work we study the dynamics of a broad class of Boolean networks with quenched disorder and thermal noise using the generating functional analysis; the analysis is general and covers a large class of recurrent Boolean networks and related models. We show that results for the Hamming distance and network activity obtained via the quenched and annealed approaches, for this class, are identical. In addition, stationary solutions of Hamming distance and two-time autocorrelation function (inaccessible via the annealed approximation) coincide, giving insight into the uniform mapping of states within the basin of attraction onto the stationary states. In the presence of noise, we show that above some noise level the system is always ergodic and explore the possibility of spin-glass phase below this level. Finally, we show that our theory can be used to study the dynamics of models with strong memory effects.

Joint work with Alexander Mozeika

The Traveling Salesman Problem: Theory and Practice in the Unit Square

In the Traveling Salesman Problem (TSP) we are given a collection of cities and the distance between each pair, and asked to find the shortest route that visits all the cities and returns to its starting place. When writers in the popular press wish to talk about NP-completeness, this is the problem they typically use to illustrate the concept, but how typical is it really? The TSP has also been highly attractive to theorists, who have proved now-classical results about the worst-case performance of heuristics for it, but how relevant to practice are those results?

In this talk I provide a brief introduction to the TSP, its applications, and key theoretical results about it, and then report on experiments that address both the above questions. I will concentrate on randomly generated instances with cities uniformly distributed in the unit square, which I will argue provide a reasonable surrogate for the instances arising in many real-world TSP applications. I'll first survey the performance of heuristics on these instances, and then report on an ongoing study into the average length and structure of their optimal tours, based on extensive data generated using state-of-the-art optimization software for the TSP, which can regularly find optimal solutions to TSP instances with 1000 cities or more.

No-wait Flow Shop with Batching Machines

Scheduling problems with batching machines are extensively considered in the literature. Batching means that sets of jobs which are processed on the same machine must be grouped into batches. Two types of batching machines have been considered, namely s-batching machines and p-batching machines. For s-batching machines, the processing time of a batch is given by the sum of the processing times of the jobs in the batch, whereas, for p-batching machines the processing time of batches is given by the maximum of the processing times of the jobs in the batch.

In this talk we consider no-wait flowshop scheduling problems with batching machines. The first problem that will be considered is no-wait flowshop with two p-batching machines and three batching machines. For these problems we characterize the optimal solution and we give a polynomial time algorithm to minimize the makespan for the two-machine problem. For the three-machine problem we show the number of batches can be limited to nine and give an example where all optimal schedules have seven batches. The second problem that will be considered is the no-wait flowshop with two-machines, where the first machine is a p-batching machine, and the second machine is an s-batching machine. We show that the makespan minimization is NP-hard and we present some polynomial cases by reducing the scheduling problem to a matching problem with minimal cost in a specific graph.

Space Fullerenes

A (geometric) fullerene is a 3-valent polyhedron whose faces are hexagons and pentagons (so, 12 of them). A fullerene is said to be Frank-Kasper if its hexagons are adjacent only to pentagons; there are four such fullerenes: with 20, 24, 26 and 28 vertices.

A space fullerene is a 4-valent 3-periodic tiling of R^3 by Frank-Kasper fullerenes. Space fullerenes are interesting in Crystallography (metallic alloys, zeolites, clathrates) and in Discrete Geometry. 27 such physical structures, all realized by alloys, were already known.

A new computer enumeration method has been devised for enumerating the space fullerenes with a small fundamental domain under their translation groups: 84 structures with at most 20 fullerenes in the reduced unit cell (i.e. by a Biberbach group) were found. The 84 obtained structures have been compared with the 27 physical ones and all known special constructions: by Frank-Kasper-Sullivan, Shoemaker-Shoemaker, Sadoc-Mossieri and Deza-Shtogrin. 13 obtained structures are among the above 27, including A_{15}, Z, C_{15} and 4 other Laves phases.

Moreover, there are 16 new proportions of 20-, 24-, 26-, 28-vertex fullerenes in the unit cell. 3 of them provide the first counterexamples to a conjecture by Rivier-Aste, 1996, and to the old conjecture by Yarmolyuk-Kripyakevich, 1974, that the proportion should be a conic linear combination of proportions (1:3:0:0), (2:0:0:1), (3:2:2:0) of A_{15}, C_{15}, Z.

So, a new challenge to practical Crystallography and Chemistry is to check the existence of alloys, zeolites, or other compounds having one of the 71 new geometrical structures.

This is joint work with Mathieu Dutour and Olaf Delgado.

Elementary Polycycles and Applications

Given q \in \mathbb{N} and R \subset \mathbb{N}, an (R,q)-polycycle is a non-empty, 2-connected, planar, locally finite (i.e. any circle contains only a finite number of its vertices) graph G with faces partitioned into two non-empty sets F_1 and F_2, so that:

- all elements of F_1 (called proper faces) are combinatorial i-gons with i \in R,
- all elements of F_2 (called holes, the exterior face(s) are amongst them) are pair-wise disjoint, i.e. have no common vertices,
- all vertices have degree within {2,...,q} and all interior (i.e. not on the boundary of a hole) vertices are q-valent.

Such a polycycle is called elliptic, parabolic or hyperbolic when 1/q+1/r-1/2 (where r={max_{i \in R}i}) is positive, zero or negative, respectively.

A bridge of an (R,q)-polycycle is an edge, which is not on a boundary and goes from a hole to a hole (possibly the same hole). An (R,q)-polycycle is called elementary if it has no bridges. An open edge of an (R,q)-polycycle is an edge on a boundary, such that each of its end-vertices has degree less than q. Every (R,q)-polycycle is formed by the agglomeration of elementary (R,q)-polycycles along their open edges.

We classify all elliptic elementary (R,q)-polycycles and present various applications.

Triangle-intersecting Families of Graphs

A family of graphs F on a fixed set of n vertices is said to be `triangle-intersecting' if for any two graphs G and H in F, the intersection of G and H contains a triangle. Simonovits and S\'{o}s conjectured that such a family has size at most $\frac{1}{8}2^{{n \choose 2}}$, and that equality holds only if F consists of all graphs containing some fixed triangle. Recently, the author, Yuval Filmus and Ehud Friedgut proved a strengthening of this conjecture, namely that if F is an odd-cycle-intersecting family of graphs, then $|F| \leq \tfrac{1}{8} 2^{{n \choose 2}}$. Equality holds only if $F$ consists of all graphs containing some fixed triangle. A stability result also holds: an odd-cycle-intersecting family with size close to the maximum must be close to a family of the above form. We will outline proofs of these results, which use Fourier analysis, together with an analysis of the properties of random cuts in graphs, and some results from the theory of Boolean functions. We will then discuss some related open questions.

All will be based on joint work with Yuval Filmus (University of Toronto) and Ehud Friedgut (Hebrew University of Jerusalem).

Overlap Colourings of Graphs: A Generalization of Multicolourings

An r-multicolouring of a graph allocates r colours (from some `palette') to each vertex of a graph such that the colour sets at adjacent vertices are disjoint; in an (r,\lambda) overlap colouring the sets at adjacent vertices must also overlap by \lambda colours. The (r,\lambda) chromatic number, \chi_{r,\lambda}(G), is the smallest possible palette size. Classifying graphs by their overlap chromatic properties turns out to be strictly finer than by their multichromatic properties but not as fine as by their cores.

I shall survey what is currently known: basically, everything concerning series-parallel (i.e. K_4-minor-free) and wheel graphs, and the asymptotics for complete graphs.

Number Systems and Data Structures

The interrelationship between numerical representations and data structures is efficacious. However, in many write-ups such connection has not been made explicit. As far as we know, their usage was first discussed in the seminar notes by Clancy and Knuth. Early examples of data structures relying on number systems include finger search trees and binomial queues.

In this talk, we survey some known number systems and their usage in existing worst-case efficient data structures. We formalize properties of number systems and requirements that should be imposed on a number system to guarantee efficient performance on the corresponding data structures. We introduce two new number systems: the strictly-regular system and the five-symbol skew system. We illustrate how to perform operations on the two number systems and give applications for their usage to implement worst-case efficient data structures. We also give a simple method that extends any number system supporting increments to support decrements using the same number of digit flips.

The strictly-regular system is a compact system that supports increments and decrements in constant number of digit flips. Compared to other number systems, the strictly-regular system has distinguishable properties. It is superior to the regular system for its efficient support of decrements, and superior to the extended-regular system for being more compact by using three symbols instead of four. To demonstrate the applicability of the new number system, we modify Brodal's meldable priority queues making *delete* require at most 2lg(n)+O(1) element comparisons (improving the bound from 7lg(n)+O(1)) while maintaining the efficiency and the asymptotic time bounds for all operations.

The five-symbol skew system also supports increments and decrements with a constant number of digit flips. In this number system the weight of the ith digit is 2^{i}-1, and hence it can be used to implement efficient structures that rely on complete binary trees. As an application, we implement a priority queue as a forest of heap-ordered complete binary trees. The resulting data structure guarantees O(1) worst-case cost per *insert* and O(lg(n)) worst-case cost per *delete*.

The Complexity of the Constraint Satisfaction Problem: Beyond Structure and Language

The Constraint Satisfaction Problem (CSP) is concerned with the feasibility of satisfying a collection of constraints. The CSP paradigm has proven to be useful in many practical applications.

In a CSP instance, a set of variables must be assigned values from some domain. The values allowed for certain (ordered) subsets of the variables are restricted by constraint relations. The general CSP is NP-hard. However there has been considerable success in identifying tractable fragments of the CSP: these have traditionally been characterised in one of two ways:

The sets of variables that are constrained in any CSP instance can be abstracted to give a hypergraph structure for the instance. Subproblems defined by limiting the allowed hypergraphs are called structural. The theory of tractable structural subproblems is analogous to the theory of tractable conjunctive query evaluation in relational databases and many of the tractable cases derive from generalisations of acyclic hypergraphs. We have several important dichotomy theorems for the complexity of structural subproblems.

Alternatively, it is possible to restrict the set of relations which can be used to define constraints. Subproblems defined in this way are called relational. It turns out that the complexity of relational subproblems can be studied by analysing a universal algebraic object: the clone of polymorphisms. This algebraic analysis is well advanced and again there are impressive dichotomy theorems for relational subproblems.

As such, it is timely to consider so-called hybrid subproblems which can neither be characterised by structural nor relational restrictions. This exciting new research direction shows considerable promise. In this talk we present several of the new results (tractable classes) for hybrid tractability: Turan, Broken Triangle, Perfect and Pivots.

Auction and Equilibrium in Sponsored Search Market Design

The Internet enabled sponsored market has been one of those that have been attracting extensive attention. Within this framework of a new market design, the price and allocation of on-line advert placement through auction or market equilibrium become very important topic both in theory and in practice.

Within this context, we discuss incentive issues of both the market maker (the seller) and the market participants (the buyers) within the market equilibrium paradigm, and discuss existence, convergence and polynomial time solvability results with the comparison to auction protocols.

Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity

We present a near-linear time algorithm that approximates the edit distance between two strings within a significantly better factor than previously known. This result emerges in our investigation of edit distance from a new perspective, namely a model of asymmetric queries, for which we present near-tight bounds.

Another consequence of this new model is the first rigorous separation between edit distance and Ulam distance, by tracing the hardness of edit distance to phenomena that were not used by previous analyses.

[Joint work with Alexandr Andoni and Krzysztof Onak.]

All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with a Quadratic Number of Variables

We will consider the most general ternary Permutation Constraint Satisfaction Problem (CSP) and observe that all other ternary Permutation-CSPs can be reduced to this one. An instance of such a problem consists of a set of variables V and a multiset of constraints, which are ordered triples of distinct variables of V. The objective is to find a linear ordering alpha of V that maximises the number of triples whose ordering (under alpha) follows that of the constraint.

We prove that all ternary Permutation-CSPs parameterized above average (which is a tight lower bound) have kernels with a quadratic number of variables.

Defining Real-world Vehicle Routing Problems: An Object-based Approach

Much interest is currently being expressed in "Real-world" VRPs. But what are they and how can they be defined? The conventional method of problem formulations for the VRP are rarely extended to deal with many real-world constraints and rapidly become complex and unwieldy as the number and complexity of constraints increases. In Software Engineering practice, complex systems and constraints are commonplace, and the prevailing modelling and programming paradigm is Object-Oriented Programming. This talk will present an OOP model for the VRP and show it's application to some classic VRP variants as well as some real-world problem domains.

To reserve your place please contact Sue Shaw <S.Shaw@wbs.ac.uk>.

A Role for the Lovasz Theta Function in Quantum Mechanics

The mathematical study of the transmission of information without error was initiated by Shannon in the 50s. Only in 1979, Lovasz solved the major open problem of Shannon concerned with this topic. The solution is based on a now well-known object called the Lovasz theta function. Its role greatly contributed to the developments of areas of Mathematics like semidefinite programming and extremal problems in combinatorics. The Lovasz theta function is an upper bound to the zero-error capacity, however it is not always tight.

In the last two decades quantum information theory established itself as the natural extension of information theory to the quantum regime, i.e. for the study of information storage and transmission with the use of quantum systems and dynamics. I will show that the Lovasz theta function is an upper bound to the zero-error capacity when the parties of a channel can share certain quantum physical resources. This quantity, which is called entanglement-assisted zero-error capacity, can be greater than the classical zero-error capacity, in both single use of the channel and asymptotically.

Additionally, I will propose a physical interpretation of the Lovasz theta function as the maximum violation of certain noncontextual inequalities. These are inequalities traditionally used to study the difference between classical, quantum mechanical, and more exotic theories of nature.

This is joint work with Adan Cabello (Sevilla), Runyao Duan (Tsinghua/Sydney), and Andreas Winter (Bristol/Singapore).

Boundedness, Rigidity and Global Rigidity of Direction-Length Frameworks

A mixed graph G=(V;D,L) is a graph G together with a bipartition (D,L) of its edge set. A d-dimensional direct-length framework (G,p) is a mixed graph G together with a map p:V->R^d. We imagine that the vertices are free to move in R^d subject to the constraints that the directions of the direction edges and the lengths of the length edges edges remain constant. The framework is rigid if the only such motions are simple translations.

Two frameworks (G,p) and (G,q) are equivalent if the edges in D have the same directions and edges in L have the same lengths in both (G,p) and (G,q). The framework (G,p) is globally rigid if every framework which is equivalent to (G,p), can be obtained from (G,p) by a translation or a dilation by -1. It is bounded if there exists K in R such that every framework (G,q) which is equivalent to (G,q), satisfies |q(u)-q(v)| <= K for all u,v in V.

I will describe characterizations of boundedness and rigidity of generic 2-dimensional direction-length frameworks, and give partial results for the open problem of characterizing the global rigidity of such frameworks. This is joint work with Peter Keevash and Tibor Jordán.

Grid Pattern Classes

Matrix griddings are structural means of representing permutations as built of finitely many increasing and decreasing permutations. More specifically, let M be an m × n matrix with entries m_{ij} ∈ { 0,1,-1}. We say that a permutation π admits an M-gridding if the xy-plane in which the graph Γ of π has been plotted can be partitioned into an xy-parallel, m × n rectangular grid with cells C_{ij}, such that the following hold:

- if m_{ij} = 1 then Γ ∩ C_{ij} is an increasing sequence of points;
- if m_{ij} = -1 then Γ ∩ C_{ij} is decreasing;
- if m_{ij} = 0 then Γ ∩ C_{ij} = ∅.

Let G(M) denote the set (pattern class) of all permutations which admit M-griddings. Grid classes have been present in the pattern classes literature from very early on. For example, Atkinson (1999) observed that the class of permutations avoiding 321 and 2143 is equal to G((1 1)) ∩ G((1 1)^{t}) and used this to enumerate the class. Much more recently, grid classes have played a crucial role in Vatter's (to appear) classification of small growth rates of pattern classes.

These past uses hint strongly at the natural importance of grid classes in the general theory of pattern classes. If this is to be so, the next step is to establish `nice' general properties of grid classes themselves. A number of researchers, including M.H. Albert, M.D. Atkinson, M. Bouvel, R. Brignall, V. Vatter and myself, have been engaged on such a project over the past year, and I will report on their findings. The results are proved by an intriguing interplay of language-theoretic and combinatorial-geometric methods, the flavour of which I will try to convey. The talk will conclude with a discussion of some open problems concerning general grid classes, which ought to point the way for the next stage in this project.

Unsatisfiability Below the Threshold(s)

It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal rule. Also, above the satisfiability threshold, where a random formula is with high probability (whp) unsatisfiable, the unsatisfiability is whp due to a large ``minimal unsatisfiable subformula'' (MUF).

By contrast, we show that for the (rare) unsatisfiable formulae below the pure literal threshold, the unsatisfiability is whp due to a unique MUF with smallest possible ``excess'', failing this whp due to a unique MUF with the next larger excess, and so forth. In the same regime, we give a precise asymptotic expansion for the probability that a formula is unsatisfiable, and efficient algorithms for satisfying a formula or proving its unsatisfiability. It remains open what happens between the pure literal threshold and the satisfiability threshold. We prove analogous results for the k-core and k-colorability thresholds for a random graph, or more generally a random r-uniform hypergraph.

Matchings in 3-uniform Hypergraphs

A theorem of Tutte characterises all graphs that contain a perfect matching. In contrast, a result of Garey and Johnson implies that the decision problem of whether an r-uniform hypergraph contains a perfect matching is NP-complete for r>2. So it is natural to seek simple sufficient conditions that ensure a perfect matching. Given an r-uniform hypergraph H, the degree of a k-tuple of vertices is the number of edges in H containing these vertices. The minimum vertex degree of H is the minimum of these degrees over all 1-tuples. The minimum codegree of H is the minimum of all the degrees over all (r-1)-tuples of vertices in H.

In recent years there has been significant progress on this problem. Indeed, in 2009 Rödl, Ruciński and Szemerédi characterised the minimum codegree that ensures a perfect matching in an r-uniform hypergraph. However, much less is known about minimum vertex degree conditions for perfect matchings in r-uniform hypergraphs H. Hàn, Person and Schacht gave conditions on the minimum vertex degree that ensures a perfect matching in the case when r>3. These bounds were subsequently lowered by Markström and Ruciński. This result, however, is believed to be far from tight. In the case when r=3, Hàn, Person and Schacht asymptotically determined the minimum vertex degree that ensures a perfect matching. In this talk we discuss a result which determines this threshold exactly. This is joint work with Daniela Kühn and Deryk Osthus.

On Incidentor Colorings of Multigraphs

An incidentor in a directed or undirected multigraph is an ordered pair of a vertex and an arc incident to it. It is convenient to treat an incidentor as half of an arc incident to a vertex. Two incidentors of the same arc are called mated. Two incidentors are adjacent if they adjoin the same vertex. The incidentor coloring problem (indeed, a class of problems) is to color all incidentors of a given multigraph with the minimum number of colors satisfying some restrictions on colors of adjacent and mated incidentors.

A review of various results on incidentor coloring will be given in the talk.

The Empire Colouring Problem: Old and New Results

Assume that the vertex set of a graph G is partitioned into blocks B_1, B_2, ... of size r>1, so that B_i contains vertices labelled (i-1)r+1, (i-1)r+2, ... , ir. The r-empire chromatic number of G is the minimum number of colours \chi_r(G) needed to colour the vertices of G in such a way that all vertices in the same block receive the same colour, but pairs of blocks connected by at least one edge of G are coloured differently.The decision version of this problem (termed the r-empire colouring problem) dates back to the work of Perci Heawood on the famous Four Colour Theorem (note that the 1-empire colouring problem is just planar graph colouring). In this talk I will present a survey of some old and new results on this problem. Among other things, I will focus on the computational complexity of the r-empire colouring problem and then talk about the colourability of random trees.

Reconstruction Problems and Polynomials

There are three classical unsolved reconstruction problems: vertex reconstruction of S.M. Ulam and P.J. Kelly (1941), edge reconstruction of F. Harary (1964) and switching reconstruction of R.P. Stanley (1985). It turns out that these and similar questions are intimately connected with a wide range of important and also mostly open problems related to polynomials. For example, a simplest analogue of vertex reconstruction - reconstruction of a sequence from its subsequences leads to Littlewood-type problems concerning polynomials with -1,0, 1 coefficients. In switching reconstruction one has to know the number of zero coefficients in the expansion of (1-x)^n (1+x)^m, which is the same as the number of integer zeros of Krawtchouk polynomials. In this talk I will try to explain these connections and show how they can be applied to reconstruction.

A Decidability Result for the Dominating Set Problem

We study the following question: given a finite collection of graphs G_1,...,G_k, decide whether the dominating set problem is NP-hard in the class of (G_1,...,G_k)-free graphs or not. In this talk, we prove the existence of an efficient algorithm that answers this question for k=2.

Hardness and Approximation of Minimum Maximal Matching in k-regular graphs

We consider the problem of finding a maximal matching of minimum size in a graph, and in particular, in bipartite regular graphs. This problem was motivated by a stable marriage allocation problem. The minimum maximal matching is known to be NP-hard in bipartite graphs with maximum degree 3. We first extend this result to the class of $k$-regular bipartite graphs, for any fixed $k\geq 3$. In order to find some “good” solutions, we compare the size $M$ of a maximum matching and the size $MMM$ of a minimum maximal matching in regular graphs. It is well known that $M\leq 2MMM$ in any graph and we show that it can be improved to $M\leq (2-1/k)MMM$ in $k$-regular graphs. On the other hand, we analyze a greedy algorithm finding in $k$-regular bipartite graphs a maximal matching of size $MM$ satisfying $MM\leq (1-\epsilon(k))M$. It leads to a $(1-\epsilon(k))(2-1/k)$-approximation algorithm for $k$-regular bipartite graphs.

This is joint work with Tinaz Ekim and C. Tanasescu

Query Complexity Lower Bounds for Reconstruction of Codes

We investigate the problem of "local reconstruction", as defined by Saks and Seshadhri (2008), in the context of error correcting codes.

The first problem we address is that of "message reconstruction", where given an oracle access to a corrupted encoding $w \in \{0,1\}^n$ of some message $x \in \{0,1\}^k$ our goal is to probabilistically recover $x$ (or some portion of it). This should be done by a procedure (reconstructor) that given an index $i$ as input, probes $w$ at few locations and outputs the value of $x_i$. The reconstructor can (and indeed must) be randomized, but all its randomness is specified in advance by a single random seed, such that with high probability ALL $k$ values $x_i$ for $1 \leq i \leq k$ are reconstructed correctly.

Using the reconstructor as a filter allows to evaluate certain classes of algorithms on $x$ efficiently. For instance, in case of a parallel algorithm, one can initialize several copies of the reconstructor with the same random seed, and they can autonomously handle decoding requests while producing outputs that are consistent with the original message $x$. Another example is that of adaptive querying algorithms, that need to know the value of some $x_i$ before deciding which index should be decoded next.

The second problem that we address is "codeword reconstruction", which is similarly defined, but instead of reconstructing the message our goal is to reconstruct the codeword itself, given an oracle access to its corrupted version.

Error correcting codes that admit message and codeword reconstruction can be obtained from Locally Decodable Codes (LDC) and Self Correctible Codes (SCC) respectively. The main contribution of this paper is a proof that in terms of query complexity, these are close to be the best possible constructions, even when we disregard the length of the encoding.

This is joint work with Eldar Fischer and Arie Matsliah.

Altruism in Atomic Congestion Games

We study the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a linear trade-off between selfish and social objectives. Our model can be embedded in the framework of congestion games with player-specific latency functions. Stable states are the pure Nash equilibria of these games, and we examine their existence and the convergence of sequential best-response dynamics. In general, pure Nash equilibria are often absent and existence is \NP-hard to decide. Perhaps surprisingly, if all delay functions are linear, the games remain potential games even when agents are arbitrarily altruistic. This result can be extended to a class of general potential games and social cost functions, and we study a number of prominent examples.

In addition to these results for uncoordinated dynamics, we consider a scenario with a central altruistic institution that can set incentives for the agents. We provide constructive and hardness results for finding the minimum number of altruists to stabilize an optimal congestion profile and more general mechanisms to incentivize agents to adopt favorable behavior.

Proportional Optimization and Fairness: Applications

The problem of allocating resources in proportion to some measure has been studied in various fields of science for a long time. The apportionment problem of allocating seats in a parliament in proportion to the number of votes obtained by political parties is one example. This presentation will show a number of other real-life problems, for instance the Liu-Layland problem, stride scheduling and fair queueing which can be formulated and solved as the problems of proportional optimization and fairness.

A Decomposition Approach for Insuring Critical Paths

We consider a stochastic optimization problem involving protection of vital arcs in a critical path network. We analyze a problem in which task finishing times are uncertain, but can be insured a priori to mitigate potential delays. We trade off costs incurred in insuring arcs with expected penalties associated with late completion times, where lateness penalties are lower semi-continuous nondecreasing functions of completion time. We provide decomposition strategies to solve this problem with respect to either convex or nonconvex penalty functions. In particular, we employ the Reformulation-Linearization Technique to make the problem amenable to solution via Benders decomposition. We also consider a chance-constrained version of this problem, in which the probability of completing a project on time is sufficiently large.

Energy Efficient Job Scheduling with Speed Scaling and Sleep Management

Energy usage has become a major issue in the design of microprocessors, especially for battery-operated devices. Many modern processors support dynamic speed scaling to reduce energy usage. The speed scaling model assumes that a processor, when running at speed s, consumes energy at the rate of s^\alpha, where \alpha is typically 2 or 3. In older days when speed scaling was not available, energy reduction was mainly achieved by allowing a processor to enter a low-power sleep state, yet waking up requires extra energy. It is natural to study job scheduling on a processor that allows both sleep state and speed scaling. In the awake state, a processor running at speed s>0 consumes energy at the rate s^\alpha + \sigma , where \sigma > 0 is the static power and s^\alpha is the dynamic power. In this case, job scheduling involves two components: a sleep management algorithm to determine when to work or sleep, and a speed scaling algorithm to determine which job to run and at what speed to run. Adding a sleep state changes the nature of speed scaling. Without sleep state, running a job slower is a natural way to save energy. With sleep state, one can also save energy by working faster to allow a longer sleep period. It is not trivial to strike a balance. In this talk, we will discuss some new scheduling results involving both speed scaling and sleep management.

Edge Expansion in Graphs on Surfaces

Edge expansion for graphs is a well-studied measure of connectivity, which is important in discrete mathematics and computer science. While there has been much recent work done in finding approximation algorithms for determining edge expansion, there has been less attention in developing exact polynomial-time algorithms to determine edge expansion for restricted graph classes. In this talk, I will present an algorithm that, given an n-vertex graph G of genus g, determines the edge expansion of G in time n^{O(g)}.

A Survey of Connectivity Approximation via a Survey of the Techniques

We survey some crucial techniques in approximating connectivity problems. The most general question we study is the Steiner Network problem, where we are given an undirected weighted graph with costs on the edges, and required number rij of paths between every i, j. The paths need to be vertex or edge disjoint depending on the problem. The goal is to find a minimum cost feasible solution.

The full talk has the following techniques and problems:

- Solving k out-connectivity in polynomial time in the edge (Edmonds) and in the vertex (Frank Tardos) cases. This gives a simple ratio 2 for edge k-connectivity.
- The cycle lemma of Mader: together with technique 1 it both gives results for minimum power k-connectivity power problems (see the talk for exact definition) and an improved result for k-edge connectivity in the metric case.
- Laminarity and the new charging scheme by Ravi et. al. getting a much simplified version of Jain's theorem of 2 approximating of Steiner network in the edge disjoint paths case.

The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements

The king of refinements of Nash equilibrium is trembling hand perfection. In this talk, we show that it is NP-hard and SQRTSUM-hard to decide if a given pure strategy Nash equilibrium of a given three-player game in strategic form with integer payoffs is trembling hand perfect. Analogous results are shown for a number of other solution concepts, including proper equilibrium, (the strategy part of) sequential equilibrium, quasi-perfect equilibrium and CURB.

Exponential Lower Bounds For Policy Iteration

We study policy iteration for infinite-horizon Markov decision processes. In particular, we study greedy policy iteration. This is an algorithm that has been found to work very well in practice, where it is used as an alternative to linear programming. Despite this, very little is known about its worst case complexity. Friedmann has recently shown that policy iteration style algorithms have exponential lower bounds in a two player game setting. We extend these lower bounds to Markov decision processes with the total-reward and average-reward optimality criteria.

Paths of Bounded Length and their Cuts: Parameterized Complexity and Algorithms

We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger's theorem both problems are equivalent (and computationally easy) in the unbounded case for single source, single target paths. However, in the bounded case, they are combinatorial distinct and are both NP-hard, even to approximate. Our results indicate that a more refined landscape appears when we study these problems with respect to their parameterized complexity. For this, we consider several parameterizations (with respect to the maximum length l of paths, the number k of paths or the size of a cut, and the treewidth of the input graph) of all variants of both problems (edge/vertex-disjoint paths or cuts, directed/undirected). We provide several FPT-algorithms (for all variants) when parameterized by both k and l and hardness results when the parameter is only one of k and l. Our results indicate that the bounded length disjoint-path variants are structurally harder than their bounded length cut counterparts. Also, it appears that the edge variants are harder than their vertex-disjoint counterparts when parameterized by the treewidth of the input graph. Joint work with Dimitrios M. Thilikos (Athens).

Colouring Pairs of Binary Trees and the Four Colour Problem - Results and Achievements

The Colouring Pairs of Binary Trees problem was introduced by Gibbons and Czumaj, and its equivalence to the Four Colour Problem means that it is an interesting combinatorial problem. Given two binary trees Ti and Tj, the question is whether Ti and Tj can be 3-coloured in such a way that the edge adjacent to leaf k is the same colour in Ti and Tj. This talk will introduce the problem and discuss some of the results that have been achieved so far, and will also discuss the potential benefits of finding a general solution to the problem. In particular we present two approaches that lead to linear-time algorithms solving CPBT for specific sub-classes of tree pairs. This is joint work with Alan Gibbons.

An Approximate Version of Sidorenko's Conjecture

A beautiful conjecture of Erdos-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same order and edge density. This conjecture also has an equivalent analytic form and has connections to a broad range of topics, such as matrix theory, Markov chains, graph limits, and quasirandomness. Here we prove the conjecture if H has a vertex complete to the other part, and deduce an approximate version of the conjecture for all H. Furthermore, for a large class of bipartite graphs, we prove a stronger stability result which answers a question of Chung, Graham, and Wilson on quasirandomness for these graphs.

Hybridizing Evolutionary Algorithms and Parametric Quadratic Programming to Solve Multi-Objective Portfolio Optimization Problems with Cardinality Constraints

The problem of portfolio selection is a standard problem in financial engineering and has received a lot of attention in recent decades. Classical mean-variance portfolio selection aims at simultaneously maximizing the expected return of the portfolio and minimizing portfolio variance, and determining all efficient (Pareto-optimal) solutions. In the case of linear constraints, the problem can be solved efficiently by parametric quadratic programming (i.e., variants of Markowitz’ critical line algorithm). However, there are many real-world constraints that lead to a non-convex search space, e.g., cardinality constraints which limit the number of different assets in a portfolio, or minimum buy-in thresholds. As a consequence, the efficient approaches for the convex problem can no longer be applied, and new solutions are needed. In this talk, we present a way to integrate an active set algorithm into a multi-objective evolutionary algorithm (MOEA). The idea is to let the MOEA come up with some convex subsets of the set of all feasible portfolios, solve a critical line algorithm for each subset, and then merge the partial solutions to form the solution of the original non-convex problem. Because this means the active set algorithm has to be run for the evaluation of every candidate solution, we also discuss how to efficiently implement parametric quadratic programming for portfolio selection. We show that the resulting envelope-based MOEA significantly outperforms other state-of-the-art MOEAs.

A Rigorous Approach to Statistical Database Privacy

Privacy is a fundamental problem in modern data analysis. We describe "differential privacy", a mathematically rigorous and comprehensive notion of privacy tailored to data analysis. Differential privacy requires, roughly, that any single individual's data have little effect on the outcome of the analysis. Given this definition, it is natural to ask: what computational tasks can be performed while maintaining privacy? In this talk, we focus on the tasks of machine learning and releasing contingency tables.

Learning problems form an important category of computational tasks that generalizes many of the computations applied to large real-life datasets. We examine what concept classes can be learned by an algorithm that preserves differential privacy. Our main result shows that it is possible to privately agnostically learn any concept class using a sample size approximately logarithmic in the cardinality of the hypothesis class. This is a private analogue of the classical Occam's razor result.

Contingency tables are the method of choice of government agencies for releasing statistical summaries of categorical data. We provide tight bounds on how much distortion (noise) is necessary in these tables to provide privacy guarantees when the data being summarized is sensitive. Our investigation also leads to new results on the spectra of random matrices with correlated rows.

Local Algorithms for Robotic Formation Problems

Consider a scenario with a set of autonomous mobile robots having initial positions in the plane. Their goal is to move in such a way that they eventually reach a prescribed formation. Such a formation may be a straight line between two given endpoints (short communication chain), a circle or any other geometric pattern, or just one point (gathering problem). In this talk, I consider simple local strategies for such robotic formation problems: the robots are limited to see only robots within a bounded radius; they are memoryless, without common orientation. Thus, their decisions where to move next are solely based on the relative positions of robots within the bounded radius. I will present local strategies for short communication chains and gathering, and present runtime bounds assuming different time models. All previous algorithms with a proven time bound assume global view on the positions of all robots.

Algorithmic Meta-Theorems: Upper and Lower Bounds for the Parameterized Complexity of Problems on Graphs

In 1990, Courcelle proved a fundamental theorem stating that every property of graphs definable in monadic second-order logic can be decided in linear time on any class of graphs of bounded tree-width. This theorem is the first of what is today known as algorithmic meta-theorems, that is, results of the form: every property definable in a logic L can be decided efficiently on any class of structures with property P.

Such theorems are of interest both from a logical point of view, as results on the complexity of the evaluation problem for logics such as first-order or monadic second-order logic, and from an algorithmic point of view, where they provide simple ways of proving that a problem can be solved efficiently on certain classes of structures.

Following Courcelle's theorem, several meta-theorems have been established, primarily for first-order logic with respect to properties of structures derived from graph theory. In this talk I will motivate the study of algorithmic meta-theorems from a graph algorithmic point of view, present recent developments in the field and illustrate the key techniques from logic and graph theory used in their proofs.

So far, work on algorithmic meta-theorems has mostly focused on obtaining tractability results for as general classes of graphs as possible. The question of finding matching lower bounds, that is, intractability results for monadic second-order or first-order logic with respect to certain graph properties, has so far received much less attention. Tight matching bounds, for instance for Courcelle's theorem, would be very interesting as they would give a clean and exact characterisation of tractability for MSO model-checking with respect to structural properties of the models. In the second part of the talk I will present a recent result in this direction showing that Courcelle's theorem can not be extended much further to classes of unbounded tree-width.

Time-optimal Strategies for Infinite Games

The use of two-player games of infinite duration has a long history in the synthesis of controllers for reactive systems. Classically, the quality of a winning strategy is measured in the size of the memory needed to implement it. But often there are other natural quality measures: in many games (even if they are zero-sum) there are winning plays for Player 0 that are more desirable than others. In this talk, we define and compute time-optimal winning strategies for three winning conditions.

In a Poset game, Player 0 has to answer request by satisfying a partially ordered set of events. We use a waiting time based approach to define the quality of a strategy and show that Player 0 has optimal winning strategies, which are finite-state and effectively computable.

In Parametric LTL, temporal operators may be equipped with free variables for time bounds. We present algorithms that determine whether a player wins a game with respect to some, infinitely many, or all variable valuations. Furthermore, we show how to determine optimal valuations that allow a player to win a game.

In a k-round Finite-time Muller game, a play is stopped as soon as some loop is traversed k times in a row. For k=n^2n!+1, the winner of the k-round Finite-time Muller game wins also the classical Muller game. For k=2, this equivalence does no longer hold. For all values in between, it is open whether the games are equivalent.

Induced Minors and Contractions - An Algorithmic View

The theory of graph minors by Robertson and Seymour is one of very active fields in modern (algorithmic) graph theory. In this talk we will be interested in two containment relations similar to minors -- contractions and induced minors. We will survey known classic results and present some new work. In particular, I would like to talk about two recent results: (1) a polynomial-time algorithm for finding induced linkages in claw-free graphs, and (2) a polynomial-time algorithm for contractions to a fixed pattern in planar graphs. The talk will be based on joint work with Jiri Fiala, Bernard Lidicky, Daniel Paulusma and Dimitrios Thilikos.

The Generalized Triangle-triangle Transformation in Percolation (joint seminar with Statistical Mechanics)

One of the main aims in the theory of percolation is to find the `critical probability' above which long range connections emerge from random local connections with a given pattern and certain individual probabilities. The quintessential example is Kesten's result from 1980 that if the edges of the square lattice are selected independently with probability p, then long range connections appear if and only if p>1/2. The starting point is a certain self-duality property, observed already in the early 60s; the difficulty is not in this observation, but in proving that self-duality does imply criticality in this setting.

Since Kesten's result, more complicated duality properties have been used to determine a variety of other critical probabilities. Recently, Scullard and Ziff have described a very general class of self-dual planar percolation models; we show that for the entire class (in fact, a larger class), self-duality does imply criticality.

A Flow Model Based on Linking Systems with Applications in Network Coding

The Gaussian relay channel network, is a natural candidate to model wireless networks. Unfortunately, it is not known how to determine the capacity of this model, except for simple networks. For this reason, Avestimehr, Diggavi and Tse introduced in 2007 a purely deterministic network model (the ADT model), which captures two key properties of wireless channels, namely broadcast and superposition. Furthermore, the capacity of an ADT model can be determined efficiently and approximates the capacity of Gaussian relay channels. In 2009, Amaudruz and Fragouli presented the first polynomial time algorithm to determine a relay encoding strategy that achieves the min-cut value of an ADT network.

In this talk, I will present a flow model which shares many properties with classical network flows (as introduced by Ford and Fulkerson) and includes the ADT model as a special case. The introduced flow model is based on linking systems, a structure closely related to matroids. Exploiting results from matroid theory, many interesting prop result. Furthermore, classical matroid algorithms can be used to obtain efficient algorithms for finding maximum flows, minimum cost flows and minimum cuts. This is based on joint work with Michel Goemans and Satoru Iwata.

A Nonlinear Approach to Dimension Reduction

The celebrated Johnson-Lindenstrauss lemma says that every n points in Euclidean space can be represented using O(log n) dimensions with only a minor distortion of pairwise distances. It has been conjectured that a much-improved dimension reduction representation is achievable for many interesting data sets, by bounding the target dimension in terms of the intrinsic dimension of the data, e.g. by replacing the log(n) term with the doubling dimension. This question appears to be quite challenging, requiring new (nonlinear) embedding techniques.

We make progress towards resolving this question by presenting two dimension reduction theorems with similar flavour to the conjecture. For some intended applications, these results can serve as an alternative to the conjectured embedding.

[Joint work with Lee-Ad (Adi) Gottlieb.]

k-Means has Polynomial Smoothed Complexity

The k-means method is one of the most widely used clustering algorithms, drawing its popularity from its speed in practice. Recently, however, it was shown to have exponential worst-case running time. In order to close the gap between practical performance and theoretical analysis, we study the k-means method in the model of smoothed analysis.

Smoothed analysis is a hybrid of worst-case and average-case analysis, which is based on a semi-random input model in which an adversary first specifies an arbitrary input that is subsequently slightly perturbed at random. This models random influences (e.g., measurement errors or numerical imprecision) that are present in most applications, and it often yields more realistic results than a worst-case or average-case analysis.

We show that the smoothed running time of the k-means method is bounded by a polynomial in the input size and 1/sigma, where sigma is the standard deviation of the Gaussian perturbations. This means that if an arbitrary input data set is randomly perturbed, then the k-means method will run in expected polynomial time on that input set.

This talk is based on joint work with David Arthur (Stanford University) and Bodo Manthey (University of Twente).

Total Fractional Colorings of Graphs with Large Girth

A total coloring is a combination of a vertex coloring and an edge coloring of a graph: every vertex and every edge is assigned a color and any two adjacent/incident objects must receive distinct colors. One of the main open problems in the area of graph colorings is the Total Coloring Conjecture of Behzad and Vizing from the 1960's asserting that every graph has a total coloring with at most *D*+2 colors where *D* is its maximum degree. When relaxed to fractional total colorings, the Total Coloring Conjecture was verified by Kilakos and Reed. In the talk, we will present a proof of the following conjecture of Reed:

For every real ε > 0 and integer *D*, there exists *g* such that every graph with maximum degree *D* and girth at least *g* has total fractional chromatic number at most *D*+1+ε.

For *D*=3 and *D*=4,6,8,10,..., we prove the conjecture in a stronger form: there exists *g* such that every graph with maximum degree *D* and girth at least *g* has total fractional chromatic number equal to *D*+1.

Joint work with Tomas Kaiser, František Kardoš, Andrew King and Jean-Sébastien Sereni.

Hamilton Decompositions of Graphs and Digraphs

A Hamilton decomposition of a graph or digraph G is a set of edge-disjoint Hamilton cycles which together contain all the edges of G. In 1968, Kelly conjectured that every regular tournament has a Hamilton decomposition. We recently proved an approximate version of this conjecture (joint work with D. Kuhn and A. Treglown).

I will also describe an asymptotic solution of a problem by Nash-Williams (from 1971) on the number of edge-disjoint Hamilton cycles in a graph with given minimum degree (joint work with D. Christofides and D. Kuhn).

Time Complexity of Decision Trees

We study time complexity of decision trees over an infinite set of k-valued attributes. As time complexity measures, we consider the depth and its extension - weighted depth of decision trees. The problem under consideration is the following. Is it possible for an arbitrary finite set of attributes to construct a decision tree which recognizes values of these attributes for a given input, and has the weighted depth less than the total weight of the considered attributes? The solution of this problem for the case of depth is given in terms of independence dimension (which is closely connected with VC dimension) and a condition of decomposition of granules. Each granule can be described by a set of equations of the kind "attribute = value". The solution of the considered problem for the weighted depth is based on the solution for the depth. We also discuss the place of the obtained results in the comparative analysis of time complexity of deterministic and nondeterministic decision trees.

Random Graph Processes

The random triangle-free graph process starts with an empty graph and a random ordering on all the possible edges and in each step considers an edge and adds it too the graph if it remains triangle-free. In the same way one can define the random planar graph process where an edge is added when the graph remains planar. In this talk the two processes are compared. For example we show that with high probability at the end of the random planar process every fixed planar graph is a subgraph whereas in the triangle-process dense triangle-free subgraphs will not appear.

Cycles in Directed Graphs

There are many theorems concerning cycles in graphs for which it is natural to seek analogous results for directed graphs. I will survey some recent results of this type, including:

- a solution to a question of Thomassen on an analogue of Dirac's theorem for oriented graphs,
- a theorem on packing cyclic triangles in tournaments that "almost" answers a question of Cuckler and Yuster, and
- a bound for the smallest feedback arc set in a digraph with no short directed cycles, which is optimal up to a constant factor and extends a result of Chudnovsky, Seymour and Sullivan.

These are joint work respectively with (1.) Kuhn and Osthus, (2.) Sudakov, and (3.) Fox and Sudakov.

Solvable and Unsolvable in Cellular Automata

- The problem of ergodicity for cellular automata.
- The problem of eroders for cellular automata.

This is a joint seminar with the Centre for Complexity Science.

Using Neighbourhood Exploration to Speed up Random Walks

We consider strategies that can be used to speed-up the cover time of a random walk on undirected connected graphs. The price of this speed up is normally some extra work that can be performed locally by the walk or by the vertices of the graph. Typical assumptions about what is allowed include: Biased walk transitions, Use of previous history, Local exploration of the graph.

Methods of local exploration include the neighbour marking process RW-MARK and look-ahead RW-LOOK (searching to fixed depth).

The marking process, RW-MARK, made by a random walk on an undirected graph G is as follows. Upon arrival at a vertex v, the walk marks v if unmarked and otherwise it marks a randomly chosen unmarked neighbor of v.

Depending on the degree and the expansion of the graph, we prove several upper bounds on the time required by the process RW-MARK to mark all vertices of G. If, for instance G is the hypercube on n vertices the processes marks all vertices in time O(n), with high probability. This significantly reduces the n ln n cover time of the hypercube using a standard random walk.

The process RW-MARK can be compared to the marking process where a vertex v is chosen uniformly at random (coupon collecting) at each step. For the hypercube also has a marking time of O(n).

In the related look-ahead process RW-LOOK, the walk marks all neighbours of the visited vertex to some depth k. For the hypercube, for example, the performance of the processes RW-LOOK-1, and CC-LOOK-1 is asymptotic to n ln 2 with high probability.

This research is joint work with Petra Berenbrink, Robert Elsaesser, Tomasz Radzik and Thomas Sauerwald.

Robustness of the Rotor-router Mechanism for Graph Exploration

We consider the model of exploration of an undirected graph G by a single agent which is called the rotor-router mechanism or the Propp machine (among other names). Let p_v indicate the edge adjacent to a node v which the agent took on its last exit from v. The next time when the agent enters node v, first the "rotor" at node v advances pointer p_v to the next edge in a fixed cyclic order of the edges adjacent to v. Then the agent is directed onto edge p_v to move to the next node. It was shown before that after initial O(mD) steps, the agent periodically follows one established Eulerian cycle (that is, in each period of 2m consecutive steps the agent will traverse each edge exactly twice, once in each direction). The parameters m and D are the number of edges in G and the diameter of G. We investigate robustness of such exploration in presence of faults in the pointers p_v or dynamic changes in the graph. In particular, we show that after the exploration establishes an Eulerian cycle, if at some step k edges are added to the graph, then a new Eulerian cycle is established within O(km) steps. We show similar results for the case when the values of k pointers p_v are arbitrarily changed and when an arbitrary edge is deleted from the graph. Our proofs are based on the relation between Eulerian cycles and spanning trees known as the "BEST" Theorem (after de Bruijn, van Aardenne-Ehrenfest, Smith and Tutte).

This is joint work with: E. Bampas, L. Gasieniec, R. Klasing and A. Kosowski.

Discrepancy and Signed Domination in Graphs and Hypergraphs

For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and -1 such that the closed neighbourhood of every vertex contains more +1's than -1's. This concept is closely related to combinatorial discrepancy theory as shown by Fueredi and Mubayi [J. Combin. Theory, Ser. B76 (1999) 223-239]. The signed domination number of G is the minimum of the sum of colours for all vertices, taken over all signed domination functions of G. In this talk, we will discuss new upper and lower bounds for the signed domination number. These new bounds improve a number of known results.

An Overview of Multi-index Assignment Problems

In this presentation we give an overview of applications of, and algorithms for, multi-index assignment problems (MIAPs). MIAPs, and relatives of it, have a long history both in applications as well as in theoretical results, starting at least in the 1950's. In particular, we focus here on the complexity and approximability of special cases of MIAPs.

A prominent example of a MIAP is the so-called axial three index assignment problem (3AP) which has many applications in a variety of domains including clustering. A description of 3AP is as follows. Given are three n-sets R, G, and B. For each triple in R X G X B a cost-coefficient c(i,j,k) is given. The problem is to find n triples such that each element is in exactly one triple, while minimizing total cost. We show positive and negative results for finding an optimal solution to this problem that depend upon different ways of how the costs c(i,j,k) are specified.

Approximability and Parameterized Complexity of Minmax Values

We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with a precision of "ε log n" digits (for any constant ε > 0) is NP-hard, where n is the size of the game. On the other hand, approximating the value with a precision of c log log n digits (for any constant c ≤ 1) can be done in quasi-polynomial time.We consider the parameterized complexity of the problem, with the parameter being the number of pure strategies k of the player for which the minmax value is computed. We show that if there are three players, k = 2 and there are only two possible rational payoffs, the minmax value is a rational number and can be computed exactly in linear time. In the general case, we show that the value can be approximated with any polynomial number of digits of accuracy in time n^{O(k)}. On the other hand, we show that minmax value approximation is W[1]-hard and hence not likely to be fixed parameter tractable. Concretely, we show that if k-CLIQUE requires time n^{Ω(k)} then so does minmax value computation.

This is joint work with Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, and Peter Bro Miltersen.

Profit-maximizing Pricing: The Highway and Tollbooth Problem

We consider the profit maximizing pricing problem for single-minded buyers. Here, we wish to sell a set of m items to n buyers, each of whom is interested in buying a single set of items. Our goal is to set prices for the items such that the profit obtained by selling the items to the buyers who can afford them is maximized. We also assume in our case, that we have arbitrarily many copies of each item to sell.

When the underlying set of items are edges of a graph, and the buyers are interested in buying specific paths, this is called the tollbooth problem. We consider the special case where the graph is a tree, or a path. In the case of a tree, the problem is already known to be APX-hard. We give an O(log n) approximation algorithm. When the graph is a path, the problem is called the highway problem. In this case, we show that the problem is strongly NP-hard, complementing an earlier QPTAS. We also consider the discount model where some items are allowed to have negative prices, and show that a very simple case is already APX-hard.

This is joint work with K. Elbassioni, S. Ray and R. Sitters.

Pricing Lotteries

Randomized mechanisms, which map a set of bids to a probability distribution over outcomes rather than a single outcome, are an important but ill-understood area of computational mechanism design. We investigate the role of randomized outcomes ("lotteries") in the context of a fundamental and archetypical multi-parameter mechanism design problem: selling heterogeneous items to unit-demand bidders. To what extent can a seller improve her revenue by pricing lotteries rather than items, and does this modification of the problem affect its computational tractability? We show that the answers to these questions hinge on the exact model of consumer behavior we deploy and present several tight bounds on the increase in revenue obtainable via randomization and the computational complexity of revenue maximization in these different models. This is joint work with Shuchi Chawla, Bobby Kleinberg, and Matt Weinberg.

Some Multiobjective Optimization Problems

Multiobjective Optimization has many applications in such fields as the internet, finance, biomedicine, management science, game theory and engineering. However, solving MO problems is not an easy task. Searching for all Pareto optimal solutions is expensive and time consuming process because there are usually exponentially large (or infinite) Pareto optimal solutions. Even for the simplest problem determining whether a point belongs to the Pareto curve is NP-hard.

In this talk we are going to discuss some continuous and combinatorial multiobjective optimization problems and their applications in management, finance and military. Exact and heuristic techniques for solving these problems are presented.

We also consider nondifferentiable multiobjective programming problems involving generalized convex functions and present optimality conditions and duality results for the problems.

The Extremal Function for Partial Bipartite Tilings

For a fixed graph *H*, let ex(*n*,*H*) be the maximum number of edges of an *n*-vertex graph not containing a copy of *H*. The asymptotic estimation of ex(*n*,*H*) is a central problem to extremal graph theory, and for the case when *H* is non-bipartite the answer is given by the Erdős-Stone theorem. However despite considerable effort, the problem is still open when *H* is bipartite.

A related topic is the study of ex(*n*, *l × H*), the maximum number of edges of an *n*-vertex graph not containing *l*-vertex disjoint copies of a graph *H*. Insofar, this function has been investigated only for some special values of *H*. In this talk I shall first discuss known results about ex(*n*, *l × H*). Then for a given α ∈ (0,1) I shall determine the asymptotic behaviour of ex(*n*, *αn × H*), in the particular case when *H* is a bipartite graph. The proof is an application of the regularity lemma.

This is joint work with Jan Hladký.

The Power of Choice in a Generalized Pólya Urn Model

We introduce a "Pólya choice" urn model combining elements of the well known "power of two choices" model and the "rich get richer" model. From a set of *k* urns, randomly choose *c* distinct urns with probability proportional to the product of a power γ > 0 of their occupancies, and increment one with the smallest occupancy. The model has an interesting phase transition. If γ ≤ 1, the urn occupancies are asymptotically equal with probability 1. For γ > 1, this still occurs with positive probability, but there is also positive probability that some urns get only finitely many balls while others get infinitely many.

Random Graphs with Few Disjoint Cycles

Fix a positive integer *k*, and consider the class of all graphs which do not have *k+1* vertex-disjoint cycles. A classical result of Erdős and Pósa says that each such graph *G* contains a blocker of size at most *f(k)*. Here a *blocker* is a set *B* of vertices such that *G-B* has no cycles. We give a minor extension of this result, and deduce that almost all such labelled graphs on vertex set *1,...,n* have a blocker of size *k*. This yields an asymptotic counting formula for such graphs; and allows us to deduce further properties of a graph *R**n* taken uniformly at random from the class: we see for example that the probability that *R**n* is connected tends to a specified limit as *n* → ∞. There are corresponding results when we consider unlabelled graphs with few disjoint cycles. We consider also variants of the problem involving for example disjoint long cycles. This is joint work with Valentas Kurauskas and Mihyun Kang.

Oblivious Routing in the L_p-norm

Gupta et al. introduced a very general multi-commodity flow problem in which the cost of a given flow solution on a graph G=(V,E) is calculated by first computing the link loads via a load-function l, that describes the load of a link as a function of the flow traversing the link, and then aggregating the individual link loads into a single number via an aggregation function.

We show the existence of an oblivious routing scheme with competitive ratio O(log n) and a lower bound of Ω(log n/loglog n) for this model when the aggregation function agg is an Lp-norm.

Our results can also be viewed as a generalization of the work on approximating metrics by a distribution over dominating tree metrics and the work on minimum congestion oblivious. We provide a convex combination of trees such that routing according to the tree distribution approximately minimizes the Lp-norm of the link loads. The embedding techniques of Bartal and Fakcharoenphol et al. can be viewed as solving this problem in the L1-norm while the result on congestion minmizing oblivious routing solves it for L∞. We give a single proof that shows the existence of a good tree-based oblivious routing for any Lp-norm.

Correlation Decay and Applications to Counting Colourings

We present two algorithms for counting the number of colourings of sparse random graph. Our approach is based on correlation decay techniques originating in statistical physics.

The first algorithm is based on establishing correlation decay properties of Gibbs distribution which are related to Dobrushin's condition for uniqueness of Gibbs measure on infinite trees. More specifically, we impose boundary conditions to a specific set of vertices of the graph and we show that the effect of this boundary decays as we move away.

For the second algorithm we set a new context for exploiting correlation decay properties. Instead of imposing boundary conditions -fixing the colouring of vertices-, we impose a specific graph structure to some region (i.e. delete edges) and show that the effect of this change on the Gibbs distribution decays as we move away. It turns out that this approach designates a new set of spatial correlation decay conditions that can be used for counting algorithms.

In both cases the algorithms with high probability provide in polynomial time a (1/poly(n))-approximation of the logarithm of the number of k-colourings of the graph ("free energy") with k constant. The value of k depends on the expected degree of the graph. The second technique gives better results than the first one in terms of minimum number of colours needed.

Finally, the second algorithm can be applied to another class of graphs which we call locally a-dense graphs of bounded maximum degree Δ. A graph G = (V, E) in this family has following property: For all {u,v} in E the number of vertices which are adjacent to v but not adjacent to u are at most (1-a)Δ, where 0<a<1 is a parameter of the model. For a locally a-dense graph G with bounded Δ the algorithm computes in polynomial time a (1/polylogn)-approximation to the logarithm of the number of k-colourings, for k> (2-a)Δ. By restricting the treewidth of the neighbourhoods in G we can improve the approximation.

Antichains and the Structure of Permutation Classes

The analogue of hereditary properties of graphs for permutations are known as "permutation classes", defined as downsets in the "permutation containment" partial ordering. They are most commonly described as the collection "avoiding" some set of permutations, cf forbidden induced subgraphs for hereditary graph properties. Their origin lies with Knuth in the analysis of sorting machines, but in recent years have received a lot of attention in their own right. While much of the emphasis has been on exact and asymptotic enumeration of particular families of classes, an ongoing study of the general structure of permutations is yielding remarkable results which typically also have significant enumerative consequences.

In this talk I will describe a number of these structural results, with a particular emphasis on the question of partial well-order -- i.e. the existence or otherwise of infinite antichains in any given permutation class. The building blocks of all permutations are "simple permutations", and we will see how these on their own contribute to the partial well-order problem. We will see how "grid classes", a seemingly independent concept used to express large complicated classes in terms of smaller easily-described ones, also have significant consequences in determining the existence of infinite antichains. Finally, I will present recent and ongoing work in combining these two concepts, both to describe a general method of constructing antichains and to prove when certain classes are partially well-ordered.

Wiretapping a Hidden Network

We consider the problem of maximizing the probability of hitting a strategically chosen hidden *virtual network* by placing a wiretap on a single link of a communication network. This can be seen as a two-player win-lose (zero-sum) game that we call the *wiretap game*. The *value* of this game is the greatest probability that the wiretapper can secure for hitting the virtual network. The value is shown to be equal the reciprocal of the *strength* of the underlying graph. We provide a polynomial time algorithm that finds linear-sized description of the maxmin-polytope, and a characterization of its extreme points. It also provides a succint representation of all equilibrium strategies of the wiretapper that minimize the number of pure best responses of the hider. Among these strategies, we efficiently compute the *unique* strategy that maximizes the least punishment that the hider incurs for playing a pure strategy that is not a best response.

Finally, we show that this unique strategy is the nucleolus of the recently studied simple cooperative *spanning connectivity game*.

Joint work with: Haris Aziz, Mike Paterson and Rahul Savani.

Synchronization

A reset word for a finite deterministic automaton is a word which takes the machine to a fixed state from any starting state. Investigations into an old conjecture on the length of a reset word (if one exists) has led to new properties of permutation groups lying between primitivity and 2-transitivity, and a surprising fact about the representation of transformation monoids as endomorphism monoids of graphs. In the talk I will discuss some of these things and their connections.

On Graphs that Satisfy Local Pooling

Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known as Greedy Maximal Scheduling - GMS) are guaranteed to achieve only a fraction of the maximum possible throughput (e.g., 50% throughput in switches). However, it was recently shown that in networks in which the local pooling conditions are satised, GMS achieves 100% throughput. A graph *G* = (*V*,*E*) is said to satisfy the local pooling conditions if for every induced subgraph *H* of *G* there exists a function g : *V*(*H*) → [0, 1] such that Σ*v*∈*S* g(*v*)=1 for every maximal stable set *S* in *H*.

We first analyze line graphs and give a characterization of line graphs that satisfy local pooling. Line graphs are of interest since they correspond to the interference graphs of wireless networks under primary interference constraints. Finally we consider claw-free graphs and give a characterization of claw-free graphs that satisfy local pooling. This is joint work with Berk Birand, Maria Chudnovsky, Paul Seymour, Gil Zussman and Yori Zwols.

The Power of Online Reordering

Online algorithms studied in theory are characterized by the fact that they get to know the input sequence incrementally, one job at a time, and a new job is not issued until the previous one is processed by the algorithm. In real applications, jobs can usually be delayed for a short amount of time. As a consequence, the input sequence of jobs can be reordered in a limited fashion to optimize the performance. In this talk, the power and limits of this online reodering paradigm is discussed for several problems.

Triangles in Random Graphs

Let *X* be the number of triangles in a random graph *G(n,1/2)*. Loebl, Matousek and Pangrac showed that *X* is close to uniformly distributed modulo *q* when *q=O(log n)* is prime. We extend this result considerably, and discuss further implications of our methods for the distribution of *X*. This is joint work with Atsushi Tateno (Oxford).

Positive Projections

If *A* is a set of *n* positive integers, how small can the set {a/(a,b) : a,b ∈ A} be? Here as usual (*a*,*b*) denotes the HCF of *a* and *b*. This elegant question was raised by Granville and Roesler, who also reformulated it in the following way: given a set *A* of *n* points in Z^{d}, how small can (*A*-*A*)^{+}, the projection of the difference set of *A* onto the positive orthant, be?

Freiman and Lev gave an example to show that (in any dimension) the size can be as small as *n*^{2/3} (up to a constant factor). Granville and Roesler proved that in two dimensions this bound is correct, i.e. that the size is always at least *n*^{2/3}, and asked if this held in any dimension. Holzman, Lev and Pinchasi showed that in three dimensions the size is at least *n*^{3/5}, and that in four dimensions the size is at least *n*^{6/11} (up to a logarithmic factor), and they also asked if the correct exponent is always 2/3.

After some background material, the talk will focus on recent developments, including a negative answer to the *n*^{2/3} question.

Joint work with Béla Bollobás.

Cycles, Paths, Connectivity and Diameter in Distance Graphs

Circulant graphs form an important and very well-studied class of graph. They are Cayley graphs of cyclic groups and have been proposed for numerous applications such as local area computer networks, large area communication networks, parallel processing architectures, distributed computing, and VLSI design. Their connectivity and diameter, cycle and path structure, and further graph-theoretical properties have been studied in great detail. Polynomial time algorithms for isomorphism testing and recognition of circulant graphs have been long-standing open problems which were completely solved only recently.

Our goal here is to extend some of the fundamental results concerning circulant graphs to the similarly defined yet more general class of distance graphs. We prove that the class of circulant graphs coincides with the class of regular distance graphs. We study the existence of long cycles and paths in distance graphs and analyse the computational complexity of problems related to their connectivity and diameter.

Joint work with L. Draque Penso und J.L. Szwarcfiter.

Discrepancy and eigenvalues

A graph has low discrepancy if its global edge distribution is "close" to that of a random graph with the same overall density. It has been known that low discrepancy is related to the spectra of various matrix representations of the graph such as the adjacency matrix or the normalized Laplacian. More precisely, a large spectral gap implies low discrepancy. The topic of this talk is the converse implication: does low discrepancy imply a large spectral gap? The proofs are based on the Grothendieck inequality and the duality theorem for semidefinite programs.

Social Context Games

We introduce the study of social context games. A social context game is defined by an underlying game in strategic form, and a social context consisting of an undirected graph of neighborhood among players and aggregation functions. The players and strategies in a social context game are as in the underlying game, while the players' utilities in a social context game are computed from their payoffs in the underlying game based on the graph of neighborhood and the aggregation functions. Examples of social context games are ranking games and coalitional con- gestion games. A signifcant challenge is the study of how various social contexts affect various properties of the game. In this work we consider resource selection games as the underlying games, and four basic social contexts. An important property of resource selection games is the existence of pure strategy equilibrium. We study the existence of pure strategy Nash equilibrium in the corresponding social context games. We also show that the social context games possessing pure strategy Nash equilibria are not potential games, and therefore are distinguished from congestion games.

Joint work with Itai Ashlagi and Moshe Tennenholtz.

30 Years with Consensus: from Feasibility to Scalability

The problem of reaching consensus in a distributed environment is one of the fundamental topics in the area of distributed computing, systems and architectures. It was formally abstracted in late 70's by Lamport, Pease and Shostak. The early work on this problem focused on feasibility, i.e., what are the conditions under which the consensus can be solved. Later, the complexity of solutions has become of great importance. In this talk I'll introduce the problem, present selected classic algorithms and lower bounds, and conclude with my recent work on time and communication complexity of consensus in a message-passing system.

Disconnecting a Graph by a Disconnected Cut

For a connected graph *G* = (*V*, *E*), a subset *U* of vertices is called a *k*-cut if *U* disconnects *G*, and the subgraph induced by *U* contains exactly *k*≥1 components. More specifically, a *k*-cut *U* is called a (*k*, *l*)-cut if *V* \ *U* induces a subgraph with exactly *l*≥2 components. We study two decision problems, called *k*-CUT and (*k*, *l*)-CUT, which determine whether a graph *G* has a *k*-cut or (*k*, *l*)-cut, respectively. By pinpointing a close relationship to graph contractibility problems we first show that (*k*, *l*)-CUT is in P for *k*=1 and any fixed constant *l*≥2, while the problem is NP-complete for any fixed pair *k*, *l*≥2. We then prove that *k*-CUT is in P for *k*=1, and NP-complete for any fixed *k*≥2. On the other hand, we present an FPT algorithm that solves (*k*, *l*)-CUT on planar graphs when parameterized by *k* + *l*. By modifying this algorithm we can also show that *k*-CUT is in FPT (with parameter *k*) and DISCONNECTED CUT is solvable in polynomial time for planar graphs. The latter problem asks if a graph has a *k*-cut for some *k*≥2.

Joint work with Takehiro Ito and Marcin Kamiński.

Algorithms for Counting/Sampling Cell-Bounded Contingency Tables

This is a survey talk about counting/sampling contingency tables and cell-bounded contingency tables. In the cell-bounded contingency tables problem, we are given a list of positive integer row sums r=(r1,...,rm), a list of positive integer column sums c=(c1,...,cn), and a non-negative integer bound bij, for every 1 ≤ i ≤ m, 1 ≤ j ≤ n.

The problem is to count/sample the set of all m-by-n tables X ∈ Z^{mn} of non-negative integers which satisfy the given row and column sums, and for which 0 ≤ Xij ≤ bij for all i, j. I will outline a complicated (reduction to volume estimation) algorithm for approximately counting these tables in polynomial time, when the number of row is constant. I also hope to outline a more recent, 'cute' dynamic programming algorithm for exactly the same case of constantly-many rows. The case for general m is still open.

Joint with Martin Dyer and Dana Randall

4-Colour Ramsey Number of Paths

The Ramsey number R(*l* x *H*) is the smallest integer *m* such that any *l*-colouring of the edges of *K*m induces a monochromatic copy of *H*. We prove that R(4 x *P*n)=2.5*n*+o(*n*). Luczak proposed a way how to attack the problem of finding a long monochromatic path in a coloured graph *G*: one should search for a large monochromatic connected matching in the reduced graph of *G*. Here we propose a modification of Luczak's technique: we find a large monochromatic connected fractional matching. This relaxation allows us to use LP duality and reduces the question to a vertex-cover problem.

This is a joint work with Jan Hladký and Daniel Král'.

Sparse Random Graphs are Fault Tolerant for Large Bipartite Graphs

Random graphs *G* on *n* vertices and with edge probability at least c(log n/n)^(1/Δ) are robust in the following sense: Let *H* be an arbitrary planar bipartite graph on (1-ε)n vertices with maximum degree Δ. Now you, the adversary, may arbitrarily delete edges in *G* such that no vertex looses more than a third of its neighbours. However, you will not be able to destroy all copies of *H*.

This result is obtained (joint work with Yoshiharu Kohayakawa and Anusch Taraz) via a sparse version of the regularity lemma. In the talk I will provide some background concerning related results, introduce sparse regularity, and outline how this can be used to prove theorems such as the one above.

Counting Flags in Triangle Free Digraphs

An important instance of the Caccetta-Häggkvist conjecture asserts that an n-vertex digraph with minimum outdegree at least n/3 contains a directed triangle. Improving on a previous bound of 0.3532n due to Hamburger, Haxell, and Kostochka we prove that a digraph with minimum outdegree at least 0.3465n contains a directed triangle. The proof is an application of a recent combinatorial calculus developed by Razborov. This calculus enables one to formalize common techniques in the area (such as induction or the Cauchy-Schwartz inequality). In the talk I shall describe Razborov's method in general, and its application to the setting of the Cacceta-Häggvist Conjecture.

This is joint work with Dan Král' and Sergey Norin.

Regularity Lemmas for Graphs

Szemerédi's regularity lemma is a powerful tool in extremal graph theory, which had have many applications. In this talk we present several variants of Szemerédi's original lemma (due to several researchers including Frieze and Kannan, Alon et al., and Lovász and Szegedy) and discuss their relation to each other.

Time and Space Efficient Anonymous Graph Traversal

We consider the problem of periodic graph traversal in which a mobile entity with constant memory has to visit all n nodes of an arbitrary undirected graph G in a periodic manner. Graphs are supposed to be anonymous, that is, nodes are unlabeled. However, while visiting a node, the robot has to distinguish between edges incident to it. For each node v the endpoints of the edges incident to v are uniquely identified by different integer labels called port numbers. We are interested in minimization of the length of the exploration period.

This problem is unsolvable if the local port numbers are set arbitrarily (shown by Budach in 1978). However, surprisingly small periods can be achieved when carefully assigning the local port numbers. Dobrev, Jansson, Sadakane, and Sung described an algorithm for assigning port numbers, and an oblivious agent (i.e. an agent with no memory) using it, such that the agent explores all graphs with n vertices within period 10n. Providing the agent with a constant number of memory bits, the optimal length of the period was later proved to be no more than 3.75n (using a different assignment of the port numbers). Following on from this, a period of length at most (4 1/3)n was shown for oblivious agents, and a period of length at most 3.5n for agents with constant memory.

This talk describes results in two papers by the speaker, which are joint work with several other authors.

Eliminating Cycles in the Torus

I will discuss the problem of cutting the (discrete or continuous) d-dimensional torus economically, so that no nontrivial cycle remains. This improves, simplifies and/or unifies results of Bollobás, Kindler, Leader and O'Donnell, of Raz and of Kindler, O'Donnell, Rao and Wigderson. More formal, detailed abstract(s) appear in http://www.math.tau.ac.il/~nogaa/PDFS/torus3.pdf and in http://www.math.tau.ac.il/~nogaa/PDFS/torusone.pdf.

Joint work with Bo'az Klartag.

Oblivious Interference Scheduling

In the *interference scheduling problem*, one is given a set of *n* communication requests described by pairs of points from a metric space. The points correspond to devices in a wireless network. In the *directed version* of the problem, each pair of points consists of a dedicated sending and a dedicated receiving device. In the *bidirectional version* the devices within a pair shall be able to exchange signals in both directions. In both versions, each pair must be assigned a power level and a color such that the pairs in each color class can communicate simultaneously at the specified power levels. The feasibility of simultaneous communication within a color class is defined in terms of the Signal to Interference Plus Noise Ratio (SINR) that compares the strength of a signal at a receiver to the sum of the strengths of other signals. This is commonly referred to as the "physical model" and is the established way of modelling interference in the engineering community. The objective is to minimize the number of colors as this corresponds to the time needed to schedule all requests.

We study *oblivious power assignments* in which the power value of a pair only depends on the distance between the points of this pair. We prove that oblivious power assignments cannot yield approximation ratios better than Ω(n) for the directed version of the problem, which is the worst possible performance guarantee as there is a straightforward algorithm that achieves an O(n)-approximation. For the bidirectional version, however, we can show the existence of a universally good oblivious power assignment: For any set of *n* bidirectional communication requests, the so-called "*square root assignment*" admits a coloring with at most polylog(*n*) times the minimal number of colors. The proof for the existence of this coloring is non-constructive. We complement it by an approximation algorithm for the coloring problem under the square root assignment. This way, we obtain the first polynomial time algorithm with approximation ratio polylog(*n*) for interference scheduling in the physical model.

This is joint work with Alexander Fanghänel, Thomas Keßelheim and Harald Räcke

Polynomial Time Solvable Cases of the Vehicle Routing Problem

The Traveling Salesman Problem (TSP) is one of the most famous NP-hard problems. So, much works have been done to study polynomially solvable cases, that is, to find good conditions for distances between cities such that an optimal tour can be found in polynomial time. These good conditions give some restriction on the optimal solution, for example, Monge property. For a given complete weighted digraph *G*, a vertex *x* of *G*, and a positive integer *k*, the Vehicle Routing Problem (VRP) is to find a minimum weight connected subgraph *F* of *G* such that *F* is a union of *k* cycles sharing only the vertex *x*. In this talk, we apply good conditions for the TSP to the VRP. We will show that if a given weighted digraph satisfies several conditions, which is known for the TSP, then an optimal solution of the VRP can also be computed in polynomial time.

Bounding Revenue Deficiency in Multiple Winner Procurement Auctions

Consider a firm, called the buyer, that satisfies its demand over a *T*-period time horizon by assigning the demand vector to a supplier via a procurement (reverse) auction; call this the *Standard auction*. The firm is considering an alternative procedure in which it will allow bids on one or more periods; in this auction, there can be more than one winner covering the demand vector; call this the *Multiple Winner auction*. Choosing the Multiple Winner auction over the Standard auction will tend to: (1) allow each supplier the option of supplying demand for any subset of periods of the *T*-period horizon; (2) increase competition among the suppliers, and (3) allow the buyer to combine bids from different suppliers in order to lower his purchase cost. All three effects might lead one to expect that the buyer's cost will always be lower in the Multiple Winner auction than in the Standard auction. To the contrary, there are cases in which the buyer will have a higher cost in the Multiple Winner auction. We provide a bound on how much greater the buyer's cost can be and show that this bound is sharp.

Prize-Collecting Steiner Trees and Disease

The identification of functional modules in protein-protein interaction networks is an important topic in systems biology. These modules might help, for example, to better understand the underlying biological mechanisms of different tumor subtypes. In this talk, I report on results of a cooperation with statisticians and medical researchers from the University of Würzburg. In particular, I will present an exact integer linear programming solution for this problem, which is based on its connection to the well-known prize-collecting Steiner tree problem from Operations Research.

Adding Recursion to Markov Chains, Markov Decision Processes, and Stochastic Games

I will decribe a family of finitely presented, but infinite-state, stochastic models that arise by adding a natural recursion feature to Markov Chains, Markov Decision Processes, and Stochastic Games.

These models subsume a number of classic and heavily studied purely stochastic models, including (multi-type) branching processes, (quasi-)-birth-death processes, stochastic context-free grammars, and others. They also provide a natural abstract model of probabilistic procedural programs with recursion.

The theory behind the algorithmic analysis of these models, developed over the past few years, has turned out to be very rich, with connections to a number of areas of research. I will survey just a few highlights from this work. There remain many open questions about the computational complexity of basic analysis problems. I will highlight a few such open problems.

(Based on joint work with Mihalis Yannakakis, Columbia University)

The Robust Network Loading Problem under Polyhedral Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations

For a given undirected graph G, the Network Loading Problem (NLP) deals with the design of a least cost network by allocating discrete units of facilities with different capacities on the links of G so as to support expected pairwise demands between some endpoints of G. In this work, we relax the assumption of known demands and study robust NLP with polyhedral demands to obtain designs flexible enough to support changing communication patterns in the least costly manner. More precisely, we seek for a final design that remains operational for any feasible demand realization in a prescribed polyhedral set.

Firstly, we give a compact multi-commodity formulation of the problem for which we prove a nice decomposition property obtained from projecting out the flow variables. This simplifies the resulting polyhedral analysis and computations considerably by doing away with metric inequalities, an attendant feature of the most successful algorithms on the Network Loading Problem. Then, we focus on a specific choice of the uncertainty description, called the "hose model", which specifies aggregate traffic upper bounds for selected endpoints of the network. We study the polyhedral aspects of the Network Loading Problem under hose demand uncertainty and present valid inequalities for robust NLP with arbitrary number of facilities and arbitrary capacity structures as the second main contribution of the present work. Finally, we develop an efficient Branch-and-Cut algorithm supported by a simple but effective heuristic for generating upper bounds and use it to solve several well-known network design instances.

Optimal Mechanisms for Scheduling

We study the design of optimal mechanisms in a setting where job-agents compete for being processed by a service provider that can handle one job at a time. Each job has a processing time and incurs a waiting cost. Jobs need to be compensated for waiting. We consider two models, one where only the waiting costs of jobs are private information (1-d), and another where both waiting costs and processing times are private (2-d). An optimal mechanism minimizes the total expected expenses to compensate all jobs, while it has to be Bayes-Nash incentive compatible. We derive closed formulae for the optimal mechanism in the 1-d case and show that it is efficient for symmetric jobs. For non-symmetric jobs, we show that efficient mechanisms perform arbitrarily bad. For the 2-d case, we prove that the optimal mechanism in general does not even satisfy IIA, the "independent of irrelevant alternatives" condition. We also show that the optimal mechanism is not even efficient for symmetric agents in the 2-d case.

Joined work with Birgit Heydenreich, Debasis Mishra and Marc Uetz.

Distributed Optimisation in Network Control

Communication networks (such as the Internet or BT's network) are held together by a wide variety of interacting network control systems. Examples include routing protocols, which determine the paths used by different sessions, and flow control mechanisms, which determine the rate at which different sessions can send traffic. Many of these control processes can be viewed as distributed algorithms that aim to solve a network-wide optimisation problem.

I will present a mathematical framework, based on Lagrangian decomposition, for the design and analysis of such algorithms. As an illustration, I will discuss how this framework has been used in BT Innovate to develop a new resource control system which integrates multi-path routing and admission control decisions.

The notion of convexity plays an important role in convergence proofs for our algorithms. We can design a control system with stability guarantees as long as the system's target behaviour can be captured as the solution to a convex optimisation problem. Unfortunately, many standard network design problems are formulated as integer programming problems and therefore inherently non-convex. I will discuss some of the implications of this non-convexity and identify some related research challenges.

Multidimensional Problems in Additive Combinatorics

We discuss bounds on extremal sets for problems like those below:

- What is the largest subset of (ℤ/nℤ)
^{r}that does not contain an arithmetic progression of length k? - What is the largest subset/(multiset) of (ℤ/nℤ)
^{r}that does not contain n elements that sum to 0? - What is the largest subset of [1,...,n]
^{r}that does not contain a solution of x+y=z (i.e., which is a sum free set)? - Colour the elements of [1,...,n]
^{r}red and blue. How many monochromatic Schur triples are there?

Fast Distance Multiplication of Unit-Monge Matrices

A matrix is called Monge, if its density matrix is nonnegative. Monge matrices play an important role in optimisation. Distance multiplication (also known as min-plus or tropical multiplication) of two Monge matrices of size n can be performed in time O(n^{2}). Motivated by applications to string comparison, we introduced in a previous work the following subclass of Monge matrices. A matrix is called unit-Monge, if its density matrix is a permutation matrix; we further restrict our attention to a subclass that we call simple unit-Monge matrices. Our previous algorithm for distance multiplication of simple unit-Monge matrices runs in time O(n^{3/2}). Landau conjectured in 2006 that this problem can be solved in linear time. In this work, we give an algorithm running in time O(n log^{4} n), thus approaching Landau's conjecture within a polylogarithmic factor. The new algorithm implies immediate improvements in running time for a number of string comparison and graph algorithms: semi-local longest common subsequences between permutations; longest increasing subsequence in a cyclic permutation; longest pattern-avoiding subsequence in a permutation; longest piecewise monotone subsequence; maximum clique in a circle graph; subsequence recognition in a grammar-compressed string; sparse spliced alignment of genome strings.

Boundary Properties of Graphs and the Hamiltonian Cycle Problem

The notion of a boundary graph property is a relaxation of that of a minimal property. Several fundamental results in graph theory have been obtained in terms of identifying minimal properties. For instance, Robertson and Seymour showed that there is a unique minimal minor-closed property with unbounded tree-width (the planar graphs), while Balogh, Bollobás and Weinreich identified nine minimal hereditary properties with the factorial speed of growth. However, there are situations where the notion of minimal property is not applicable. A typical example of this type is given by graphs of large girth. It is known that for each particular value of k, the graphs of girth at least k have unbounded tree-, clique- or rank-width, their speed of growth is superfactorial and many algorithmic problems remain NP-hard for these graphs, while the “limit” property of this sequence (i.e., acyclic graphs) has bounded tree-, clique- and rank-width, its speed of growth is factorial, and most of algorithmic problems can be solved in polynomial time in this class. The notion of boundary properties of graphs allows to overcome this difficulty. In this talk we survey some available results on this topic and identify the first boundary class for the Hamiltonian cycle problem.

Joint work with N. Korpelainen and A. Tiskin

Minimum Degree Conditions for Large Subgraphs

Turán's theorem shows that every *n*-vertex graph with minimum degree *n/2* contains a triangle. A proof (for large *n*) of the Pósa conjecture shows that every *n*-vertex graph with minimum degree *2n/3* contains the square of a Hamilton cycle; this is a cyclic ordering of the vertices in which every three consecutive vertices forms a triangle. We fill in the gap between these theorems, giving the correct relationship (for large *n*) between the minimum degree of an *n*-vertex graph and the lengths of squared cycles which are forced to exist in the graph. We also discuss generalisations of all three theorems to other graphs with chromatic number three, and offer some conjectures on higher chromatic numbers. This is joint work with Julia Böttcher and Jan Hladký.

Degree Sequence Conditions for Graph Properties

We discuss recent work on graphical degree sequences, i.e., sequences of integers that correspond to the degrees of the vertices of a graph. Historically, such degree sequences have been used to provide sufficient conditions for graphs to have a certain property, such as being k-connected or hamiltonian. For hamiltonicity, this research has culminated in a beautiful theorem due to Chvátal (1972). This theorem gives a sufficient condition for a graphical degree sequence to be forcibly hamiltonian, i.e., such that every graph with this degree sequence is hamiltonian. Moreover, the theorem is the strongest of an entire class of theorems in the following sense: if the theorem does not guarantee that a sequence π is forcibly hamiltonian, then there exists a nonhamiltonian graph with a degree sequence that majorizes π. Very recently, Kriesell solved an open problem due to Bauer et al. by establishing similar conditions for k-edge connectivity for any fixed k. We will introduce a general framework for such conditions and discuss recent progress and open problems on similar sufficient conditions for a variety of graph properties. This is based on joint work with Bauer, van den Heuvel, Kahl, and Schmeichel.

Min-Max Functions

Min-Max function appear in various contexts in mathematics, computer science, and engineering. For instance, in the analysis of zero-sum two-player games on graphs, Min-Max functions arise as dynamic programming operators. They also play a role in the performance analysis of certain discrete event systems, which are used to model computer networks and manufacturing systems. In each of these fields it is important to understand the long-term iterative behaviour of Min-Max functions. In this talk I will explain how this problem is related to certain combinatorial geometric problems and discuss some results and a conjecture.

Even-hole-free Graphs and the Decomposition Method

We consider finite and simple graphs. We say that a graph G *contains* a graph F, if F is isomorphic to an induced subgraph of G. A graph G is *F-free* if it does not contain F. Let ℱ be a (possibly infinite) family of graphs. A graph G is *ℱ-free* if it is F-free, for every F ∈ ℱ.

Many interesting classes of graphs can be characterized as being *ℱ-free* for some family ℱ. The most famous such example is the class of perfect graphs. A graph G is *perfect* if for every induced subgraph H of G, χ(H) = ω(H), where χ(H) denotes the chromatic number of H and ω(H) denotes the size of a largest clique in H. The famous Strong Perfect Graph Theorem states that a graph is perfect if and only if it does not contain an odd hole nor an odd antihole (where a *hole* is a chordless cycle of length at least four).

In the last 15 years a number of other classes of graphs defined by excluding a family of induced subgraphs have been studied, perhaps originally motivated by the study of perfect graphs. The kinds of questions this line of research was focused on were whether excluding induced subgraphs affects the global structure of the particular class in a way that can be exploited for putting bounds on parameters such as χ and ω, constructing optimization algorithms (problems such as finding the size of a largest clique or a minimum coloring), recognition algorithms and explicit construction of all graphs belonging to the particular class. A number of these questions were answered by obtaining a structural characterization of a class through their decomposition (as was the case with the proof of the Strong Perfect Graph Theorem).

In this talk we survey some of the most recent uses of the decomposition theory in the study of classes of even-hole-free graphs. Even-hole-free graphs are related to β-perfect graphs in a similar way in which odd-hole-free graphs are related to perfect graphs. β-Perfect graphs are a particular class of graphs that can be polynomially colored, by coloring greedily on a particular, easily constructable, ordering of vertices.

Approximability of Combinatorial Exchange Problems

In a combinatorial exchange the goal is to find a feasible trade between potential buyers and sellers requesting and offering bundles of indivisible goods. We investigate the approximability of several optimization objectves in this setting and show that the problems of surplus and trade volume maximization are inapproximable even with free disposal and even if each agent's bundle is of size at most 3. In light of the negative results for surplus maximization we consider the complementary goal of social cost minimization and present tight approximation results for this scenario. Considering the more general supply chain problem, in which each agent can be a seller and buyer simultaneously, we prove that social cost minimization remains inapproximable even with bundles of size 3, yet becomes polynomial time solvable for agents trading bundles of size 1 or 2. This yields a complete characterization of the approximability of supply chain and combinatorial exchange problems based on the size of traded bundles. We finally briefly address the problem of exchanges in strategic settings.

This is joint work with Moshe Babaioff and Patrick Briest.

Sensor Networks and Random Intersection Graphs

A *uniform random intersection graph* *G(n,m,k)* is a random graph constructed as follows. Label each of *n* nodes by a randomly chosen set of *k* distinct colours taken from some finite set of possible colours of size *m*. Nodes are joined by an edge if and only if some colour appears in both their labels. These graphs arise in the study of the security of wireless sensor networks. Such graphs arise in particular when modelling the network graph of the well known key predistribution technique due to Eschenauer and Gligor. In this talk we consider the threshold for connectivity and the appearance of a giant component of the graph *G(n,m,k)* when *n → ∞* with *k* a function of *n* such that *k≥2* and *m=⌊n ^{α}⌋* for some fixed positive real number

*α*.

Throughput Optimization in Two-Machine Flowshops with Flexible Operations

We discuss the following scheduling problem. A two-machine flowshop produces identical parts. Each of the parts is assumed to require a number of manufacturing operations, and the machines are assumed to be flexible enough to perform different operations. Due to economical or technological constraints, some specific operations are preassigned to one of the machines. The remaining operations, called flexible operations, can be performed on either one of the machines, so that the same flexible operation can be performed on different machines for different parts. The problem is to determine the assignment of the flexible operations to the machines for each part, with the objective of maximizing the throughput rate. We consider various cases depending on the number of parts to be produced and the capacity of the buffer between the machines. Along the way, we underline the fact that this problem belongs to the class of "high multiplicity scheduling problem": for this class of problems, the input data can be described in a very compact way due to the fact that the jobs fall into a small number of distinct job types, where all the jobs of a same type possess the same attribute values. High multiplicity scheduling problems have been recently investigated by several researchers who have observed that the complexity of such problems must be analyzed with special care.

Joint work with Hakan Gültekin.

Tricky Problems for Graphs of Bounded Treewidth

In this talk I will consider computational problems that (A) can be solved in polynomial time for graphs of bounded treewidth and (B) where the order of the polynomial time bound is expected to depend on the treewidth of the instance. Among the considered problems are coloring problems, factor problems, orientation problems and satisfiability problems. I will present an algorithmic meta-theorem (an extension of Courcelle's Theorem) that provides a convenient way for establishing (A) for some of the considered problems and I will explain how concepts from parameterized complexity theory can be used to establish (B).

The External Network Problem and the Source Location Problem

The connectivity of a communications network can sometimes be enhanced if the nodes are able, at some expense, to form links using an external network. Using graphs, the following is a possible way to model such situations.

Let G = (V,E) be a graph. A subset X of vertices in V may be chosen, the so-called external vertices. An internal path is a normal path in G; an external path is a pair of internal paths P1 = v1 · · · vs, P2 = w1 · · · wt in G such that vs and w1 are from the chosen set X of external vertices. (The idea is that v1 can communicate with wt along this path using an external link from vs to w1.) For digraphs we use similar vocabulary, but then using directed paths.

Next suppose a certain desired connectivity for the network is prescribed in terms of edge, vertex or arc-connectivity. Say that for a given k there need to be at least k edge- (or vertex- or arc-) disjoint paths (which can be internal or external) between any pair of vertices. What is the smallest set X of external vertices such that this can be achieved?

A related problem is the Source Location Problem : In this we need to find, given a graph or digraph and a required connectivity requirement, a subset S of the vertices such that from each vertex in the graph there are at least the required number of edge- (or vertex- or arc-) disjoint paths between any vertex and the set S. And again, the goal is to minimise the number of vertices in S.

It seems clear that the External Network Problem and the Source Location Problem are closely related. In this talk we discuss these relations, and also show some instances where the problems behave quite differently. Some recent results on the complexity of the different types of problems will be presented as well.

Joint work with Matthew Johnson (University of Durham)

Extremal Graph Theory with Colours

We consider graphs whose edges are painted with two colours (some edges might get both colours), and ask, given a fixed such graph H, how large another such graph G can be if it has many vertices but doesn't contain a copy of H. The notion of largeness here is the total weight of G if red edges are given weight p and blue edges weight q, with p+q=1.

This question arises in the applications of Szemerédi's Regularity Lemma, in particular to Ramsey-type games, and to the study of edit distance and property testing.

We shall describe an approach to answering this question and to settling some outstanding issues concerning edit distance.

Machine-Job Assignment Problems with Separable Convex Costs and Match-up Scheduling with Controllable Processing Times

In this talk, we discuss scheduling and rescheduling problems with controllable job processing times. We start with the optimal allocation of a set of jobs on a set of parallel machines with given machining time capacities. Each job may have different processing times and different convex compression costs on different machines. We consider finding the optimal machine-job allocation and compression level decisions for the total cost. We propose a strengthened conic quadratic formulation for this problem. We provide theoretical and computational results that prove the quality of the proposed reformulation. We next shortly discuss match-up scheduling approach in the same scheduling environment with an initial schedule subject to a machine breakdown. We show how processing time controllability provides flexibility in rescheduling decisions.

Discounted Deterministic Markov Decision Processes

We present an O(mn)-time algorithm for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP), where n is the number of vertices (or states) and m is the number of edges (or actions). This improves a recent O(mn^2)-time algorithm of Andersson and Vorobyov.

Joint work with Omid Madani and Mikkel Thorup.

On a Disparity Between Relative Cliquewidth and Relative NLC-width

Cliquewidth and NLC-width are two closely related parameters that measure the complexity of graphs. Both clique- and NLC-width are defined to be the minimum number of labels required to create a labelled graph by certain terms of operations. Many hard problems on graphs become solvable in polynomial time if the inputs are restricted to graphs of bounded clique- or NLC-width. Cliquewidth and NLC-width differ by a factor of at most two.

The relative counterparts of these parameters are defined to be the minimum number of labels necessary to create a graph while the tree-structure of the term is fixed. We show that the problems Relative Cliquewidth and Relative NLC-width differ significantly in computational complexity: the former is NP-complete, the latter is solvable in polynomial time. Additionally, our technique enables combinatorial characterisations of clique- and NLC-width that avoid the usual operations on labelled graphs.

Colouring Random Geometric Graphs

The random geometric graph G(n,r) is constructed by picking *n* vertices X1, · · · , Xn ∈ [0,1] ^{d} i.i.d. uniformly at random and adding an edge (Xi, Xj) if ‖X1-X2‖ < r. I will discuss the behaviour of the chromatic number of G(n,r) and some related random variables when n tends to infinity and r=r(n) is allowed to vary with n.

A Clique-Based Integer Programming Formulation of Graph Colouring and Applications

In this talk, we first give an overview of several exact approaches to graph colouring: known integer linear programming formulations, approaches based on SDP relaxations, as well as selected approaches not using any mathematical programming. Second, we introduce an integer programming formulation of graph colouring based on reversible clique partition or, seen another way, optimal polynomial-time transformation of graph colouring to multicolouring. The talk will be concluded by discussion of some specifics of applications of graph colouring in timetabling applications and utility of the proposed formulation in this context.

Fast-Converging Tatonnement Algorithms for One-Time and Ongoing Market Problems

Why might markets tend toward and remain near equilibrium prices? In an effort to shed light on this question from an algorithmic perspective, we formalize the setting of Ongoing Markets, by contrast with the classic market scenario, which we term One-Time Markets. The Ongoing Market allows trade at non-equilibrium prices, and, as its name suggests, continues over time. As such, it appears to be a more plausible model of actual markets.

For both market settings, we define and analyze variants of a simple tatonnement algorithm that differs from previous algorithms that have been subject to asymptotic analysis in three significant respects: the price update for a good depends only on the price, demand, and supply for that good, and on no other information; the price update for each good occurs distributively and asynchronously; the algorithms work (and the analyses hold) from an arbitrary starting point. We show that this update rule leads to fast convergence toward equilibrium prices in a broad class of markets that satisfy the weak gross substitutes property.

Our analysis identifies three parameters characterizing the markets, which govern the rate of convergence of our protocols. These parameters are, broadly speaking:

- A bound on the fractional rate of change of demand for each good with respect to fractional changes in its price.
- A bound on the fractional rate of change of demand for each good with respect to fractional changes in wealth.
- The closeness of the market to a Fisher market (a market with buyers starting with money alone).

Joint work with Lisa Fleischer.

The Multi-Armed Bandit Meets the Web Surfer

The multi-armed bandit paradigm has been studied extensively for over 50 years in Operations Research, Economics and Computer Science literature, modeling online decisions under uncertainty in a setting in which an agent simultaneously attempts to acquire new knowledge and to optimize its decisions based on the existing knowledge. In this talk I'll discuss several new results motivated by web applications, such as content matching (matching advertising to page contest and user's profile) and efficient web crawling.

Optimizing Communication Networks: Incentives, Welfare Maximization an1245210 Multipath Transfers

We discuss control strategies for communication networks such as the Internet or wireless multihop networks, where the aim is to optimize network performance. We describe how welfare maximization can be used as a paradigm for network resource allocation, and can also be used to derive rate-control algorithms. We apply this to the case of multipath data transfers. We show that welfare maximization requires active balancing across paths by data sources, which can be done provided the underlying "network layer" is able to expose the marginal congestion cost of network paths to the "transport layer". When users are allowed to change the set of paths they use, we show that for large systems the path-set choices correspond to Nash equilibria, and give conditions under which the resultant Nash equilibria correspond to welfare maximising states. Moreover, simple path selection policies that shift to paths with higher net benefit can find these states.

We conclude by commenting on incentives, pricing and open problems.

Unsplittable Shortest Path Routing: Hardness and Approximation Algorithms

Most data networks nowadays employ shortest path routing protocols to control the flow of data packets. With these protocols, all end-to-end traffic streams are routed along shortest paths with respect to some administrative routing weights. Dimensioning and routing planning are extremely difficult for such networks, because end-to-end routing paths cannot be configured individually but only jointly and indirectly via the routing weights. Additional difficulties arise if the communication demands must be sent unsplit through the network - a requirement that is often imposed to ensure tractability of end-to-end traffic flows and to prevent package reordering in practice. In this case, the lengths must be chosen such that the shortest paths are uniquely determined for all communication demands.

In this talk we consider the minimum congestion unsplittable shortest path routing problem MinConUSPR: Given a capacitated digraph D = (V, A) and traffic demands d(s,t), (s, t) ∈ K ⊆ V^{2}, the task is to find routing weights λa ∈ ℤ+, a ∈ A, such that the shortest (s, t)-path is unique for each (s, t) ∈ K and the maximum arc congestion (induced flow/capacity ratio) is minimal.

We discuss the approximability of this problem and the relation between the unsplittable shortest path routing paradigm and other routing schemes. We show that MinConUSPR is NP-hard to approximate within a factor of O(|V|^{1-ε}), but approximable within min(|A|, |K|) in general. For the special cases where the underlying graph is an undirected cycle or a bidirected ring, we present constant factor approximation algorithms. We also construct problem instances where the minimum congestion that can be obtained by unsplittable shortest path routing is a factor of Ω(|V|^{2}) larger than that achievable by unsplittable flow routing or shortest multi-path routing, and a factor of Ω(|V|) larger than that achievable by unsplittable source-invariant routing.

Diophantine Problems Arising in the Theory of Monlinear Waves

I will consider waves in finite domains, for example water waves in a swimming pool. For such waves to exchange energy among different modes, these modes must be in resonance in both frequency and wavenumber, which leads to a set of nontrivial conditions/equations in integers. I will discuss some known results and open questions about the solutions of these Diophantine equations.

Controlling Epidemic Spread on Networks

The observation that many natural and engineered networks exhibit scale-free degree distributions, and that such networks are particularly prone to epidemic outbreaks, raises questions about how best to control epidemic spread on such networks.

We will begin with some background on threshold phenomena for epidemics, describing how the minimum infection rate needed to sustain long-lived epidemics is related to the cure rate and the topology of the graph. In particular, we will see that, on scale-free networks, this minimum infection rate tends to zero as the network grows large. We will describe two ways of tackling this problem. One involves allocating curing or monitoring resources non-uniformly, favouring high-degree nodes. Another mechanism, called contact tracing, involves identifying and curing neighbours (or contacts) of infected nodes, and is used in practice. We will present some mathematical results for both these mechanisms.

Joint work with Borgs, Chayes, Saberi and Wilson.

Strategic Characterization of the Index of an Equilibrium

The index of a Nash equilibrium is an integer that is related to notions of ``stability'' of the equilibrium, for example under dynamics that have equilibria as rest points. The index is a relatively complicated topological notion, essentially a geometric orientation of the equilibrium. We prove the following theorem, first conjectured by Hofbauer (2003), which characterizes the index in much simpler strategic terms:

**Theorem.** A generic bimatrix game has index +1 if and only if it can be made the unique equilibrium of an extended game with additional strategies of one player. In an mxn game, it suffices to add 3m strategies of the column player.

The main tool to prove this theorem is a novel geometric-combinatorial method that we call the "dual construction," which we think is of interest of its own. It allows to visualize all equilibria of an mxn game in a diagram of dimension m-1. For example, all equilibria of a 3xn game are visualized with a diagram (essentially, of suitably connected n+3 points) in the plane. This should provide new insights into the geometry of Nash equilibria.

Joint work with Arndt von Schemde.

On Recent Progress on Computing Approximate Nash Equilibria

In view of the apparent computational difficulty of computing a Nash equilibrium of a game, recent work has addressed the computation of "approximate Nash equilibrium". The standard criterion of "no incentive for any player to change his strategy" is here replaced by "small incentive for any player to change his strategy". The question is, how small an incentive can we aim for, before once again we have a computationally difficult problem? In this talk, I explain in detail what is meant by Nash equilibrium and approximate Nash equilibrium, and give an overview of some recent results.

Online Minimum Makespan Scheduling with Reordering

In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machines. The objective is to minimize the makespan, which is the time it takes until all jobs are processed. We consider online scheduling algorithms without preemption. Much effort has been made to narrow the gap between upper and lower bounds on the competitive ratio of this problem.

A quite good and easy approximation can be achieved by sorting the jobs according to their size and than assigning them greedily to machines. However, the complete sorting of the input sequence contradicts the notion of an online algorithm. Therefore, we propose a new method to somewhat reorder the input in an online manner. Although our proofs are technically surprisingly simple, we give, for any number of identical machines, tight and significantly improved bounds on the competitive ratio for this new method.

This talk is based on joint work with Deniz Özmen and Matthias Westermann

Balloon Popping with Applications to Ascending Auctions

We study the power of ascending auctions in a scenario in which a seller is selling a collection of identical items to anonymous unit-demand bidders. We show that even with full knowledge of the set of bidders' private valuations for the items, if the bidders are ex-ante identical, no ascending auction can extract more than a constant times the revenue of the best fixed price scheme.

This problem is equivalent to the problem of coming up with an optimal strategy for blowing up indistinguishable balloons with known capacities in order to maximize the amount of contained air. We show that the algorithm which simply inflates all balloons to a fixed volume is close to optimal in this setting.

Joint work with Anna Karlin, Mohammad Mahdian, and Kunal Talwar

Randomly colouring a random graph

We will consider generating a random vertex colouring of a graph using a Markov chain. The aim is to determine the smallest number of colours, measured as a multiple of the maximum degree, for which the chain converges in time polynomial in the number of vertices. We will examine this problem for the case of an Erdős-Rényi random graph. This has been studied previously for graphs with small edge density. However, the methods used in the sparse case do not seem applicable as the edge density becomes larger. We will describe a different approach, which can be used to obtain results for denser graphs.

Game theoretic Approach to Hedging of Rainbow Options

We suggest a game theoretic framework (so called now 'interval model') for the analysis of option prices in financial mathematics. This leads to remarkable explicit formulas and effective numeric procedures for rainbow (or coloured) options hedging.

Short-length routes in low-cost networks via Poisson line patterns

How efficiently can one move about in a network linking a configuration of n cities? Here the notion of "efficient" has to balance (a) total network length against (b) short network distances between cities. My talk will explain how to use Poisson line processes to produce networks which are nearly of shortest total length, which make the average inter-city distance almost Euclidean.

This is joint work with David Aldous.

Clustering for Metric and Non-Metric Distance Measures

We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite point set P, our goal is to find a set C of size k such that the sum of errors D(P,C) = Σ{p in P} min{c in C} {D(p,c)} is minimized. The main result in this talk can be stated as follows: There exists an O(n 2^{(k/ε)^O(1)}) time (1+ε)-approximation algorithm for the k-median problem with respect to D, if the 1-median problem can be approximated within a factor of (1+ε) by taking a random sample of constant size and solving the 1-median problem on the sample exactly.

Using this characterization we obtain the first linear time (1+ε)-approximation algorithms for the k-median problem for doubling metrics, for the Kullback-Leibler divergence, Mahalanobis distances and some special cases of Bregman divergences.

The Travelling Salesman Problem: Are there any Open Problems left? Part II.

We consider the notorious travelling salesman problem (TSP) and such seemingly well-studied algorithms as the Held & Karp dynamic programming algorithm, the double-tree and Christofides heuristics, as well as algorithms for finding optimal pyramidal tours. We show how the ideas from these classical algorithms can be combined to obtain one of the best tour-constructing TSP heuristics. The main message of our presentation: despite the fact that the TSP has been investigated for decades, and thousands(!) of papers have been published on the topic, there are still plenty of exciting open problems, some of which (we strongly believe) are not that difficult to resolve.

The Travelling Salesman Problem: Are there any Open Problems left? Part I.

We consider the notorious travelling salesman problem (TSP) and such seemingly well-studied algorithms as the Held & Karp dynamic programming algorithm, the double-tree and Christofides heuristics, as well as algorithms for finding optimal pyramidal tours. We show how the ideas from these classical algorithms can be combined to obtain one of the best tour-constructing TSP heuristics. The main message of our presentation: despite the fact that the TSP has been investigated for decades, and thousands(!) of papers have been published on the topic, there are still plenty of exciting open problems, some of which (we strongly believe) are not that difficult to resolve.

Improving Integer Programming Solvers: {0,½}-Chvátal-Gomory Cuts

Chvátal-Gomory cuts are among the most well-known classes of cutting planes for general integer linear programs (ILPs). In case the constraint multipliers are either 0 or ½, such cuts are known as {0,½}-cuts. This talk reports on our study to separate general {0,½}-cuts effectively, despite its NP-completeness.

We propose a range of preprocessing rules to reduce the size of the separation problem. The core of the preprocessing builds a Gaussian elimination-like procedure. To separate the most violated {0,½}-cut, we formulate the (reduced) problem as an integer linear program. Some simple heuristic separation routines complete the algorithmic framework.

Computational experiments on benchmark instances show that the combination of preprocessing with exact and/or heuristic separation is a very vital idea to generate strong generic cutting planes for integer linear programs and to reduce the overall computation times of state-of-the-art ILP-solvers.

Strategic Game Playing and Equilibrium Refinements

Koller, Megiddo and von Stengel showed in 1994 how to efficiently find minimax behavior strategies of two-player imperfect information zero-sum extensive games using linear programming. Their algorithm has been widely used by the AI-community to solve very large games, in particular variants of poker. However, it is a well known fact of game theory that the Nash equilibrium concept has serious deficiencies as a prescriptive solution concept, even for the case of zero-sum games where Nash equilibria are simply pairs of minimax strategies. That these deficiencies show up in practice in the AI-applications was documented by Koller and Pfeffer. In this talk, we argue that the theory of equilibrium refinements of game theory provides a satisfactory framework for repairing the deficiencies, also for the AI-applications. We describe a variant of the Koller, Megiddo and von Stengel algorithm that computes a *quasi-perfect* equilibrium and another variant that computes all *normal-form proper* equilibria. Also, we present a simple yet non-trivial characterization of the normal form proper equilibria of a two-player zero-sum game with perfect information.

The talk is based on joint papers with Troels Bjerre Sørensen, appearing at SODA'06 and SODA'08.

An Approximation Trichotomy for Boolean #CSP

This talk examines the computational complexity of approximating the number of solutions to a Boolean constraint satisfaction problem (CSP). It extends a line of investigation started in a classical paper of Schaefer on the complexity of the decision problem for CSPs, and continued by Creignou and Hermann, who addressed exact counting.

We find that the class of Boolean CSPs exhibits a trichotomy. Depending on the set of allowed relations, the CSP may be polynomial-time solvable (even exactly); or the number of solutions may be as hard to approximate as the number of accepting computations of a non-deterministic Turing machine. But there is a third possibility: approximating the number of solutions may be complete for a certain logically defined complexity class, and hence equivalent in complexity to a number of natural approximate counting problems, of which independent sets in a bipartite graph is an example.

All the necessary background material on approximate counting and CSPs will be covered.

This is joint work with Martin Dyer (Leeds) and Leslie Ann Goldberg (Liverpool).

From Tree-width to Clique-width: Excluding a Unit Interval Graph

From the theory of graph minors we know that the class of planar graphs is the only critical class with respect to tree-width. In this talk, we reveal a critical class with respect to clique-width, a notion generalizing tree-width. This class is known in the literature under different names, such as unit interval, proper interval or indifference graphs, and has important applications in various fields. We prove that the unit interval graphs constitute a minimal hereditary class of unbounded clique-width and discuss some applications of the obtained result.

Cut-based Inequalities for Capacitated Network Design Problems

In this talk we study basic network design problems with modular capacity assignment. The focus is on classes of strong valid inequalities that are defined for cuts of the underlying network. We show that regardless of the link model, facets of the polyhedra associated with such a cut translate to facets of the original network design polyhedra if the two subgraphs defined by the network cut are (strongly) connected. Accordingly, we focus on the facial structure of the cutset polyhedra. A large class of facets of cutset polyhedra is defined by flow-cutset inequalities. These inequalities are presented in a unifying way for different model variants. We propose a generic separation algorithm and in an extensive computational study on 54 instances from the survivable network design library (SNDlib), we show that the performance of CPLEX can significantly be enhanced by this class of cutting planes.

Submodular Percolation and the Worm Order

Suppose we have a grid mxn, two real-valued functions f and g on [m] and [n] respectively, and a threshold value b. We declare a point (i,j) in the grid to be open if f(i) + g(j) is at most b. It turns out that, if there is a path of open points from the bottom point (1,1) to the top point (m,n), then there is a monotone path of open points, i.e., if we can get from bottom to top at all, then we can do so without having to retreat.

This is an instance of the following much more general result. Let f be a submodular function on a modular lattice L; we show that there is a maximal chain C in L on which the sequence of values of f is minimal among all paths from 0 to 1 in the Hasse diagram of L, in a certain well-behaved partial order -- the "worm order" -- on sequences of reals. One consequence is that the maximum value of f on C is minimised over all such paths. We discuss the worm order, relate our work to that on searching a graph, and mention some sample applications.

Joint work with Peter Winkler.

Ant Colony Optimization for Vehicle Routing

In this talk I will first present the basic working principles of Ant Colony Optimization (ACO) and then explain some of our work on applying ACO to vehicle routing problems. The main idea in this context is to exploit problem knowledge to improve the performance of the general purpose heuristic ACO.

Parameterized Algorithms for Directed Maximum Leaf Problems

We prove that finding a rooted subtree with at least k leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family L that includes all strong and acyclic digraphs. This settles completely an open question of Fellows and solves another one for digraphs in L. We also prove the following combinatorial result which can be viewed as a generalization of many results for a "spanning tree with many leaves" in the undirected case, and which is interesting on its own: If a digraph D ∈ L of order n with minimum in-degree at least 3 contains a rooted spanning tree, then D contains one with at least (n/4)^{1/3}-1 leaves.

Joint work with Noga Alon, Fedor Fomin, Michael Krivelevich and Saket Saurabh

Hierarchical Graph Decompositions for Minimizing Congestion

An oblivious routing protocol makes its routing decisions independent of the traffic in the underlying network. This means that the path chosen for a routing request may only depend on its source node, its destination node, and on some random input. In spite of these serious limitations it has been shown that there are oblivious routing algorithms that obtain a polylogarithmic competitive ratios w.r.t. the congestion in the network (i.e., maximum load of a network link).

In this talk I will present a new hierarchical decomposition technique that leads to good oblivious routing algorithms. This decomposition can also be used as a generic tool for solving a large variety of cut based problems in undirected graphs.

Overhang Bounds

How far can a stack of n identical blocks be made to hang over the edge of a table? The question dates back to at least the middle of the 19th century and the answer to it was widely believed to be of order log n. Recently, we (Paterson and Zwick) constructed n-block stacks with overhangs of order n^{1/3}, exponentially better than previously thought possible. The latest news is that we (Paterson, Peres, Thorup, Winkler and Zwick) can show that order n^{1/3} is best possible, resolving the long-standing overhang problem up to a constant factor.

I shall review the construction and describe the upper bound proof, which illustrates how methods founded in algorithmic complexity can be applied to a discrete optimization problem that has puzzled some mathematicians and physicists for more than 150 years.

Connecting Bits with Floating-Point Numbers: Model Checking and Theorem Proving in Practice

High performance floating point hardware is notoriously difficult to design correctly. In fact, until recently, the most expensive hardware bug encountered in industry, was the Intel FDIV bug in 1994 that lead to a charge of 450 million dollars against earnings. At the same time, floating point arithmetic is unique in that there is a fairly unambiguous specification, the IEEE 754 standard, which all implementations should obey. Unfortunately, bridging the gap between the mathematical specification of the standard and a low-level implementation is an extremely difficult task. At Intel we have developed an approach that combines the strengths of theorem proving with symbolic trajectory evaluation (a type of model checking), that allows us to completely verify the correctness of todayÇs floating point units. In this talk I will discuss the evolution of this approach and discuss some of the results that have been obtained in addition to areas of future research.

Tree-width and Optimization in Bounded Degree Graphs

It is well known that boundedness of tree-width implies polynomial-time solvability of many algorithmic graph problems. The converse statement is generally not true, i.e., polynomial-time solvability does not necessarily imply boundedness of tree-width. However, in graphs of bounded vertex degree, for some problems, the two concepts behave in a more consistent way. We study this phenomenon with respect to three important graph problems -- dominating set, independent dominating set and induced matching -- and obtain several results toward revealing the equivalency between boundedness of the tree-width and polynomial-time solvability of these problems in bounded degree graphs. Joint work with Martin Milanic.

A Survey of Short PCP Constructions

The PCP theorem [AS, ALMSS] specifies a way of encoding any mathematical proof such that the validity of the proof can be verified probabilistically by querying the proof only at a constant number of locations. Furthermore, this encoding is complete and sound, i.e., valid proofs are always accepted while invalid proofs are accepted with probability at most 1/2. A natural question that arises in the construction of PCPs is by how much does this encoding blow up the original proof while retaining low query complexity.

The study of efficient probabilistic checkable proofs was initiated in the works of Babai et. al. [BFLS] and Feige at. al. [FGLSS] with very different motivation and emphases. The work of Babai et. al. considered the direct motivation of verifying proofs highly efficiently. In contrast, Feige et. al. established a dramatic connection between efficient probabilistically checkable proofs (PCPs) and the inapproximability of optimization problems.

In this talk, I'll review some of the recent works of Ben-Sasson et. al. [BGHSV'04, BGHSV'05], Dinur-Reingold [DR], Ben-Sasson and Sudan [BS'04] and Dinur [Din'06] that have led to the construction of PCPs that are at most a polylogarithmic factor longer than the original proof and furthermore, are checkable by a verifier running in time at most polylogarithmic in the length of the original proof.

An important ingredient in these constructions is a a new variant of PCPs called "PCPs of Proximity''. These new PCPs facilitate proof composition, a crucial component in PCP construction. I'll outline how these new PCPs allow for shorter PCP constructions and efficient proof verification

Solved and Unsolved Optimization Challenges in Telecommunications

We give an overview of the optimization challenges addressed in recent years ranging from frequency assignment in mobile networks to multi-layer network design in backbone networks. We discuss the practical problems, the mathematical modelling, the methodologies used to tackle these problems, and the results achieved.

The content of this page is drawn directly from the corresponding page on the DIMAP website.