Pages that link to "Item:Q5230321"

The following pages link to A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs (Q5230321):

Displaying 11 items.

• Reverse shortest path problem for unit-disk graphs (Q832915) (← links)
• The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
• Near-optimal algorithms for shortest paths in weighted unit-disk graphs (Q2223616) (← links)
• The homogeneous broadcast problem in narrow and wide strips. I: Algorithms (Q2415369) (← links)
• The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds (Q2415370) (← links)
• Parameterized study of Steiner tree on unit disk graphs (Q2700383) (← links)
• A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
• Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs (Q5042449) (← links)
• (Q5088957) (← links)
• Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
• Parameterized approximation algorithms and lower bounds for \(k\)-center clustering and variants (Q6586660) (← links)