Isolde Adler

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 27

Top Topics

Bounded Treewidth

Top Venues

Discret. Appl. Math.

Publications

Isolde Adler, Eva Fluck
Monotonicity of the cops and robber game for bounded depth treewidth. CoRR (2024)
Isolde Adler, Noleen Köhler, Pan Peng
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. SIAM J. Comput. 53 (4) (2024)
Isolde Adler, Eva Fluck
Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth. MFCS (2024)
Isolde Adler, Noleen Köhler, Pan Peng
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. CoRR (2023)
Isolde Adler, Polly Fahey
Faster Property Testers in a Variation of the Bounded Degree Model. ACM Trans. Comput. Log. 24 (3) (2023)
Isolde Adler, Noleen Köhler
An explicit construction of graphs of bounded degree that are far from being Hamiltonian. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Isolde Adler, Bjarki Geir Benediktsson, Dugald Macpherson
Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs. Discret. Appl. Math. 312 (2022)
Isolde Adler, Noleen Köhler, Pan Peng
GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing. Computational Complexity Conference (2021)
Isolde Adler, Polly Fahey
Towards Approximate Query Enumeration with Sublinear Preprocessing Time. CoRR (2021)
Isolde Adler, Noleen Köhler, Pan Peng
GSF-locality is not sufficient for proximity-oblivious testing. CoRR (2021)
Isolde Adler, Christophe Paul, Dimitrios M. Thilikos
Connected search for a lazy robber. J. Graph Theory 97 (4) (2021)
Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon
On the tree-width of even-hole-free graphs. Eur. J. Comb. 98 (2021)
Isolde Adler, Noleen Köhler, Pan Peng
On Testability of First-Order Properties in Bounded-Degree Graphs. SODA (2021)
Isolde Adler, Noleen Köhler
On graphs of bounded degree that are far from being Hamiltonian. CoRR (2020)
Isolde Adler, Noleen Köhler, Pan Peng
On Testability of First-Order Properties in Bounded-Degree Graphs. CoRR (2020)
Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon
On the tree-width of even-hole-free graphs. CoRR (2020)
Isolde Adler, Polly Fahey
Faster Property Testers in a Variation of the Bounded Degree Model. CoRR (2020)
Isolde Adler, Polly Fahey
Faster Property Testers in a Variation of the Bounded Degree Model. FSTTCS (2020)
Isolde Adler, Christophe Paul, Dimitrios M. Thilikos
Connected Search for a Lazy Robber. FSTTCS (2019)
Isolde Adler, Philipp Klaus Krause
A lower bound on the tree-width of graphs with irrelevant vertices. J. Comb. Theory, Ser. B 137 (2019)
Isolde Adler, Philipp Klaus Krause
A lower bound on the tree-width of graphs with irrelevant vertices. CoRR (2019)
Isolde Adler, Frederik Harwath
Property Testing for Bounded Degree Databases. STACS (2018)
Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
Irrelevant vertices for the planar Disjoint Paths Problem. J. Comb. Theory, Ser. B 122 (2017)
Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm. Algorithmica 78 (1) (2017)
Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
On rank-width of even-hole-free graphs. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
Planar Disjoint-Paths Completion. Algorithmica 76 (2) (2016)
Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
On rank-width of even-hole-free graphs. CoRR (2016)
Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
Planar Disjoint-Paths Completion. CoRR (2015)
Isolde Adler, Mamadou Moustapha Kanté
Linear rank-width and linear clique-width of trees. Theor. Comput. Sci. 589 (2015)
Isolde Adler, Arthur M. Farley, Andrzej Proskurowski
Obstructions for linear rank-width at most 1. Discret. Appl. Math. 168 (2014)
Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm. CoRR (2014)
Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
Linear Rank-Width of Distance-Hereditary Graphs. WG (2014)
Hans Adler, Isolde Adler
Interpreting nowhere dense graph classes as a classical notion of model theory. Eur. J. Comb. 36 (2014)
Isolde Adler, Mamadou Moustapha Kanté
Linear Rank-Width and Linear Clique-Width of Trees. WG (2013)
Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
Irrelevant Vertices for the Planar Disjoint Paths Problem. CoRR (2013)
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
Fast Minor Testing in Planar Graphs. Algorithmica 64 (1) (2012)
Isolde Adler, Mark Weyer
Tree-width for first order formulae Log. Methods Comput. Sci. 8 (1) (2012)
Isolde Adler, Tomas Gavenciak, Tereza Klimosová
Hypertree-depth and minors in hypergraphs. Theor. Comput. Sci. 463 (2012)
Isolde Adler, Arthur M. Farley, Andrzej Proskurowski
Obstructions for linear rankwidth at most 1 CoRR (2011)
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
Faster parameterized algorithms for minor containment. Theor. Comput. Sci. 412 (50) (2011)
Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
Planar Disjoint-Paths Completion. IPEC (2011)
Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
Tight Bounds for Linkages in Planar Graphs. ICALP (1) (2011)
Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle
On the Boolean-Width of a Graph: Structure and Applications. WG (2010)
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
Fast Minor Testing in Planar Graphs. ESA (1) (2010)
Hans Adler, Isolde Adler
Nowhere dense graph classes, stability, and the independence property CoRR (2010)
Isolde Adler, Philipp Klaus Krause
A lower bound for the tree-width of planar graphs with vital linkages CoRR (2010)
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
Faster Parameterized Algorithms for Minor Containment. SWAT (2010)
Isolde Adler, Mark Weyer
Tree-Width for First Order Formulae. CSL (2009)
Isolde Adler
Games for width parameters and monotonicity CoRR (2009)
Isolde Adler
Tree-width and functional dependencies in databases. PODS (2008)
Hans Adler, Isolde Adler
A note on clique-width and tree-width for structures CoRR (2008)
Isolde Adler
Tree-Related Widths of Graphs and Hypergraphs. SIAM J. Discret. Math. 22 (1) (2008)
Isolde Adler, Martin Grohe, Stephan Kreutzer
Computing excluded minors. SODA (2008)
Isolde Adler
Directed tree-width examples. J. Comb. Theory, Ser. B 97 (5) (2007)
Isolde Adler, Georg Gottlob, Martin Grohe
Hypertree width and related hypergraph invariants. Eur. J. Comb. 28 (8) (2007)
Isolde Adler
Marshals, monotone marshals, and hypertree-width. J. Graph Theory 47 (4) (2004)