We consider the problem of classifying graphs using graph kernels. We define a new graph
kernel, called the generalized shortest path kernel, based on the number and length of …

We prove that Hamiltonicity in maximum-degree-3 grid graphs (directed or undirected) is
ASP-complete, ie, it has a parsimonious reduction from every NP search problem (including …

A k-proper connected 2-coloring for a graph is an edge bipartition which ensures the
existence of at least k vertex disjoint simple alternating paths (ie, paths where no two …

We determine the complexity of counting models of bounded size of specifications
expressed in linear-time temporal logic. Counting word-models is# P-complete, if the bound …

We show that the permanent of an nxn matrix over any finite ring of r<= n elements can be
computed with a deterministic 2^{n-Omega (n/r)} time algorithm. This improves on a Las …

Carbon is the most versatile of chemical elements in combining with itself or other elements
to form chains, rings, sheets, cages, and periodic 3D structures. One of the perspective …

We define the notion of diversity for families of finite functions and express the limitations of a
simple class of holographic algorithms, called elementary algorithms, in terms of limitations …

We describe a method for computing the number of Hamilton cycles in cubic polyhedral
graphs. The Hamilton cycle counts are expressed in terms of a finite‐state machine, and can …

Eschewing the often standard dry and static writing style of traditional textbooks, Discrete
Encounters provides a refreshing approach to discrete mathematics. The author blends …

Parallel ant colony optimization algorithm for solving protein tertiary structure prediction
problem given its amino acid sequence is introduced. The efficiency of developed algorithm …