The following pages link to (Q5743499):
Displaying 24 items.
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- Linear-time recognition of map graphs with outerplanar witness (Q1662161) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Map graphs having witnesses of large girth (Q2632022) (← links)
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
- (Q4972036) (← links)
- (Q5009491) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- Decomposition of Map Graphs with Applications. (Q5091217) (← links)
- (Q5092371) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- Structure of Graphs with Locally Restricted Crossings (Q5346557) (← links)
- (Q5743499) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
- Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)
- Hardness and structural results for half-squares of restricted tree convex bipartite graphs (Q5919674) (← links)
- Optimality program in segment and string graphs (Q5920196) (← links)
- On embeddability of unit disk graphs onto straight lines (Q6038709) (← links)
- Graph product structure for non-minor-closed classes (Q6170788) (← links)
- Recognizing map graphs of bounded treewidth (Q6182682) (← links)
