The Densest Subgraph Problem requires us to find, in a given graph, a subset of vertices
whose induced subgraph maximizes a measure of density. The problem has received a …

In the Densest k-Subgraph (D k S) problem, given an undirected graph G and an integer k,
the goal is to find a subgraph of G on k vertices that contains maximum number of edges …

In our recent paper [Rubinstein 2016] we rule out a PTAS for the 2-Player Nash Equilibrium
Problem. More precisely, we prove that there exists a constant ϵ> 0 such that, assuming the …

Graph modeling allows numerous security problems to be tackled in a general way,
however, little work has been done to understand their ability to withstand adversarial …

We consider questions that arise from the intersection between the areas of approximation
algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms. The …

A $(k\times l) $-birthday repetition $\mathcal {G}^{k\times l} $ of a two-prover game $\mathcal
{G} $ is a game in which the two provers are sent random sets of questions from $\mathcal …

Given a graph and an integer k, Densest k-Subgraph is the algorithmic task of finding the
subgraph on k vertices with the maximum number of edges. This is a fundamental problem …

We study the combinatorial contract design problem, introduced and studied by Dütting et
al.(2021, 2022), in both the single and multi-agent settings. Prior work has examined the …

We formulate a new hardness assumption, the Strongish Planted Clique Hypothesis
(SPCH), which postulates that any algorithm for planted clique must run in time $ n^{\Omega …

We consider questions that arise from the intersection between the areas of polynomial-time
approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable …