169
click to vote
TCS
2016
10 years 3 months ago
2016
A set of vertices X of a graph G is convex if no shortest path between two vertices in X contains a vertex outside X. We prove that for fixed p ≥ 1, all partitions of the verte...
197
click to vote
TCS
2016
10 years 3 months ago
2016
A clique of a graph is a maximal set of vertices of size at least 2 that induces a complete graph. A k-clique-colouring of a graph is a colouring of the vertices with at most k co...
184
click to vote
TCS
2016
10 years 3 months ago
2016
The downward and upward closures of a regular language L are obtained by collecting all the subwords and superwords of its elements, respectively. The downward and upward interior...
178
Voted
TCS
2016
10 years 3 months ago
2016
rder Abstract Voronoi Diagrams. Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou and Maksym Zavershynskyi 3D rectangulations and geometric matrix multiplication. Peter Floderus...
176
click to vote
TCS
2016
10 years 3 months ago
2016
Consider a deck of real cards with faces that are either black or red and backs that are all identical. Then, using two cards of different colors, we can commit a secret bit to a...