Marshals, monotone marshals, and hypertree-width. - Isolde Adler (J. Graph Theory, 2004)

Width functions for hypertree decompositions (Weitefunktionen für Hyperbaumzerlegungen) - Isolde Adler (2006)

Hypertree width and related hypergraph invariants. - Isolde Adler; Georg Gottlob; Martin Grohe (Eur. J. Comb., 2007)

Directed tree-width examples. - Isolde Adler (J. Comb. Theory B, 2007)

Tree-width and functional dependencies in databases. - Isolde Adler (PODS, 2008)

Computing excluded minors. - Isolde Adler; Martin Grohe; Stephan Kreutzer (SODA, 2008)

A note on clique-width and tree-width for structures - Hans Adler; Isolde Adler (CoRR, 2008)

Tree-Related Widths of Graphs and Hypergraphs. - Isolde Adler (SIAM J. Discret. Math., 2008)

Games for width parameters and monotonicity - Isolde Adler (CoRR, 2009)

On the Boolean-Width of a Graph: Structure and Applications. - Isolde Adler; Binh-Minh Bui-Xuan; Yuri Rabinovich; Gabriel Renault; Jan Arne Telle; Martin Vatshelle (WG, 2010)

A lower bound for the tree-width of planar graphs with vital linkages - Isolde Adler; Philipp Klaus Krause (CoRR, 2010)

Nowhere dense graph classes, stability, and the independence property - Hans Adler; Isolde Adler (CoRR, 2010)

Tight Bounds for Linkages in Planar Graphs. - Isolde Adler; Stavros G. Kolliopoulos; Philipp Klaus Krause; Daniel Lokshtanov; Saket Saurabh 001; Dimitrios M. Thilikos (ICALP (1), 2011)

Obstructions for linear rankwidth at most 1 - Isolde Adler; Arthur M. Farley; Andrzej Proskurowski (CoRR, 2011)

Faster parameterized algorithms for minor containment. - Isolde Adler; Frederic Dorn; Fedor V. Fomin; Ignasi Sau; Dimitrios M. Thilikos (Theor. Comput. Sci., 2011)

Fast Minor Testing in Planar Graphs. - Isolde Adler; Frederic Dorn; Fedor V. Fomin; Ignasi Sau; Dimitrios M. Thilikos (Algorithmica, 2012)

Tree-width for first order formulae - Isolde Adler; Mark Weyer (Log. Methods Comput. Sci., 2012)

Hypertree-depth and minors in hypergraphs. - Isolde Adler; Tomas Gavenciak; Tereza Klimosová (Theor. Comput. Sci., 2012)

Linear Rank-Width of Distance-Hereditary Graphs. - Isolde Adler; Mamadou Moustapha Kanté; O-joung Kwon (WG, 2014)

Obstructions for linear rank-width at most 1. - Isolde Adler; Arthur M. Farley; Andrzej Proskurowski (Discret. Appl. Math., 2014)

Interpreting nowhere dense graph classes as a classical notion of model theory. - Hans Adler; Isolde Adler (Eur. J. Comb., 2014)

Linear rank-width and linear clique-width of trees. - Isolde Adler; Mamadou Moustapha Kanté (Theor. Comput. Sci., 2015)

Planar Disjoint-Paths Completion. - Isolde Adler; Stavros G. Kolliopoulos; Dimitrios M. Thilikos (Algorithmica, 2016)

Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm. - Isolde Adler; Mamadou Moustapha Kanté; O-joung Kwon (Algorithmica, 2017)

On rank-width of even-hole-free graphs. - Isolde Adler; Ngoc-Khang Le; Haiko Müller; Marko Radovanovic; Nicolas Trotignon; Kristina Vuskovic (Discret. Math. Theor. Comput. Sci., 2017)

Irrelevant vertices for the planar Disjoint Paths Problem. - Isolde Adler; Stavros G. Kolliopoulos; Philipp Klaus Krause; Daniel Lokshtanov; Saket Saurabh 001; Dimitrios M. Thilikos (J. Comb. Theory B, 2017)

Property Testing for Bounded Degree Databases. - Isolde Adler; Frederik Harwath (STACS, 2018)

A lower bound on the tree-width of graphs with irrelevant vertices. - Isolde Adler; Philipp Klaus Krause (J. Comb. Theory B, 2019)

On graphs of bounded degree that are far from being Hamiltonian. - Isolde Adler; Noleen Köhler (CoRR, 2020)

GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing. - Isolde Adler; Noleen Köhler; Pan Peng 001 (CCC, 2021)

On Testability of First-Order Properties in Bounded-Degree Graphs. - Isolde Adler; Noleen Köhler; Pan Peng 001 (SODA, 2021)

Towards Approximate Query Enumeration with Sublinear Preprocessing Time. - Isolde Adler; Polly Fahey (CoRR, 2021)

On the tree-width of even-hole-free graphs. - Pierre Aboulker; Isolde Adler; Eun Jung Kim 002; Ni Luh Dewi Sintiari; Nicolas Trotignon (Eur. J. Comb., 2021)

Connected search for a lazy robber. - Isolde Adler; Christophe Paul; Dimitrios M. Thilikos (J. Graph Theory, 2021)

Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs. - Isolde Adler; Bjarki Geir Benediktsson; Dugald Macpherson (Discret. Appl. Math., 2022)

An explicit construction of graphs of bounded degree that are far from being Hamiltonian. - Isolde Adler; Noleen Köhler (Discret. Math. Theor. Comput. Sci., 2022)

Faster Property Testers in a Variation of the Bounded Degree Model. - Isolde Adler; Polly Fahey (ACM Trans. Comput. Log., 2023)

Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth. - Isolde Adler; Eva Fluck (MFCS, 2024)

On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. - Isolde Adler; Noleen Köhler; Pan Peng 001 (SIAM J. Comput., 2024)

Early Career Researcher Workshop. - Debasree Das; Isolde Adler; Daniela Nicklas 001 (BTW Workshops, 2025)

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth. - Isolde Adler; Eva Fluck; Tim Seppelt; Gian Luca Spitzer (CoRR, 2025)