Pages that link to "Item:Q5414151"
From MaRDI portal
The following pages link to Near-Optimal Separators in String Graphs (Q5414151):
Displayed 19 items.
- A crossing lemma for Jordan curves (Q1647400) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- A sharp threshold phenomenon in string graphs (Q2066317) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Coloring curves that cross a fixed curve (Q2415382) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- On String Graph Limits and the Structure of a Typical String Graph (Q2978181) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
- Separators in region intersection graphs (Q4638049) (← links)
- The Effect of Planarization on Width (Q4961755) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Refining the hierarchies of classes of geometric intersection graphs (Q5892293) (← links)
- Balanced line separators of unit disk graphs (Q5918796) (← links)
- Optimality program in segment and string graphs (Q5920196) (← links)
- Clique-based separators for geometric intersection graphs (Q6103521) (← links)
- String graphs have the Erdős-Hajnal property (Q6192228) (← links)