Instituts-Logo Theorie der Informatik
Prof. Dr. Isolde Adler
Institut für Informatik
Frankfurt am Main

Isolde Adler's publications

Tree-width for first order formulae, with Mark Weyer.
CSL 2009, accepted.

Games for width parameters and monotonicity
arXiv:0906.3857, 2009.

A note on clique-width and tree-width for structures, with Hans Adler.
arXiv:0806.0103, 2008.
This is an updated version of the original note in German
Notiz zur unären Cliquenweite von Strukturen, 2005.

Tree-width and functional dependencies in databases
In: Proceedings of the 27th ACM Sigact-Sigart Symposium on Principles of Database Systems, (PODS'08), 311-320, 2008.

Computing Excluded Minors, with Martin Grohe and Stephan Kreutzer.
In Proceedings of the of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), pp.641-650, 2008.

Tree-related widths of graphs and hypergraphs
SIAM Journal on Discrete Mathematics, Volume 22(1), pp.102-123, 2008.

Directed Tree-Width Examples
Journal of Combinatorial Theory, Series B, Volume 97(5), pp.718-725, 2007.

Width functions for hypertree decompositions
PhD thesis, Freiburg 2006.

Marshals, Monotone Marshals, and Hypertree-Width
Journal of Graph Theory, 47(4):275--296, 2004.

Hypertree-Width and Related Hypergraph Invariants, with Georg Gottlob and Martin Grohe.
Conference version in Proceedings of the 3rd European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'05),
DMTCS Proceedings Series, Volume AE, pp.5-10, 2005.
Full version in: European Journal of Combinatorics, Volume 28(8), pp.2167-2181, 2007.

Spiele als Hilfsmittel zu Strukturuntersuchungen bei Graphen und Hypergraphen
Diploma thesis (in german), Freiburg 2002.


Tree-width and functional dependencies in databases
A talk given at PODS 2008 in Vancouver.

Computing excluded minors
A talk given at the Dagstuhl workshop "Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs" July 2007.

Hypertree-width and related invariants
A talk given at the CSL workshop on Logic and Combinatorics 2006 in Szeged.


Open problems related to computing obstruction sets
A small collection of open problems compiled for the workshop Graph Minors in Banff, Canada, 2008.

Last modified: 20. October 2009, 15:59 CEST 2009