Pages that link to "Item:Q4593248"

The following pages link to Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248):

Displaying 20 items.

• Greedy domination on biclique-free graphs (Q1730031) (← links)
• Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
• Treetopes and their graphs (Q2197683) (← links)
• Constructing planar support for non-piercing regions (Q2207613) (← links)
• Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs (Q2662795) (← links)
• Two lower bounds for $p$-centered colorings (Q3386629) (← links)
• A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
• Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
• Uncertain Measure and its Application in Minimum Weighted Maximal Matching Problem (Q5040503) (← links)
• Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
• (Q5090497) (← links)
• Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003) (← links)
• Balanced line separators of unit disk graphs (Q5918796) (← links)
• Maximum matchings in geometric intersection graphs (Q6050213) (← links)
• On weighted sublinear separators (Q6081561) (← links)
• Clique-based separators for geometric intersection graphs (Q6103521) (← links)
• Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
• Shallow Minors, Graph Products, and Beyond-Planar Graphs (Q6130539) (← links)
• An ETH-Tight Exact Algorithm for Euclidean TSP (Q6156029) (← links)