Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel

Stability of representation with respect to increasing lim- its of Newtonian and Riesz potentials is established in ([16], Theorem 1.26, Theorem 3.9).. Convergence properties

[r]

Although Algorithm 4 is formulated for the binary k-lcs, the implementation can handle input tuples of concept descriptions by applying the binary k-lcs to the first two concepts

University of Zurich (UZH) Fall 2012 MAT532 – Representation theory..

u EWRA 2005 (European Water Resources Association) – Menton (France), September, 7-10, 2005: Presentation of the BRIDGE Project - Background Criteria for the Identifi- cation

u The derivation of groundwater threshold values based on natural background levels and reference values such as environmental quality standards for dependent ecosystems or

But for finite depth foliations (which have two sided branching), there are many examples where it is impossible to make the pseudo-Anosov flow transverse to the foliation [Mo5] and

We will use the idea of Bakry and Emery [1] to give a notion of a ”lower Ricci curvature bound” on graphs and to prove that Ricci curvature on Locally finite graphs is always