Isolde Adler

According to our database, Isolde Adler authored at least 39 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing.

Isolde Adler, Noleen Köhler, Pan Peng

SIAM J. Comput., 2024

Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth.

Isolde Adler, Eva Fluck

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

Faster Property Testers in a Variation of the Bounded Degree Model.

Isolde Adler, Polly Fahey

ACM Trans. Comput. Log., 2023

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

Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs.

Isolde Adler, Bjarki Geir Benediktsson, Dugald Macpherson

Discret. Appl. Math., 2022

2021

Connected search for a lazy robber.

Isolde Adler, Christophe Paul, Dimitrios M. Thilikos

J. Graph Theory, 2021

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

Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon

Eur. J. Comb., 2021

Towards Approximate Query Enumeration with Sublinear Preprocessing Time.

Isolde Adler, Polly Fahey

CoRR, 2021

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

Isolde Adler, Noleen Köhler, Pan Peng

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing.

Isolde Adler, Noleen Köhler, Pan Peng

Proceedings of the 36th Computational Complexity Conference, 2021

2020

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

Isolde Adler, Noleen Köhler

CoRR, 2020

2019

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

Isolde Adler, Philipp Klaus Krause

J. Comb. Theory B, 2019

2018

Property Testing for Bounded Degree Databases.

Isolde Adler, Frederik Harwath

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

2017

Irrelevant vertices for the planar Disjoint Paths Problem.

Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos

J. Comb. Theory B, 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

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

Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon

Algorithmica, 2017

2016

Planar Disjoint-Paths Completion.

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

Algorithmica, 2016

2015

Linear rank-width and linear clique-width of trees.

Isolde Adler, Mamadou Moustapha Kanté

Theor. Comput. Sci., 2015

2014

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

Hans Adler, Isolde Adler

Eur. J. Comb., 2014

Obstructions for linear rank-width at most 1.

Isolde Adler, Arthur M. Farley, Andrzej Proskurowski

Discret. Appl. Math., 2014

Linear Rank-Width of Distance-Hereditary Graphs.

Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2012

Hypertree-depth and minors in hypergraphs.

Isolde Adler, Tomas Gavenciak, Tereza Klimosová

Theor. Comput. Sci., 2012

Tree-width for first order formulae

Isolde Adler, Mark Weyer

Log. Methods Comput. Sci., 2012

Fast Minor Testing in Planar Graphs.

Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos

Algorithmica, 2012

2011

Faster parameterized algorithms for minor containment.

Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos

Theor. Comput. Sci., 2011

Obstructions for linear rankwidth at most 1

Isolde Adler, Arthur M. Farley, Andrzej Proskurowski

CoRR, 2011

Tight Bounds for Linkages in Planar Graphs.

Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Nowhere dense graph classes, stability, and the independence property

Hans Adler, Isolde Adler

CoRR, 2010

A lower bound for the tree-width of planar graphs with vital linkages

Isolde Adler, Philipp Klaus Krause

CoRR, 2010

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

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

2009

Games for width parameters and monotonicity

Isolde Adler

CoRR, 2009

2008

Tree-Related Widths of Graphs and Hypergraphs.

Isolde Adler

SIAM J. Discret. Math., 2008

A note on clique-width and tree-width for structures

Hans Adler, Isolde Adler

CoRR, 2008

Computing excluded minors.

Isolde Adler, Martin Grohe, Stephan Kreutzer

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Tree-width and functional dependencies in databases.

Isolde Adler

Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

2007

Directed tree-width examples.

Isolde Adler

J. Comb. Theory B, 2007

Hypertree width and related hypergraph invariants.

Isolde Adler, Georg Gottlob, Martin Grohe

Eur. J. Comb., 2007

2006

Width functions for hypertree decompositions (Weitefunktionen für Hyperbaumzerlegungen)

Isolde Adler

PhD thesis, 2006

2004

Marshals, monotone marshals, and hypertree-width.

Isolde Adler

J. Graph Theory, 2004