120
Voted
LFCS
2016
Springer
9 years 11 months ago
2016
Springer
We generalize the adjoint logics of Benton and Wadler (1996) and Reed (2009) to allow multiple different adjunctions between the same categories. This provides insight into the str...
128
Voted
LFCS
2016
Springer
9 years 11 months ago
2016
Springer
201
Voted
LFCS
2016
Springer
9 years 11 months ago
2016
Springer
Abstract. We present a soundness theorem for a dependent type theory with context conith respect to an indexed category of (finite, abstract) simplical complexes. The point of int...
118
click to vote
LATIN
2016
Springer
9 years 11 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...
222
Voted
LATIN
2016
Springer
9 years 11 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...
115
click to vote
LATIN
2016
Springer
9 years 11 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...
117
Voted
LATIN
2016
Springer
9 years 11 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....
104
click to vote
LATIN
2016
Springer
9 years 11 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...
110
click to vote
LATIN
2016
Springer
9 years 11 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 ...
113
click to vote
LATIN
2016
Springer
9 years 11 months ago
2016
Springer
:00 Simple realizability of complete abstract topological graphs simplified. Jan Kynˇcl. 11:00-11:30 Coffee break · · · · · · · · · · · · · · · · · · · · · ...