Isolde Adler

发表

Marshals, monotone marshals, and hypertree-width

Isolde Adler, 2004 .

Vapnik–Chervonenkis dimension and density on Johnson and Hamming graphs

Dugald Macpherson, Isolde Adler, D. Macpherson, 2021, Discrete Applied Mathematics.

On rank-width of even-hole-free graphs

H. Müller, Isolde Adler, Nicolas Trotignon, 2016, Discret. Math. Theor. Comput. Sci..

Tree-width for first order formulae

Isolde Adler, M. Weyer, 2012 .

Isolde Adler, 2008 .

Tree-width and functional dependencies in databases

Isolde Adler, Isolde Adler, 2008, PODS.

Marshals, monotone marshals, and hypertree‐width

Isolde Adler, Isolde Adler, 2004, J. Graph Theory.

GSF-locality is not sufficient for proximity-oblivious testing

Isolde Adler, Noleen Köhler, Pan Peng, 2021, CCC.

An explicit construction of graphs of bounded degree that are far from being Hamiltonian

Isolde Adler, N. Köhler, 2020, Discret. Math. Theor. Comput. Sci..

On Testability of First-Order Properties in Bounded-Degree Graphs

Isolde Adler, Noleen Köhler, Pan Peng, 2020, SODA.

On graphs of bounded degree that are far from being Hamiltonian.

Isolde Adler, Noleen Köhler, Isolde Adler, 2020 .

On the tree-width of even-hole-free graphs pdf

Nicolas Trotignon, Eun Jung Kim, Isolde Adler, 2020, Eur. J. Comb..

Hypertree width and related hypergraph invariants

Georg Gottlob, Martin Grohe, Isolde Adler, 2007, Eur. J. Comb..

Games for width parameters and monotonicity pdf

Isolde Adler, Isolde Adler, 2009, ArXiv.

Connected search for a lazy robber

Christophe Paul, Dimitrios M. Thilikos, Isolde Adler, 2020, FSTTCS.

Obstructions for linear rank-width at most 1

Arthur M. Farley, Andrzej Proskurowski, Isolde Adler, 2014, Discret. Appl. Math..

Obstructions for linear rankwidth at most 1 pdf

Arthur M. Farley, Andrzej Proskurowski, Isolde Adler, 2011, ArXiv.

A lower bound on the tree-width of graphs with irrelevant vertices pdf

Philipp Klaus Krause, Isolde Adler, Isolde Adler, 2019, J. Comb. Theory, Ser. B.

Irrelevant vertices for the planar Disjoint Paths Problem

Dimitrios M. Thilikos, Saket Saurabh, Daniel Lokshtanov, 2013, J. Comb. Theory, Ser. B.

Interpreting nowhere dense graph classes as a classical notion of model theory

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

Computing excluded minors

Stephan Kreutzer, Martin Grohe, Isolde Adler, 2008, SODA '08.

Open Problems related to computing obstruction sets

Isolde Adler, Isolde Adler, 2008 .

Faster parameterized algorithms for minor containment

Dimitrios M. Thilikos, Fedor V. Fomin, Ignasi Sau, 2010, Theor. Comput. Sci..

Property Testing for Bounded Degree Databases

Frederik Harwath, Isolde Adler, Isolde Adler, 2018, STACS.

On the Boolean-Width of a Graph: Structure and Applications

Gabriel Renault, Jan Arne Telle, Martin Vatshelle, 2009, WG.

Fast Minor Testing in Planar Graphs

F. Fomin, D. Thilikos, Isolde Adler, 2010, Algorithmica.

Hypertree-depth and minors in hypergraphs

Tereza Klimosova, Tomas Gavenciak, Isolde Adler, 2012, Theor. Comput. Sci..

Planar Disjoint-Paths Completion

Dimitrios M. Thilikos, Stavros G. Kolliopoulos, Isolde Adler, 2011, Algorithmica.

Ju l 2 01 7 On rank-width of ( diamond , even hole )-free graphs

H. Müller, Isolde Adler, Nicolas Trotignon, 2017 .

Graph-Theoretic Concepts in Computer Science: 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers

Haiko Müller, Isolde Adler, H. Müller, 2020, WG.

Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm

Mamadou Moustapha Kanté, O-joung Kwon, Isolde Adler, 2014, Algorithmica.

On the tree-width of even-hole-free graphs

Ni Luh Dewi Sintiari, Eun Jung Kim, Isolde Adler, 2020, Eur. J. Comb..