LATIN
2016
Springer
8 years 8 months ago
2016
Springer
We consider drawings of graphs in the plane in which edges are represented by polygonal paths with at most one bend and the number of different slopes used by all segments of thes...
LATIN
2016
Springer
8 years 8 months ago
2016
Springer
We study the compressed representation of a ranked tree by a straight-line program (SLP) for its preorder traversal string, and compare it with the previously studied representatio...
LATIN
2016
Springer
8 years 8 months 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...
LATIN
2016
Springer
8 years 8 months 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....
LATIN
2016
Springer
8 years 8 months 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...
LATIN
2016
Springer
8 years 8 months 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 ...
LATIN
2016
Springer
8 years 8 months ago
2016
Springer
:00 Simple realizability of complete abstract topological graphs simplified. Jan Kynˇcl. 11:00-11:30 Coffee break · · · · · · · · · · · · · · · · · · · · · ...
LATIN
2016
Springer
8 years 8 months 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...