Titlebook: LATIN 2016: Theoretical Informatics; 12th Latin American Evangelos Kranakis,Gonzalo Navarro,Edgar Chávez Conference proceedings 2016 Sprin

懦夫

叫喊

Period Recovery over the Hamming and Edit Distances,n .. In this paper we investigate the period recovery problem. Given a string . of length ., find the primitive period(s) . such that the distance between . and the string that is periodic in . is below a threshold .. We consider the period recovery problem over both the Hamming distance and the edi

Armory

Chasing Convex Bodies and Functions,n the input is an online sequence of convex functions over some Euclidean space. In response to a function, the online algorithm can move to any destination point in the Euclidean space. The cost is the total distance moved plus the sum of the function costs at the destination points. Lazy Convex Bo

生存環(huán)境

Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of ,-free Edge Modificatioopy of .. .-. and .-. are defined similarly where only completion (addition) of edges are allowed in the former and both completion and deletion are allowed in the latter. We completely settle the classical complexities of these problems by proving that .-. is . if and only if . is a graph with at l

怒目而視

Parameterized Complexity of , for Lines,rse . containing . blue elements and . red elements, positive integers . and ., and a family . of . sets over ., the . problem is to decide whether there is a subfamily . of size at most . that covers all blue elements, but at most . of the red elements. This generalizes . and thus in full generalit

沖突

Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons,over a simple rectilinear polygon . with . vertices. When . is monotone and rectilinear, we prove that this bound becomes .. We also present an optimal linear-time algorithm for computing the beacon kernel of ..

rheumatism

針葉樹

Reclaim

On the Total Number of Bends for Planar Octilinear Drawings,be readable, special care is needed in order to keep the number of bends small. As the problem of finding planar octilinear drawings of minimum number of bends is NP-hard, in this paper we focus on upper and lower bounds. From a recent result of Keszegh et al.?on the slope number of planar graphs, w

Soliloquy

Bidirectional Variable-Order de Bruijn Graphs, using Bloom filters and the other using a kind of Burrows-Wheeler Transform on the edge labels of the graph. The second representation is more elegant and can even handle many graph-orders at once, but it does not cleanly support traversing edges backwards or inserting new nodes or edges. In this p