#### Filter Results:

#### Publication Year

2013

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We show that for finite n ≥ 3, every first-order axiomatisation of the varieties of representable n-dimensional cylindric algebras, diagonal-free cylindric algebras , polyadic algebras, and polyadic equality algebras contains an infinite number of non-canonical formulas. We also show that the class of structures for each of these varieties is… (More)

- Ernst W Mayr, Nicolas Ollinger, Susanne Albers, Tu München, Chris Hankin, Michael Mitzenmacher +494 others
- 2015

In brief, this license authorizes each and everybody to share (to copy, distribute and transmit) the work under the following conditions, without impairing or restricting the authors' moral rights: Attribution: The work must be attributed to its authors. LIPIcs is a series of high-quality conference proceedings across all fields in informatics. LIPIcs… (More)

A commonly studied means of parameterizing graph problems is the deletion distance from triviality (Guo et al., Parameterized and exact computation, Springer, Berlin, pp. 162–173, 2004), which counts vertices that need to be deleted from a graph to place it in some class for which efficient algorithms are known. In the context of graph isomorphism, we… (More)

We show that for various classes $$\mathcal {C}$$ C of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining the distance of a given graph G to $$\mathcal {C}$$ C is fixed-parameter tractable. The results are based on two general techniques. The first of these, building… (More)

- ‹
- 1
- ›