128
click to vote
LATIN
2016
Springer
10 years 26 days ago
2016
Springer
We study information gathering in ad-hoc radio networks. Initially, each node of the network has a piece of information called a rumor, and the overall objective is to gather all t...
126
click to vote
LATIN
2016
Springer
10 years 26 days ago
2016
Springer
We consider the problem of sampling a uniformly random spanning tree of a graph. This is a classic algorithmic problem for which several exact and approximate algorithms are known....
112
click to vote
LATIN
2016
Springer
10 years 26 days ago
2016
Springer
We consider three related online problems: Online Convex Optimization, Convex Body Chasing, and Lazy Convex Body Chasing. In Online Convex Optimization the input is an online seque...
118
click to vote
LATIN
2016
Springer
10 years 26 days ago
2016
Springer
Recently, Aravind, Sandeep, and Sivadasan (IPEC 2014) showed that for any finite set of connected graphs H, the problem H-Free Edge Deletion admits a polynomial kernelization on ...
121
click to vote
LATIN
2016
Springer
10 years 26 days ago
2016
Springer
:00 Simple realizability of complete abstract topological graphs simplified. Jan Kynˇcl. 11:00-11:30 Coffee break · · · · · · · · · · · · · · · · · · · · · ...
126
click to vote
LATIN
2016
Springer
10 years 26 days ago
2016
Springer
A graph G is called a block graph if each maximal 2-connected component of G is a clique. In this paper we study the Block Graph Vertex Deletion from the perspective of fixed para...
138
click to vote
LATA
2016
Springer
10 years 26 days ago
2016
Springer
Abstract. We study a subclass of tree-to-word transducers: linear treeto-word transducers, that cannot use several copies of the input. We aim to study the equivalence problem on t...
149
click to vote
LATA
2016
Springer
10 years 26 days ago
2016
Springer
Abstract. Finding minimal separating sequences for all pairs of inequivalent states in a finite state machine is a classic problem in automata theory. Sets of minimal separating s...
137
click to vote
LATA
2016
Springer
10 years 26 days ago
2016
Springer
Two of the most celebrated results that effectively exploit visual representation to give logical characterization and decidable modelchecking include visibly pushdown automata (V...
220
click to vote
LATA
2016
Springer
10 years 26 days ago
2016
Springer
Capacitated automata (CAs) have been recently introduced in [8] as a variant of finite-state automata in which each transition is associated with a (possibly infinite) capacity. ...