#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1969

2019

- This year (2)
- Last 5 years (10)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Isolde Adler, Georg Gottlob, Martin Grohe
- Eur. J. Comb.
- 2005

We study the notion of hypertree-width of hypergraphs. We prove that, up to a constant factor, hypertree-width is the same as a number of other hypergraph invariants that resemble graph invariants… (More)

- Isolde Adler, Martin Grohe, Stephan Kreutzer
- SODA
- 2008

By Robertson and Seymour's graph minor theorem, every minor ideal can be characterised by a finite family of excluded minors. (A <i>minor ideal</i> is a class of graphs closed under taking minors.)… (More)

The Disjoint-Paths Problem asks, given a graph G and a set of pairs of terminals (s1, t1),..., (sk, tk), whether there is a collection of k pairwise vertex-disjoint paths linking si and ti, for i =… (More)

- Isolde Adler
- 2004

The tree-width of a hypergraph H equals one less than the number of cops necessary to catch the robber in the Monotone Robber and Cops Game played on H. Analogously, the hypertree-width of a… (More)

We study the recently introduced boolean-width of graphs. Our structural results are as follows. Firstly, we show that almost surely the boolean-width of a random graph on $n$ vertices is $O(\log^2… (More)

We present a characterization of the linear rank-width of distance-hereditary graphs. Using the characterization, we show that the linear rank-width of every $n$-vertex distance-hereditary graph can… (More)

- Isolde Adler
- SIAM J. Discrete Math.
- 2008

A hypergraph pair is a pair $(G,H)$ where $G$ and $H$ are hypergraphs on the same set of vertices. We extend the definitions of hypertree-width [G. Gottlob, N. Leone, and F. Scarcello, J. Comput.… (More)

- Hans Adler, Isolde Adler
- Eur. J. Comb.
- 2014

A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of complete graphs that occur as r-minors. We observe that this recent tameness notion from… (More)

The theory of Graph Minors by Robertson and Seymour is one of the deepest and significant theories in modern Combinatorics. This theory has also a strong impact on the recent development of… (More)

- Isolde Adler, Mark Weyer
- Logical Methods in Computer Science
- 2009

We introduce tree-width for first order formulae \phi, fotw(\phi). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formulae of… (More)