We present a fast algorithm for the subset convolution problem:given functions f*g and g defined on the lattice of subsets of an<i>n</i>-element set <i> n</i>, compute their subset convolutions in O(n<sup>2</sup> 2<sup>[T ⊆ S] f(T) g(S/T),,] using Möbius transform and inversion.Expand

In this paper we take an algorithm engineering approach to canonical labeling, and develop a backtrack algorithm and data structures appropriate for fast handling of large and sparse graphs.Expand

A new starting-point and a new method are requisite, to insure a complete [classi?cation of the Steiner triple systems of order 15]. This method was furnished, and its tedious and di?cult execution… Expand

We present randomized algorithms for some well-studied, hard combinatorial problems: the k-path problem, the p-packing of q-sets problem, and the q-dimensional p-matching problem.Expand

We introduce a new algebraic sieving technique to detect constrained multilinear monomials in multivariate polynomial generating functions given by an evaluation oracle.Expand

We use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model, resulting in solutions that outperform all previous combinatorial algorithms.Expand

We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energy-constrained (e.g. battery-operated) nodes by choosing ideal transmission power levels for the nodes relaying the connection.Expand

In this article, the steering committee of the Parameterized Algorithms and Computational Experiments challenge reports on the first iteration of the challenge.Expand