#### Filter Results:

#### Publication Year

2011

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Jannis Bulian, Ian M. Hodkinson
- Ann. Pure Appl. Logic
- 2013

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)

We show that for finite n ≥ 3 the class of representable cylindric algebras RCA n cannot be axiomatised by canonical first-order formulas. So, although RCA n is known to be canonical, which means that it is closed under canonical extensions, there is no axioma-tisation where all the formulas are preserved by canonical extensions. In fact, we show that every… (More)

- Jannis Bulian, Anuj Dawar
- Algorithmica
- 2014

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)

- Jannis Bulian, Anuj Dawar
- Algorithmica
- 2015

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)

- Jannis Bulian
- 2017

This dissertation offers contributions to the area of parameterized complexity theory, which studies the complexity of computational problems in a multivariate framework. We demonstrate that for graph problems, many popular parameters can be understood as distances that measure how far a graph is from belonging to a class of sparse graphs. We introduce the… (More)

- ‹
- 1
- ›