Isolde Adler
- Position
- Lecturer
- Role
- Computer Science and Mathematics programme leader
-
- A lower bound on the tree-width of graphs with irrelevant vertices.
Isolde Adler and Philipp Klaus Krause.
Journal of Combinatorial Theory, Series B 137: 126-136 (2019).
- A lower bound on the tree-width of graphs with irrelevant vertices.
-
- Property Testing for Bounded Degree Databases.
Isolde Adler and Frederik Harwath.
Symposium on Theoretical Aspects of Computer Science (STACS) 2018: 6:1-6:14.
- Property Testing for Bounded Degree Databases.
-
- Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm.
Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon.
Algorithmica 78(1): 342-377 (2017).
- Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm.
-
- On rank-width of even-hole-free graphs.
Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic.
Discrete Mathematics & Theoretical Computer Science 19(1) (2017).
- On rank-width of even-hole-free graphs.
-
- Irrelevant vertices for the planar Disjoint Paths Problem.
Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos.
Journal of Combinatorial Theory, Series B 122: 815-843 (2017).
- Irrelevant vertices for the planar Disjoint Paths Problem.
-
- Planar Disjoint-Paths Completion.
Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos.
Algorithmica 76(2): 401-425 (2016).
- Planar Disjoint-Paths Completion.
-
- Linear rank-width and linear clique-width of trees.
Isolde Adler, Mamadou Moustapha Kanté.
Theoretical Computer Science 589: 87-98 (2015).
- Linear rank-width and linear clique-width of trees.
-
- Obstructions for linear rank-width at most 1.
Isolde Adler, Arthur M. Farley, Andrzej Proskurowski.
Discrete Applied Mathematics 168: 3-13 (2014).
- Obstructions for linear rank-width at most 1.
-
- Interpreting nowhere dense graph classes as a classical notion of model theory.
Hans Adler, Isolde Adler.
European Journal of Combinatorics 36: 322-330 (2014).
- Interpreting nowhere dense graph classes as a classical notion of model theory.
-
- Linear Rank-Width of Distance-Hereditary Graphs.
Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon.
International Workshop on Graph-Theoretic Concepts in Computer Science (WG) 2014: 42-55.
- Linear Rank-Width of Distance-Hereditary Graphs.
-
- Linear Rank-Width and Linear Clique-Width of Trees.
Isolde Adler, Mamadou Moustapha Kanté.
International Workshop on Graph-Theoretic Concepts in Computer Science (WG) 2013: 12-25.
- Linear Rank-Width and Linear Clique-Width of Trees.
-
- Fast Minor Testing in Planar Graphs.
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos.
Algorithmica 64(1): 69-84 (2012).
- Fast Minor Testing in Planar Graphs.
-
- Tree-width for first order formulae.
Isolde Adler, Mark Weyer.
Logical Methods in Computer Science 8(1) (2012).
- Tree-width for first order formulae.
-
- Hypertree-depth and minors in hypergraphs.
Isolde Adler, Tomas Gavenciak, Tereza Klimosova.
Theoretical Computer Science 463: 84-95 (2012).
- Hypertree-depth and minors in hypergraphs.
-
- Faster parameterized algorithms for minor containment.
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos.
Theoretical Computer Science 412(50): 7018-7028 (2011).
- Faster parameterized algorithms for minor containment.
-
- Tight Bounds for Linkages in Planar Graphs.
Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos.
International Colloquium on Automata, Languages and Programming ICALP (1) 2011: 110-121.
- Tight Bounds for Linkages in Planar Graphs.
-
- Planar Disjoint-Paths Completion.
Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos.
International Colloquium on Parameterized and Exact Computation IPEC 2011: 80-93.
- Planar Disjoint-Paths Completion.
-
- Fast Minor Testing in Planar Graphs.
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos.
European Symposium on Algorithms ESA (1) 2010: 97-109.
- Fast Minor Testing in Planar Graphs.
-
- Faster Parameterized Algorithms for Minor Containment.
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos.
Scandinavian Symposium and Workshops on Algorithm Theory SWAT 2010: 322-333.
- Faster Parameterized Algorithms for Minor Containment.
-
- On the Boolean-Width of a Graph: Structure and Applications.
Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle.
International Workshop on Graph-Theoretic Concepts in Computer Science (WG) 2010: 159-170.
- On the Boolean-Width of a Graph: Structure and Applications.
-
- Tree-Width for First Order Formulae.
Isolde Adler, Mark Weyer.
International Workshop on Computer Science Logic (CSL) 2009: 71-85.
- Tree-Width for First Order Formulae.
-
- Tree-Related Widths of Graphs and Hypergraphs.
Isolde Adler.
SIAM Journal on Discrete Math. 22(1): 102-123 (2008).
- Tree-Related Widths of Graphs and Hypergraphs.
-
- Tree-width and functional dependencies in databases.
Isolde Adler.
Symposium on Principles of Database Systems (PODS) 2008: 311-320.
- Tree-width and functional dependencies in databases.
-
- Computing excluded minors.
Isolde Adler, Martin Grohe, Stephan Kreutzer.
ACM-SIAM Symposium on Discrete Algorithms (SODA) 2008: 641-650.
- Computing excluded minors.
-
- Hypertree width and related hypergraph invariants.
Isolde Adler, Georg Gottlob, Martin Grohe.
European Journal of Combinatorics 28(8): 2167-2181 (2007).
- Hypertree width and related hypergraph invariants.
-
- Directed tree-width examples.
Isolde Adler.
Journal of Combinatorial Theory, Series B 97(5): 718-725 (2007).
- Directed tree-width examples.
-
- Marshals, monotone marshals, and hypertree-width.
Isolde Adler.
Journal of Graph Theory 47(4): 275-296 (2004).
- Marshals, monotone marshals, and hypertree-width.