We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
This paper describes a compositional analysis algorithm for statically detecting leaks in Java programs. The algorithm is based on separation logic and exploits the concept of bi-a...
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny Aggregation (p-KAGG) -- a problem in social choice theory -- and for p-One-Sided Crossing Minimiza...
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov,...