Related papers: Pfaffian Pairs and Parities: Counting on Linear Ma…
A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection…
We initiate the study of matroid problems in a new oracle model called dynamic oracle. Our algorithms in this model lead to new bounds for some classic problems, and a "unified" algorithm whose performance matches previous results developed…
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to…
In this paper, we consider the problem of counting and sampling structures in graphs. We define a class of "edge universal labeling problems"---which include proper $k$-colorings, independent sets, and downsets---and describe simple…
Perfect matching width is a treewidth-like parameter designed for graphs with perfect matchings. The concept was originally introduced by Norine for the study of non-bipartite Pfaffian graphs. Additionally, perfect matching width appears to…
Maintaining the pair similarity relationship among originally high-dimensional data into a low-dimensional binary space is a popular strategy to learn binary codes. One simiple and intutive method is to utilize two identical code matrices…
A recurring theme in the least squares approach to phylogenetics has been the discovery of elegant combinatorial formulas for the least squares estimates of edge lengths. These formulas have proved useful for the development of efficient…
It is well known that Pfaffian formulas for eigenvalue correlations are useful in the analysis of real and quaternion random matrices. Moreover the parametric correlations in the crossover to complex random matrices are evaluated in the…
Conjunctive queries are one of the most common class of queries used in database systems, and the best studied in the literature. A seminal result of Grohe, Schwentick, and Segoufin (STOC 2001) demonstrates that for every class $G$ of…
Matrix multiplication is a fundamental computation in many scientific disciplines. In this paper, we show that novel fast matrix multiplication algorithms can significantly outperform vendor implementations of the classical algorithm and…
Combining the techniques of approximation algorithms and parameterized complexity has long been considered a promising research area, but relatively few results are currently known. In this paper we study the parameterized approximability…
An Ingletonian polymatroid satisfies, in addition to the polymatroid axioms, the inequalities of Ingleton (Combin. Math. Appln., 1971). These inequalities are required for a polymatroid to be representable. It is has been an open question…
The Weighted First-Order Model Counting Problem (WFOMC) asks to compute the weighted sum of models of a given first-order logic sentence over a given domain. Conditioning WFOMC on evidence -- fixing the truth values of a set of ground…
Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, r-rank perturbed graphic matroid M is a binary matroid that can be represented in the form I +P,…
It is well known that many local graph problems, like Vertex Cover and Dominating Set, can be solved in 2^{O(tw)}|V|^{O(1)} time for graphs G=(V,E) with a given tree decomposition of width tw. However, for nonlocal problems, like the…
We show for a broad class of counting problems, correlation decay (strong spatial mixing) implies FPTAS on planar graphs. The framework for the counting problems considered by us is the Holant problems with arbitrary constant-size domain…
In the past decades, determinants and Pfaffians were found for eigenvalue correlations of various random matrix ensembles. These structures simplify the average over a large number of ratios of characteristic polynomials to integrations…
We give a combinatorial condition for the existence of efficient, LP-based FPT algorithms for a broad class of graph-theoretical optimisation problems. Our condition is based on the notion of biased graphs known from matroid theory.…
Research in explorable uncertainty addresses combinatorial optimization problems where there is partial information about the values of numeric input parameters, and exact values of these parameters can be determined by performing costly…
The classical 1961 solution to the problem of determining the number of perfect matchings (or dimer coverings) of a rectangular grid graph -- due independently to Kasteleyn and to Temperley and Fisher -- consists of changing the sign of…