IA
Isolde Adler
cs.DMmath.COcs.DScs.LOcs.CCcs.DBmath.LOcs.GT
On Valency
published · living versionsW_uutd3qem·v1 · currentpublished
Preprints & journals
22 papers in the corpus · 2009–2026Property Testing for Recursive Query Languages2609.03908v2 · Isolde Adler, Carsten Lutz, Quentin Maniere et al.2026 · 0 citationsarXiv
Constant time testability of first-order logic with modulo counting on finitary graphs2605.10841v1 · Isolde Adler, Jenny Stimpson2026 · 0 citationsarXiv
Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth2505.01193v5 · Isolde Adler, Eva Fluck, Tim Seppelt et al.2025 · 1 citationLogical Methods in Computer Science, Volume 22, Issue 2 (June 29, 2026) lmcs:15619
Monotonicity of the cops and robber game for bounded depth treewidth2402.09139v1 · Isolde Adler, Eva Fluck2024 · 0 citationsarXiv
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing2304.03810v1 · Isolde Adler, Noleen Kohler, Pan Peng2023 · 1 citationarXiv
GSF-locality is not sufficient for proximity-oblivious testing2105.08490v1 · Isolde Adler, Noleen Kohler, Pan Peng2021 · 0 citationsarXiv
Towards Approximate Query Enumeration with Sublinear Preprocessing Time2101.06240v1 · Isolde Adler, Polly Fahey2021 · 0 citationsarXiv
Faster Property Testers in a Variation of the Bounded Degree Model2009.07770v1 · Isolde Adler, Polly Fahey2020 · 1 citationarXiv
On Testability of First-Order Properties in Bounded-Degree Graphs2008.05800v2 · Isolde Adler, Noleen Kohler, Pan Peng2020 · 1 citationarXiv
An explicit construction of graphs of bounded degree that are far from being Hamiltonian2008.05801v6 · Isolde Adler, Noleen Kohler2020 · 1 citationDiscrete Mathematics & Theoretical Computer Science, vol. 24, no. 1, Graph Theory (January 31, 2022) dmtcs:7109
On the tree-width of even-hole-free graphs2008.05504v1 · Pierre Aboulker, Isolde Adler, Eun Jung Kim et al.2020 · 21 citationsEuropean Journal of Combinatorics, Volume 98, 2021, 103394
Vapnik-Chervonenkis Dimension and Density on Johnson and Hamming Graphs2007.16042v1 · Bjarki Geir Benediktsson, Dugald Macpherson, Isolde Adler2020 · 1 citationarXiv
A lower bound on the tree-width of graphs with irrelevant vertices1901.04325v1 · Isolde Adler, Philipp Klaus Krause2019 · 5 citationsarXiv
On rank-width of even-hole-free graphs1611.09907v3 · Isolde Adler, Ngoc Khang Le, Haiko Muller et al.2016 · 6 citationsDiscrete Mathematics & Theoretical Computer Science, Vol. 19 no. 1, Graph Theory (October 5, 2017) dmtcs:2575
Planar Disjoint-Paths Completion1511.04952v2 · Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos2015 · 0 citationsarXiv
Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm1403.1081v3 · Isolde Adler, Mamadou Moustapha Kant'e, O-joung Kwon2014 · 15 citationsarXiv
Irrelevant Vertices for the Planar Disjoint Paths Problem1310.2378v4 · Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause et al.2013 · 33 citationsarXiv
Tree-width for first order formulae1203.3814v2 · Isolde Adler, Mark Weyer2012 · 8 citationsLogical Methods in Computer Science, Volume 8, Issue 1 (March 29, 2012) lmcs:786
Obstructions for linear rankwidth at most 11106.2533v1 · Isolde Adler, Arthur M. Farley, Andrzej Proskurowski2011 · 16 citationsarXiv
Nowhere dense graph classes, stability, and the independence property1011.4016v1 · Hans Adler, Isolde Adler2010 · 3 citationsarXiv
A lower bound for the tree-width of planar graphs with vital linkages1011.2136v1 · Isolde Adler, Philipp Klaus Krause2010 · 3 citationsarXiv
Games for width parameters and monotonicity0906.3857v1 · Isolde Adler2009 · 3 citationsarXiv
Career total: 54 works. 22 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.