This paper investigates ultrafilters in the context of connectivity systems, defined as pairs
$(X, f) $ where $ X $ is a finite set and $ f $ is a symmetric submodular function. Ultrafilters …

Graph theory, a fundamental branch of mathematics, centers on the study of networks
composed of vertices (nodes) and edges, examining their paths, structures, and properties …

3D spatial perception is the problem of building and maintaining an actionable and
persistent representation of the environment in real-time using sensor data and prior …

Microaggregation is a classical statistical disclosure control technique which requires the
input data to be partitioned into clusters while adhering to specified size constraints. We …

We systematically study the query complexity of learning geodesically convex halfspaces on
graphs. Geodesic convexity is a natural generalisation of Euclidean convexity and allows …

The organizers of the 4th Parameterized Algorithms and Computational Experiments
challenge (PACE 2019) report on the 4th iteration of the PACE challenge. This year, the first …

We initiate the study of coresets for clustering in graph metrics, ie, the shortest-path metric of
edge-weighted graphs. Such clustering problems are essential to data analysis and used for …

In this paper, we introduce a novel algorithm to solve projected model counting (PMC). PMC
asks to count solutions of a Boolean formula with respect to a given set of projection …

In indexing a graph for distance queries, distance labeling is a common practice; in
particular, 2-hop labeling which guarantees the exactness of the query results is widely …

Given an undirected graph and a number of vertex groups, the group Steiner trees problem
is to find a tree such that (i) this tree contains at least one vertex in each vertex group; and (ii) …