The following pages link to Anna Adamaszek (Q343696):
Displaying 34 items.
- Lower bounds for locally highly connected graphs (Q343698) (← links)
- Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721) (← links)
- Uniqueness of graph square roots of girth six (Q551233) (← links)
- Algorithmic and hardness results for the colorful components problems (Q747623) (← links)
- Combinatorics of the change-making problem (Q1041183) (← links)
- Reordering buffer management with advice (Q1707821) (← links)
- Submodular unsplittable flow on trees (Q1801021) (← links)
- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem (Q2946037) (← links)
- Approximation Schemes for Capacitated Geometric Network Design (Q3012789) (← links)
- Large-Girth Roots of Graphs (Q3013143) (← links)
- Approximation and Hardness Results for the Maximum Edge q-coloring Problem (Q3060768) (← links)
- PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k (Q3069731) (← links)
- Large-Girth Roots of Graphs (Q3113734) (← links)
- Submodular Unsplittable Flow on Trees (Q3186514) (← links)
- Reordering Buffer Management with Advice (Q3188872) (← links)
- Approximating Airports and Railways (Q3304099) (← links)
- PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k (Q3652286) (← links)
- Approximation Schemes for Capacitated Geometric Network Design (Q4556954) (← links)
- Irrational Guards are Sometimes Needed (Q4580074) (← links)
- Airports and Railways: Facility Location Meets Network Design (Q4601855) (← links)
- An <i>O</i> (log <i>k</i> )-Competitive Algorithm for Generalized Caching (Q4629976) (← links)
- Hardness of Approximation for Strip Packing (Q4973891) (← links)
- New Approximation Algorithms for (1,2)-TSP (Q5002675) (← links)
- The Art Gallery Problem is ∃ℝ-complete (Q5066941) (← links)
- Approximation Schemes for Independent Set and Sparse Subsets of Polygons (Q5215458) (← links)
- The art gallery problem is ∃ ℝ-complete (Q5230277) (← links)
- Fast fencing (Q5230320) (← links)
- How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking (Q5351888) (← links)
- A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem (Q5363013) (← links)
- A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices (Q5384010) (← links)
- Optimal online buffer scheduling for block devices (Q5415503) (← links)
- Almost tight bounds for reordering buffer management (Q5419131) (← links)
- (Q5743509) (← links)
- Almost Tight Bounds for Reordering Buffer Management (Q5864670) (← links)
