Isolde Adler

Orcid: 0000-0002-9667-9841

Affiliations:
  • Goethe University Frankfurt am Main, Germany


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing.
SIAM J. Comput., 2024

Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth.
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.
ACM Trans. Comput. Log., 2023

2022
An explicit construction of graphs of bounded degree that are far from being Hamiltonian.
Discret. Math. Theor. Comput. Sci., 2022

Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs.
Discret. Appl. Math., 2022

2021
Connected search for a lazy robber.
J. Graph Theory, 2021

On the tree-width of even-hole-free graphs.
Eur. J. Comb., 2021

Towards Approximate Query Enumeration with Sublinear Preprocessing Time.
CoRR, 2021

On Testability of First-Order Properties in Bounded-Degree Graphs.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing.
Proceedings of the 36th Computational Complexity Conference, 2021

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

2019
A lower bound on the tree-width of graphs with irrelevant vertices.
J. Comb. Theory B, 2019

2018
Property Testing for Bounded Degree Databases.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

2017
Irrelevant vertices for the planar Disjoint Paths Problem.
J. Comb. Theory B, 2017

On rank-width of even-hole-free graphs.
Discret. Math. Theor. Comput. Sci., 2017

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

2016
Planar Disjoint-Paths Completion.
Algorithmica, 2016

2015
Linear rank-width and linear clique-width of trees.
Theor. Comput. Sci., 2015

2014
Interpreting nowhere dense graph classes as a classical notion of model theory.
Eur. J. Comb., 2014

Obstructions for linear rank-width at most 1.
Discret. Appl. Math., 2014

Linear Rank-Width of Distance-Hereditary Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2012
Hypertree-depth and minors in hypergraphs.
Theor. Comput. Sci., 2012

Tree-width for first order formulae
Log. Methods Comput. Sci., 2012

Fast Minor Testing in Planar Graphs.
Algorithmica, 2012

2011
Faster parameterized algorithms for minor containment.
Theor. Comput. Sci., 2011

Obstructions for linear rankwidth at most 1
CoRR, 2011

Tight Bounds for Linkages in Planar Graphs.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Nowhere dense graph classes, stability, and the independence property
CoRR, 2010

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

On the Boolean-Width of a Graph: Structure and Applications.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

2009
Games for width parameters and monotonicity
CoRR, 2009

2008
Tree-Related Widths of Graphs and Hypergraphs.
SIAM J. Discret. Math., 2008

A note on clique-width and tree-width for structures
CoRR, 2008

Computing excluded minors.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Tree-width and functional dependencies in databases.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

2007
Directed tree-width examples.
J. Comb. Theory B, 2007

Hypertree width and related hypergraph invariants.
Eur. J. Comb., 2007

2006
Width functions for hypertree decompositions (Weitefunktionen für Hyperbaumzerlegungen)
PhD thesis, 2006

2004
Marshals, monotone marshals, and hypertree-width.
J. Graph Theory, 2004


  Loading...