
Bears with Hats and Independence Polynomials
Consider the following hat guessing game. A bear sits on each vertex of ...
read it

Data Structures Lower Bounds and Popular Conjectures
In this paper, we investigate the relative power of several conjectures ...
read it

Barrington Plays Cards: The Complexity of Cardbased Protocols
In this paper we study the computational complexity of functions that ha...
read it

Parameterized Inapproximability of Independent Set in HFree Graphs
We study the Independent Set (IS) problem in Hfree graphs, i.e., graphs...
read it

Lower Bounds for Semiadaptive Data Structures via Corruption
In a dynamic data structure problem we wish to maintain an encoding of s...
read it

On Induced Online Ramsey Number of Paths, Cycles, and Trees
An online Ramsey game is a game between Builder and Painter, alternating...
read it

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
We study the Steiner Tree problem, in which a set of terminal vertices n...
read it
Pavel Dvořák
is this you? claim profile