Isolde Adler - RankMe

60 papers A* 3A 2B 7Journal 41Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Early Career Researcher Workshop. BTW Workshops Debasree Das, Isolde Adler, Daniela Nicklas
2025	J	`jnl`	Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth. CoRR Isolde Adler, Eva Fluck, Tim Seppelt, Gian Luca Spitzer
2024	B	`conf`	Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth. MFCS Isolde Adler, Eva Fluck
2024	J	`jnl`	Monotonicity of the cops and robber game for bounded depth treewidth. CoRR Isolde Adler, Eva Fluck
2024	J	`jnl`	On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. SIAM J. Comput. Isolde Adler, Noleen Köhler, Pan Peng
2023	J	`jnl`	Faster Property Testers in a Variation of the Bounded Degree Model. ACM Trans. Comput. Log. Isolde Adler, Polly Fahey
2023	J	`jnl`	On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. CoRR Isolde Adler, Noleen Köhler, Pan Peng
2022	J	`jnl`	An explicit construction of graphs of bounded degree that are far from being Hamiltonian. Discret. Math. Theor. Comput. Sci. Isolde Adler, Noleen Köhler
2022	J	`jnl`	Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs. Discret. Appl. Math. Isolde Adler, Bjarki Geir Benediktsson, Dugald Macpherson
2021	J	`jnl`	Connected search for a lazy robber. J. Graph Theory Isolde Adler, Christophe Paul, Dimitrios M. Thilikos
2021	A	`conf`	GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing. CCC Isolde Adler, Noleen Köhler, Pan Peng
2021	J	`jnl`	GSF-locality is not sufficient for proximity-oblivious testing. CoRR Isolde Adler, Noleen Köhler, Pan Peng
2021	A*	`conf`	On Testability of First-Order Properties in Bounded-Degree Graphs. SODA Isolde Adler, Noleen Köhler, Pan Peng
2021	J	`jnl`	On the tree-width of even-hole-free graphs. Eur. J. Comb. Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon
2021	J	`jnl`	Towards Approximate Query Enumeration with Sublinear Preprocessing Time. CoRR Isolde Adler, Polly Fahey
2020	—	`conf`	Faster Property Testers in a Variation of the Bounded Degree Model. FSTTCS Isolde Adler, Polly Fahey
2020	J	`jnl`	Faster Property Testers in a Variation of the Bounded Degree Model. CoRR Isolde Adler, Polly Fahey
2020	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers WG Isolde Adler, Haiko Müller
2020	J	`jnl`	On Testability of First-Order Properties in Bounded-Degree Graphs. CoRR Isolde Adler, Noleen Köhler, Pan Peng
2020	J	`jnl`	On graphs of bounded degree that are far from being Hamiltonian. CoRR Isolde Adler, Noleen Köhler
2020	J	`jnl`	On the tree-width of even-hole-free graphs. CoRR Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon
2019	J	`jnl`	A lower bound on the tree-width of graphs with irrelevant vertices. CoRR Isolde Adler, Philipp Klaus Krause
2019	J	`jnl`	A lower bound on the tree-width of graphs with irrelevant vertices. J. Comb. Theory B Isolde Adler, Philipp Klaus Krause
2019	—	`conf`	Connected Search for a Lazy Robber. FSTTCS Isolde Adler, Christophe Paul, Dimitrios M. Thilikos
2018	A	`conf`	Property Testing for Bounded Degree Databases. STACS Isolde Adler, Frederik Harwath
2017	J	`jnl`	Irrelevant vertices for the planar Disjoint Paths Problem. J. Comb. Theory B Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2017	J	`jnl`	Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm. Algorithmica Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
2017	J	`jnl`	On rank-width of even-hole-free graphs. Discret. Math. Theor. Comput. Sci. Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
2016	J	`jnl`	On rank-width of even-hole-free graphs. CoRR Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
2016	J	`jnl`	Planar Disjoint-Paths Completion. Algorithmica Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
2015	J	`jnl`	Linear rank-width and linear clique-width of trees. Theor. Comput. Sci. Isolde Adler, Mamadou Moustapha Kanté
2015	J	`jnl`	Planar Disjoint-Paths Completion. CoRR Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
2014	J	`jnl`	Interpreting nowhere dense graph classes as a classical notion of model theory. Eur. J. Comb. Hans Adler, Isolde Adler
2014	B	`conf`	Linear Rank-Width of Distance-Hereditary Graphs. WG Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
2014	J	`jnl`	Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm. CoRR Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
2014	J	`jnl`	Obstructions for linear rank-width at most 1. Discret. Appl. Math. Isolde Adler, Arthur M. Farley, Andrzej Proskurowski
2013	J	`jnl`	Irrelevant Vertices for the Planar Disjoint Paths Problem. CoRR Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2013	B	`conf`	Linear Rank-Width and Linear Clique-Width of Trees. WG Isolde Adler, Mamadou Moustapha Kanté
2012	J	`jnl`	Fast Minor Testing in Planar Graphs. Algorithmica Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2012	J	`jnl`	Hypertree-depth and minors in hypergraphs. Theor. Comput. Sci. Isolde Adler, Tomas Gavenciak, Tereza Klimosová
2012	J	`jnl`	Tree-width for first order formulae Log. Methods Comput. Sci. Isolde Adler, Mark Weyer
2011	J	`jnl`	Faster parameterized algorithms for minor containment. Theor. Comput. Sci. Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2011	J	`jnl`	Obstructions for linear rankwidth at most 1 CoRR Isolde Adler, Arthur M. Farley, Andrzej Proskurowski
2011	B	`conf`	Planar Disjoint-Paths Completion. IPEC Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
2011	—	`conf`	Tight Bounds for Linkages in Planar Graphs. ICALP (1) Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2010	J	`jnl`	A lower bound for the tree-width of planar graphs with vital linkages CoRR Isolde Adler, Philipp Klaus Krause
2010	—	`conf`	Fast Minor Testing in Planar Graphs. ESA (1) Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2010	—	`conf`	Faster Parameterized Algorithms for Minor Containment. SWAT Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2010	J	`jnl`	Nowhere dense graph classes, stability, and the independence property CoRR Hans Adler, Isolde Adler
2010	B	`conf`	On the Boolean-Width of a Graph: Structure and Applications. WG Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle
2009	J	`jnl`	Games for width parameters and monotonicity CoRR Isolde Adler
2009	B	`conf`	Tree-Width for First Order Formulae. CSL Isolde Adler, Mark Weyer
2008	J	`jnl`	A note on clique-width and tree-width for structures CoRR Hans Adler, Isolde Adler
2008	A*	`conf`	Computing excluded minors. SODA Isolde Adler, Martin Grohe, Stephan Kreutzer
2008	J	`jnl`	Tree-Related Widths of Graphs and Hypergraphs. SIAM J. Discret. Math. Isolde Adler
2008	A*	`conf`	Tree-width and functional dependencies in databases. PODS Isolde Adler
2007	J	`jnl`	Directed tree-width examples. J. Comb. Theory B Isolde Adler
2007	J	`jnl`	Hypertree width and related hypergraph invariants. Eur. J. Comb. Isolde Adler, Georg Gottlob, Martin Grohe
2006	—	`—`	Width functions for hypertree decompositions (Weitefunktionen für Hyperbaumzerlegungen) Isolde Adler
2004	J	`jnl`	Marshals, monotone marshals, and hypertree-width. J. Graph Theory Isolde Adler