Pages that link to "Item:Q4815769"
From MaRDI portal
The following pages link to Geometric separation and exact solutions for the parameterized independent set problem on disk graphs (Q4815769):
Displaying 20 items.
- Compact and low delay routing labeling scheme for unit disk graphs (Q419502) (← links)
- Theory and application of width bounded geometric separators (Q632801) (← links)
- Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Reachability oracles for directed transmission graphs (Q2309470) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs (Q3183486) (← links)
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
- Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams (Q3452847) (← links)
- Fine-grained complexity of coloring unit disks and balls (Q4580091) (← links)
- On Embeddability of Unit Disk Graphs onto Straight Lines (Q5042239) (← links)
- Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking (Q5111257) (← links)
- (Q5115779) (← links)
- (Q5116530) (← links)
- On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs (Q5283382) (← links)
- (Q5743499) (← links)
- Balanced line separators of unit disk graphs (Q5918796) (← links)
- Optimality program in segment and string graphs (Q5920196) (← links)
- On embeddability of unit disk graphs onto straight lines (Q6038709) (← links)
- Maximum matchings in geometric intersection graphs (Q6050213) (← links)
