PersonLehrstuhl für Algorithmen und Komplexitätstheorie
Person
Adler, Isolde
Profil
Informationen
- Einrichtung
- ORCID
Publikationen
Liste exportieren: BibTeX · RIS
- Going deep and going wide : Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth – Adler, Isolde; Fluck, Eva; Seppelt, Tim u. a. · 2026 · Konferenzveröffentlichung
- Going deep and going wide : Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth – Adler, Isolde; Fluck, Eva; Seppelt, Tim u. a. · 2026 · Konferenzveröffentlichung
- Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth – Adler, Isolde; Fluck, Eva · 2026 · Konferenzveröffentlichung
- BTW 2025 Early Career Researcher Workshop : Message from the Chairs – Das, Debasree; Nicklas, Daniela; Adler, Isolde · 2026 · Konferenzveröffentlichung
- BTW 2025 Early Career Researcher Workshop : Message from the Chairs – Das, Debasree; Nicklas, Daniela; Adler, Isolde · 2025 · Konferenzveröffentlichung
- Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth – Adler, Isolde; Fluck, Eva · 2024 · Konferenzveröffentlichung
- On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing – Adler, Isolde; Köhler, Noleen; Peng, Pan · 2024 · Artikel in einer Zeitschrift / Postprint
- On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing – Adler, Isolde; Köhler, Noleen; Peng, Pan · 2023 · preprint
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian – Adler, Isolde; Köhler, Noleen · 2023 · Artikel in einer Zeitschrift / Postprint
- On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing – Adler, Isolde; Köhler, Noleen; Peng, Pan · 2023 · preprint
- Faster Property Testers in a Variation of the Bounded Degree Model – Adler, Isolde; Fahey, Polly · 2023 · Artikel in einer Zeitschrift / Postprint
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian – Adler, Isolde; Köhler, Noleen · 2022 · Artikel in einer Zeitschrift / Postprint
- Vapnik–Chervonenkis dimension and density on Johnson and Hamming graphs – Adler, Isolde; Benediktsson, Bjarki Geir; Macpherson, Dugald · 2022 · Artikel in einer Zeitschrift / Postprint
Projekte
- Logik und Graphstruktur für sublineare Algorithmen (LogAlgo) – LogAlgo · 2026–2029