114
Voted
STACS
2016
Springer
10 years 14 days ago
2016
Springer
We prove that for every positive integer r and for every graph class G of bounded expansion, the r-Dominating Set problem admits a linear kernel on graphs from G. Moreover, in the...
127
Voted
STACS
2016
Springer
10 years 14 days ago
2016
Springer
136
click to vote
STACS
2016
Springer
10 years 14 days ago
2016
Springer
The quantitative verification of Probabilistic Automata (PA) is undecidable in general. Unary PA are a simpler model where the choice of action is fixed. Still, the quantitative...
142
click to vote
STACS
2016
Springer
10 years 14 days ago
2016
Springer
We study the question of testing structured properties (classes) of discrete distributions. Specifically, given sample access to an arbitrary distribution D over [n] and a proper...
133
click to vote
STACS
2016
Springer
10 years 14 days ago
2016
Springer
John Tromp introduced the so-called ’binary lambda calculus’ as a way to encode lambda terms in terms of 0−1-strings. Later, Grygiel and Lescanne conjectured that the number...
135
Voted
STACS
2016
Springer
10 years 14 days ago
2016
Springer
We prove that satisfiability over infinite words is decidable for a fragment of asymptotic monadic second-order logic. In this fragment we only allow formulae of the form ∃t...
137
Voted
STACS
2016
Springer
10 years 14 days ago
2016
Springer
Two intimately related new classes of games are introduced and studied: entropy games (EGs) and matrix multiplication games (MMGs). An EG is played on a finite arena by two-and-a...
151
Voted
STACS
2016
Springer
10 years 14 days ago
2016
Springer
We consider the complexity of the Hamilton cycle decision problem when restricted to k-uniform hypergraphs H of high minimum codegree δ(H). We show that for tight Hamilton cycles...
122
Voted
STACS
2016
Springer
10 years 14 days ago
2016
Springer
We show an exponential separation between two well-studied models of algebraic computation, namely read-once oblivious algebraic branching programs (ROABPs) and multilinear depth ...
128
click to vote
STACS
2016
Springer
10 years 14 days ago
2016
Springer
A tournament is a directed graph T such that every pair of vertices is connected by an arc. A feedback vertex set is a set S of vertices in T such that T −S is acyclic. In this ...