Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Adler, Isolde - Institut für Informatik, Johann Wolfgang Goethe-Universität Frankfurt am Main
Fast Minor Testing in Planar Graphs Isolde Adler1
Tree-width and functional dependencies in Isolde Adler
Tree-width and functional dependencies in databases Isolde Adler
arXiv:1106.2533v1[cs.DM]13Jun2011 Obstructions for linear rankwidth at most 1
COMPUTING EXCLUDED MINORS Isolde Adler
Tight Bounds for Linkages in Planar Graphs
Open Problems related to computing obstruction sets
Computing Excluded Minors Isolde Adler Martin Grohe
Tree-related Widths of Graphs and Hypergraphs
arXiv:0906.3857v1[cs.DM]21Jun2009 Games for width parameters and monotonicity
Faster Parameterized Algorithms for Minor Containment
Tree-width for first order formulae Isolde Adler1
Width Functions Hypertree Decompositions
Hypertree Width and Related Hypergraph Invariants Isolde Adler Georg Gottlob Martin Grohe
Hypertree-width and related invariants Isolde Adler
A lower bound for the tree-width of planar graphs with vital linkages
Nowhere dense graph classes, stability, and the independence property
Directed Tree-Width Examples Isolde Adler
On the boolean-width of a graph: structure and applications I. Adler1 , B.-M. Bui-Xuan1 , Y. Rabinovich2 , G. Renault1 , J. A. Telle1 , and M. Vatshelle1
