Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
This paper presents an approach to matching parts of deformable shapes. Multiscale salient parts of the two shapes are first identified. Then, these parts are matched if their im...
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Abstract. Dimension schemas are abstract models of the data hierarchies that populate OLAP warehouses. Although there is abundant work on schema equivalence in a variety of data mo...
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
Paolo Baldan, Andrea Corradini, Tobias Heindel, Ba...