The following pages link to Isolde Adler (Q329284):
Displaying 37 items.
- Planar disjoint-paths completion (Q329285) (← links)
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs (Q831858) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Hypertree-depth and minors in hypergraphs (Q1929221) (← links)
- On the tree-width of even-hole-free graphs (Q1979431) (← links)
- A lower bound on the tree-width of graphs with irrelevant vertices (Q2312606) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- Interpreting nowhere dense graph classes as a classical notion of model theory (Q2441640) (← links)
- Obstructions for linear rank-width at most 1 (Q2442201) (← links)
- Hypertree width and related hypergraph invariants (Q2461773) (← links)
- Directed tree-width examples (Q2642009) (← links)
- Linear Rank-Width and Linear Clique-Width of Trees (Q2864286) (← links)
- Tree-width for first order formulae (Q2881100) (← links)
- Planar Disjoint-Paths Completion (Q2891339) (← links)
- Linear Rank-Width of Distance-Hereditary Graphs (Q2945179) (← links)
- Tight Bounds for Linkages in Planar Graphs (Q3012796) (← links)
- On the Boolean-Width of a Graph: Structure and Applications (Q3057622) (← links)
- Marshals, monotone marshals, and hypertree-width (Q3159383) (← links)
- Property Testing for Bounded Degree Databases (Q3304100) (← links)
- Faster Parameterized Algorithms for Minor Containment (Q3569902) (← links)
- (Q3576650) (← links)
- (Q3579375) (← links)
- Fast Minor Testing in Planar Graphs (Q3586454) (← links)
- Tree-Related Widths of Graphs and Hypergraphs (Q3614197) (← links)
- Tree-Width for First Order Formulae (Q3644741) (← links)
- On rank-width of even-hole-free graphs (Q4558968) (← links)
- (Q5469338) (← links)
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726) (← links)
- Connected Search for a Lazy Robber (Q5875639) (← links)
- Connected search for a lazy robber (Q6080862) (← links)
- GSF-locality is not sufficient for proximity-oblivious testing (Q6115397) (← links)
- Vapnik-Chervonenkis Dimension and Density on Johnson and Hamming Graphs (Q6346245) (← links)
- Monotonicity of the cops and robber game for bounded depth treewidth (Q6521776) (← links)
- On testability of first-order properties in bounded-degree graphs and connections to proximity-oblivious testing (Q6573776) (← links)
