Isolde Adler

    • 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).
    • 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.
    • Planar Disjoint-Paths Completion.
      Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos.
      International Colloquium on Parameterized and Exact Computation IPEC 2011: 80-93.
    • Computing excluded minors.
      Isolde Adler, Martin Grohe, Stephan Kreutzer.
      ACM-SIAM Symposium on Discrete Algorithms (SODA) 2008: 641-650.