Sciweavers

Share
LATIN
2016
Springer
3 years 16 days ago
Graph Drawings with One Bend and Few Slopes
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...
Kolja Knauer, Bartosz Walczak
LATIN
2016
Springer
3 years 16 days ago
Tree Compression Using String Grammars
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...
Moses Ganardi, Danny Hucke, Markus Lohrey, Eric No...
LATIN
2016
Springer
3 years 16 days ago
Faster Information Gathering in Ad-Hoc Radio Tree Networks
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...
Marek Chrobak, Kevin P. Costello
LATIN
2016
Springer
3 years 16 days ago
Generating Random Spanning Trees via Fast Matrix Multiplication
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....
Nicholas J. A. Harvey, Keyulu Xu
LATIN
2016
Springer
3 years 16 days ago
Chasing Convex Bodies and Functions
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...
Antonios Antoniadis, Neal Barcelo, Michael Nugent,...
LATIN
2016
Springer
3 years 16 days ago
Compressing Bounded Degree Graphs
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 ...
Pål Grønås Drange, Markus S. Dr...
LATIN
2016
Springer
3 years 16 days ago
Stabbing Circles for Sets of Segments in the Plane
:00 Simple realizability of complete abstract topological graphs simplified. Jan Kynˇcl. 11:00-11:30 Coffee break · · · · · · · · · · · · · · · · · · · · · ...
Mercè Claverol, Elena Khramtcova, Evanthia ...
LATIN
2016
Springer
3 years 16 days ago
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
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...
Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtano...
books